Skip to:Content
|
Bottom
Cover image for Optimal measurement methods for distributed parameter system identification
Title:
Optimal measurement methods for distributed parameter system identification
Personal Author:
Publication Information:
Boca Raton, FL : CRC Press, 2005
ISBN:
9780849323133

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010082565 QA402 U24 2005 Open Access Book Book
Searching...

On Order

Summary

Summary

For dynamic distributed systems modeled by partial differential equations, existing methods of sensor location in parameter estimation experiments are either limited to one-dimensional spatial domains or require large investments in software systems. With the expense of scanning and moving sensors, optimal placement presents a critical problem.

Optimal Measurement Methods for Distributed Parameter System Identification discusses the characteristic features of the sensor placement problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, culminating in the most comprehensive and timely treatment of the issue available. By presenting a step-by-step guide to theoretical aspects and to practical design methods, this book provides a sound understanding of sensor location techniques.

Both researchers and practitioners will find the case studies, the proposed algorithms, and the numerical examples to be invaluable. This text also offers results that translate easily to MATLAB and to Maple. Assuming only a basic familiarity with partial differential equations, vector spaces, and probability and statistics, and avoiding too many technicalities, this is a superb resource for researchers and practitioners in the fields of applied mathematics, electrical, civil, geotechnical, mechanical, chemical, and environmental engineering.


Author Notes

Ucinski, Dariusz


Table of Contents

