Abstract
Supervisory control theory provides means to synthesize supervisors for systems with discrete-event behavior from models of the uncontrolled plant and of the control requirements. The applicability of supervisory control theory often fails due to a lack of scalability of the algorithms. This paper proposes a format for the requirements and a method to ensure that the crucial properties of controllability and nonblockingness directly hold, thus avoiding the most computationally expensive parts of synthesis. The method consists of creating a control problem dependency graph and verifying whether it is acyclic. Vertices of the graph are modular plant components, and edges are derived from the requirements. In case of a cyclic graph, potential blocking issues can be localized, so that the original control problem can be reduced to only synthesizing supervisors for smaller partial control problems. The strength of the method is illustrated on two case studies: a production line and a roadway tunnel.
Original language | English |
---|---|
Article number | 104830 |
Pages (from-to) | 1-13 |
Number of pages | 13 |
Journal | Control Engineering Practice |
Volume | 112 |
Early online date | 23 Apr 2021 |
DOIs | |
Publication status | Published - Jul 2021 |
Bibliographical note
Funding Information:The authors thank Ferdie Reijnen for providing the models of the Festo production line and Lars Moormann for providing the models of the Eerste Heijnenoord Tunnel. Advice given by prof.em. Jan H. van Schuppen has been a great help in preparing the manuscript of this paper. The authors thank Han Vogel and Maria Angenent from Rijkswaterstaat for their valuable feedback and support. This work is supported by Rijkswaterstaat, the Netherlands, part of the Ministry of Infrastructure and Water Management of the Government of the Netherlands, and by the Swedish Science Foundation, Vetenskapsr?det.
Funding Information:
This work is supported by Rijkswaterstaat, the Netherlands , part of the Ministry of Infrastructure and Water Management of the Government of the Netherlands, and by the Swedish Science Foundation, Vetenskapsrådet .
Publisher Copyright:
© 2021 The Author(s)
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
Funding
The authors thank Ferdie Reijnen for providing the models of the Festo production line and Lars Moormann for providing the models of the Eerste Heijnenoord Tunnel. Advice given by prof.em. Jan H. van Schuppen has been a great help in preparing the manuscript of this paper. The authors thank Han Vogel and Maria Angenent from Rijkswaterstaat for their valuable feedback and support. This work is supported by Rijkswaterstaat, the Netherlands, part of the Ministry of Infrastructure and Water Management of the Government of the Netherlands, and by the Swedish Science Foundation, Vetenskapsr?det. This work is supported by Rijkswaterstaat, the Netherlands , part of the Ministry of Infrastructure and Water Management of the Government of the Netherlands, and by the Swedish Science Foundation, Vetenskapsrådet .
Keywords
- Directed graph
- Finite automata
- Supervisory control