Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190141" target="_blank" >RIV/00216208:11320/13:10190141 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases

Original language description

We suggest to employ propositional satisfiability techniques in solving a problem of cooperative multi-robot path-finding optimally. Several propositional encodings of path-finding problems have been suggested recently. In this paper we evaluate how efficient these encodings are in solving certain cases of cooperative path-findings problems optimally. Par-ticularly, a case where robots have multiple optional loca-tions as their targets is considered in this paper.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>

Continuities

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

Publication year

2013

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 Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013,

ISBN

978-1-57735-630-1

ISSN

—

e-ISSN

—

Number of pages

4

Pages from-to

119-122

Publisher name

AAAI

Place of publication

USA

Event location

USA

Event date

Jul 11, 2013

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—