Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
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
Clement, B.J., Durfee, E.H.: Identifying and resolving conflicts among agents with hierarchical plans. In: Proceedings of AAAI Workshop on Negotiation: Settling Conflicts and Identifying Opportunities, Technical Report WS-99-12, pp. 6–11. AAAI Press, Menlo Park (1999)
Clement, B.J., Durfee, E.H.: Theory for coordinating concurrent hierarchical planning agents using summary information. In: AAAI 1999/IAAI 1999: Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence, pp. 495–502. American Association for Artificial Intelligence, Menlo Park (1999)
Clement, B.J., Durfee, E.H.: Performance of coordinating concurrent hierarchical planning agents using summary information. In: Proceedings of 4th International Conference on Multi-Agent Systems (ICMAS), pp. 373–374. IEEE Computer Society, Boston (2000)
Kummer, O., Wienberg, F., Duvigneau, M.: Renew – the Reference Net Workshop, Release 2.1 (May 2006)
Shaw, P.H., Bordini, R.H.: Towards alternative approaches to reasoning about goals. In: Baldoni, M., Son, T.C., van Riemsdijk, M.B., Winikoff, M. (eds.) DALT 2007. LNCS (LNAI), vol. 4897, pp. 104–121. Springer, Heidelberg (2008)
Shaw, P., Farwer, B., Bordini, R.H.: Theoretical and experimental results on the goal-plan tree problem. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1379–1382 (2008)
Shaw, P.H.: Reasoning about Goal-Plan Trees in Autonomous Agents: Development of Petri net and Constraint-Based Approaches with Resulting Performance Comparisons. PhD thesis, School of Engineering and Computing Sciences, University of Durham, UK (January 2010)
Thangarajah, J., Padgham, L., Winikoff, M.: Detecting and avoiding interference between goals in intelligent agents. In: Proceedings of 18th International Joint Conference on Artificial Intelligence (IJCAI), pp. 721–726. Morgan Kaufmann, Acapulco (2003)
Thangarajah, J., Padgham, L., Winikoff, M.: Detecting and exploiting positive goal interaction in intelligent agents. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 401–408. ACM Press, New York (2003)
Thangarajah, J., Winikoff, M., Padgham, L.: Avoiding resource conflicts in intelligent agents. In: Proceedings of 15th European Conference on Artifical Intelligence (ECAI 2002), IOS Press, Amsterdam (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shaw, P., Bordini, R.H. (2011). An Alternative Approach for Reasoning about the Goal-Plan Tree Problem. In: Dastani, M., El Fallah Seghrouchni, A., Hübner, J., Leite, J. (eds) Languages, Methodologies, and Development Tools for Multi-Agent Systems. LADS 2010. Lecture Notes in Computer Science(), vol 6822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22723-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22723-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22722-6
Online ISBN: 978-3-642-22723-3
eBook Packages: Computer ScienceComputer Science (R0)