Prefacep. xv
1 Introductionp. 1
1.1 The optimum experimental design problem in contextp. 1
1.2 A general review of the literaturep. 3
2 Key ideas of identification and experimental designp. 9
2.1 System descriptionp. 9
2.2 Parameter identificationp. 13
2.3 Measurement-location problemp. 14
2.4 Main impedimentsp. 19
2.4.1 High dimensionality of the multimodal optimization problemp. 19
2.4.2 Loss of the underlying properties of the estimator for finite horizons of observationp. 20
2.4.3 Sensor clusterizationp. 20
2.4.4 Dependence of the solution on the parameters to be identifiedp. 22
2.5 Deterministic interpretation of the FIMp. 24
2.6 Calculation of sensitivity coefficientsp. 27
2.6.1 Finite-difference methodp. 27
2.6.2 Direct-differentiation methodp. 28
2.6.3 Adjoint methodp. 29
2.7 A final introductory notep. 31
3 Locally optimal designs for stationary sensorsp. 33
3.1 Linear-in-parameters lumped modelsp. 33
3.1.1 Problem statementp. 34
3.1.2 Characterization of the solutionsp. 38
3.1.3 Algorithmsp. 49
3.2 Construction of minimax designsp. 68
3.3 Continuous designs in measurement optimizationp. 74
3.4 Clusterization-free designsp. 83
3.5 Nonlinear programming approachp. 88
3.6 A critical note on a deterministic approachp. 92
3.7 Modifications required by other settingsp. 95
3.7.1 Discrete-time measurementsp. 95
3.7.2 Multiresponse systems and inaccessibility of state measurementsp. 95
3.7.3 Simplifications for static DPSsp. 96
3.8 Summaryp. 100
4 Locally optimal strategies for scanning and moving observationsp. 103
4.1 Optimal activation policies for scanning sensorsp. 103
4.1.1 Exchange scheme based on clusterization-free designsp. 105
4.1.2 Scanning sensor scheduling as a constrained optimal control problemp. 118
4.1.3 Equivalent Mayer formulationp. 120
4.1.4 Computational procedure based on the control parameterization-enhancing techniquep. 121
4.2 Adapting the idea of continuous designs for moving sensorsp. 125
4.2.1 Optimal time-dependent measuresp. 125
4.2.2 Parameterization of sensor trajectoriesp. 129
4.3 Optimization of sensor trajectories based on optimal-control techniquesp. 131
4.3.1 Statement of the problem and notationp. 131
4.3.2 Equivalent Mayer problem and existence resultsp. 134
4.3.3 Linearization of the optimal-control problemp. 136
4.3.4 A numerical technique for solving the optimal measurement problemp. 137
4.3.5 Special casesp. 142
4.4 Concluding remarksp. 149
5 Measurement strategies with alternative design objectivesp. 153
5.1 Optimal sensor location for predictionp. 153
5.1.1 Problem formulationp. 153
5.1.2 Optimal-control formulationp. 155
5.1.3 Minimization algorithmp. 156
5.2 Sensor location for model discriminationp. 159
5.2.1 Competing models of a given distributed systemp. 160
5.2.2 Theoretical problem setupp. 161
5.2.3 T[subscript 12]-optimality conditionsp. 164
5.2.4 Numerical construction of T[subscript 12]-optimum designsp. 167
5.3 Conclusionsp. 171
6 Robust designs for sensor locationp. 173
6.1 Sequential designsp. 173
6.2 Optimal designs in the average sensep. 175
6.2.1 Problem statementp. 175
6.2.2 Stochastic-approximation algorithmsp. 177
6.3 Optimal designs in the minimax sensep. 181
6.3.1 Problem statement and characterizationp. 181
6.3.2 Numerical techniques for exact designsp. 182
6.4 Robust sensor location using randomized algorithmsp. 187
6.4.1 A glance at complexity theoryp. 188
6.4.2 NP-hard problems in control-system designp. 190
6.4.3 Weakened definitions of minimap. 191
6.4.4 Randomized algorithm for sensor placementp. 193
6.5 Concluding remarksp. 198
7 Towards even more challenging problemsp. 201
7.1 Measurement strategies in the presence of correlated observationsp. 201
7.1.1 Exchange algorithm for [psi]-optimum designsp. 203
7.2 Maximization of an observability measurep. 209
7.2.1 Observability in a quantitative sensep. 210
7.2.2 Scanning problem for optimal observabilityp. 211
7.2.3 Conversion to finding optimal sensor densitiesp. 212
7.3 Summaryp. 216
8 Applications from engineeringp. 217
8.1 Electrolytic reactorp. 217
8.1.1 Optimization of experimental effortp. 219
8.1.2 Clusterization-free designsp. 220
8.2 Calibration of smog-prediction modelsp. 221
8.3 Monitoring of groundwater resources qualityp. 225
8.4 Diffusion process with correlated observational errorsp. 230
8.5 Vibrating H-shaped membranep. 232
9 Conclusions and future research directionsp. 237
Appendicesp. 245
A List of symbolsp. 247
B Mathematical backgroundp. 251
B.1 Matrix algebrap. 251
B.2 Symmetric, nonnegative definite and positive-definite matricesp. 255
B.3 Vector and matrix differentiationp. 260
B.4 Convex sets and convex functionsp. 264
B.5 Convexity and differentiability of common optimality criteriap. 267
B.6 Differentiability of spectral functionsp. 268
B.7 Monotonicity of common design criteriap. 271
B.8 Integration with respect to probability measuresp. 272
B.9 Projection onto the canonical simplexp. 274
B.10 Conditional probability and conditional expectationp. 275
B.11 Some accessory inequalities from statistical learning theoryp. 277
B.11.1 Hoeffding's inequalityp. 277
B.11.2 Estimating the minima of functionsp. 278
C Statistical properties of estimatorsp. 279
C.1 Best linear unbiased estimators in a stochastic-process settingp. 279
C.2 Best linear unbiased estimators in a partially uncorrelated frameworkp. 284
D Analysis of the largest eigenvaluep. 289
D.1 Directional differentiabilityp. 289
D.1.1 Case of the single largest eigenvaluep. 289
D.1.2 Case of the repeated largest eigenvaluep. 292
D.1.3 Smooth approximation to the largest eigenvaluep. 293
E Differentiation of nonlinear operatorsp. 297
E.1 Gateaux and Frechet derivativesp. 297
E.2 Chain rule of differentiationp. 298
E.3 Partial derivativesp. 298
E.4 One-dimensional domainsp. 299
E.5 Second derivativesp. 299
E.6 Functionals on Hilbert spacesp. 300
E.7 Directional derivativesp. 301
E.8 Differentiability of max functionsp. 301
F Accessory results for PDEsp. 303
F.1 Green formulaep. 303
F.2 Differentiability w.r.t. parametersp. 304
G Interpolation of tabulated sensitivity coefficientsp. 313
G.1 Cubic spline interpolation for functions of one variablep. 313
G.2 Tricubic spline interpolationp. 314
H Differentials of Section 4.3.3p. 321
H.1 Derivation of formula (4.126)p. 321
H.2 Derivation of formula (4.129)p. 322
I Solving sensor-location problems using Maple & Matlabp. 323
I.1 Optimum experimental effort for a 1D problemp. 323
I.1.1 Forming the system of sensitivity equationsp. 324
I.1.2 Solving the sensitivity equationsp. 325
I.1.3 Determining the FIMs associated with individual spatial pointsp. 327
I.1.4 Optimizing the design weightsp. 327
I.1.5 Plotting the resultsp. 328
I.2 Clusterization-free design for a 2D problemp. 329
I.2.1 Solving sensitivity equations using the PDE Toolboxp. 329
I.2.2 Determining potential contributions to the FIM from individual spatial pointsp. 335
I.2.3 Iterative optimization of sensor locationsp. 336
Referencesp. 339
Indexp. 367
Go to:Top of Page