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”

Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)

  • Original language description

    We address a variant of multi-agent path finding(MAPF) with continuous time and geometric agents. The standard MAPF is a task of navigating agents in an undirected graph from given starting vertices to given goals so that agents do not collide. In the continuous version (MAPFR), agents move in then-dimensional Euclidean space along straight lines that inter-connect predefined positions. We present a new solving ap-proach based on satisfiability modulo theories(SMT) to obtain makespan optimal solutions. Our SMT-based approach for MAPFR called SMT-CBSR reformulates the Conflict-based Search (CBS) algorithm in terms of SMT concepts.

  • 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

    2019

  • 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 Twelfth International Symposium on Combinatorial Search

  • ISBN

    978-1-57735-808-4

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    200-201

  • Publisher name

    Association for the Advancement of Artificial Intelligence (AAAI)

  • Place of publication

    Palo Alto, California

  • Event location

    Napa, California

  • Event date

    Jul 16, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article