On multi-agent product systems: Graph MA Products and partially observed MA products

Author

Romanovski, I. ; Caines, P.E.

Author_Institution

Dept. of Chem. Eng., Queen´´s Univ., Kingston, Ont., Canada

Volume

3

fYear

2003

fDate

9-12 Dec. 2003

Firstpage

2680

Abstract

In this paper we explore the notion of the graph MA product that constitutes a formal framework for the analysis of complex systems and their associated vector languages defined on graphs. This product is a generalization of the notion of an MA product which was introduced and developed in [P. Hubbard and P. E. Caines, 1999] and [P. Hubbard, December 1999]. It is shown that a necessary and sufficient condition for the existence of graph MA supervisors is the same as for the case when the MA product model is used. Next, we consider MA product systems under partial observation, introduce the notions of MA observability and MA co-observability, and show that these notions play a crucial role for the existence of vector supervisors.

Keywords

deterministic automata; discrete event systems; finite automata; formal languages; graph theory; large-scale systems; multi-agent systems; observers; Graph MA Product; co-observability; graphs; multiagent product systems; partial observation; vector languages; Automata; Automatic generation control; Chemical engineering; Control systems; Information analysis; State-space methods; Sufficient conditions; Supervisory control;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on

ISSN

0191-2216

Print_ISBN

0-7803-7924-1

Type

conf

DOI

10.1109/CDC.2003.1273028

Filename

1273028