Preface 1. Introduction Overview A Brief History of LMIs in Control Theory Notes on the Style of the Book Origin of the Book 2. Some Standard Problems Involving LMIs. Linear Matrix Inequalities Some Standard Problems Ellipsoid Algorithm Interior-Point Methods Strict and Nonstrict LMIs Miscellaneous Results on Matrix Inequalities Some LMI Problems with Analytic Solutions 3. Some Matrix Problems. Minimizing Condition Number by Scaling Minimizing Condition Number of a Positive-Definite Matrix Minimizing Norm by Scaling Rescaling a Matrix Positive-Definite Matrix Completion Problems Quadratic Approximation of a Polytopic Norm Ellipsoidal Approximation 4. Linear Differential Inclusions. Differential Inclusions Some Specific LDIs Nonlinear System Analysis via LDIs 5. Analysis of LDIs: State Properties. Quadratic Stability Invariant Ellipsoids 6. Analysis of LDIs: Input/Output Properties. Input-to-State Properties State-to-Output Properties Input-to-Output Properties 7. State-Feedback Synthesis for LDIs. Static State-Feedback Controllers State Properties Input-to-State Properties State-to-Output Properties Input-to-Output Properties Observer-Based Controllers for Nonlinear Systems 8. Lure and Multiplier Methods. Analysis of Lure Systems Integral Quadratic Constraints Multipliers for Systems with Unknown Parameters 9. Systems with Multiplicative Noise. Analysis of Systems with Multiplicative Noise State-Feedback Synthesis 10. Miscellaneous Problems. Optimization over an Affine Family of Linear Systems Analysis of Systems with LTI Perturbations Positive Orthant Stabilizability Linear Systems with Delays Interpolation Problems The Inverse Problem of Optimal Control System Realization Problems Multi-Criterion LQG Nonconvex Multi-Criterion Quadratic Problems Notation List of Acronyms Bibliography Index.

/pdf/linear-matrix-inequalities-in-system-and-control-theory-2q5cf0pqm2.pdf

Linear Matrix Inequalities in System and Control Theory

Simple state-space formulas are derived for all controllers solving the following standard H/sub infinity / problem: For a given number gamma >0, find all controllers such that the H/sub infinity / norm of the closed-loop transfer function is (strictly) less than gamma . It is known that a controller exists if and only if the unique stabilizing solutions to two algebraic Riccati equations are positive definite and the spectral radius of their product is less than gamma /sup 2/. Under these conditions, a parameterization of all controllers solving the problem is given as a linear fractional transformation (LFT) on a contractive, stable, free parameter. The state dimension of the coefficient matrix for the LFT, constructed using the two Riccati solutions, equals that of the plant and has a separation structure reminiscent of classical LQG (i.e. H/sub 2/) theory. This paper is intended to be of tutorial value, so a standard H/sub 2/ solution is developed in parallel. >

State-space solutions to standard H/sub 2/ and H/sub infinity / control problems

Preface, Notations 1.Introduction to Time-Delay Systems I.Frequency-Domain Approach 2.Systems with Commensurate Delays 3.Systems withIncommensurate Delays 4.Robust Stability Analysis II.Time Domain Approach 5.Systems with Single Delay 6.Robust Stability Analysis 7.Systems with Multiple and Distributed Delays III.Input-Output Approach 8.Input-output stability A.Matrix Facts B.LMI and Quadratic Integral Inequalities Bibliography Index

/pdf/stability-of-time-delay-systems-5d2qjgdknf.pdf

Stability of Time-Delay Systems

N G van Kampen 1981 Amsterdam: North-Holland xiv + 419 pp price Dfl 180 This is a book which, at a lower price, could be expected to become an essential part of the library of every physical scientist concerned with problems involving fluctuations and stochastic processes, as well as those who just enjoy a beautifully written book. It provides an extensive graduate-level introduction which is clear, cautious, interesting and readable.

https://iopscience.iop.org/article/10.1088/0031-9112/34/4/040/pdf

Stochastic Processes in Physics and Chemistry

Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

We establish a correspondence between the singular values of a transfer matrix evaluated along the imaginary axis and the imaginary eigenvalues of a related Hamiltonian matrix. We give a simple linear algebraic proof, and also a more intuitive explanation based on a certain indefinite quadratic optimal control problem. This result yields a simple bisection algorithm to compute the H∞ norm of a transfer matrix. The bisection method is far more efficient than algorithms which involve a search over frequencies, and the usual problems associated with such methods (such as determining how fine the search should be) do not arise. The method is readily extended to compute other quantities of system-theoretic interest, for instance, the minimum dissipation of a transfer matrix. A variation of the method can be used to solve the H∞ Armijo line-search problem with no more computation than is required to compute a single H∞ norm.

