Accepted Papers

Long Papers

• A Conflict-Driven Approach for Reaching Goals Specified with Negation as Failure
  Forest Agostinelli

• Sorting Colored Balls in Colored Tubes
  Ernst Althaus, Markus Blumenstock, Nick Rassau, Felix Martin Schuhknecht, Anton Quentin Zimdars

• Finding All Optimal Solutions in Multi-Agent Path Finding
  Shahar Bardugo, Daniel Koyfman, Dor Atzmon

• A Problem with the Current Methodology for Comparing Search Algorithms and a Proposed Solution
  Michael Barley, Natasha de Kriek, Santiago Franco, Angel Garcia-Olaya, Tim Hartill, Christopher Triggs, Henry Zwart, Vidal Alcázar, Patricia Riddle

• Sub-Microsecond Grid Path Planning, at What Cost?
  Mark Carlson, Daniel Harabor, Peter J. Stuckey

• New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding
  Shao-Hung Chan, Thomy Phan, Jiaoyang Li, Sven Koenig

• A Bucket-Based Priority Queue for Bounded-Suboptimal and Anytime A* Search
  Garrett M. Fereday, Eric A. Hansen

• A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
  Yaron Halle, Ariel Felner, Sven Koenig, Oren Salzman

• Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance
  Weimin Huang, Natalie M. Isenberg, Ján Drgoňa, Draguna L Vrabie, Bistra Dilkina

• Minimizing Fuel in Multi-Agent Pathfinding
  Daniel Koyfman, Dor Atzmon, Shahaf Shperberg, Ariel Felner

• Low-Level Search on Time Intervals in Branch-and-Cut-and-Price for Multi-Agent Path Finding
  Edward Lam, Peter J. Stuckey

• Hierarchical DeepPruner: A Novel Framework for Search Space Reduction
  Ankur Nath, Alan Kuhnle

• Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding
  Keisuke Okumura, Hiroki Nagai

• Lazy Heuristic Search for Solving POMDPs with Expensive-to-Compute Belief Transitions
  Muhammad Suhail Saleem, Rishi Veerapaneni, Maxim Likhachev

• From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search
  Dominik Schreiber, Christoph Jabs, Jeremias Berg

• From Agent Centric to Obstacle Centric Planning: A Makespan-Optimal Algorithm for the Multi-Agent Warehouse Rearrangement Problem
  Yaakov Sherma, Eyal Weiss, Oren Salzman

• Heuristics for Bounded-Suboptimal Search
  Lior Siag, Ariel Felner, Shahaf Shperberg

• Task and Motion Planning Using Infinite Completion Tree and Agnostic Skills
  Matan Sudry, Tom Jurgenson, Erez Karpas

• Real-time Cost-algebraic Heuristic Search
  Devin Wild Thomas, Wheeler Ruml

• Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties
  Shizhe Zhao, Yancheng Wu, Zhongqiang Ren

Short Papers

• Using Action-Policy Testing in RL to Reduce the Number of Bugs
  Hasan Ferit Eniser, Songtuan Lin, Nicola Müller, Anastasia Isychev, Valentin Wüstholz, Isabel Valera, Jörg Hoffmann, Maria Christakis

• On Path Selection for Reduction-Based Solving of Multi-Agent Pathfinding Using Graph Pruning
  Matej Husár, Jiří Švancara, Roman Barták

• Guiding the Search for the Euclidean Shortest Path Problem
  Daniel Koch, Stefan Funke

• Real-Time LaCAM for Real-Time MAPF
  Runzhe Liang, Rishi Veerapaneni, Daniel Harabor, Jiaoyang Li, Maxim Likhachev

• Decoupling Generation and Evaluation for Parallel Greedy Best-First Search
  Takumi Shimoda, Alex Fukunaga

• Augmenting Exploration with Locally Greedy Probes
  Dawson Tomasz, Richard Valenzano

Position Papers

• Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities
  Jiaqi Tan, Yudong Luo, Jiaoyang Li, Hang Ma

• Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey
  Zhihui Xie, Xu Liu, Shuai Li

Position Short Papers

• Should Multi-Agent Path Finding Algorithms Coordinate Target Arrival Times?
  Jonathan Morag, Noy Gabay, Daniel Koyfman, Roni Stern

• Extracting Problem Structure with LLMs for Optimized SAT Local Search
  André Schidler, Stefan Szeider

• Position Paper: On the Impact of Direction-Selection in BAE*
  Shahaf Shperberg, Lior Siag, Nathan Sturtevant, Ariel Felner

Extended Abstracts

• Surrogate-Assisted Monte-Carlo Tree Search in Facility Location and Beyond (Extended Abstract)
  Saeid Amiri, Danial Dervovic, Parisa Zehtabi, Michael Cashmore

• BLAST: Bit-Blasting Numbers for Classical Planning (Extended Abstract)
  Luigi Bonassi, Francesco Percassi, Enrico Scala

• Learning Heuristic Functions with Graph Neural Networks for Numeric Planning (Extended Abstract)
  Valerio Borelli, Alfonso Emilio Gerevini, Enrico Scala, Ivan Serina

• Exploring the Trade-off Between Flexible and Deployable Models for PDDL+ Urban Traffic Control (Extended Abstract)
  Sandra Castellanos-Paez, Francesco Percassi, Mauro Vallati

• Critical Section Macros - New Results (Extended Abstract)
  Lukáš Chrpa, Mauro Vallati

• Multi-Agent Path Finding for Schedule Constrained Automation (Extended Abstract)
  Kareem Eissa, Rayal Prasad, Ankur Kapoor

• Suboptimal Search with Dynamic Distribution of Suboptimality (Extended Abstract)
  Mohammadreza Hami, Nathan Sturtevant

• Hierarchical Seating Allocation (Extended Abstract)
  Anton Ipsen, Michael Cashmore, Parisa Zehtabi, Nicolas Marchesotti, Kirsty Fielding, Daniele Magazzeni, Manuela Veloso

• 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

• Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract)
  Shahaf Shperberg, Natalie Morad, Lior Siag, Ariel Felner, Dor Atzmon

• Bidirectional Heuristic Search in Longest Path Problems (Extended Abstract)
  Tzur Shubi, Solomon Eyal Shimony, Ariel Felner, Shahaf Shperberg

• Uncertainty in Real-World Vehicle Routing (Extended Abstract)
  Václav Sobotka, Hana Rudová

• Object Packing and Scheduling for Sequential 3D Printing: A Linear Arithmetic Model and a CEGAR-Inspired Optimal Solver (Extended Abstract)
  Pavel Surynek, Vojtěch Bubník, Lukáš Matěna, Petr Kubiš

• 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 Bıyık, Sven Koenig

• LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract)
  Shuai Zhou, Shizhe Zhao, Zhongqiang Ren