SCClassicalPlanning 0.1.0

SCClassicalPlanning

Basic but fully functional and documented classical planning implementations. Somewhat influenced by chapter 10 of Artificial Intelligence: A Modern Approach (3rd Edition - ISBN 978-1292153964). Intended first and foremost to assist with learning and experimentation, but will (by the time v1 arrives) include extension points (and async support) so that it is at least conceivable that it could be (extended to be) useful in a production scenario. Includes:

• A model for planning problems that consists of Problem, Domain, State, Goal, Action, and Effect. Note that while this is a significantly smaller model than that capable of being expressed with even the earliest versions of PDDL, it does go further than chapter 10 of AIaMA - partly out of necessity (to create a coherent set of functionality), and partly to (partially!) "bridge the gap" between the rough ideas in this chapter and real, production-ready planners. It is perhaps worth noting that I do feel chapter 10 is one of the weaker chapters of the source material, simply because of the need to add quite a lot to it to create something coherent.
• A few basic planner implementations. One that uses forward state space search, one that uses backward state space search, and one that uses graphplan (NB: GraphPlan not there just yet - will appear prior to v1).

As mentioned above, the main goal here is for it to be a resource for learning and experimentation. As such, care has been taken to include good type and member documentation, as well as Source Link to allow for debugging - and explanatory inline comments in the source code where appropriate.

Full documentation can be found via the SCClassicalPlanning repository readme.