Pyperplan - A Python STRIPS planner

[Jendrik Seipp]

There's a new kid on the block of automatic planners: Pyperplan.

It has been developed by a group of students from the University of Freiburg under the supervision of Malte Helmert and Robert Mattmï¿œller.
The planner is licensed under the terms of the GNU General Public License 3 and you can find the code at https://bitbucket.org/malte/pyperplan.

Pyperplan isn't as fast as other planners, because it's written in Python, but it has many of the advanced features also found in other recent planners. The code is both easy to read and well documented, making Pyperplan well suited for teaching planning algorithms. Our planner supports STRIPS without action costs and includes many different search algorithms and heuristics:

Search algorithms:

• Breadth-first search
• Enforced hill-climbing search
• (Weighted) A* search
• Greedy best-first search
• Iterative deepening search
• SAT planner
  

Heuristics:

• Blind
• hAdd
  
• Set-additive
• hMax
• Landmark-cut heuristic
• Landmark heuristic
  
• FF/additive heuristic

The planner can easily be extended and modified, so it can serve as a testbed for the prototyping and development of new algorithms. Pyperplan will automatically validate your plans if you have VAL installed and it comes with a massive test-suite currently consisting of 358 tests.

The original authors are (in alphabetical order):

• Yusra Alkhazraji
• Matthias Frorath
• Markus Grï¿œtzner
• Thomas Liebetraut
• Manuela Ortlieb
• Jendrik Seipp
• Tobias Springenberg
• Philip Stahl
• Jan Wï¿œlfing

Cheers,
Jendrik