Incremental Gain Computation and Regulation of Discrete-time Positive Lur\'e Systems using Linear Programming
Jared Miller

TL;DR
This paper develops linear programming methods to compute and regulate incremental and gains for discrete-time positive Lure9 systems, enhancing robustness analysis and control design.
Contribution
It introduces a novel approach to compute and regulate incremental gains for positive Lure9 systems using linear programming, with practical numerical verification.
Findings
Linear programming effectively computes upper bounds on incremental gains.
Regulation of gain via state-feedback control is demonstrated.
Numerical examples confirm the approach's validity and robustness.
Abstract
This work approaches the problem of computing incremental and gains for discrete-time positive systems in \lure feedback with static memoryless nonlinearities, and regulating the gain through the design of a state-feedback controller. Finite incremental gains provide a quantitative measure of robustness for trajectories, and will ensure that all pairs of trajectories will converge to a fixed point or will diverge together in the absence of an applied input. Upper-bounds on these incremental gains can be computed through linear programming. Computation and regulation of the and incremental gains are verified by numerical examples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Control Systems Optimization · Stability and Control of Uncertain Systems
