A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems (Q6104921): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation of reachable sets by direct solution methods for optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperplane method for reachable state estimation for linear time- invariant systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex bodies by multiple objective optimization and an application in reachable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and computation of disturbance invariant sets for discrete-time linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback and invariance under uncertainty via set-iterates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant approximations of the minimal robust positively Invariant set / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((A,B)\)-invariant polyhedral sets of linear discrete-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Approach to Deterministic Infinite Horizon Optimal Control Problems with Discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for error in the solution set of a perturbed linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Bodies The Brunn-MinkowskiTheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and algebraic methods in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank

Latest revision as of 12:45, 1 August 2024

scientific article; zbMATH DE number 7704021
Language Label Description Also known as
English
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
scientific article; zbMATH DE number 7704021

    Statements

    A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2023
    0 references
    reachable set
    0 references
    discrete-time linear systems
    0 references
    numerical approximation
    0 references
    polytopes
    0 references
    linear optimization
    0 references
    disjunctive program
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references