Discrete-Event Coordination Design for Distributed Agents

被引:6
作者
Manh Tung Pham [1 ]
Seow, Kiam Tian [1 ]
机构
[1] Nanyang Technol Univ, Div Comp Syst, Sch Comp Engn, Singapore 639798, Singapore
关键词
Coordinability; coordination design; control synthesis; discrete-event systems (DESs); SUPERVISORY CONTROL; DECENTRALIZED CONTROL; SENSOR SELECTION; COMPLEXITY; SYSTEMS;
D O I
10.1109/TASE.2011.2166068
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually equipped with a coordination module, through which they interact and communicate. In terms of existing control-theoretic concepts, we first define the concept of a coordinable language and show that it is the necessary and sufficient existence condition of coordination modules for distributed agents to achieve conformance to a prespecified interagent constraint language. Following, we present a synthesis algorithm to compute near-optimal coordination modules. An example is provided to illustrate the design synthesis using the proposed algorithm. Finally, a discussion with related work distinguishes our coordination design problem from related problems in the literature. Note to Practitioners-Multiagent coordination presents a key approach to developing complex systems. In this approach, the basic idea is to model a system as a network of interacting agents, and design for each agent a coordination module by which the agents can interact and communicate to manage the interdependencies arising due to system needs or limitations. In this paper, we propose a novel approach for coordination design of distributed agents. By modeling coordinating agents as discrete-event processes, we formulate and address the problem of synthesizing for each agent a coordination module to achieve conformance to a given interagent constraint. Importantly, by showing that our multiagent coordination problem shares the same algorithmic foundation with existing problems in the literature, we are able to adapt existing techniques to develop a new coordination synthesis algorithm, without reinventing the wheel. The coordination modules synthesized by our algorithm are proven to be minimally interventive with the agents' local plans and ensure that communication among the agents is made only when necessary. Potential applications of our work can be found in domains where discrete-event modeling has proven to be suitable and effective, and these include manufacturing, transportation, and logistics systems.
引用
收藏
页码:70 / 82
页数:13
相关论文
共 39 条
[1]  
An B., 2010, Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Volume 1 - Volume 1, AAMAS '10, V1, P981
[2]  
[Anonymous], P 3 INT JOINT C AUT
[3]   Decentralized supervisory control with communicating controllers [J].
Barrett, C ;
Lafortune, S .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2000, 45 (09) :1620-1638
[4]  
Cao Xi- Ren, 2007, STOCHASTIC LEARNING
[5]   Modeling and performance evaluation of supply chains using batch deterministic and stochastic Petri nets [J].
Chen, HX ;
Amodeo, L ;
Chu, F ;
Labadi, K .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2005, 2 (02) :132-144
[6]   Robust Supervisory Control for Product Routings With Multiple Unreliable Resources [J].
Chew, Song Foh ;
Wang, Shengyong ;
Lawley, Mark A. .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2009, 6 (01) :195-200
[7]  
de Queiroz MH, 2000, P AMER CONTR CONF, P4051, DOI 10.1109/ACC.2000.876983
[8]  
Feng L, 2006, WODES 2006: EIGHTH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, PROCEEDINGS, P3
[9]   Modeling and supervisory control of railway networks using Petri nets [J].
Giua, Alessandro ;
Seatzu, Carla .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2008, 5 (03) :431-445
[10]   On the complexity of supervisory control design in the RW framework [J].
Gohari, P ;
Wonham, WM .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2000, 30 (05) :643-652