SAT-based Multi-Agent Path Finding

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F19%3A00333585" target="_blank" >RIV/68407700:21240/19:00333585 - isvavai.cz</a>

Výsledek na webu

<a href="http://idm-lab.org/wiki/IJCAI19-MAPF/" target="_blank" >http://idm-lab.org/wiki/IJCAI19-MAPF/</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

SAT-based Multi-Agent Path Finding

Popis výsledku v původním jazyce

Multi-agent Path Finding (MAPF) became an area of growing research interest. At the core of this research area,numerous diverse techniques were developed in the past 10years for optimally solving MAPF under various objectives such as the sum-of-costs.One of the major streams of development are optimal solving algorithms based on the reduction to propositional satisfiability (SAT). In this talk I will survey these techniques, while putting them into the wider context of the MAPF research. I will also provide theoretical and experimental comparisons that show pros and cons of the SAT-based approach in contrast to other search-based techniques. The talk is addressed to the general computer science audience. No prior knowledge is needed.

Název v anglickém jazyce

SAT-based Multi-Agent Path Finding

Popis výsledku anglicky

Multi-agent Path Finding (MAPF) became an area of growing research interest. At the core of this research area,numerous diverse techniques were developed in the past 10years for optimally solving MAPF under various objectives such as the sum-of-costs.One of the major streams of development are optimal solving algorithms based on the reduction to propositional satisfiability (SAT). In this talk I will survey these techniques, while putting them into the wider context of the MAPF research. I will also provide theoretical and experimental comparisons that show pros and cons of the SAT-based approach in contrast to other search-based techniques. The talk is addressed to the general computer science audience. No prior knowledge is needed.

Druh

O - Ostatní výsledky

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA19-17966S" target="_blank" >GA19-17966S: intALG-MAPFg: Inteligentní algoritmy pro zobecněné varianty multi-agetního hledání cest</a><br>

Návaznosti

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

Rok uplatnění

2019

Kód důvěrnosti údajů

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