CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding
Authors:
- Jaein LimJLJaein Lim
- Panagiotis TsiotrasPTPanagiotis Tsiotras
- 9 May 2025
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 346
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (IIS-2008686)
- US Army Combat Capabilities Development Command Army Research Laboratory (DCIST CRA W911NF-17-2-0181)
This publication has 12 references indexed in Scilit:
- Lazy incremental search for efficient replanning with bounded suboptimality guaranteesThe International Journal of Robotics Research, 2024
- Pairwise symmetry reasoning for multi-agent path finding searchArtificial Intelligence, 2021
- dRRT*: Scalable and informed asymptotically-optimal multi-robot motion planningAutonomous Robots, 2019
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problemsAnnals of Mathematics and Artificial Intelligence, 2017
- Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planningThe International Journal of Robotics Research, 2016
- Conflict-based search for optimal multi-agent pathfindingArtificial Intelligence, 2015
- The increasing cost tree search for optimal multi-agent pathfindingArtificial Intelligence, 2013
- Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robotsRobotics and Autonomous Systems, 2002
- Studies in Semi-Admissible HeuristicsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968