Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …

Multi-agent Pathfinding, also known as MAPF, is an Artificial Intelligence problem-solving.
The aim is to direct each agent to find its path to reach its target, both individually and in …

The Multi-Agent Pathfinding problem (MAPF) has several applications in industry and
robotics. The aim of a MAPF-solver is to find a set of optimal and non-overlapping paths for a …

A warehouse delivery problem consists of a set of robots that undertake delivery jobs within
a warehouse. Items are moved around the warehouse in response to events. A solution to a …

This article describes the heuristics used by the Shadoks team for the CG: SHOP 2021
challenge. This year's problem is to coordinate the motion of multiple robots in order to reach …

As systems involving multiple agents are increasingly deployed, there is a growing need to
diagnose failures in such systems. Model-Based Diagnosis (MBD) is a well-known AI …

Although the multi-agent pickup and delivery (MAPD) problem, wherein multiple agents
iteratively carry materials from some storage areas to the respective destinations without …

In many multi-agent systems (MAS), agents are assigned to perform tasks. These tasks
require designing plans for the agents, which are called multi-agent plan (MAP). Such …

Multi-agent Path Finding deals with finding collision-free paths for a set of agents moving in
a shared environment. Due to uncertainty during execution, agents might be delayed, which …

The main challenge in multi-robot navigation is the resolution of navigation conflicts
between agents caused by intersecting paths. The contributions of this paper are: The …