Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Tzur Shubi; Ariel Felner; Solomon Eyal Shimony; Shahaf Shperberg
Fast and Memory Efficient Multimodal Journey Planning with Delays
Denys Katkalo; Andrii Rohovyi; Toby Walsh
Learning and Completeness in Real-Time Heuristic Search
Devin Wild Thomas; Wheeler Ruml
Thread-Ordered Parallel Greedy Best First Search
Dawson Tomasz; Rishi Veerapaneni; Maxim Likhachev; Richard Valenzano
GPU-Accelerated A* Search with Deep Neural Network Heuristics
Misagh Soltani; Forest Agostinelli
Symbolic Greedy Best-First Search with Operator-Potential Heuristics
Daniel Fišer; Álvaro Torralba
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
Bridging Multi-Valued Heuristics and Dimensionality Reduction in Multi-Objective Search
Maya Wolff; Ariel Felner; Oren Salzman
Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation
Junfeng Wu; Jiaqi Chen; Hongkun Lyu; Kevin Zheng; Andy Li
Exact number of flips required to sort a burnt stack of pancakes
Gerold Jäger; Nacim Oijid
Bounded Suboptimal Conflict-Based Search for Multi Agent Path Finding with Asynchronous Actions
Xuemian Wu; Shizhe Zhao; Zhongqiang Ren
ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs
Weimin Huang; Natalie Isenberg; Ján Drgoňa; Draguna Vrabie; Bistra Dilkina
Faster Grid Pathfinding with Approximate Bounding Boxes
Mark Carlson; Daniel Harabor; Peter J. Stuckey
Alternating Target–Path Planning for Scalable Multi-Agent Coordination
Yu Kumagai; Keisuke Okumura
From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations
Malte Helmert; Gabriele Röger
Beyond Static Assumptions: the Predictive Justified Perspective Model for Epistemic Planning
Guang Hu; Weijia Li; Yangmengfei Xu
Precomputing Multi-Agent Path Replanning using Temporal Flexibility
Issa Hanou; Eric Kemmeren; Devin Wild Thomas; Mathijs de Weerdt
Make Use of Your Search Effort: Data Augmentation for Learning Effective Planning Heuristics from Optimal Plans
Shanhe Zhong; Eldan Cohen
Maximizing Throughput in Lifelong Multi-Agent Path Finding with Unassigned Agents
Omer Onn; Ariel Felner; Roni Stern
Lifelong LaCAM with Local Guidance for Lifelong MAPF
Tomoki Arita; Keisuke Okumura
Fast and Scalable Rule-Based Search for Deadline-Constrained Anonymous Multi-Agent Path Finding
Sahar Badri; Serafino Cicerone; Alessia Di Fonso
Tree-MAPF: On the Complexity of Optimizing Multi Agent Path Finding on Tree Graphs
Daniel Koyfman; Dor Atzmon; Shahaf Shperberg; Ariel Felner
Minimizing Conditional Cost with Goal-Reachability Guarantee in Stochastic Shortest Paths with Dead-Ends
Matisse Roche; Caroline Ponzoni Carvalho Chanel; Yoko Watanabe
Front-to-Attractors: Modifying the Front-to-Front Heuristic in Bidirectional Search
Alvin Zou; Muhammad Suhail Saleem; Maxim Likhachev
Open List Implementations in A*
Remo Christen; Florian Pommerening; Malte Helmert
Bucket Aggregation in Bucket-Based Priority Queues for Heuristic Search
Ryan Goodwin; Eric Hansen; Garrett Fereday
Formula Neural Networks as Action Policies in Safety-Critical Planning: An Empirical Evaluation
Victor Scherer Putrich; Tim Nico Bauerschmidt; Chaahat Jain; Songtuan Lin; Joerg Hoffmann; Isabel Valera
Parallelizing Classical Planning: Critical Path Heuristics on the GPU
Markus Fritzsche; David Speck; Daniel Gnad; Simon Ståhlberg
Domain-Abstraction Heuristics for Simple Numeric Planning
Markus Fritzsche; Mikhail Gruntov; Alexander Shleyfman; Daniel Gnad
Embodying Multi-Hand Manipulation Policies by Searching the Assignment and Null Spaces
Yorai Shaoul; Jiaoyang Li; Maxim Likhachev
Petri Net Induced Heuristic Search for Resource Constrained Scheduling
Ido Lublin; Dor Atzmon; Izack Cohen
Evaluation of Baseline Methods for SSD-based External Memory Search
Yuki Suzuki; Alex Fukunaga
Tree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design Patterns
Guni Sharon
On the Use of AI Planning for Water Management of the Red River Basin in Vietnam
Diego Aineto; Nicola Bettinzoli; Ngo Le An; Enrico Scala; Ivan Serina
Understanding Reward Shaping in Planning: A Theoretical and Empirical Analysis
Oleksii Shuhailo; Tomáš Pevný; Karel Chvalovský; Mohsen Ghaffari
Policy-Guided Search on Tree-of-Thoughts for Efficient Problem Solving with Bounded Language Model Queries (Published TMLR 2025)
Sumedh Pendurkar; Guni Sharon
LaCAM* Variants for Minimizing Makespan in Multi-Agent Path Finding
Omer Idgar; Dor Atzmon; Ariel Felner
Situated Planning with Soft Goals
Andrew Coles; Erez Karpas; Solomon Eyal Shimony; Shahaf Shperberg; Wheeler Ruml
Adaptive Width Best-First Search: Dynamic Frontier Expansion for GNN-based Heuristics
Valerio Borelli; Alfonso Emilio Gerevini; Enrico Scala; Ivan Serina
The Pathfinding Benchmark (Extended Abstract)
Forest Agostinelli; Shahaf Shperberg; Ian Turner; Peng Fu; Rojina Panta; Misagh Soltani; Cale Workman; Ritvick Neerattil; Francisco León; Robert Vazquez; Amin Tavakoli; Pierre Baldi
MOSAIC: Skill-Centric Manipulation Planning with Physics Simulation
Itamar Mishani; Yorai Shaoul; Maxim Likhachev
Efficient Hierarchical Object Search in Road Networks
Tenindra Abeywickrama; Muhammad Aamir Cheema; Sabine Storandt
Parallel Heuristic Search as Inference for Actor-Critic Reinforcement Learning Models
Itamar Mishani; Hanlan Yang; Luca Pivetti; Zachary Kingston; Maxim Likhachev
Modelling Multi-Agent Pathfinding Problems by Integrating Connectivity and No-Collision Constraints
Jiří Švancara; Roman Barták; Ian Miguel; Joan Espasa
Ghost Agents in SAT-based Models for Multi-Agent Pathfinding
Jiří Švancara; Roman Barták
Multi-Agent Path Finding with Unassigned Agents (MAPFUA) - Extended Abstract
Ariel Felner; Roni Stern