Abstract is missing.
- Frontmatter [doi]
- Core Expansion in Optimization CrosswordsAdi Botea, Vadim Bulitko. 2-10 [doi]
- Greedy Priority-Based Search for Suboptimal Multi-Agent Path FindingShao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig. 11-19 [doi]
- Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D GridsTzvika Geft. 20-28 [doi]
- Generating SAS+ Planning Tasks of Specified Causal StructureMichael Katz 0001, Junkyu Lee 0001, Shirin Sohrabi. 29-37 [doi]
- On K* Search for Top-K PlanningJunkyu Lee 0001, Michael Katz 0001, Shirin Sohrabi. 38-46 [doi]
- Adapting to Planning Failures in Lifelong Multi-Agent Path FindingJonathan Morag, Roni Stern, Ariel Felner. 47-55 [doi]
- Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial PlantsThomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh. 56-64 [doi]
- A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task RefinementsConny Olz, Pascal Bercher. 65-73 [doi]
- Improved Exploration of the Bench Transition System in Parallel Greedy Best First SearchTakumi Shimoda, Alex Fukunaga. 74-82 [doi]
- Real-World Pickup and Delivery Problem with TransfersVáclav Sobotka, Hana Rudová. 83-91 [doi]
- Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and DeliveryDavid Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman. 92-100 [doi]
- Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential HeuristicsHan Zhang 0018, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig. 101-109 [doi]
- Improvements to CPCESXiaodi Zhang, Alban Grastien. 110-118 [doi]
- Efficient Multi Agent Path Finding with Turn ActionsYue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey. 119-127 [doi]
- Reducing Redundant Work in Jump Point SearchShizhe Zhao, Daniel Harabor, Peter J. Stuckey. 128-136 [doi]
- SAT Feature Analysis for Machine Learning Classification TasksMarco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan. 138-142 [doi]
- K∗ and Partial Order Reduction for Top-Quality PlanningMichael Katz 0001, Junkyu Lee 0001. 143-147 [doi]
- Novelty and Lifted Helpful Actions in Generalized PlanningChao Lei, Nir Lipovetzky, Krista A. Ehinger. 148-152 [doi]
- GePA*SE: Generalized Edge-Based Parallel A* for Slow EvaluationsShohin Mukherjee, Maxim Likhachev. 153-157 [doi]
- Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional SearchLior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant. 158-162 [doi]
- A-ePA*SE: Anytime Edge-Based Parallel A* for Slow EvaluationsHanlan Yang, Shohin Mukherjee, Maxim Likhachev. 163-167 [doi]
- Using Machine Learning Classifiers in SAT Branching [Extended Abstract]Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory M. Provan. 169-170 [doi]
- Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave. 171-172 [doi]
- Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]Andrii Nyporko, Lukás Chrpa. 173-174 [doi]
- A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]Adittyo Paul, Ying Feng, Jiaoyang Li 0001. 175-176 [doi]
- On the Notion of Fixability of PDDL+ Plans [Extended Abstract]Francesco Percassi, Enrico Scala, Mauro Vallati. 177-178 [doi]
- Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan. 179-180 [doi]
- Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]Zhongqiang Ren, Sivakumar Rathinam, Howie Choset. 181-182 [doi]
- Must-Expand Nodes in Multi-Objective Search [Extended Abstract]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang 0018, Sven Koenig, William Yeoh 0001, Carlos Hernández Ulloa. 183-184 [doi]
- Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]Jirí Svancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko, Roland Kaminski. 185-186 [doi]
- Complete Search of Sliding Tile Puzzles on a Personal Computer [Extended Abstract]Oleg Tarakanov. 187-188 [doi]
- Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)David Fairbairn. 190-191 [doi]
- Domain-Independent Dynamic Programming (Student Abstract)Ryo Kuroiwa 0002. 192-193 [doi]
- Pipe-Routing and Pathfinding in 3D (Student Abstract)Thomas K. Nobes. 194-195 [doi]
- Structural Bias in Heuristic Search (Student Abstract)Alison Paredes. 196-197 [doi]
- Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract)Enrico Saccon. 198-199 [doi]
- Tracking Progress in Multi-Agent Path Finding (Student Abstract)Bojie Shen. 200-201 [doi]
- Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract)Václav Sobotka. 202-203 [doi]
- Domain Specific Situated Planning (Student Abstract)Devin Wild Thomas. 204-205 [doi]
- A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)Eyal Weiss 0001. 206-207 [doi]
- Searching with Distributional Heuristics (Student Abstract)Stephen Wissow. 208-209 [doi]