7 papers
Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigms
Zongyuan Shen, Shalabh Gupta, Shancheng Zhao +7
Motion planning in dynamic environments is a fundamental problem in robotics, aiming to generate safe and efficient paths, trajectories, or control actions in the presence of movin…
Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions
Zongyuan Shen, Shalabh Gupta, Shancheng Zhao +6
Coverage path planning (CPP) is a fundamental problem in robot motion planning, whose aim is to produce robot trajectories that provide complete coverage of target workspaces while…
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…
Motion Planning in Dynamic Environments: A Survey from Classical to Modern Methods
Zongyuan Shen, Yaming Ou, Shalabh Gupta +6
Motion planning in dynamic environments requires robots to continuously adapt their paths in response to environmental changes for safe and uninterrupted navigation. While many sur…
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
Anoop Bhat, Geordan Gutow, Surya Singh +3
The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one o…
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.…