Abstract
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.
This work has been partly supported by the National Science Centre under the grant No. 011/01/B/ST6/01477. Michał Knapik is supported by DEC-2012/07/N/ST6/03426 NCN Preludium 4 grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Pessimistic complexity is still prohibitive.
References
Cook, D.R.: The SMT-LIBv2 language and tools: a tutorial (2012). http://www.grammatech.com/resource/smt/SMTLIBTutorial.pdf
Doliwa, D., et al.: PlanICS - a web service compositon toolset. Fundamenta Informaticae 112(1), 47–71 (2011)
Gerevini, A.E., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intel. 173(5), 619–668 (2009)
Goldman, R.P., Musliner, D.J., Krebsbach, K.D., Boddy, M.S.: Dynamic abstraction planning. In: AAAI/IAAI, pp. 680–686 (1997)
Gómez, J.V., Lumbier, A., Garrido, S., Moreno, L.: Planning robot formations with fast marching square including uncertainty conditions. Robot. Auton. Syst. 61(2), 137–152 (2013)
Knapik, M.: SpaceCut - a tool for none-plan generation (2015). https://github.com/MichalKnapik/SpaceCut
Knapik, M., Penczek, W.: Bounded model checking for parametric timed automata. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency V. LNCS, vol. 6900, pp. 141–159. Springer, Heidelberg (2012)
Knapik, M., Penczek, W.: SMT-based parameter synthesis for L/U automata. In: Proceedings of International Workshop on Petri Nets and Software Engineering (PNSE 2012), pp. 77–92 (2012)
Li, Z., O’Brien, L., Keung, J., Xu, X.: Effort-oriented classification matrix of web service composition. In Proceedings of the Fifth International Conference on Internet and Web Applications and Services, pp. 357–362 (2010)
Niewiadomski, A., Penczek, W.: Towards SMT-based abstract planning in PlanICS ontology. In: Proceedings of International Conference on Knowledge Engineering and Ontology Development (KEOD), pp. 123–131 (2013)
Niewiadomski, A., Penczek, W.: SMT-based abstract temporal planning. In: Proceedings of International Workshop on Petri Nets and Software Engineering, pp. 55–74 (2014)
Nourbakhsh, I.: Using abstraction to interleave planning and execution. In: Proceedings of the Third Biannual World Automation Congress, vol. 2 (1998)
Rao, J., Su, X.: A survey of automated web service composition methods. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43–54. Springer, Heidelberg (2005)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall Press, Upper Saddle River (2009)
Skaruz, J., Niewiadomski, A., Penczek, W.: Evolutionary algorithms for abstract planning. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2013, Part I. LNCS, vol. 8384, pp. 392–401. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Knapik, M., Niewiadomski, A., Penczek, W. (2015). Generating None-Plans in Order to Find Plans. In: Calinescu, R., Rumpe, B. (eds) Software Engineering and Formal Methods. SEFM 2015. Lecture Notes in Computer Science(), vol 9276. Springer, Cham. https://doi.org/10.1007/978-3-319-22969-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-22969-0_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22968-3
Online ISBN: 978-3-319-22969-0
eBook Packages: Computer ScienceComputer Science (R0)