Path finding in multi-agent systems aims to identify collision-free and cost-optimized paths
for all agents with distinct start and goal positions. It poses challenging optimization …

Incrementalgraph search algorithms such as D* Lite reuse previous, and perhaps partial,
searches to expedite subsequent path planning tasks. In this article, we are interested in …

This work addresses a Multi-Objective Shortest Path Problem (MO-SPP) on a graph where
the goal is to find a set of Pareto-optimal solutions from a start node to a destination in the …

In multi-agent applications such as surveillance and logistics, fleets of mobile agents are
often expected to coordinate and safely visit a large number of goal locations as efficiently …

Path planning among dynamic obstacles is a fundamental problem in Robotics with
numerous applications. In this work, we investigate a problem called Multi-Objective Path …

Conventional multi-agent path planners typically compute an ensemble of paths while
optimizing a single objective, such as path length. However, many applications may require …

Conventional Multi-Agent Path Finding (MAPF) problems aim to compute an ensemble of
collision-free paths for multiple agents from their respective starting locations to pre …

A unified framework for multi-agent task assignment and distributed trajectory planning that
can autonomously adapt to complex interactive environments and multi-task constraints has …

Conventional multi-agent path planners typically compute an ensemble of paths while
optimizing a single objective, such as path length. However, many applications may require …

The Shortest Path (SP) problem resembles a variety of real-world situations where one
needs to find paths between origins and destinations. A generalization of the SP is the …