Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/47695

Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)

Title

A graph-based multi-agent planning algorithm with QoS guarantees

Author(s)

Zhang, Jian Feng;  Nguyen, Xuan Thang;  Kowalczyk, Ryszard

Abstract

Many existing planning approaches assume the existence of a centralized planner that has complete information of its planning problem. However, with the increasing popularity of distributed paradigm today, a planning problem may span across the boundaries of different organizations. Consequently, such a problem is difficult to be managed by any single organization. In this paper, we propose a new graph based approach for distributed planning without a centralized planner. Our approach employs Distributed Constraint Satisfaction (DisCSP) and Graph planning techniques. It encompasses both of functional and non-functional plannings.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies. Centre for Information Technology Research

Source

Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007, Silicon Valley, USA, 02-05 November 2007 / Tsau Young (T.Y.) Lin, Jeffrey M. Bradshaw, Matthias Klusch, Chengqi Zhang, Andrei Broder, Howard Ho (eds.), pp. 273-276

Publication year

2008

Keyword(s)

Algorithms;  Centralized planners;  Distributed paradigm;  Graph theory;  Institutions;  Multi agent systems;  Planning approaches;  Problem solving;  Quality of service;  Societies

Publisher

IEEE

ISBN

9780769530277, 0769530273

Publisher URL

http://dx.doi.org/10.1109/IAT.2007.87

Copyright

Copyright © 2007 IEEE. Published version of the paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Full text

Peer reviewed