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”

An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10333013" target="_blank" >RIV/00216208:11320/16:10333013 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives

  • Original language description

    In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been modified for the sum-of-costs objective. In this paper, we em- pirically compare the hardness of solving MAPF with SAT- based and search-based solvers under the makespan and the sum-of-costs objectives in a number of domains. The experi- mental evaluation shows that MAPF under the makespan ob- jective is easier across all the tested solvers and domains

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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 Ninth Annual Symposium on Combinatorial Search

  • ISBN

    978-1-57735-769-8

  • ISSN

  • e-ISSN

  • Number of pages

    3

  • Pages from-to

    145-147

  • Publisher name

    AAAI Press

  • Place of publication

    Tarrytown

  • Event location

    Tarrytown, USA

  • Event date

    Jul 6, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article