Abstract
We present an algorithm for replanning in a reactive agent architecture which incorporates decision-theoretic notions to drive the planning and metadeliberation process. The deliberation component relies on a refinement planner which produces plans with optimal expected utility. The replanning algorithm we propose exploits the planner’s ability to provide an approximate evaluation of partial plans: it starts from a fully refined plan and makes it more partial until it finds a more partial plan which subsumes more promising refinements; at that point, the planning process is restarted from the current partial plan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. E. Bratman, D. J. Israel, and M. E. Pollack. Plans and resource-bounded practical reasoning. Computational Intelligence, 4:349–355, 1988.
Vu Ha and Peter Haddawy. Theoretical foundations for abstraction-based probabilistic planning. In 12th Conf. on Uncertainty in Artificial Intelligence, pages 291–298, Portland, 1996.
P. Haddawy and S. Hanks. Utility models for goal-directed, decision-theoretic planners. Computational Intelligence, 14:392–429, 1998.
P. Haddawy and M. Suwandi. Decision-theoretic refinement planning using inheritance abstraction. In Proc. of 2nd AIPS Int. Conf., pages 266–271, Menlo Park, CA, 1994.
Steve Hanks and Daniel S. Weld. Adomain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research, 2:319–360, 1995.
B. Nebel and J. Koehler. Plan modification versus plan generation:A complexity-theoretic perspective. In Proceedings of of the 13th International Joint Conference on Artificial Intelligence, pages 1436–1441, Chambery, France, 1993.
A. Rao and M. P. Georgeff. Modeling rational agents within a BDI-architecture. In Proc. 2th Int. Conf. Principles of Knowledge Representation and Reasoning (KR:91), pages 473–484, Cambridge, MA, 1991.
E. D. Sacerdoti. A Structure for Plans and Behavior. American Elsevier, NewYork, 1977.
Mike Wooldridge and Simon Parsons. Intention reconsideration reconsidered. In Jörg Müller, Munindar P. Singh, and Anand S. Rao, editors, Proc. of ATAL-98), volume 1555, pages 63–80. Springer-Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boella, G., Damiano, R. (2002). A Replanning Algorithm for a Reactive Agent Architecture. In: Scott, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2002. Lecture Notes in Computer Science(), vol 2443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46148-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-46148-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44127-4
Online ISBN: 978-3-540-46148-7
eBook Packages: Springer Book Archive