Fully decentralized solutions of supervisory control problems

Author

Kozák, P. ; Wonham, W.M.

Author_Institution

Inst. of Inf. Theory & Autom., Czechoslovak Acad. of Sci., Prague, Czech Republic

Volume

40

Issue

12

fYear

1995

fDate

12/1/1995 12:00:00 AM

Firstpage

2094

Lastpage

2097

Abstract

The paper gives a new characterization of solutions of the decentralized supervisory control problem and presents a special class of “fully decentralized” solutions, so called because the main idea is to avoid communication not only among subsupervisors during run-time but also among agents designing the subsupervisors. The solutions are constructed from optimal centralized ones using a worst-case philosophy. Their basic properties and comparison with the partially observable supervisory control problem are given. If it is known a priori that the fully decentralized solution exists, then the supervisor can be computed partly online. A sufficiency test of the existence of such a solution is provided

Keywords

controllability; decentralised control; discrete event systems; feedback; formal languages; optimal control; set theory; closed loop language; controllability; decentralized supervisory control; event lable set; feedback; index set; optimal control; partial observation; Automatic control; Control systems; Distributed control; Feedback; Information theory; LAN interconnection; Polynomials; Runtime; Supervisory control; Testing;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.478331

Filename

478331