Theory for coordinating concurrent hierarchical planning agents using summary information
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Detecting & exploiting positive goal interaction in intelligent agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Theoretical and experimental results on the goal-plan tree problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Detecting & avoiding interference between goals in intelligent agents
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Towards alternative approaches to reasoning about goals
DALT'07 Proceedings of the 5th international conference on Declarative agent languages and technologies V
| Hi-index | 0.00 |
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is most naturally represented by a structure that has been called a Goal-Plan Tree. One of the uses of such structure is in agent deliberation (in particular, deciding whether to commit to achieving a certain goal or not). In previous work, a Petri net based approach for reasoning about goal-plan trees was defined. This paper presents a constraint-based approach to perform the same reasoning, which is then compared with the Petri net approach.