There has been a continuous interest in multi-robot formation systems in the last few years
due to several significant advantages such as robustness, scalability, and efficiency …

In this article, we present a novel approach, namely distributed matching-by-clone
hungarian-based algorithm (DMCHBA), to multiagent task-allocation problems, in which the …

Abstract In the Multi-Agent Meeting problem (MAM), the task is to find the optimal meeting
location for multiple agents, as well as a path for each agent to that location. Among all …

We consider the problem of connected coordinated motion planning for a large collective of
simple, identical robots: From a given start grid configuration of robots, we need to reach a …

Multi-agent path planning (MAPP) is the problem of planning collision-free trajectories from
start to goal locations for a team of agents. This work explores a relatively unexplored setting …

Multi-mobile robot systems (MMRSs) show great advantages over one single robot in many
applications. However, the robots are required to form desired task-specified formations …

We propose an efficient framework using the Dehornoy order for homotopy-aware multi-
agent path planning in the plane. We developed a method to generate homotopically distinct …

A tactical military unit is a complex system composed of many agents such as infantry,
robots, or drones. Given a mission, an automated planner can find an optimal plan …

In this paper, we propose a novel approach for execution and planning-time efficient path
planning for a formation of robots moving in complex indoor environments. Our approach …

There are multi-agent algorithms that provide solutions with the shortest path without
considering other pursuing agents. However, less attention has been paid to computing an …