Parallel and distributed algorithms for supervisory control of discrete event systems

Author

Garg, Vijay K.

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

fYear

1993

fDate

15-17 Dec 1993

Firstpage

2236

Abstract

We describe parallel and distributed algorithms for supervisory control of discrete event dynamical systems. These algorithms offer a significant reduction in time required to compute the control policy for any plant. In particular, we discuss algorithms to compute the supremal controllable sublanguage of a given language, algorithms to check observability and normality of any given language and algorithms to implement a control policy under complete and partial observation. Besides the obvious advantage of speed, distributed algorithms are also useful when the state space of the controller is so large that it cannot fit in the memory of a single computer

Keywords

discrete event simulation; discrete time systems; formal languages; hierarchical systems; parallel algorithms; discrete event dynamical systems; distributed algorithms; normality; observability; parallel algorithms; supervisory control; supremal controllable sublanguage; Computational modeling; Concurrent computing; Control systems; Discrete event systems; Distributed algorithms; Distributed computing; Parallel algorithms; Parallel processing; State-space methods; Supervisory control;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-1298-8

Type

conf

DOI

10.1109/CDC.1993.325596

Filename

325596