AAAI Publications, Twenty-Fifth International FLAIRS Conference

Font Size: 
When Planning Should Be Easy: On Solving Cumulative Planning Problems
Roman Bartak, Filip Dvorak, Jakub Gemrot, Cyril Brom, Daniel Toropila

Last modified: 2012-05-16


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. We propose 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.


planning algorithms; delete-relaxed planning; games

Full Text: PDF