| 2024 | A Short Summary of Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration (Extended Abstract). | Yuanhang Zhang, Hesheng Wang, Zhongqiang Ren |
| 2024 | Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). | Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey |
| 2024 | Multi-Agent Motion Planning with Bzier Curve Optimization under Kinodynamic Constraints (Extended Abstract). | Jingtian Yan, Jiaoyang Li |
| 2024 | Multi-agent Motion Planning through Stationary State Search (Extended Abstract). | Jingtian Yan, Jiaoyang Li |
| 2024 | Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract). | Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern |
| 2024 | From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS (Extended Abstract). | Yu Wu, Rishi Veerapaneni, Jiaoyang Li, Maxim Likhachev |
| 2024 | Tunable Suboptimal Heuristic Search. | Stephen Wissow, Fanhao Yu, Wheeler Ruml |
| 2024 | Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. | Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner |
| 2024 | A Data Efficient Framework for Learning Local Heuristics. | Rishi Veerapaneni, Jonathan Park, Muhammad Suhail Saleem, Maxim Likhachev |
| 2024 | Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. | Carlos Hernndez Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman |
| 2024 | The Bench Transition System and Stochastic Exploration. | Dawson Tomasz, Richard Valenzano |
| 2024 | Real-time Safe Interval Path Planning. | Devin Wild Thomas, Wheeler Ruml, Solomon Eyal Shimony |
| 2024 | ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem. | Yimin Tang, Sven Koenig, Jiaoyang Li |
| 2024 | Large-Scale Multi-Robot Coverage Path Planning via Local Search (Extended Abstract). | Jingtao Tang, Hang Ma |
| 2024 | Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract). | Jingtao Tang, Hang Ma |
| 2024 | Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). | Pavel Surynek |
| 2024 | CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). | Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito |
| 2024 | On Parallel External-Memory Bidirectional Search (Extended Abstract). | Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant |
| 2024 | On the Properties of All-Pair Heuristics. | Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant |
| 2024 | Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP. | Pouya Shati, Eldan Cohen, Sheila A. McIlraith |
| 2024 | Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality. | Yorai Shaoul, Rishi Veerapaneni, Maxim Likhachev, Jiaoyang Li |
| 2024 | Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). | Irene Saccani, Kristna Janovsk, Pavel Surynek |
| 2024 | A Quality Diversity Approach to Automatically Generate Multi-Agent Path Finding Benchmark Maps (Extended Abstract). | Cheng Qian, Yulun Zhang, Jiaoyang Li |
| 2024 | Optimised Variants of Polynomial Compilation for Conditional Effects in Classical Planning. | Francesco Percassi, Enrico Scala, Alfonso Emilio Gerevini |
| 2024 | Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms. | Sumedh Pendurkar, Levi H. S. Lelis, Nathan R. Sturtevant, Guni Sharon |