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”

MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10424629" target="_blank" >RIV/00216208:11320/20:10424629 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1609/aaai.v34i09.7088" target="_blank" >https://doi.org/10.1609/aaai.v34i09.7088</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1609/aaai.v34i09.7088" target="_blank" >10.1609/aaai.v34i09.7088</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots

  • Original language description

    Multi-Agent Path Finding (MAPF) deals with finding collision free paths for a set of agents (robots) moving on a graph. The interest in MAPF in the research community started to increase recently partly due to practical applications in areas such as warehousing and computer games. However, the academic community focuses mostly on solving the abstract version of the problem (moving of agents on the graph) with only a few results on real robots. The presented software MAPF Scenario provides a tool for specifying MAPF problems on grid maps, solving the problems using various abstractions (for example, assuming rotation actions or not), simulating execution of plans, and translating the abstract plans to control programs for small robots Ozobots. The tool is intended as a research platform for evaluating abstract MAPF plans on real robots and as an educational and demonstration tool bridging the areas of artificial intelligence and robotics.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • 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

    Conference on Artificial Intelligence

  • ISBN

    978-1-57735-835-0

  • ISSN

    2374-3468

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    13602-13603

  • Publisher name

    AAAI Press

  • Place of publication

    Neuveden

  • Event location

    New York, USA

  • Event date

    Feb 7, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article