A generalized theory on supervisor reduction

To make a supervisor comprehensible to a designer has been a long-standing goal in the supervisory control community. One strategy is to reduce the size of a supervisor to generate a control equivalent version, whose size is optimistically much smaller than the original one so that a user or control...

Full description

Saved in:
Bibliographic Details
Main Authors: Su, Rong, Wonham, Walter Murray
Other Authors: School of Electrical and Electronic Engineering
Format: Conference or Workshop Item
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/138016
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-138016
record_format dspace
spelling sg-ntu-dr.10356-1380162020-04-22T02:36:44Z A generalized theory on supervisor reduction Su, Rong Wonham, Walter Murray School of Electrical and Electronic Engineering 2018 IEEE Conference on Decision and Control (CDC) Engineering::Electrical and electronic engineering Automata Computational Complexity To make a supervisor comprehensible to a designer has been a long-standing goal in the supervisory control community. One strategy is to reduce the size of a supervisor to generate a control equivalent version, whose size is optimistically much smaller than the original one so that a user or control designer can easily check whether a designed controller fulfils its objectives and requirements. After the first journal paper on this topic appeared in 1986 by Vaz and Wonham, which relied on the concept of control covers, Su and Wonham proposed in 2004 to use control congruences to ensure computational viability. This work was later adopted in supervisor localization theory, which aims for a control equivalent distributed implementation of a given centralized supervisor. Despite these publications some fundamental questions, which might have been addressed in the first place, have not yet been answered, namely what information is critical to ensure control equivalence, what information is responsible for size reduction, and whether partial observation makes the problem essentially different. In this paper we address these questions by showing that there exists a unified reduction theory, which is applicable to all feasible supervisors regardless of whether they are under full observation or partial observation. Our theory proposes a preorder (called leanness) over all control equivalent feasible supervisors based on their enabling, disabling and marking information such that, if a supervisor S1 is leaner than another supervisor S2, then the size of the minimal control cover defined over the state set of S1 is no bigger than that of S2. NRF (Natl Research Foundation, S’pore) MOE (Min. of Education, S’pore) Accepted version 2020-04-22T02:36:43Z 2020-04-22T02:36:43Z 2019 Conference Paper Su, R., & Wonham, W. M. (2018). A generalized theory on supervisor reduction. Proceedings of 2018 IEEE Conference on Decision and Control (CDC), 3950-3955. doi:10.1109/CDC.2018.8619444 9781538613962 https://hdl.handle.net/10356/138016 3950 3955 en © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/CDC.2018.8619444 application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Automata
Computational Complexity
spellingShingle Engineering::Electrical and electronic engineering
Automata
Computational Complexity
Su, Rong
Wonham, Walter Murray
A generalized theory on supervisor reduction
description To make a supervisor comprehensible to a designer has been a long-standing goal in the supervisory control community. One strategy is to reduce the size of a supervisor to generate a control equivalent version, whose size is optimistically much smaller than the original one so that a user or control designer can easily check whether a designed controller fulfils its objectives and requirements. After the first journal paper on this topic appeared in 1986 by Vaz and Wonham, which relied on the concept of control covers, Su and Wonham proposed in 2004 to use control congruences to ensure computational viability. This work was later adopted in supervisor localization theory, which aims for a control equivalent distributed implementation of a given centralized supervisor. Despite these publications some fundamental questions, which might have been addressed in the first place, have not yet been answered, namely what information is critical to ensure control equivalence, what information is responsible for size reduction, and whether partial observation makes the problem essentially different. In this paper we address these questions by showing that there exists a unified reduction theory, which is applicable to all feasible supervisors regardless of whether they are under full observation or partial observation. Our theory proposes a preorder (called leanness) over all control equivalent feasible supervisors based on their enabling, disabling and marking information such that, if a supervisor S1 is leaner than another supervisor S2, then the size of the minimal control cover defined over the state set of S1 is no bigger than that of S2.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Su, Rong
Wonham, Walter Murray
format Conference or Workshop Item
author Su, Rong
Wonham, Walter Murray
author_sort Su, Rong
title A generalized theory on supervisor reduction
title_short A generalized theory on supervisor reduction
title_full A generalized theory on supervisor reduction
title_fullStr A generalized theory on supervisor reduction
title_full_unstemmed A generalized theory on supervisor reduction
title_sort generalized theory on supervisor reduction
publishDate 2020
url https://hdl.handle.net/10356/138016
_version_ 1681057117495099392