A bisection method for computing the H ∞ norm of a transfer matrix and related problems

This paper investigates the use of generalized sampled-data hold functions (GSHF) in the control of linear time-invariant systems. The idea of GSHF is to periodically sample the output of the system, and generate the control by means of a hold function applied to the resulting sequence. The hold function is chosen based on the dynamics of the system to be controlled. This method appears to have several advantages over dynamic controllers: it has the efficacy of state feedback without the requirement of state estimation; it provides the control system designer with substantially more freedom; and it requires few on-line computations. This paper focuses on four questions: pole assignment, specific behavior, noise sensitivity, and robustness. Among the problems solved are: simultaneous arbitrary pole assignment for a finite number of systems by a single GSHF controller, exact model matching, decoupling, and optimal noise rejection. Examples are given.

Control of linear systems using generalized sampled-data hold functions

Sampled-data systems with continuous-time inputs and outputs, where some state variables evolve in continuous time and others evolve in discrete time, are considered. Methods are presented for computing and optimizing the L/sub 2/-induced norm of such systems, considered as operators relating square integral signals. These worst-case analysis and design results are counterparts of the H/sub infinity /-norm analysis and synthesis for purely continuous- or discrete-time systems. The analysis shows that the L/sub 2/-induced norm of a sampled-data system is smaller than gamma if certain discrete-time descriptor systems have no eigenvalue of magnitude one, and if a certain discrete-time linear time-invariant plant depending on gamma has H/sub infinity / norm smaller than gamma . The synthesis shows that the optimal attenuation problem for a four-block continuous-time plant with a digital controller can be solved with a gamma -iteration on a certain discrete-time four-block plant which depends on gamma . >

Worst-case analysis and design of sampled-data control systems

The control problem of time-optimal, rest-to-rest slewing of a flexible spacecraft through a large angle is considered. The flexible spacecraft is modeled as a linear, elastic, undamped, nongyroscopic system suitable for analysis of planar rotational maneuvers. Minimum-time open-loop planar maneuvers are studied. The control histories are found to be bang-bang with multiple switches in each control variable. The optimal control history is shown to have an important time symmetry property. The switching times, final time, and costates at midmaneuver satisfy a system of nonlinear algebraic equations that can be solved using a homotopy method. An upper bound on attitude error due to control spillover is obtained. This helps to determine, a priori, the number of vibrational modes that need to be actively suppressed at the final time such that a prespecified pointing accuracy is guaranteed after the maneuver has been completed. A time-optimal slewing example is discussed to demonstrate the applicability of the results.

/pdf/planar-time-optimal-rest-to-rest-slewing-maneuvers-of-xkjfwzgl5h.pdf

Planar, time-optimal, rest-to-rest slewing maneuvers of flexible spacecraft

This paper considers energy-optimal path planning and perpetual endurance for unmanned aerial vehicles equipped with solar cells on the wings, which collect energy used to drive a propeller. Perpetual endurance is the ability to collect more energy than is lost during a day. This paper considers two unmanned aerial vehicle missions: 1) to travel between given positions within an allowed duration while maximizing the final value of energy and 2) to loiter perpetually from a given position, which requires perpetual endurance. For the first mission, the subsequent problem of energy-optimal path planning features the coupling of the aircraft kinematics and energetics models through the bank angle. The problem is then formulated as an optimal control problem, with the bank angle and speed as inputs. Necessary conditions for optimality are formulated and used to study the optimal paths. The power ratio, a nondimensional number, is shown to predict the qualitative features of the optimal paths. This ratio also quantifies a design requirement for the second mission. Specifically, perpetual endurance is possible if and only if the power ratio exceeds a certain threshold. Comparisons are made of this threshold between Earth and Mars. Implications of the power ratio for unmanned aerial vehicle design are also discussed. Several illustrations are given.

/pdf/solar-powered-aircraft-energy-optimal-path-planning-and-2cjgzdscd4.pdf

Pierre T. Kabamba

Papers

A bisection method for computing the H ∞ norm of a transfer matrix and related problems

Control of linear systems using generalized sampled-data hold functions

Worst-case analysis and design of sampled-data control systems

Planar, time-optimal, rest-to-rest slewing maneuvers of flexible spacecraft

Solar-Powered Aircraft: Energy-Optimal Path Planning and Perpetual Endurance