Table of Contents

• Weight Constrained Path Finding with Bidirectional ASaman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby. 2-10 [doi]
• On Merging Agents in Multi-Agent Pathfinding AlgorithmsEli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig. 11-19 [doi]
• Iterative-Deepening Uniform-Cost Heuristic SearchZhaoxing Bu, Richard E. Korf. 20-28 [doi]
• Portability and Explainability of Synthesized Formula-based HeuristicsVadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis. 29-37 [doi]
• Multi-Train Path Finding RevisitedZhe Chen, Jiaoyang Li 0001, Daniel Harabor, Peter J. Stuckey, Sven Koenig. 38-46 [doi]
• Effective Planning in Resource-Competition Problems by Task DecompositionLukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp. 47-55 [doi]
• Generalized Longest Path ProblemsGal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner. 56-64 [doi]
• MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex TerrainsManash Pratim Das, Damon M. Conover, Sungmin Eum, Heesung Kwon, Maxim Likhachev. 65-73 [doi]
• A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide ProgramsChao Gao, Jingwei Chen, Tong Mo, Tanvir Sajed, Shangling Jui, Min Qin, Laiyuan Gong, Wei Lu. 74-82 [doi]
• When to Commit to an Action in Online Planning and SearchTianyi Gu 0001, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas. 83-90 [doi]
• On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAEKilian Hu, David Speck 0001. 91-99 [doi]
• On Producing Shortest Cost-Optimal PlansMichael Katz 0001, Gabriele Röger, Malte Helmert. 100-108 [doi]
• Optimal Search with Neural Networks: Challenges and ApproachesTianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner. 109-117 [doi]
• Leveraging Experience in Lifelong Multi-Agent PathfindingNitzan Madar, Kiril Solovey, Oren Salzman. 118-126 [doi]
• Heuristic Search for SSPs with Lexicographic Preferences over Multiple CostsShuwa Miura, Kyle Hollins Wray, Shlomo Zilberstein. 127-135 [doi]
• ePA*SE: Edge-Based Parallel A* for Slow EvaluationsShohin Mukherjee, Sandip Aine, Maxim Likhachev. 136-144 [doi]
• The JPS Pathfinding System in 3DThomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh. 145-152 [doi]
• Trajectory Constraint Heuristics for Optimal Probabilistic PlanningJohn R. Peterson, Anagha Kulkarni 0005, Emil Keyder, Joseph Kim, Shlomo Zilberstein. 153-161 [doi]
• Enhanced Multi-Objective A* Using Balanced Binary Search TreesZhongqiang Ren, Richard Zhan, Sivakumar Rathinam, Maxim Likhachev, Howie Choset. 162-170 [doi]
• Scaling-Up Generalized Planning as Heuristic Search with LandmarksJavier Segovia Aguas, Sergio Jiménez Celorrio, Laura Sebastiá, Anders Jonsson. 171-179 [doi]
• Additive Pattern Databases for Decoupled SearchSilvan Sievers, Daniel Gnad 0001, Álvaro Torralba. 180-189 [doi]
• Which MAPF Model Works Best for Automated Warehousing?Sumanth Varambally, Jiaoyang Li 0001, Sven Koenig. 190-198 [doi]
• Anytime Approximate Bi-Objective SearchHan Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig. 199-207 [doi]
• Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path FindingShuyang Zhang, Jiaoyang Li 0001, Taoan Huang, Sven Koenig, Bistra Dilkina. 208-216 [doi]
• Benchmarks for Pathfinding Search: Iron HarvestDaniel Harabor, Ryan Hechenberger, Thomas Jahn. 218-222 [doi]
• Neural Network Heuristic Functions: Taking Confidence into AccountDaniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein 0001, Jörg Hoffmann 0001. 223-228 [doi]
• Online Multi-Agent Path Finding: New ResultsJonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski. 229-233 [doi]
• Light Contraction Hierarchies: Hierarchical Search Without ShortcutsClaudius Proissl. 234-238 [doi]
• Bounded-Cost Bi-Objective Heuristic SearchShawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh 0001, Carlos Hernández Ulloa. 239-243 [doi]
• Meeting at the Border of Two Separate DomainsAlexandru Paul Tabacaru, Dor Atzmon, Ariel Felner. 244-248 [doi]
• Mutex Propagation in Multi-Agent Path Finding for Large AgentsHan Zhang, Yutong Li, Jiaoyang Li 0001, T. K. Satish Kumar, Sven Koenig. 249-253 [doi]
• Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract)Jorge A. Baier, Nicolás Rivera, Carlos Hernández Ulloa. 255-257 [doi]
• Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract)Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi 0001. 258-260 [doi]
• Local Motif Clustering via (Hyper)Graph PartitioningAdil Chhabra, Marcelo Fonseca Faraj, Christian Schulz 0003. 261-263 [doi]
• A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract)Vianney Coppé, Pierre Schaus. 264-266 [doi]
• Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract)Ali Davoodi, Mark Wallace 0001, Daniel Harabor. 267-269 [doi]
• Lazy Compilation in Classical Planning (Extended Abstract)Zuzana Fílová, Pavel Surynek. 270-272 [doi]
• Parallel Beam Search for Combinatorial Optimization (Extended Abstract)Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi. 273-275 [doi]
• On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract)Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina. 276-278 [doi]
• K-Focal Search for Slow Learned Heuristics (Extended Abstract)Matias Greco, Jorge Toro, Carlos Hernández Ulloa, Jorge A. Baier. 279-281 [doi]
• Focal Discrepancy Search for Learned Heuristics (Extended Abstract)Matias Greco, Pablo Araneda, Jorge A. Baier. 282-284 [doi]
• Dual Euclidean Shortest Path Search (Extended Abstract)Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor. 285-287 [doi]
• IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract)Irene Hiess, Ludwig Kampel, Michael Wagner 0026, Dimitris E. Simos. 288-290 [doi]
• Urban Traffic Control via Planning with Global State Constraints (Extended Abstract)Franc Ivankovic, Mauro Vallati, Lukás Chrpa, Marco Roveri. 291-293 [doi]
• Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract)Kristýna Janovská, Pavel Surynek. 294-296 [doi]
• A Jeep Crossing a Desert of Unknown Width (Extended Abstract)Richard E. Korf. 297-298 [doi]
• An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract)Elad Levy, Guy Shani, Roni Stern. 299-301 [doi]
• Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract)Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner. 302-304 [doi]
• Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract)Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank. 305-307 [doi]
• Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract)Stefan O'Toole, Miquel Ramírez, Nir Lipovetzky, Adrian R. Pearce. 308-310 [doi]
• A Discussion on the Scalability of Heuristic Approximators (Extended Abstract)Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon. 311-313 [doi]
• On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)Francesco Percassi, Enrico Scala, Mauro Vallati. 314-316 [doi]
• Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract)Pavel Surynek. 317-319 [doi]
• Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract)Jirí Svancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub. 320-322 [doi]
• Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)Devin Thomas, Tianyi Gu 0001, Wheeler Ruml, Solomon Eyal Shimony. 323-325 [doi]
• Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract)Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev. 326-328 [doi]
• Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract)David Zahrádka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev. 329-331 [doi]
• Deep RRTXuzhe Dang, Lukás Chrpa, Stefan Edelkamp. 333-335 [doi]
• Avoiding Errors in Learned Heuristics in Bounded-Suboptimal SearchMatias Greco, Jorge A. Baier. 336-338 [doi]
• Beyond Markov Decision Process with Scalar Markovian RewardsShuwa Miura. 339-340 [doi]