A Replanning Algorithm for a Reactive Agent Architecture

Authors:
Guido Boella;Rossana Damiano
Affiliations:
-;-
Venue:
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Year:
2002

Citing 3
Cited 1

Intention Reconsideration Reconsidered

ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
A domain-independent algorithm for plan adaptation

Journal of Artificial Intelligence Research
Theoretical foundations for abstraction-based probabilistic planning

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Graph-based multiagent replanning algorithm

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an algorithm for replanning in a reactive agent architecture which incorporates decision-theoretic notions to drive the planning and meta-deliberation 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.