Comparison of RPG-based FF and DTG-based FF Disrtibuted Heuristics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00234478" target="_blank" >RIV/68407700:21230/15:00234478 - isvavai.cz</a>
Result on the web
<a href="http://www.cs.bgu.ac.il/~icaps15/workshops/dmap2015-proceedings.pdf" target="_blank" >http://www.cs.bgu.ac.il/~icaps15/workshops/dmap2015-proceedings.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of RPG-based FF and DTG-based FF Disrtibuted Heuristics
Original language description
Distributed computation of heuristic functions has recently become a hot topic in multiagent planning. One of the classical heuristics most often adapted for distribution is the FF heuristic. In this paper we compare two approaches used to distribute theFF heuristic, which were previously incomparable, as each was implemented in a different planning scheme, a greedy best-first search and a forward-chaining partial order planner.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored 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ů