Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design

On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design AbstractThe class of hybrid systems describes most technical systems in great detail. However, the respective models and their behavior tend to be very complex. Recently, a new subclass of hybrid automata has been introduced, the Flat Hybrid Automata (FHA) that relies on the concepts of differential flatness for the continuous parts, and strongly connected automaton graphs for the discrete event part, in order to deal with the complexity from a design perspective. Therefore, we introduce in the present paper an approach to reduce the automaton graph of an FHA in a systematic way by removing edges from the adjacency matrix. The main contribution of the paper is twofold: Firstly, based on practical considerations we develop a heuristic algorithm to reduce the automaton graph. Secondly, we present possible ways to include knowledge about the system in the reduction. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png at - Automatisierungstechnik de Gruyter

On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design

Loading next page...
 
/lp/de-gruyter/on-complexity-reduction-of-the-discrete-event-subsystem-of-flat-hybrid-Uzpv8vlLvz
Publisher
de Gruyter
Copyright
© 2020 Walter de Gruyter GmbH, Berlin/Boston
ISSN
2196-677X
eISSN
2196-677X
DOI
10.1515/auto-2020-0061
Publisher site
See Article on Publisher Site

Abstract

AbstractThe class of hybrid systems describes most technical systems in great detail. However, the respective models and their behavior tend to be very complex. Recently, a new subclass of hybrid automata has been introduced, the Flat Hybrid Automata (FHA) that relies on the concepts of differential flatness for the continuous parts, and strongly connected automaton graphs for the discrete event part, in order to deal with the complexity from a design perspective. Therefore, we introduce in the present paper an approach to reduce the automaton graph of an FHA in a systematic way by removing edges from the adjacency matrix. The main contribution of the paper is twofold: Firstly, based on practical considerations we develop a heuristic algorithm to reduce the automaton graph. Secondly, we present possible ways to include knowledge about the system in the reduction.

Journal

at - Automatisierungstechnikde Gruyter

Published: Jul 26, 2020

There are no references for this article.