An Optimal Algorithm to Solve the Combined Task Allocation and Path Finding Problem

07/24/2019
by   Christian Henkel, et al.
0

We consider multi-agent transport task problems where, e.g. in a factory setting, items have to be delivered from a given start to a goal pose while the delivering robots need to avoid collisions with each other on the floor. We introduce a Task Conflict-Based Search (TCBS) Algorithm to solve the combined delivery task allocation and multi-agent path planning problem optimally. The problem is known to be NP-hard and the optimal solver cannot scale. However, we introduce it as a baseline to evaluate the sub-optimality of other approaches. We show experimental results that compare our solver with different sub-optimal ones in terms of regret.

READ FULL TEXT
research
02/08/2022

Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks

Multi-Agent Path Finding (MAPF) is the problem of finding collision-free...
research
05/13/2018

Multi-Agent Path Finding with Deadlines: Preliminary Results

We formalize the problem of multi-agent path finding with deadlines (MAP...
research
02/24/2021

MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings

Solving the Multi-Agent Path Finding (MAPF) problem optimally is known t...
research
06/11/2018

Multi-Agent Path Finding with Deadlines

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The obje...
research
06/03/2022

Towards Group Learning: Distributed Weighting of Experts

Aggregating signals from a collection of noisy sources is a fundamental ...
research
02/24/2021

Iterative Refinement for Real-Time Multi-Robot Path Planning

We study the iterative refinement of path planning for multiple robots, ...
research
07/02/2020

Multi-agent Planning for thermalling gliders using multi level graph-search

This paper solves a path planning problem for a group of gliders. The gl...

Please sign up or login with your details

Forgot password? Click here to reset