Search

Search Results

• Modelling Multi-Agent Pathfinding Problems by Integrating Connectivity and No-Collision Constraints (Extended Abstract)

  Jiří Švancara, Roman Barták, Ian Miguel, Joan Espasa

  314-315

  2026-08-14

• Ghost Agents in SAT-based Models for Multi-Agent Pathfinding (Extended Abstract)

  Jiří Švancara, Roman Barták

  316-317

  2026-08-14

• Alternating Target–Path Planning for Scalable Multi-Agent Coordination

  Yu Kumagai, Keisuke Okumura

  112-120

  2026-08-14

• Fast and Scalable Rule-Based Search for Deadline-Constrained Anonymous Multi-Agent Path Finding

  Sahar Badri, Serafino Cicerone, Alessia Di Fonso

  11-19

  2026-08-14

• ID-PaS+: Identity-Aware Predict-and-Search for Solving General Mixed-Integer Linear Programs

  Junyang Cai, El Mehdi Er Raqabi, Pascal Van Hentenryck, Bistra Dilkina

  20-28

  2026-08-14

• Faster Grid Pathfinding with Approximate Bounding Boxes

  Mark Carlson, Daniel D. Harabor, Peter J. Stuckey

  29-35

  2026-08-14

• Symbolic Greedy Best-First Search with Operator-Potential Heuristics

  Daniel Fišer, Álvaro Torralba

  36-46

  2026-08-14

• Precomputing Multi-Agent Path Replanning Using Temporal Flexibility

  Issa Hanou, Eric Kemmeren, Devin Wild Thomas, Mathijs de Weerdt

  47-55

  2026-08-14

• From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations

  Malte Helmert, Gabriele Röger

  56-64

  2026-08-14

• Beyond Static Assumptions: The Predictive Justified Perspective Model for Epistemic Planning

  Guang Hu, Weijia Li, Yangmengfei Xu

  65-73

  2026-08-14

• ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs

  Weimin Huang, Natalie M. Isenberg, Ján Drgoňa, Draguna L Vrabie, Bistra Dilkina

  74-83

  2026-08-14

• Exact Number of Flips Required to Sort a Burnt Stack of Pancakes

  Gerold Jäger, Nacim Oijid

  84-92

  2026-08-14

• Fast and Memory Efficient Multimodal Journey Planning with Delays

  Denys Katkalo, Andrii Rohovyi, Toby Walsh

  93-101

  2026-08-14

• Tree-MAPF: On the Complexity of Optimizing Multi Agent Path Finding on Tree Graphs

  Daniel Koyfman, Dor Atzmon, Shahaf Shperberg, Ariel Felner

  102-111

  2026-08-14

• Lifelong LaCAM with Local Guidance for Lifelong MAPF

  Tomoki Arita, Keisuke Okumura

  2-10

  2026-08-14

• Maximizing Throughput in Lifelong Multi-Agent Path Finding with Unassigned Agents

  Omer Onn, Ariel Felner, Roni Stern

  121-128

  2026-08-14

• Minimizing Conditional Cost with Goal-Reachability Guarantee in Stochastic Shortest Paths with Dead-Ends

  Matisse Roche, Yoko Watanabe, Caroline P. C. Chanel

  129-137

  2026-08-14

• Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics

  Tzur Shubi, Ariel Felner, Solomon Eyal Shimony, Shahaf Shperberg

  138-147

  2026-08-14

• GPU-Accelerated A* Search with Deep Neural Network Heuristics

  Misagh Soltani, Forest Agostinelli

  148-156

  2026-08-14

• Thread-Ordered Parallel Greedy Best First Search

  Dawson Tomasz, Rishi Veerapaneni, Maxim Likhachev, Richard Valenzano

  157-165

  2026-08-14

• Learning, Commitment, and Completeness in Real-Time Heuristic Search

  Devin Wild Thomas, Wheeler Ruml

  166-174

  2026-08-14

• Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search

  Maya Wolff, Ariel Felner, Oren Salzman

  175-183

  2026-08-14

• Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation

  Junfeng Wu, Jiaqi Chen, Hongkun Lyu, Kevin Zheng, Andy Li

  184-192

  2026-08-14

• BCBS-AA: Bounded Sub-Optimal Conflict-Based Search for Multi-Agent Path Finding with Asynchronous Actions

  Xuemian Wu, Shizhe Zhao, Zhongqiang Ren

  193-201

  2026-08-14

• Make Use of Your Search Effort: Data Augmentation for Learning Effective Planning Heuristics from Optimal Plans

  Shanhe Zhong, Eldan Cohen

  202-211

  2026-08-14