Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10333012" target="_blank" >RIV/00216208:11320/16:10333012 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective

Original language description

This paper focuses on finding optimal solutions to the multi-agent path finding (MAPF) problem over undirected graphs where the task is to find non-colliding paths for multiple agents, each with a different start and goal position. An encoding of MAPF to Boolean satisfiability (SAT) is already known to the makespan optimal variant of the problem.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2016

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 2016 International Conference on Autonomous Agents &amp; Multiagent Systems

ISBN

978-1-4503-4239-1

ISSN

—

e-ISSN

—

Number of pages

2

Pages from-to

1435-1436

Publisher name

ACM

Place of publication

Singapore

Event location

Singapore

Event date

May 9, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—