Collision avoidance of multi unmanned aerial vehicles: A review
The control of a multiple unmanned aerial vehicle (UAV) system is popular and attracting a
lot of attentions. This is motivated by many practical civil and commercial UAV applications …
lot of attentions. This is motivated by many practical civil and commercial UAV applications …
Multi-agent pathfinding: Definitions, variants, and benchmarks
The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …
for multiple agents, where the key constraint is that the agents will be able to follow these …
[PDF][PDF] Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.
Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
[PDF][PDF] Explainable multi agent path finding
S Almagor, M Lahijanian - AAMAS, 2020 - mortezalahijanian.com
ABSTRACT Multi Agent Path Finding (MAPF) is the problem of planning paths for agents to
reach their targets from their start locations, such that the agents do not collide while …
reach their targets from their start locations, such that the agents do not collide while …
From multi-agent pathfinding to 3D pipe routing
Abstract The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free
paths for a number of agents, from a set of start locations to a set of goal positions in a …
paths for a number of agents, from a set of start locations to a set of goal positions in a …
Conflict-based search for explainable multi-agent path finding
The goal of the Multi-Agent Path Finding (MAPF) problem is to find non-colliding paths for
agents in an environment, such that each agent reaches its goal from its initial location. In …
agents in an environment, such that each agent reaches its goal from its initial location. In …
Rapid randomized restarts for multi-agent path finding solvers
Abstract Multi-Agent Path Finding (MAPF) is an NP-hard problem that has been well studied
in artificial intelligence and robotics. Recently, randomized MAPF solvers have been shown …
in artificial intelligence and robotics. Recently, randomized MAPF solvers have been shown …
[HTML][HTML] Real-time schedule adjustments for conflict-free vehicle routing
Abstract Conflict-Free Vehicle Routing Problems (CFVRPs) arise in manufacturing,
transportation and logistics applications where Automated Guided Vehicles (AGVs) are …
transportation and logistics applications where Automated Guided Vehicles (AGVs) are …
Temporal segmentation in multi agent path finding with applications to explainability
Abstract Multi-Agent Path Finding (MAPF) is the problem of planning paths for agents to
reach their targets from their start locations, such that the agents do not collide while …
reach their targets from their start locations, such that the agents do not collide while …
ECBS with flex distribution for bounded-suboptimal multi-agent path finding
Abstract Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for
multiple agents. CBS is a leading optimal two-level MAPF solver whose low level plans …
multiple agents. CBS is a leading optimal two-level MAPF solver whose low level plans …