Sökning: onr:"swepub:oai:research.chalmers.se:af0ffe7a-0d4b-49db-9e30-152bf89812fe" >
Model properties fo...
Model properties for efficient synthesis of nonblocking modular supervisors
-
- Goorden, Martijn (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology
-
- van de Mortel-Fronczak, Joanna M. (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology
-
- Reniers, Michel A. (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology
-
visa fler...
-
- Fabian, Martin, 1960 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Fokkink, Wan J. (författare)
- Vrije Universiteit Amsterdam (VU),Technische Universiteit Eindhoven,Eindhoven University of Technology
-
- Rooda, Jacobus E. (författare)
- Technische Universiteit Eindhoven,Eindhoven University of Technology
-
visa färre...
-
(creator_code:org_t)
- Elsevier BV, 2021
- 2021
- Engelska.
-
Ingår i: Control Engineering Practice. - : Elsevier BV. - 0967-0661. ; 112
- Relaterad länk:
-
https://research.cha... (primary) (free)
-
visa fler...
-
https://doi.org/10.1...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Robotteknik och automation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Robotics (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
Nyckelord
- Finite automata
- Supervisory control
- Directed graph
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas