Accepted Papers
Technical Long Papers:
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees
Gal Dahan; Itay Tabib; Solomon Eyal Shimony; Yefim Dinitz
Multi-Agent Path Execution with Uncertainty
Yihao Liu; Xueyan Tang; Wentong Cai; Jingning Li
A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications
Evgeny Mishlyakov; Mikhail Gruntov; Alexander Shleyfman; Erez Karpas
ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem
Yimin Tang; Sven Koenig; Jiaoyang Li
Prioritised Planning with Guarantees
Jonathan Morag; Yue Zhang; Daniel Koyfman; Zhe Chen; Ariel Felner; Daniel Harabor; Roni Stern
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions
Songtuan Lin; Daniel Höller; Pascal Bercher
On the Properties of All-Pair Heuristics
Shahaf Shperberg; Ariel Felner; Lior Siag; Nathan R. Sturtevant
Real-time Safe Interval Path Planning
Devin Wild Thomas; Wheeler Ruml; Solomon Eyal Shimony
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search
Thayne T. Walker; Nathan R. Sturtevant; Ariel Felner
Tunable Suboptimal Heuristic Search
Stephen Wissow; Fanhao Yu; Wheeler Ruml
Introducing Delays in Multi Agent Path Finding
Justin Kottinger; Tzvika Geft; Shaull Almagor; Oren Salzman; Morteza Lahijanian
Optimised Variants of Polynomial Compilation for Conditional Effects in Classical Planning
Francesco Percassi; Enrico Scala; Alfonso Emilio Gerevini
Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms
Sumedh Pendurkar; Levi H. S. Lelis; Nathan R. Sturtevant; Guni Sharon
Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP
Pouya Shati; Eldan Cohen; Sheila McIlraith
A-A*pex: Efficient Anytime Approximate Multi-Objective Search
Han Zhang; Oren Salzman; Ariel Felner; Carlos Hernández Ulloa; Sven Koenig
Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality
Yorai Shaoul; Rishi Veerapaneni; Maxim Likhachev; Jiaoyang Li
Heuristic Search for the Orienteering Problem with Time-Varying Reward
Chao Cao; Jinyun Xu; Ji Zhang; Howie Choset; Zhongqiang Ren
The Bench Transition System and Stochastic Exploration
Dawson Tomasz; Richard Valenzano
Bi-Criteria Diverse Plan Selection via Beam Search Approximation
Shanhe Zhong; Pouya Shati; Eldan Cohen
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing
Ang Li; Peter J. Stuckey; Sven Koenig; T. K. Satish Kumar
Avoiding Node Re-Expansions Can Break Symmetry Breaking
Mark Carlson; Daniel Harabor; Peter J. Stuckey
Efficient and Exact Public Transport Routing via a Transfer Connection Database
Abdallah Abuaisha; Mark Wallace; Daniel Harabor; Bojie Shen
Technical Short Papers:
Optimal Unlabeled Pebble Motion on Trees
Pierre Le Bodic; Edward Lam
Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning
Clemens Büchner; Remo Christen; Salomé Eriksson; Thomas Keller
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations
Carlos Hernández Ulloa; Han Zhang; Sven Koenig; Ariel Felner; Oren Salzman
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning
Dillon Z. Chen; Sylvie Thiébaux
Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning
Michael Katz; Junkyu Lee; Jungkoo Kang; Shirin Sohrabi
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures
Han Zhang; Oren Salzman; Ariel Felner; T. K. Satish Kumar; Carlos Hernández Ulloa; Sven Koenig
A Data Efficient Framework for Learning Local Heuristics
Rishi Veerapaneni; Jonathan Park; Muhammad Suhail Saleem; Maxim Likhachev
Position Long Papers:
Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS
Grigorios Mouratidis; Bernhard Nebel; Sven Koenig
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
He Jiang; Yulun Zhang; Rishi Veerapaneni; Jiaoyang Li
Extended Abstracts:
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract)
Jingtao Tang; Hang Ma
Large-Scale Multi-Robot Coverage Path Planning via Local Search (Extended Abstract)
Jingtao Tang; Hang Ma
Exploring Conflict Generating Decisions: Initial Results (Extended Abstract)
Md Solimul Chowdhury; Martin Müller; Jia-Huai You
Lazy Evaluation of Negative Preconditions in Planning Domains (Extended Abstract)
Santiago Franco; Jamie O. Roberts; Sara Bernardini
Deployable Yet Effective Traffic Signal Optimisation via Automated Planning (Extended Abstract)
Anas El Kouaiti; Francesco Percassi; Alessandro Saetti; Thomas Leo McCluskey; Mauro Vallati
Taming Discretised PDDL+ through Multiple Discretisations (Extended Abstract)
Matteo Cardellini; Marco Maratea; Francesco Percassi; Enrico Scala; Mauro Vallati
On Parallel External-Memory Bidirectional Search (Extended Abstract)
Lior Siag; Shahaf Shperberg; Ariel Felner; Nathan R. Sturtevant
Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract)
Sean Mariasin; Andrew Coles; Erez Karpas; Wheeler Ruml; Solomon Eyal Shimony; Shahaf Shperberg
Extreme Value Monte Carlo Tree Search (Extended Abstract)
Masataro Asai; Stephen Wissow
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract)
Daniel Koyfman; Shahaf Shperberg; Dor Atzmon; Ariel Felner
Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract)
Irene Saccani; Kristýna Janovská; Pavel Surynek
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract)
Pavel Surynek
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract)
Zhe Chen; Daniel Harabor; Jiaoyang Li; Peter J. Stuckey
Parallelizing Multi-objective A* Search (Extended Abstract)
Saman Ahmadi
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
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract)
Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito
Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract)
Shahar Bardugo; Dor Atzmon
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)
Yarin Benyamin; Argaman Mordoch; Shahaf Shperberg; Wiktor Piotrowski; Roni Stern
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract)
Konstantin Yakovlev; Anton Andreychuk; Roni Stern
A Short Summary of Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration (Extended Abstract)
Yuanhang Zhang; Hesheng Wang; Zhongqiang Ren
A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract)
Rodrigo López; Roberto Asín-Achá; Jorge A. Baier
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
A Quality Diversity Approach to Automatically Generate Multi-Agent Path Finding Benchmark Maps (Extended Abstract)
Cheng Qian; Yulun Zhang; Jiaoyang Li
Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract)
Pablo Araneda; Carlos Hernández Ulloa; Nicolás Rivera; Jorge A. Baier
Multi-Robot Coordination and Layout Design for Automated Warehousing (Extended Abstract)
Yulun Zhang; Matthew C. Fontaine; Varun Bhatt; Stefanos Nikolaidis; Jiaoyang Li
Arbitrarily Scalable Environment Generators via Neural Cellular Automata (Extended Abstract)
Yulun Zhang; Matthew C. Fontaine; Varun Bhatt; Stefanos Nikolaidis; Jiaoyang Li
Multi-agent Motion Planning through Stationary State Search (Extended Abstract)
Jingtian Yan; Jiaoyang Li
Multi-Agent Motion Planning with Bézier Curve Optimization under Kinodynamic Constraints (Extended Abstract)
Jingtian Yan; Jiaoyang Li