Abstract
Constraint Satisfaction techniques have been recognized to be effective tools for increasing the efficiency of least commitment planners. We focus on least commitment on variable binding. A constraint based approach for this issue has been previously proposed by Yang and Chan [21]. In this setting, the planning problem is mapped onto a Constraint Satisfaction Problem. Its variables represent domain objects and are defined on a finite domain of values; constraints remove inconsistent values from variable domains through constraint propagation. In many applications, however, it is not always convenient, if possible at all, to know in advance all objects belonging to variable domains. Thus, domain values should be retrieved during the plan construction only when needed. The interesting point is that data acquisition for each variable can be guided by the constraint (or the constraints) imposed on the variable itself, in order to retrieve only consistent values. For this purpose, we have extended a Partial Order Planner performing least commitment on variable binding. This extension can cope with incomplete knowledge. We use the Interactive Constraint Satisfaction framework defined in [12] in order to exploit the efficiency deriving from constraint propagation and the possibility of acquiring the domain knowledge during the plan construction. Experimental results and comparisons with related approaches show the effectiveness of the proposed technique.
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
Ashish, N., Knoblock, C.A., Levy, A.: Information gathering plans with sensing actions. In: Proceedings of the 4th European Conference on Planning (1997)
Cucchiara, R., Gavanelli, M., Lamma, E., Mello, P., Milano, M., Piccardi, M.: Extending CLP(FD) with interactive data acquisition for 3d visual object recognition. In: Proceedings of PACLP 1999, pp. 137–155 (1999)
ECRC. ECLiPSe User Manual Release 3.3 (1992)
Etzioni, O., Levy, H., Segal, R., Thekkath, C.: Os agents: Using ai techniques in the operating system environment. Technical report, University of Washington (1993)
Golden, K.: Planning and Knowledge Representation for Softbots. PhD thesis, University of Washington (1997)
Golden, K., Etzioni, O., Weld, D.: Xii: Planning with universal quantification and incomplete information. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, KR 1994 (1994)
Golden, K., Weld, D.: Representing sensing actions: The middle ground revisited. In: Proceedings of 5th Int. Conf. on Knowledge Representation and Reasoning (1996)
Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)
Joslin, D.: Passive and Active Decision Postponement in Plan Generation. PhD thesis, University of Pittsburgh (1996)
Kambhampati, S.: Using disjunctive orderings instead of conflict resolution in partial order planning. Technical report, Department of Computer Science and Engineering Arizona State University (1996)
Kwock, C.T., Weld, D.S.: Planning to gather information. Technical report, Department of Computer Science and Engineering University of Washington (1996)
Lamma, E., Milano, M., Mello, P., Cucchiara, R., Gavanelli, M., Piccardi, M.: Constraint propagation and value acquisition: why we should do it interactively. In: Proceedings of the IJCAI (1999) (to appear)
Lever, J., Richards, B.: parcplan: a planning architecture with parallel actions, resources and constraints. In: Proceedings of 8th ISMIS (1994)
McAllester, D., Rosenblitt, D.: Systematic nonlinear planning. In: Proceedings of the 9th National Conference on AI, Anaheim, CA (1991)
Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proceedings of AAAI 1990 (1990)
Olawsky, D., Gini, M.: Deferred planning and sensor use. In: Proceedings DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (1990)
Pryor, E., Collins, P.: Planning for contingencies: A decision-based approach. Journal of Artificial Intelligence Research 4, 287–339 (1996)
Tate, A., Drabble, B., Dalton, J.: Reasoning with constraints within o-plan2. Technical report, AI Applications Institute Univeristy of Edinburgh (1994)
Weld, D.S.: An introduction to least commitment planning. AI Magazine 15, 27–61 (1994)
Yang, Q.: A theory of conflict resolution in planning. Artificial Intelligence 58, 361–392 (1992)
Yang, Q., Chan, A.Y.M.: Delaying variable binding commitments in planning. In: The 2nd International Conference on AI Planning Systems, AIPS (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., Lamma, E., Mello, P., Milano, M. (2000). Least Commitment on Variable Binding in Presence of Incomplete Knowledge. In: Biundo, S., Fox, M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science(), vol 1809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720246_13
Download citation
DOI: https://doi.org/10.1007/10720246_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67866-3
Online ISBN: 978-3-540-44657-6
eBook Packages: Springer Book Archive