Abstract
In this paper we discuss the “safe to act” problem, a problem associated with the safe interleaving of acting and planning. We also discuss previous research that is relevant to this problem. We then propose a specific search strategy for a general hierarchical plan-space planner that pushes portions of the emerging plan to become “execution ready” as quickly as possible. Finally, we discuss a property, critical serialisability, that is sufficient for a domain to possess in order for these portions to be “safely” executed.
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
Robocup-rescue official web page, http://www.rescuesystem.org/robocuprescue/
Muscettola, N., Rajan, K., Jonsson, A., Morris, P., Smith, B.: Planning in interplanetary space: Theory and practice. In: Proceedings of the 5th AIPS, Breckenridge, CO (2000)
Bacchus, F., Yang, Q.: The downward refinement property. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI, Sydney, Australia, pp. 286–292 (1991)
Chien, S., Rabideau, G., Knight, R., Sherwood, R., Engelhardt, B., Muts, D., Estlin, T., Smith, B., Fisher, F., Barrett, T., Stebbins, G., Tran, D.: Aspen – automating space mission operations using automated planning and scheduling, operations. In: International Conference on Space Operations (SpaceOps 2000), Toulouse, France, June 2000. European Space Agency (2000)
Christensen, J.: Automatic Abstraction in Planning. PhD thesis, Department of Computer Science, Stanford University (1991)
Tenenberg, J.D., Knoblock, C.A., Yang, Q.: Characterizing abstraction hierarchies for planning. In: Proceedings of the Ninth International Conference on Artificial Intelligence, Anaheim, CA, pp. 692–697. AAAI, Menlo Park (1991)
Fink, E., Yang, Q.: Automatically abstracting the effects of operators. In: Hendler, J. (ed.) Artificial Intelligence Planning Systems: Proceedings of the First International Conference (AIPS 1992), San Mateo, CA, pp. 243–251. Morgan Kaufmann, San Francisco (1992)
Hookway, R.J., Oyen, R.A., Ernst, G.W., Banerji, R.B., Shaffer, D.E.: Mechanical discovery of certain heuristics. Technical Report 1136-A, Case Western Reserve University, Cleveland, OH (January 1974)
Knoblock, C.A.: Automatically Generating Abstractions for Problem Solving. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1991)
Knoblock, C.A.: Why plan generation and plan execution are inseparable. In: Proceedings of the AAAI Fall Symposium on Plan Execution, Cambridge, MA (1996)
Korf, R.E.: Planning as search: A quantitative approach. Artificial Intelligence 33, 65–88 (1987)
Melis, E., Siekmann, J.H.: Knowledge-based proof planning. Articial Intelligence 115(1) (1999)
Newell, A., Simon, H.A.: Human Problem Solving. Prentice-Hall, Englewood Cliffs (1972)
Porteous, J., Sebastia, L.: Extracting landmarks and ordering them for planning. In: Arabnia, H.R. (ed.) Proceedings of the International Conference on Artificial Intelligence, ICAI, Las Vegas, NV (2001)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)
Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces 5(2), 115–135 (1974)
Yang, Q., Tenenberg, J.D.: Abtweak: Abstracting a nonlinear, least commitment planner. In: Proceedings of the Eighth National Conference on Artificial Intelligence, Boston MA, pp. 204–209. AAAI, Menlo Park (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleveland, G., Barley, M. (2005). An Approach to Safe Continuous Planning. In: Barley, M.W., Kasabov, N. (eds) Intelligent Agents and Multi-Agent Systems. PRIMA 2004. Lecture Notes in Computer Science(), vol 3371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32128-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-32128-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25340-2
Online ISBN: 978-3-540-32128-6
eBook Packages: Computer ScienceComputer Science (R0)