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 for Large Agents

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://aaai.org/Conferences/AAAI-19/" target="_blank" >https://aaai.org/Conferences/AAAI-19/</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multi-Agent Path Finding for Large Agents

  • Original language description

    Multi-Agent Path Finding (MAPF) has been widely studiedin the AI community. For example, Conflict-Based Search(CBS) is a state-of-the-art MAPF algorithm based on a two-level tree-search. However, previous MAPF algorithms as-sume that an agent occupies only a single location at anygiven time, e.g., a single cell in a grid. This limits their ap-plicability in many real-world domains that have geometricagents in lieu of point agents. Geometric agents are referredto as “large” agents because they can occupy multiple pointsat the same time. In this paper, we formalize and study LA-MAPF, i.e., MAPF for large agents.

  • 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 33rd AAAI Conference on Artificial Intelligence (AAAI-19)

  • ISBN

    978-1-57735-809-1

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    7627-7634

  • Publisher name

    Association for the Advancement of Artificial Intelligence (AAAI)

  • Place of publication

    Palo Alto, California

  • Event location

    Honolulu, Hawaii

  • Event date

    Jan 27, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000486572502020