no code implementations • 11 Dec 2023 • Zhongqiang Ren, Anushtup Nandy, Sivakumar Rathinam, Howie Choset
MCPF is challenging as it involves both planning collision-free paths for multiple agents and target sequencing, i. e., solving traveling salesman problems to assign targets to and find the visiting order for the agents.
no code implementations • 19 Sep 2023 • Anushtup Nandy, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
This paper considers a generalization of the Path Finding (PF) with refueling constraints referred to as the Refuelling Path Finding (RF-PF) problem.
