6 papers
Conflict-Based Search for Multi-Agent Path Finding with Elevators
Haitong He, Xuemian Wu, Shizhe Zhao +1
This paper investigates a problem called Multi-Agent Path Finding with Elevators (MAPF-E), which seeks conflict-free paths for multiple agents from their start to goal locations th…
Conflict-Based Search for Multi Agent Path Finding with Asynchronous Actions
Xuemian Wu, Shizhe Zhao, Zhongqiang Ren
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective start locations to their respective goal locations while minimizing path costs.…
HEHA: Hierarchical Planning for Heterogeneous Multi-Robot Exploration of Unknown Environments
Longrui Yang, Yiyu Wang, Jingfan Tang +4
This paper considers the path planning problem for autonomous exploration of an unknown environment using multiple heterogeneous robots such as drones, wheeled, and legged robots,…
Conflict-Based Search and Prioritized Planning for Multi-Agent Path Finding Among Movable Obstacles
Shaoli Hu, Shizhe Zhao, Zhongqiang Ren
This paper investigates Multi-Agent Path Finding Among Movable Obstacles (M-PAMO), which seeks collision-free paths for multiple agents from their start to goal locations among sta…
Heuristic Search for Path Finding with Refuelling
Shizhe Zhao, Anushtup Nandy, Howie Choset +2
This paper considers a generalization of the Path Finding (PF) problem with refuelling constraints referred to as the Gas Station Problem (GSP). Similar to PF, given a graph where…
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions
Shuai Zhou, Shizhe Zhao, Zhongqiang Ren
Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locations while minimizing path cos…