Detecting & exploiting positive goal interaction in intelligent agents
- 14 July 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 401-408
- https://doi.org/10.1145/860575.860640
Abstract
Rational agents typically pursue multiple goals in parallel. However most existing agent systems do not have any infrastructure support for reasoning about either positive or negative interactions between goals. Negative interactions include such things as competition for resources, which if unrecognised can lead to unnecessary failure of both goals requiring the resource. Positive interactions include situations where there is potentially a common subgoal of two goals. This paper looks at mechanisms for identifying potential common subgoals, and attempting to schedule the actions of the agent to take advantage of this. Potential common subgoals are identified by maintaining summaries of definite and potential effects of goals and plans to achieve those goals. Template summaries for goal types are produced at compile time, while instance summaries are maintained and updated at execution time to allow the agent to choose and schedule its plans to take advantage of potential commonality where possible. This increases the ability of the agent to act in a rational manner, where rational is loosely defined as the sensible behaviour exhibited by humans.Keywords
This publication has 8 references indexed in Scilit:
- Evaluating new options in the context of existing plansArtificial Intelligence, 2001
- Top-down search for coordinating the hierarchical plans of multiple agentsPublished by Association for Computing Machinery (ACM) ,1999
- JAMPublished by Association for Computing Machinery (ACM) ,1999
- An architecture for real-time reasoning and system controlIEEE Expert, 1992
- Theory and algorithms for plan mergingArtificial Intelligence, 1992
- Overloading Intentions for Efficient Practical ReasoningNoûs, 1991
- Distributed deadlock detection algorithmACM Transactions on Database Systems, 1982
- Prevention of system deadlocksCommunications of the ACM, 1969