: David H. Owens
: Iterative Learning Control An Optimization Paradigm
: Springer-Verlag
: 9781447167723
: Advances in Industrial Control
: 1
: CHF 114.50
:
: Elektronik, Elektrotechnik, Nachrichtentechnik
: English
: 473
: DRM
: PC/MAC/eReader/Tablet
: PDF

This book develops a coherent theoretical approach to algorithm design for iterative learning control based on the use of optimization concepts. Concentrating initially on linear, discrete-time systems, the author gives the reader access to theories based on either signal or parameter optimization. Although the two approaches are shown to be related in a formal mathematical sense, the text presents them separately because their relevant algorithm design issues are distinct and give rise to different performance capabilities.

Together with algorithm design, the text demonstrates that there are new algorithms that are capable of incorporating input and output constraints, enable the algorithm to reconfigure systematically in order to meet the requirements of different reference signals and also to support new algorithms for local convergence of nonlinear iterative control. Simulation and application studies are used to illustrate algorithm properties and performance in systems like gantry robots and other electromechanical and/or mechanical systems.

 Iterative Learning Control will interest academics and graduate students working in control who will find it a useful reference to the current status of a powerful and increasingly popular method of control. The depth of background theory and links to practical systems will be of use to engineers responsible for precision repetitive processes.



Professor Owens has 40 years of experience of Control Engineering theory and applications in areas including nuclear power, robotics and mechanical test. He has extensive teaching experience at both undergraduate and postgraduate levels in three UK universities. His research has included multivariable frequency domain theory and design, the theory of multivariable root loci, contributions to robust control theory, theoretical methods for controller design based  on plant step data and involvement in aspects of adaptive control, model reduction and optimization-based design. His area of research that specifically underpins the text is his experience of modelling and analysis of systems with repetitive dynamics. Originally arising in control of underground coal cutters, my theory of 'multipass processes' (developed in 1976 with follow-on applications introduced by J.B. Edwards) laid the foundation for analysis and design in this area and others including metal rolling and automated agriculture. This work led to substantial contributions (with collaborator E. Rogers and others) in the area of repetitive control systems (as part of 2D systems theory) but more specifically, since 1996, in the area of iterative learning control when I introduced the use of optimization to the ILC community in the form of 'norm optimal iterative learning control'. Since that time he has continued to teach and research in areas related to this topic adding considerable detail and depth to the approach and introducing the ideas of parameter optimal iterative learning to simplify the implementations. This led to his development of a wide range of new algorithms, supporting analysis and applications to mechanical test. This work is also being applied to the development of data analysis tools for control in gantry robots and stroke rehabilitation equipment by collaborators at Southampton University. Work with S. Daley has also seen applications in automative test at Jaguar and related industrial sites.
David Owens was elected a Fellow of the Royal Academy of Engineering for his contributions to knowledge in these and other areas.
Series Editors’ Foreword7
Preface10
Acknowledgments17
Contents19
1 Introduction27
1.1 Control Systems, Models and Algorithms28
1.2 Repetition and Iteration29
1.2.1 Periodic Demand Signals29
1.2.2 Repetitive Control and Multipass Systems30
1.2.3 Iterative Control Examples32
1.3 Dynamical Properties of Iteration: A Review of Ideas35
1.4 So What Do We Need?38
1.4.1 An Overview of Mathematical Techniques39
1.4.2 The Conceptual Basis for Algorithms41
1.5 Discussion and Further Background Reading42
2 Mathematical Methods44
2.1 Elements of Matrix Theory44
2.2 Quadratic Optimization and Quadratic Forms52
2.2.1 Completing the Square52
2.2.2 Singular Values, Lagrangians and Matrix Norms53
2.3 Banach Spaces, Operators, Norms and Convergent Sequences54
2.3.1 Vector Spaces54
2.3.2 Normed Spaces56
2.3.3 Convergence, Closure, Completeness and Banach Spaces58
2.3.4 Linear Operators and Dense Subsets59
2.4 Hilbert Spaces62
2.4.1 Inner Products and Norms62
2.4.2 Norm and Weak Convergence64
2.4.3 Adjoint and Self-adjoint Operators in Hilbert Space66
2.5 Real Hilbert Spaces, Convex Sets and Projections71
2.6 Optimal Control Problems in Hilbert Space73
2.6.1 Proof by Completing the Square75
2.6.2 Proof Using the Projection Theorem76
2.6.3 Discussion77
2.7 Further Discussion and Bibliography78
3 State Space Models80
3.1 Models of Continuous State Space Systems82
3.1.1 Solution of the State Equations83
3.1.2 The Convolution Operator and the Impulse Response84
3.1.3 The System as an Operator Between Function Spaces84
3.2 Laplace Transforms85
3.3 Transfer Function Matrices, Poles, Zeros and Relative Degree86
3.4 The System Frequency Response88
3.5 Discrete Time, Sampled Data State Space Models89
3.5.1 State Space Models as Difference Equations89
3.5.2 Solution of Linear, Discrete Time State Equations90
3.5.3 The Discrete Convolution Operator and the Discrete Impulse Response Sequence91
3.6 mathcalZ-Transforms and the Discrete Transfer Function Matrix92
3.6.1 Discrete Transfer Function Matrices, Poles, Zeros and the Relative Degree93
3.6.2 The Discrete System Frequency Response94
3.7 Multi-rate Discrete Time Systems95
3.8 Controllability, Observability, Minimal Realizations and Pole Allocation95
3.9 Inverse Systems97
3.9.1 The Case of m=ell, Zeros and ?*97
3.9.2 Left and Right Inverses When m neqell99
3.10 Quadratic Optimal Control of Linear Continuous Systems101
3.10.1 The Relevant Operators and Spaces101
3.10.2 Computation of the Adjoint Operator103
3.10.3 The Two Point Boundary Value Problem106
3.10.4 The Riccati Equation and a State Feedback Plus Feedforward Representation107
3.10.5 An Alternative Riccati Representation109
3.11 Further Reading and Bibliography110
4 Matrix Models, Supervectors and Discrete Systems112
4.1 Supervectors and the Matrix Model112
4.2 The Algebra of Series and Parallel Connections113
4.3 The Transpose System and Time Reversal114
4.4 Invertibility, Range and Relative Degrees115
4.4.1 The Relative Degree and the Kernel and Range of G117
4.4.2 The Range of G and Decoupling Theory118
4.5 The Range and Kernel and the Use of the Inverse System121
4.5.1 A Partition of the Inverse121
4.5.2 Ensuring Stability of P-1(z)123
4.6 The Range, Kernel and the mathcalC* Canonical Form124
4.6.1 Factorization Using State Feedback and Output Injection124
4.6.2 The mathcalC* Canonical Form125
4.6.3 The Special Case of Uniform Rank Systems127
4.7 Quadratic Optimal Control of Linear Discrete Systems129
4.7.1 The Adjoint and the Discrete Two Point Boundary Value Problem130
4.7.2 A State Feedback/Feedforward Solution131