When Planning Should Be Easy: On Solving Cumulative Planning Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10129828" target="_blank" >RIV/00216208:11320/12:10129828 - isvavai.cz</a>
Result on the web
<a href="http://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS12/paper/view/4458/4836" target="_blank" >http://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS12/paper/view/4458/4836</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
When Planning Should Be Easy: On Solving Cumulative Planning Problems
Original language description
This paper deals with planning domains that appear in computer games, especially when modeling intelligent virtual agents. Some of these domains contain only actions with no negative effects and are thus treated as easy from the planning perspective. Wepropose two new techniques to solve the problems in these planning domains, a heuristic search algorithm ANA* and a constraint based planner RelaxPlan, and we compare them with the state of the art planners, that were successful in IPC, using planning domains motivated by computer games.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2012)
ISBN
978-1-57735-558-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
405-410
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Marco Island, USA
Event date
May 23, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)