| 2025 | LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract). | Shuai Zhou, Shizhe Zhao, Zhongqiang Ren |
| 2025 | Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties. | Shizhe Zhao, Yancheng Wu, Zhongqiang Ren |
| 2025 | Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey. | Zhihui Xie, Xu Liu, Shuai Li |
| 2025 | Augmenting Exploration with Locally Greedy Probes. | Dawson Tomasz, Richard Valenzano |
| 2025 | Real-time Cost-algebraic Heuristic Search. | Devin Wild Thomas, Wheeler Ruml |
| 2025 | Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities. | Jiaqi Tan, Yudong Luo, Jiaoyang Li, Hang Ma |
| 2025 | RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks (Extended Abstract). | Yimin Tang, Xiao Xiong, Jingyi Xi, Jiaoyang Li, Erdem Biyik, Sven Koenig |
| 2025 | Object Packing and Scheduling for Sequential 3D Printing: A Linear Arithmetic Model and a CEGAR-Inspired Optimal Solver (Extended Abstract). | Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis |
| 2025 | Task and Motion Planning Using Infinite Completion Tree and Agnostic Skills. | Matan Sudry, Tom Jurgenson, Erez Karpas |
| 2025 | Uncertainty in Real-World Vehicle Routing (Extended Abstract). | Vclav Sobotka, Hana Rudov |
| 2025 | Heuristics for Bounded-Suboptimal Search. | Lior Siag, Ariel Felner, Shahaf S. Shperberg |
| 2025 | Bidirectional Heuristic Search in Longest Path Problems (Extended Abstract). | Tzur Shubi, Solomon Eyal Shimony, Ariel Felner, Shahaf S. Shperberg |
| 2025 | Position Paper: On the Impact of Direction-Selection in BAE. | Shahaf S. Shperberg, Lior Siag, Nathan R. Sturtevant, Ariel Felner |
| 2025 | Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract). | Shahaf S. Shperberg, Natalie Morad, Lior Siag, Ariel Felner, Dor Atzmon |
| 2025 | Decoupling Generation and Evaluation for Parallel Greedy Best-First Search. | Takumi Shimoda, Alex Fukunaga |
| 2025 | From Agent Centric to Obstacle Centric Planning: A Makespan-Optimal Algorithm for the Multi-Agent Warehouse Rearrangement Problem. | Yaakov Sherma, Eyal Weiss, Oren Salzman |
| 2025 | From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search. | Dominik Schreiber, Christoph Jabs, Jeremias Berg |
| 2025 | Extracting Problem Structure with LLMs for Optimized SAT Local Search. | Andr Schidler, Stefan Szeider |
| 2025 | Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions. | Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev |
| 2025 | Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding. | Keisuke Okumura, Hiroki Nagai |
| 2025 | Hierarchical DeepPruner: A Novel Framework for Search Space Reduction. | Ankur Nath, Alan Kuhnle |
| 2025 | You May Split but You Might Work It Out Later: First Steps Toward Merging Nodes in MAPF (Extended Abstract). | Grigorios Mouratidis, Bernhard Nebel, Sven Koenig |
| 2025 | Should Multi-Agent Path Finding Algorithms Coordinate Target Arrival Times? | Jonathan Morag, Noy Gabay, Daniel Koyfman, Roni Stern |
| 2025 | Frontmatter. | Maxim Likhachev, Hana Rudov, Enrico Scala |
| 2025 | Real-Time LaCAM for Real-Time MAPF. | Runzhe Liang, Rishi Veerapaneni, Daniel Harabor, Jiaoyang Li, Maxim Likhachev |