The first section of this page presents the program at a glance. Then, detailed schedules for the days of July 7th and 8th are presented. The program can still suffer some changes.
In the program, long papers get 22 minutes each, split as 18 minutes for the talk and 4 minutes for questions and answers. Short papers get 16 minutes each, split as 13 for the talk and 3 for questions. Previously published papers are presented as posters. In addition, each previously published paper gets a 5-minute oral presentation, without any time for questions.
Program at a Glance
July 6th
After 16:00 |
Arrival, check in, enjoying resort facilities |
18:00 – 21:00 |
Dinner |
July 7th
From 7:00 |
Breakfast |
8:20 – 8:30 |
Opening Remarks. New York Room |
8:30 – 9:30 |
Invited Talk. New York Room |
9:35 – 10:35 |
Session 1, Search Techniques. New York Room |
10:35 – 11:00 |
Coffee Break |
11:00 – 12:32 |
Session 2, Planning. New York Room |
12:32 – 14:00 |
Lunch Break |
14:00 – 14:38 |
Session 3, Real Time Search. New York Room |
14:40 – 15:40 |
Session 4, Poster Spotlights. New York Room |
15:40 – 16:10 |
Cofee Break |
16:10 – 17:35 |
Session 5, Poster Presentations. Henry Hudson Room |
17:40 – 18:15 |
Awards Ceremony. New York Room |
18:15 – 21:00 |
Dinner |
July 8th
From 7:00 |
Breakfast |
8:30 – 9:30 |
Invited Talk. New York Room |
9:35 – 10:35 |
Session 6, Scheduling, Constraints and SAT. New York Room |
10:35 – 11:00 |
Coffee Break |
11:00 – 12:38 |
Session 7, Path Planning. New York Room |
12:38 – 14:00 |
Lunch Break |
14:00 – 15:26 |
Session 8, Search in Puzzles and Other Testbeds. New York Room |
15:26 – 16:00 |
Cofee Break |
16:10 – 17:32 |
Session 9, Search Techniques. New York Room |
17:35 |
Closing Remarks. New York Room |
18:30 |
Bus to IJCAI |
Detailed Program for July 7th
From 7:00 |
Breakfast |
8:20 – 8:30 |
Opening Remarks. New York Room |
8:30 – 9:30 |
Invited Talk. New York Room Chair: Jorge Baier
Ariel Felner Search for Optimal Solutions: the Heart of Heuristic Search is Still Beating |
9:30 – 9:35 |
Short Break |
9:35 – 10:35 |
Session 1, Search Techniques. New York Room Chair: Bruno Bouzy
Daniel Gilon, Ariel Felner and Roni Stern Dynamic Potential Search - a New Bounded Suboptimal Search Algorithm (long)
Levi Lelis, Richard Valenzano, Gabriel Nazar and Roni Stern Searching with a Corrupted Heuristic (long)
Guni Sharon, Robert Holte, Nathan Sturtevant and Ariel Felner An improved priority function for MM (short) |
10:35 – 11:00 |
Coffee Break |
11:00 – 12:32 |
Session 2, Planning. New York Room Chair: Rick Valenzano
Yusra Alkhazraji and Martin Wehrle Sleep Sets Meet Duplicate Elimination (long)
Daniel Gnad, Marcel Steinmetz, Matthaeus Jany, Joerg Hoffmann, Ivan Serina and Alfonso Gerevini Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications (long)
León Illanes and Sheila McIlraith Numeric Planning via Search Space Abstraction (short)
Tim Schulte and Bernhard Nebel Trial-based Heuristic Tree-search for Distributed Multi-Agent Planning (short)
Bence Cserna, Mike Bogochow, Stephen Chambers, Michaela Tremblay, Sammie Katt and Wheeler Ruml Anytime versus Real-time Heuristic Search for On-line Planning (short) |
12:32 – 14:00 |
Lunch Break |
14:00 – 14:38 |
Session 3, Real Time Search. New York Room Chair: Carlos Hernández Ulloa
Vadim Bulitko and Alexander Sampley Weighted Lateral Learning in Real-time Heuristic Search (long)
Vadim Bulitko Searching for Real-time Search Algorithms (short) |
14:40 – 15:40 |
Session 4, Poster Spotlights. New York Room Chair: Karen Petrie
Sebastian Van Opheusden, Zahy Bnaya, Gianni Galbiati and Wei Ji Ma Do people think like computers?
Scott Kiesel and Wheeler Ruml A Bayesian Effort Bias for Sampling-based Motion Planning
Carlos Hernández Ulloa, Roberto Javier Asín Achá and Jorge Baier Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain
Hang Ma, Craig Tovey, Guni Sharon, T. K. Satish Kumar and Sven Koenig Abstract: Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem
James Bailey, Craig Tovey, Tansel Uras and Sven Koenig Abstract: Path Planning on Grids: The Effect of Vertex Placement on Path Length
Luigi Palmieri, Sven Koenig and Kai Arras Abstract: RRT-Based Nonholonomic Motion Planning Using Any-Angle Path Biasing
Hang Ma and Sven Koenig Abstract: Optimal Target Assignment and Path Finding for Teams of Agents
Liron Cohen, T. K. Satish Kumar, Tansel Uras, Hong Xu, Nora Ayanian and Sven Koenig Abstract: Improved Bounded-Suboptimal Multi-Agent Path Finding Solvers
Stefan Funke and Sabine Storandt Personalized Route Planning in Road Networks
Richard Valenzano and Fan Xie On the Completeness of Best-First Search Variants that Use Random Exploration
Richard Korf Comparing Search Algorithms using Sorting and Hashing on Disk and in Memory
Nathan Sturtevant and Jingwei Chen External Memory Bidirectional Search |
15:40 – 16:10 |
Cofee Break |
16:10 – 17:35 |
Session 5, Poster Session. Henry Hudson Room |
17:40 |
Awards Ceremony. New York Room |
18:15 – 21:00 |
Dinner |
Detailed Program for July 8th
From 7:00 |
Breakfast |
8:30 – 9:30 |
Invited Talk. New York Room Chair: Adi Botea
Michael Buro Search and State Evaluation in Real-Time Strategy Games |
9:30 – 9:35 |
Short Break |
9:35 – 10:35 |
Session 6, Scheduling, Constraints and SAT. New York Room Chair: Laura Climent
David Cohen, Karen Petrie and Christopher Jefferson A Theoretical Framework for Constraint Propagator Triggering (long)
Tony T. Tran, Minh Do, Eleanor Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli and Chris Beck A Hybrid Quantum-Classical Approach to Solving Scheduling Problems (long)
Wenxiang Chen, Darrell Whitley, Adele Howe and Brian Goldman Disjunctive Normal Form Functions for Structured SAT Instances (short) |
10:35 – 11:00 |
Coffee Break |
11:00 – 12:38 |
Session 7, Path Planning. New York Room Chair: Vadim Bulitko
Anirudh Vemula, Katharina Muelling and Jean Oh Path Planning in Dynamic Environments with Adaptive Dimensionality (long)
Peter Karkus, Glenn Wagner and Howie Choset Recursive Constraint Manifold Subsearch for Multirobot Path Planning with Cooperative Tasks (long)
Stefan Funke and Sabine Storandt Consistent Rounding of Edge Weights in Graphs (long)
Pavel Surynek, Ariel Felner and Roni Stern An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives (short)
Nathan Sturtevant Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs (short) |
12:38 – 14:00 |
Lunch Break |
14:00 – 15:26 |
Session 8, Search in Puzzles and Other Testbeds. New York Room Chair: Richard Korf
Ben Stephenson A Multi-Phase Search Approach to the LEGO Construction Problem (long)
Bruno Bouzy Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental R-approximations (short)
Gerald Paul and Malte Helmert Optimal Solitaire Game Solutions using A* Search and Deadlock Analysis (short)
Skylar Croy, Jeremy Hansen and Daniel McQuillan Calculating the Number of Order-6 Magic Squares with Modular Lifting (short)
Laura Climent, Barry O'Sullivan and Richard Wallace An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem (short) |
15:26 – 16:00 |
Cofee Break |
16:10 – 17:32 |
Session 9, Search Techniques. New York Room Chair: Stefan Edelkamp
Ciaran McCreesh and Patrick Prosser Finding Maximum k-Cliques Faster using Lazy Global Domination (long)
Vitali Sepetnitsky, Ariel Felner and Roni Stern Repair Policies for Not reopening Nodes in Different Search (long)
Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar and Subbarao Kambhampati Compliant Conditions for Polynomial Time Approximation of Operator Counts (short)
Hilla Shinitzky, Roni Stern and Meir Kalech Batch Repair with Heuristic Search (short)
Scott Alfeld, Jerry Zhu and Paul Barford Machine Teaching as Search (short) |
17:35 |
Closing Remarks. New York Room |
18:30 |
Bus to IJCAI |