Initial Release of myND Planner

Today, I can proudly announce the initial release of the myND planner for fully and partially observable nondeterministic planning tasks.

The code as well as some rudimentary documentation in the form of a wiki can be found at Bitbucket.

More technical and detailed descriptions of how the planner works algorithmically can be found in a number of conference publications. They mostly focus on the heuristics used to guide the search, but a brief description of the search algorithm is also given [MOHB10]. The earlier publications [BM08, BM09, MOHB10] deal with fully observable problems, whereas the most recent one [OM13] deals with partial observability. Regarding the heuristics used to guide the search, one publication [BM08] is about a delete-relaxation approach, whereas the others [BM09, MOHB10, OM13] use abstraction heuristics.



Pascal Bercher, Robert Mattmüller: A Planning Graph Heuristic for Forward-Chaining Adversarial Planning. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 921–922, 2008.


Pascal Bercher, Robert Mattmüller: Solving Non-deterministic Planning Problems with Pattern Database Heuristics. In: Proceedings of the 32nd Annual Conference on Artificial Intelligence (KI 2009), pp. 57–64, 2009.


Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher: Pattern Database Heuristics for Fully Observable Nondeterministic Planning. In: Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 105–112, 2010.


Manuela Ortlieb, Robert Mattmüller: Pattern-Database Heuristics for Partially Observable Nondeterministic Planning. In: Proceedings of the 36th German Conference on Artificial Intelligence (KI 2013), pp. 140–151, 2013.