Home >
Automated Planning > Toolkits and Software
 |
PathFinder2D - classical planning software
PathFinder2D is an open-source c++ experiment in various 2D shortest-path algorithms and techniques, including A* Heap, Integer, No Closed
A* Heap, Integer, A* Heap, A* Complete, A* Linked-list, A* Array, Dijkstra, Breadth-First Search and DFS.
http://www.intrafoundation.com/products.php?productcode=PathFinder2D
|
|
 |
PL-PLAN, an AI planner
PL-PLAN is a Java open-source AI planner. It proposes many algorithms for classical states-space exploration, including the Graphplan algorithm, and six other algorithms based on partial-order theory.
http://philippe-fournier-viger.com/plplan.html
|
|
 |
Simple Hierarchical Ordered Planner
This is the home page for the SHOP, JSHOP, SHOP2, and JSHOP2. This planner use domain specific information to prune search paths.
http://www.cs.umd.edu/projects/shop/
|
|
 |
The Graphplan Planner
Graphplan is a general-purpose planner for STRIPS-style domains, based on ideas used in graph algorithms.
http://www.cs.cmu.edu/afs/cs.cmu.edu/usr/avrim/www/graphplan.html
|
|
 |
The TLPLAN AI planner
TLPlan is a planning system that utilizes domain specific search control information to control simple forward chaining search.
http://www.cs.toronto.edu/~fbacchus/tlplan.html
|
|
|