We put forward a brand new approach to planning. The method aims at simplifying the task of planning in an abstract object oriented domain where entities are added only and never removed. Our approach is based on the synthesis of a family of all sets of actions that cannot be composed into a plan (called none-plans) in order to prune the state space searched for plans. We show how to build a propositional formula describing a set of the none-plans and how to approximate this set when the task of planning becomes too complex. A preliminary evaluation of the application of the none-plans synthesis to the generation of plans in the PlanICS framework is shown. The experimental results show a high potential of the approach.
CITATION STYLE
Knapik, M., Niewiadomski, A., & Penczek, W. (2015). Generating None-Plans in order to find plans. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9276, pp. 310–324). Springer Verlag. https://doi.org/10.1007/978-3-319-22969-0_22
Mendeley helps you to discover research relevant for your work.