Results 1 
4 of
4
An InputOutput Construction of Finite State ρ/µ Approximations for Control Design
"... We consider discretetime plants that interact with their controllers via fixed discrete alphabet sets in the absence of exogenous inputs. For this class of systems, we propose a general procedure for constructing a sequence of finite state approximate models starting from finite length sequences of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We consider discretetime plants that interact with their controllers via fixed discrete alphabet sets in the absence of exogenous inputs. For this class of systems, we propose a general procedure for constructing a sequence of finite state approximate models starting from finite length sequences of input and output signal pairs. We show that the proposed construction satisfies desirable properties of ρ/µ approximations, thus leading to nominal deterministic finite state machine models that can be used in certifiedbydesign controller synthesis. We also show that the proposed construction satisfies a relevant ‘completeness ’ property, and we conclude with directions for future work.
On Subspace Decompositions of Finite Horizon DP Problems with Switched Linear Dynamics
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Constructing = Approximations From Input/Output Snapshots for Systems Over Finite Alphabets
, 2012
"... Constructing ρ/μ approximations from input/output snapshots for systems over finite alphabets ..."
Abstract
 Add to MetaCart
(Show Context)
Constructing ρ/μ approximations from input/output snapshots for systems over finite alphabets