Best Newcomer at the 3rd International Planning Competition.
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990's on flaw selection strategies for POCL planning, and combines this with more recent developments in the field of domain independent planning such as distance based heuristics and reachability analysis. VHPOP also supports planning with durative actions by incorporating standard techniques for temporal constraint reasoning.
Read the anecdotal story about the development of the planner leading up the 3rd International Planning Competition.
Main features:
VHPOP is written in C++, and has been reported to compile on the following systems:
Source code: GZIP (version 2.2; March 1, 2003)
Beta: GZIP (version 3.0; October 7, 2005)
A rewrite of the code is in the works and that project is hosted by Google Code.
Håkan L. S. Younes and Reid G. Simmons. 2003. VHPOP: Versatile heuristic partial order planner. Journal of Artificial Intelligence Research 20: 405–430.
Håkan L. S. Younes and Reid G. Simmons. 2002. On the role of ground actions in refinement planning. In Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling Systems, edited by Malik Ghallab, Joachim Hertzberg, and Paolo Traverso, 54–61, Toulouse, France. AAAI Press.
| Håkan L. S. Younes |
|
|
| Last modified: Thu Jul 12 12:59:11 EDT 2007 |