Efficient supervisory synthesis of large systems
Paper in proceedings, 2004

In this paperefficient computation of controllers in the context of Supervisory Control Theory (SCT) is discussed. A simple algorithm for efficient reachability search is presented to significantly improve controller synthesis performance. as the reachability search is t he bottleneck of a controller synthesis algorithm. Simple measures to identify" hard" vs " easy" problems are also discussed and it is shown that a large state space is not always a guarantee for hardness' It is further demonstrated that well known handmade benchmark models that have been used over the years , can in fact be classified as easy, while hard problems often arise in real-world industrial systems.

Supervisory control

Symbolic computation

Reachability search

Author

Arash Vahidi

Chalmers, Signals and Systems, Systems and control

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

Martin Fabian

Chalmers, Signals and Systems, Systems and control, Automation

IFAC Proceedings Volumes (IFAC-PapersOnline)

14746670 (ISSN)

Vol. 37 18 81-86

7th International Workshop on Discrete Event Systems, WODES 2004
Reims, France,

Subject Categories

Robotics

Control Engineering

Computer Systems

DOI

10.1016/S1474-6670(17)30726-7

More information

Latest update

9/20/2019