ACM Home Page
Please provide us with feedback. Feedback
CASO: a framework for dealing with objectives in a constraint-based extension to AgentSpeak(L)
Full text PdfPdf (189 KB)
Source ACM International Conference Proceeding Series; Vol. 171 archive
Proceedings of the 29th Australasian Computer Science Conference - Volume 48 table of contents
Hobart, Australia
Pages: 121 - 126  
Year of Publication: 2006
ISBN ~ ISSN:1445-1336 , 1-920682-30-9
Authors
Aniruddha Dasgupta  Decision Systems Lab, School of IT and Computer Science, University of Wollongong, Wollongong, NSW
Aditya K. Ghose  Decision Systems Lab, School of IT and Computer Science, University of Wollongong, Wollongong, NSW
Publisher
Australian Computer Society, Inc.  Darlinghurst, Australia, Australia
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Incorporating constraints into a reactive BDI agent programming language can lead to better expressive capabilities as well as more efficient computation (in some instances). More interestingly, the use of constraint-based representations can make it possible to deal with explicit agent objectives (as distinct from agent goals) that express the things that an agent may seek to optimize at any given point in time. In this paper we extend the preliminary work of Ooi et.al in augmenting the popular Belief-Desire-Intention (BDI) language AgentSpeak(L) with constraint-handling capabilities. We present a slightly modified version of their proposal, in the form of the language CAS (Constraint AgentSpeak). We then extend CAS to form the language CASO (Constraint AgentSpeak with Objectives) to incorporate explicit objectives (represented as objective functions) and present techniques for performing option selection (selecting the best plan to use to deal with the current event) as well as intention selection. In both cases, we present parametric look-ahead techniques, i.e., techniques where the extent of look-ahead style deliberation can be adjusted.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Jaffar, J. & Maher, M.J. (1994), Constraint logic programming: A survey., in 'Journal of Logic Programming' pp. 503-581
 
3
Kinny, D. & Georgeff, M. (1997), Modeling and design of multi-agent systems, Intelligent Agents III, Lecture Notes in Artificial Intelligence Springer, Berlin.
 
4
Morley., D. (1996), Semantics of BDI agents and their environment., in 'Tech. Rep. 74, Australian Artificial. Intelligent Institute, Melbourne'.
 
5
 
6
Rao, A.S. & Georgeff, M. (1995), BDI Agents: from theory to practice., in 'Proceedings of First International Conference on Multi-Agent Systems', ICMAS-95, pp 312-319, San Francisco, CA.
7
8
 
9
 
10
 
11
 
12
Thangarajah, J., Padhgam, L. & Winikoff, M. (2003), Detecting and Avoiding Interference Between Goals in Intelligent Agents, in 'Proceedings of the 18th International Joint Conference on Artificial Intelligence', IJCAI 2003, pp. 721-726, Acapulco, Maxcio.
 
13
Thangarajah, J. (2004), Managing the Concurrent Execution of Goals in Intelligent Agents, Ph.D., RMIT, Australia.
 
14
Chalmers, S. & Gray, P.M.D. (2001), BDI agents and constraint logic, AISB Journal Special Issue on Agent Technology Vol. 1, pp. 21-40.
 
15
Dasgupta, A. & Ghose, A.K. (2005), Dealing with Objectives in a Constraint-Based Extension to AgentSpeak(L), in 'Eighth Pacific Rim Workshop on Multi-Agent Systems', PRIMA 2005.


Collaborative Colleagues:
Aniruddha Dasgupta: colleagues
Aditya K. Ghose: colleagues