From Classical to Colored Multi-Agent Path Finding

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10432978" target="_blank" >RIV/00216208:11320/21:10432978 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

From Classical to Colored Multi-Agent Path Finding

Original language description

Multi-Agent Path Finding (MAPF) deals with the problem of finding collision-free paths for a set of agents moving in a shared environment. Colored MAPF generalizes MAPF by defining groups of agents that share a set of destination locations. In the paper, we evaluate several approaches to optimally solve colored MAPF problem. We also investigate methods for obtaining lower bounds on optimal solution based on several relaxation techniques.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the Fourteenth International Symposium on Combinatorial Search

ISBN

978-1-57735-870-1

ISSN

—

e-ISSN

—

Number of pages

3

Pages from-to

150-152

Publisher name

AAAI press

Place of publication

Neuveden

Event location

Jinan, China

Event date

Jul 26, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—