Supervisory Control of Networked Timed Discrete Event Systems With Bandwidth Constraints

In this article, we investigate the supervisory control of a networked timed discrete event system modeled with a timed automaton. In this system, a plant communicates with its supervisor through multiple observation channels and a single control channel. Any observation channel is imposed a bandwid...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 70; číslo 7; s. 4849 - 4856
Hlavní autoři: Xiang, Zhaoyu, Chen, Yufeng, Wu, Naiqi, Li, Zhiwu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Atomic clocks
Automata
Bandwidth
Bandwidth constraint
Bandwidths
Clocks
Constraints
Cost accounting
Delays
Discrete event systems
networked discrete event system (NDES)
Semantics
State estimation
Supervisors
Supervisory control
timed automaton
ISSN:0018-9286, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this article, we investigate the supervisory control of a networked timed discrete event system modeled with a timed automaton. In this system, a plant communicates with its supervisor through multiple observation channels and a single control channel. Any observation channel is imposed a bandwidth constraint such that the number of events transmitted through the channel per time unit should not exceed a given nonnegative integer. The control channel is subject to bounded control delays and losses. Our goal is to synthesize a supervisor against control delays and losses such that the bandwidth constraint of any observation channel is satisfied. To this end, the system is first transformed to a region automaton that is a finite representation of the system's semantics. Then, by considering the impact of control delays and losses on system state estimation, the conventional bipartite transition systems are extended to networked timed ones, from which a necessary and sufficient condition for the existence of a desired supervisor is derived. An algorithm is proposed for building such a supervisor if existing.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2025.3545708