Abstract Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-
free paths for multiple agents on a graph. This paper describes MAPF-based software for …

Abstract Multi-Agent Path Finding (MAPF) algorithms and their variants can find high-quality
collision-free plans for automated warehousing under simplified assumptions about the …

In recent years, Machine Learning (ML) models have achieved remarkable success in
various domains. However, these models also tend to demonstrate unsafe behaviors …

Multirobot systems must be able to maintain performance when robots get delayed during
execution. For mobile robots, one source of delays is congestion. Congestion occurs when …

Efficiently coordinating different types of robots is an important enabler for many commercial
and industrial automation tasks. Here, we present a distributed framework that enables a …

For many multi-robot problems, tasks are announced during execution, where task
announcement times and locations are uncertain. To synthesise multi-robot behaviour that is …

As autonomous systems are deployed at a large scale in both public and private spaces,
robots owned and operated by competing organisations will be required to interact …

Service robots are increasingly widespread in healthcare and domestic assistance settings.
Nevertheless, the literature still lacks robotic application development approaches that can …

This paper presents a theoretical model for path planning in multi-robot navigation in swarm
robotics. The plans for the paths are optimized using two objective functions, namely to …

Formal models of multi-robot behaviour are fundamental to planning, simulation, and model
checking techniques. However, existing models are invalidated by strong assumptions that …