Abstract
We propose a planning architecture where the planner and the executor interact with each other in order to face dynamic changes of the application domain. According to the deferred planning strategy proposed in [14], a plan schema is produced off-line by a generative constraint based planner and refined at execution time by retrieving up-to- date information when that available is no longer valid. In this setting, both planning and execution can be seen as search processes in the space of partial plans. We exploit the Interactive Constraint Satisfaction fra- mework [12] which represents an extension of the Constraint Satisfaction paradigm for dealing with incomplete knowledge. Given the uncertainty of the plan execution in dynamic environments, a backup and recovery mechanism is necessary in order to allow backtracking at execution time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Ashish, C.A. Knoblock, and A. Levy. Information gathering plans with sensing actions. In Proceedings of the 4th European Conference on Planning, 1997.
D. Draper, S. Hanks, and D. Weld. Probabilistic planning with information gathering and contingent execution. In Proceedings of AIPS-94, 1994.
ECRC. ECLiPSe User Manual Release 3.3, 1992.
O. Etzioni, H. Levy, R. Segal, and C. Thekkath. Os agents: Using ai techniques in the operating system environment. Technical report, Univ. of Washington, 1993.
K. Golden. Planning and Knowledge Representation for Softbots. PhD thesis, University of Washington, 1997.
K. Golden and D.Weld. Representing sensing actions: The middle ground revisited. In Proceedings of 5th Int. Conf. on Knowledge Representation and Reasoning, 1996.
P.Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
C.A. Knoblock. Planning, executiong, sensing, and replanning for information gathering. In Proc. 14th IJCAI, 1995.
N. Kushmerick, S. Hanks, and D. Weld. An algorithm for probabilistic leastcommitment planning. In Proceedings of AAAI-94, 1994.
C.T. Kwock and D.S. Weld. Planning to gather information. Technical report, Department of Computer Science and Engineering University ofWashington, 1996.
E. Lamma, M. Milano, R. Cucchiara, and P. Mello. An interactive constraint based system for selective attention in visual search. Proceedings of the ISMIS’97, 1997.
E. Lamma, M. Milano, P. Mello, R. Cucchiara, M. Gavanelli, and M. Piccardi. Constraint propagation and value acquisition: why we should do it interactively. Proceedings of the IJCAI, 1999.
S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In Proceedings of AAAI-90, 1990.
D. Olawsky and M. Gini. Deferred planning and sensor use. In Proceedings DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control, 1990.
M. Peot and D. Smith. Conditional nonlinear planning. In J. Hendler, editor, Proc. 1st AIPS, pages 189–197, San Mateo, CA, 1992. Kaufmann.
D.S. Weld. An introduction to least commitment planning. AI Magazine, 15:27–61, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barruffi, R., Milano, M., Torroni, P. (2000). Planning while Executing: A Constraint-Based Approach. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)