CBS-Budget (CBSB): A complete and bounded suboptimal search for multi-agent path finding.
Artif. Intell., 2025
Lazy incremental search for efficient replanning with bounded suboptimality guarantees.
Int. J. Robotics Res., 2024
Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2023
Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems.
PhD thesis, 2022
Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022
Class-Ordered LPA*: An Incremental-Search Algorithm for Weighted Colored Graphs.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021
A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021
MAMS-A*: Multi-Agent Multi-Scale A.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020