Computationally efficient algorithms for state estimation with ellipsoidal approximations

International Journal of Adaptive Control and Signal Processing

Volumn 16, Issue 6, 2002, Pages 411-434

  Maksarov, D G ^a   Norton, J P ^b  

^a Bear Stearns International   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Ellipsoidal bonding; State estimation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONTROL SYSTEM ANALYSIS; DISCRETE TIME CONTROL SYSTEMS; LINEAR CONTROL SYSTEMS;

COMPUTATIONALLY EFFICIENT ALGORITHMS; ELLIPSOIDAL APPROXIMATIONS; ELLIPSOIDAL BOUNDING;

STATE ESTIMATION;

EID: 0036679138     PISSN: 08906327     EISSN: None     Source Type: Journal    
DOI: 10.1002/acs.696     Document Type: Article

References (18)

1. Recursive state estimation: Unknown but bounded errors and system inputs
2. Continuous-time state estimation under disturbances bounded by convex sets
3. Polytopes, a novel approach to tracking
4. Recursive state bounding by parallelotopes
5. State bounding with ellipsoidal set description of the uncertainty
6. Optimal guaranteed estimates of indeterminacies with the aid of ellipsoids, I
7. Optimal guaranteed estimates of indeterminacies with the aid of ellipsoids, II
8. On the value of information in system identification - Bounded noise case
9. An improved parameter identification algorithm for signals with unknown-but-bounded errors
10. Fast and robust algorithm to compare exact polytope parameter bounds
11. Identification and application of bounded-parameter models
12. Parameter estimation algorithms for a set-membership description of uncertainty
13. Minimal volume ellipsoids
14. Trace versus determinant in ellipsoidal outer-bounding with application to state estimation
15. Tuning of noise bounds in state bounding
16. The ellipsoid method: A survey
17. An optimal volume ellipsoid algorithm for parameter set estimation