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

Learn More →

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control MASSIMO BENERECETTI and MARCO FAELLA, University of Naples "Federico II," Italy We consider the problem of computing the controllable region of a Linear Hybrid Automaton with controllable and uncontrollable transitions, w.r.t. a reachability objective. We provide an algorithm for the finite-horizon version of the problem, based on computing the set of states that must reach a given non-convex polyhedron while avoiding another one, subject to a polyhedral constraint on the slope of the trajectory. Experimental results are presented, based on an implementation of the proposed algorithm on top of the tool SpaceEx. CCS Concepts: Theory of computation Timed and hybrid models; methodologies Computational control theory r r Computing Additional Key Words and Phrases: Hybrid automata, controller synthesis, reachability games ACM Reference Format: Massimo Benerecetti and Marco Faella. 2017. Automatic synthesis of switching controllers for linear hybrid systems: Reachability control. ACM Trans. Embed. Comput. Syst. 16, 4, Article 104 (May 2017), 27 pages. DOI: http://dx.doi.org/10.1145/3047500 1. INTRODUCTION Hybrid systems are a type of non-linear dynamic systems, characterized by the presence of continuous and discrete variables. Hybrid automata [Henzinger 1996] are the most common syntactic variety of hybrid system: http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control

Loading next page...
 
/lp/association-for-computing-machinery/automatic-synthesis-of-switching-controllers-for-linear-hybrid-systems-A2wAYDUwZw

References (35)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2017 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/3047500
Publisher site
See Article on Publisher Site

Abstract

Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control MASSIMO BENERECETTI and MARCO FAELLA, University of Naples "Federico II," Italy We consider the problem of computing the controllable region of a Linear Hybrid Automaton with controllable and uncontrollable transitions, w.r.t. a reachability objective. We provide an algorithm for the finite-horizon version of the problem, based on computing the set of states that must reach a given non-convex polyhedron while avoiding another one, subject to a polyhedral constraint on the slope of the trajectory. Experimental results are presented, based on an implementation of the proposed algorithm on top of the tool SpaceEx. CCS Concepts: Theory of computation Timed and hybrid models; methodologies Computational control theory r r Computing Additional Key Words and Phrases: Hybrid automata, controller synthesis, reachability games ACM Reference Format: Massimo Benerecetti and Marco Faella. 2017. Automatic synthesis of switching controllers for linear hybrid systems: Reachability control. ACM Trans. Embed. Comput. Syst. 16, 4, Article 104 (May 2017), 27 pages. DOI: http://dx.doi.org/10.1145/3047500 1. INTRODUCTION Hybrid systems are a type of non-linear dynamic systems, characterized by the presence of continuous and discrete variables. Hybrid automata [Henzinger 1996] are the most common syntactic variety of hybrid system:

Journal

ACM Transactions on Embedded Computing Systems (TECS)Association for Computing Machinery

Published: May 11, 2017

There are no references for this article.