This paper considers a generalization of the Path Finding (PF) with refu...
Combined Target-Assignment and Path-Finding problem (TAPF) requires
simu...
The Multi-Objective Shortest Path Problem, typically posed on a graph,
d...
Multi-agent exploration of a bounded 3D environment with unknown initial...
Robots have the potential to perform search for a variety of application...
This work addresses the Multi-Objective Shortest Path Problem (MO-SPP): ...
This work considers a Motion Planning Problem with Dynamic Obstacles (MP...
Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple a...
This paper addresses a generalization of the well known multi-agent path...
Incremental graph search algorithms, such as D* Lite, reuse previous sea...
In multi-agent applications such as surveillance and logistics, fleets o...
Multi-agent path finding (MAPF) determines an ensemble of collision-free...
Conventional multi-agent path planners typically determine a path that
o...
Conventional multi-agent path planners typically compute an ensemble of ...