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”

Admissible Landmark Heuristic for Multi-Agent Planning

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00234492" target="_blank" >RIV/68407700:21230/15:00234492 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Admissible Landmark Heuristic for Multi-Agent Planning

  • Original language description

    Heuristics are a crucial component in modem planning systems. In optimal multiagent planning the state of the art is to compute the heuristic locally using only information available to a single agent. This approach has a major deficiency as the local shortest path can arbitrarily underestimate the true shortest path cost in the global problem. As a solution, we propose a distributed version of a state-of-the-art LM-Cut heuristic. We show that our distributed algorithm provides estimates provably equalto estimates of the centralized version computed on the global problem. We also evaluate the algorithm experimentally and show that on a number of domains, the distributed algorithm can significantly improve performance of a multiagent planner. Copyright2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA13-22125S" target="_blank" >GA13-22125S: Deterministic Domain-independent Multi-agent Planning</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • 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 25th International Conference on Automated Planning and Scheduling 2015

  • ISBN

    978-1-57735-731-5

  • ISSN

    2334-0835

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    211-219

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park, California

  • Event location

    Jerusalem

  • Event date

    Jun 7, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article