Convex Computation of the Maximum Controlled Invariant Set for Discrete-Time Polynomial Control Systems

doi 10.1109/cdc.2013.6761016
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Information State for Robust Control of Set-Valued Discrete Time Systems

English

A Novel RPI Set Computation Method for Discrete-Time LPV Systems With Bounded Uncertainties

2019English

Convex-Cyclic Matrices, Convex-Polynomial Interpolation and Invariant Convex Sets

Operators and Matrices
Number TheoryAnalysisAlgebra
2017English

The Maximal Controlled Invariant Set of Switched Linear Systems

English

A Natural Transfer Function Space for Linear Discrete Time-Invariant and Scale-Invariant Systems

2009English

Attracting and Natural Invariant Varieties for Polynomial Vector Fields and Control Systems

Qualitative Theory of Dynamical Systems
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Symbolic Computation of Nonblocking Control Function for Timed Discrete Event Systems

2012English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

Nonuniform Polynomial Dichotomy for Noninvertible Linear Discrete-Time Systems in Banach Spaces

Journal of Control Science and Engineering
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy