Efficient supervisory synthesis of large systems
Paper i proceeding, 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

Författare

Arash Vahidi

Chalmers, Signaler och system, System- och reglerteknik

Bengt Lennartson

Chalmers, Signaler och system, System- och reglerteknik, Automation

Martin Fabian

Chalmers, Signaler och system, System- och reglerteknik, Automation

IFAC Proceedings Volumes (IFAC-PapersOnline)

14746670 (ISSN)

Vol. 37 18 81-86

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

Ämneskategorier

Robotteknik och automation

Reglerteknik

Datorsystem

DOI

10.1016/S1474-6670(17)30726-7

Mer information

Senast uppdaterat

2019-09-20