ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Reasoning intra-dependency in commitments for robust scheduling
Full text PdfPdf (271 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents
Budapest, Hungary
SESSION: Commitments/logical approaches table of contents
Pages: 953-960  
Year of Publication: 2009
ISBN:978-0-9817381-7-8
Authors
Mingzhong Wang  The University of Melbourne, Victoria, Australia
Kotagiri Ramamohanarao  The University of Melbourne, Victoria, Australia
Jinjun Chen  Swinburne University of Technology, Victoria, Australia
Sponsors
: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd
Publisher
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considering the active role of agents in them. Therefore, in this paper we propose to augment agents with the ability of reasoning about and manipulating their commitments to maximize the system utility. We adopt a bottom-up approach by first investigating the intra-dependency between each commitment's preconditions and result which leads to a novel classification of commitments as well as a formalism to express various types of complex commitment. Within this framework, we provide a set of inference rules to benefit an agent by means of commitment refactoring which enables composition and/or decomposition of its commitments to optimize runtime performance. We also discuss the pros and cons of an agent scheduling and executing its commitments in parallel. We propose a reasoning strategy and an algorithm to minimize possible loss when the commitment is broken and maximize the overall system robustness and performance. Experiments show that concurrent schedules based on the features of commitments can boost the system performance significantly.


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
 
3
M. Dastani, M. B. van Riemsdijk, and J.-J. C. Meyer. Programming multi-agent systems in 3apl. In Multi-Agent Programming, pages 39--67. 2005.
 
4
 
5
6
 
7
B. Gaudou, A. Herzig, and D. Longin. Grounding and the expression of belief. In KR, pages 221--229, 2006.
 
8
N. R. Jennings. Commitments and conventions: The foundation of coordination in multi-agent systems. The Knowledge Engineering Review, 8(3):223--250, 1993.
 
9
 
10
J. J. E. Kelley. Critical-path planning and scheduling: Mathematical basis. Operations Research, 9(3):296--320, 1961.
11
 
12
 
13
 
14
 
15
 
16
Project Scheduling Problem Library - PSPLIB. http://129.187.106.231/psplib/, last visited 28 September 2008.
 
17
 
18
 
19
 
20
J. Thangarajah, L. Padgham, and M. Winikoff. Detecting&avoiding interference between goals in intelligent agents. In IJCAI, pages 721--726, 2003.
21
 
22
D. N. Walton and E. C. Krabbe. Commitment in Dialogue: Basic Concepts of Interpersonal Reasoning. State University of New-York Press, NY, 1995.
23
 
24

Collaborative Colleagues:
Mingzhong Wang: colleagues
Kotagiri Ramamohanarao: colleagues
Jinjun Chen: colleagues