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”

Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00345197" target="_blank" >RIV/68407700:21240/20:00345197 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-59535-7_7" target="_blank" >https://doi.org/10.1007/978-3-030-59535-7_7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-59535-7_7" target="_blank" >10.1007/978-3-030-59535-7_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective

  • Original language description

    Multi-agent path finding with continuous movements and time (denoted MAPF-R) is addressed. The task is to navigate agents that move smoothly between predefined positions to their individual goals so that they do not col-lide. Recently a novel solving approach for obtaining makespan optimal solutions called SMT-CBS-R based on satisfiability modulo theories (SMT) has been introduced.

  • 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

    2020

  • 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 18th Russian Conference on Artificial Intelligence

  • ISBN

    978-3-030-59534-0

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    15

  • Pages from-to

    85-99

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Virtualne (puvodne Moskva)

  • Event date

    Oct 10, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article