2017/02/16 by Kazumune Hashimoto, Hashimoto, Kazumune, Shuichi Adachi +3 · 1 citation
Computer Science · Mathematics · #Algorithm #Combinatorics #Computer science #Construct (python library) #Discrete event dynamic system #Discrete mathematics #Discrete system #FOS: Mathematics #Formal Methods in Verification #Graph #Graph theory #Mathematical optimization #Mathematics #Optimization and Control (math.OC) #Petri Nets in System Modeling #Real-Time Systems Scheduling #Scheme (mathematics) #Set (abstract data type) #math.OC
paper · pdf · doi:10.48550/arxiv.1702.04890
published in arXiv (Cornell University) (Cornell University) · Extended version of ACC 2017
arxiv created 2017/02/16 · openalex publication_date 2017/02/16 · arxiv updated 2017/02/17 · openalex created_date 2017/03/03 · openalex updated_date 2026/08/05
In this paper, a self-triggered control scheme for constrained discrete-time control systems is presented. The key idea of our approach is to construct a transition system or a graph structure from a collection of polyhedral sets, which are generated based on the notion of set-invariance theory. The inter-event time steps are then determined through a standard graph search algorithm to obtain the minimal total cost to a terminal state. The proposed strategy is illustrated through a numerical example.