Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems

Jung–Min M. Yang; Thomas Moor; Jörg Raisch

doi:10.1016/j.ifacol.2018.06.342

Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems

Jung–Min M. Yang, Thomas Moor, Jörg Raisch

School of Electronics Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

l-complete approximation is a discrete abstraction method for a specific class of hybrid control problems involving purely discrete specifications. It allows for global refinement if the subsequent synthesis of supervisory control should fail for the currently selected abstraction level. In this paper, we present a methodology of local refinement for l-complete approximations. If the strongest l-complete approximation of a given hybrid system does not guarantee the existence of a suitable supervisor for a given specification, the proposed scheme refines the abstract model only in a local set of states that violate a controllability condition. Compared to the standard unfocused and global refinement procedure, this may significantly reduce the computational burden both in the abstraction step and the subsequent controller synthesis step.

Original language	English
Pages (from-to)	472-479
Number of pages	8
Journal	14th IFAC Workshop on Discrete Event Systems WODES 2018
Volume	51
Issue number	7
DOIs	https://doi.org/10.1016/j.ifacol.2018.06.342
State	Published - 1 Jan 2018

Keywords

Hybrid systems
discrete event systems
l-complete approximations
local refinement
supervisory control

Access to Document

10.1016/j.ifacol.2018.06.342

Cite this

@article{b1254895ed364a17a20df0252677a39b,

title = "Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems",

abstract = "l-complete approximation is a discrete abstraction method for a specific class of hybrid control problems involving purely discrete specifications. It allows for global refinement if the subsequent synthesis of supervisory control should fail for the currently selected abstraction level. In this paper, we present a methodology of local refinement for l-complete approximations. If the strongest l-complete approximation of a given hybrid system does not guarantee the existence of a suitable supervisor for a given specification, the proposed scheme refines the abstract model only in a local set of states that violate a controllability condition. Compared to the standard unfocused and global refinement procedure, this may significantly reduce the computational burden both in the abstraction step and the subsequent controller synthesis step.",

keywords = "Hybrid systems, discrete event systems, l-complete approximations, local refinement, supervisory control",

author = "Yang, {Jung–Min M.} and Thomas Moor and J{\"o}rg Raisch",

note = "Publisher Copyright: {\textcopyright} 2018",

year = "2018",

month = jan,

day = "1",

doi = "10.1016/j.ifacol.2018.06.342",

language = "English",

volume = "51",

pages = "472--479",

journal = "14th IFAC Workshop on Discrete Event Systems WODES 2018",

issn = "2405-8963",

number = "7",

}

TY - JOUR

T1 - Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems

AU - Yang, Jung–Min M.

AU - Moor, Thomas

AU - Raisch, Jörg

PY - 2018/1/1

Y1 - 2018/1/1

N2 - l-complete approximation is a discrete abstraction method for a specific class of hybrid control problems involving purely discrete specifications. It allows for global refinement if the subsequent synthesis of supervisory control should fail for the currently selected abstraction level. In this paper, we present a methodology of local refinement for l-complete approximations. If the strongest l-complete approximation of a given hybrid system does not guarantee the existence of a suitable supervisor for a given specification, the proposed scheme refines the abstract model only in a local set of states that violate a controllability condition. Compared to the standard unfocused and global refinement procedure, this may significantly reduce the computational burden both in the abstraction step and the subsequent controller synthesis step.

AB - l-complete approximation is a discrete abstraction method for a specific class of hybrid control problems involving purely discrete specifications. It allows for global refinement if the subsequent synthesis of supervisory control should fail for the currently selected abstraction level. In this paper, we present a methodology of local refinement for l-complete approximations. If the strongest l-complete approximation of a given hybrid system does not guarantee the existence of a suitable supervisor for a given specification, the proposed scheme refines the abstract model only in a local set of states that violate a controllability condition. Compared to the standard unfocused and global refinement procedure, this may significantly reduce the computational burden both in the abstraction step and the subsequent controller synthesis step.

KW - Hybrid systems

KW - discrete event systems

KW - l-complete approximations

KW - local refinement

KW - supervisory control

UR - http://www.scopus.com/inward/record.url?scp=85050072150&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2018.06.342

DO - 10.1016/j.ifacol.2018.06.342

M3 - Article

AN - SCOPUS:85050072150

SN - 2405-8963

VL - 51

SP - 472

EP - 479

JO - 14th IFAC Workshop on Discrete Event Systems WODES 2018

JF - 14th IFAC Workshop on Discrete Event Systems WODES 2018

IS - 7

ER -

Local Refinement of l-complete Approximations for Supervisory Control of Hybrid Systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this