All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00355516" target="_blank" >RIV/68407700:21240/21:00355516 - isvavai.cz</a>

  • Result on the web

    <a href="https://ojs.aaai.org/index.php/SOCS/article/view/18583" target="_blank" >https://ojs.aaai.org/index.php/SOCS/article/view/18583</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories

  • Original language description

    Multi-agent path finding with continuous movements and time (denoted MAPFR) is addressed. The task is to navigate agents that move smoothly between predefined positions to their individual goals so that they do not collide. Recently a novel solving approach for obtaining makespan optimal so- lutions called SMT-CCBS based on satisfiability modulo the- ories (SMT) has been introduced. We extend the approach further towards the sum-of-costs objective which is a more challenging case in the yes/no SMT environment due to more complex calculation of the objective

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • Project

    <a href="/en/project/GA19-17966S" target="_blank" >GA19-17966S: intALG-MAPFg: Intelligent Algorithms for Generalized Variants of Multi-Agent Path Finding</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the International Symposium on Combinatorial Search

  • ISBN

    9781713834557

  • ISSN

  • e-ISSN

  • Number of pages

    3

  • Pages from-to

    200-202

  • Publisher name

    Association for the Advancement of Artificial Intelligence (AAAI)

  • Place of publication

    Palo Alto, California

  • Event location

    Virtual conference

  • Event date

    Jul 26, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article