Abstract
Partially ordered plans have several useful properties, such as exhibiting the structure of the plan more clearly which facilitates post-plan generation tasks like scheduling the plan, explaining it to a user, or breaking it into subplans for distributed execution. The standard interpretation of partial ordering implies that whenever two subplans are unordered, every interleaving of steps from the two forms a valid execution. This restricts deordering to cases where individual steps (i.e., actions) are independent. We propose a weaker notion of partial ordering that divides the plan into blocks, such that the steps in a block may not be interleaved with steps outside the block, but unordered blocks can be executed in any sequence. We present an algorithm to find such deorderable blocks, and show that it enables deordering plans in many cases where no deordering is possible under the standard interpretation.
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
Preview
Unable to display preview. Download preview PDF.
References
Bäckström, C.: Computational aspects of reordering plans. Journal of AI Research 9, 99–137 (1998)
Policella, N., Smith, S., Cesta, A., Oddi, A.: Generating robust schedules through temporal flexibility. In: Proc. 14th International Conference on Automated Planning & Scheduling (ICAPS 2004), pp. 209–218 (2004)
Cox, J., Durfee, E., Bartold, T.: A distributed framework for solving the multiagent plan coordination problem. In: Proc. 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), pp. 821–827 (2005)
Chrpa, L., McCluskey, T., Osborne, H.: Optimizing plans through analysis of action dependencies and independencies. In: Proc. 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012 (2012)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers (2004) ISBN: 1-55860-856-7
Chapman, D.: Planning for conjunctive goals. Artificial Intelligence 32, 333–377 (1987)
McAllester, D., Rosenblitt, D.: Systematic nonlinear planning. In: Proc. 9th National Conference on Artificial Intelligence (1991)
Pednault, E.: Formulating multiagent, dynamic-world problems in the classical planning framework. In: Reasoning about Actions and Plans (1986)
Regnier, P., Fade, B.: Complete Determination of Parallel Actions and Temporal Optimization in Linear Plans of Action. In: Hertzberg, J. (ed.) EWSP 1991. LNCS, vol. 522, pp. 100–111. Springer, Heidelberg (1991)
Veloso, M.M., Pérez, M.A., Carbonell, J.G.: Nonlinear planning with parallel resource allocation. In: Workshop on Innovative Approaches to Planning, Scheduling and Control, pp. 207–212. Morgan Kaufmann (1990)
Kambhampati, S., Kedar, S.: A unified framework for explanation-based generalization of partially ordered and partially instantiated plans. Artificial Intelligence 67(1), 29–70 (1994)
Winner, E., Veloso, M.: Analyzing plans with conditional effects. In: Proc. 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 23–33 (2002)
Muise, C., McIlratih, S., Beck, J.: Optimally relaxing partial-order plans with MaxSAT. In: Proc. 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012 (2012)
Chrpa, L., Barták, R.: Towards getting domain knowledge: Plans analysis through investigation of actions dependencies. In: Proc. 21st International Florida AI Research Society Conference (FLAIRS 2008), pp. 531–536. AAAI Press (2008) ISBN 978-1-57735-365-2
Haslum, P., Jonsson, P.: Planning with reduced operator sets. In: Proc. 5:th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), pp. 150–158 (2000)
Nguyen, X., Kambhampati, S.: Reviving partial order planning. In: Proc. 17th International Conference on Artificial Intelligence, IJCAI 2001 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Siddiqui, F.H., Haslum, P. (2012). Block-Structured Plan Deordering. In: Thielscher, M., Zhang, D. (eds) AI 2012: Advances in Artificial Intelligence. AI 2012. Lecture Notes in Computer Science(), vol 7691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35101-3_68
Download citation
DOI: https://doi.org/10.1007/978-3-642-35101-3_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35100-6
Online ISBN: 978-3-642-35101-3
eBook Packages: Computer ScienceComputer Science (R0)