ACM Home Page
Please provide us with feedback. Feedback
Decommitting in multi-agent execution in non-deterministic environment: experimental approach
Full text PdfPdf (690 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 977-984  
Year of Publication: 2009
ISBN:978-0-9817381-7-8
Authors
Jiří Vokřínek  Czech Technical University in Prague
Antonín Komenda  Czech Technical University in Prague
Michal Pěchouček  Czech Technical University in Prague
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): 7,   Downloads (12 Months): 26,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in the environment. Reasoning about decommitment alternatives during the planning process contributes to flexibility and robustness of the resulting plan. In this article we formally introduce and discuss three specific decommitment rules: (i) relaxation, (ii) delegation and (iii) full decommitment. We argue that appropriate selection, setting and preference ordering of the decommitment rules contributes to robustness (measured as a number of failures) of the overall plans. The presented claims are supported by empirical experiments.


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
C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11:1--94, 1999.
 
3
 
4
 
5
H. Levesque, P. Cohen, and J. Nunes. On acting together. In AAAI-90 Proceedings, Eighth National Conference on Artificial Intelligence, volume 2, pages 94--99, Cambridge, MA, USA, 1990. MIT Press.
 
6
S. M. Majercik and M. L. Littman. MAXPLAN: A new approach to probabilistic planning. In Artificial Intelligence Planning Systems, pages 86--93, 1998.
 
7
A. Mallya, P. Yolum, and M. Singh. Resolving commitments among autonomous agents. In F. Dignum, editor, Advances in Agent Communication. International Workshop on Agent Communication Languages, ACL 2003, volume 2922 of LNCS, pages 166--82. Springer-Verlag, Berlin, Germany, 2003.
 
8
D. J. Musliner, E. H. Durfee, and K. G. Shin. CIRCA: A cooperative intelligent real time control architecture. IEEE Transactions on Systems, Man, and Cybernetics, 23(6):1561--1574, -- 1993.
 
9
 
10
 
11
M. Veloso and P. Stone. Flecs: Planning with a flexible commitment strategy. Journal of Artificial Intelligence Research, 3:25--52, 1995.
 
12
M. Wooldridge. Reasoning about Rational Agents. Intelligent robotics and autonomous agents. The MIT Press, 2000.
 
13
M. Wooldridge and N. Jennings. Cooperative problem solving. Journal of Logics and Computation, 9(4):563--594, 1999.
 
14


Collaborative Colleagues:
Jiří Vokřínek: colleagues
Antonín Komenda: colleagues
Michal Pěchouček: colleagues