Exact recursive polyhedral description of the feasible parameter set for bounded-error models
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 34 (8) , 911-915
- https://doi.org/10.1109/9.29443
Abstract
A method is described which exactly characterizes the set of all the values of the parameter vector of a linear model that are consistent with bounded errors on the measurements. It provides a parameterized expression of this set, which can be used for robust control design or for optimizing any criterion over the set. This approach is based on a new variant of the double description method for determining the edges of a polyhedral cone. It can be used in real time and provides a suitable context for implementation on a computer. Whenever a new measurement modifies the set, the characterization is updated. The technique is illustrated with a simple example.Keywords
This publication has 9 references indexed in Scilit:
- Parameter-bounding identification algorithms for bounded-noise recordsIEE Proceedings D Control Theory and Applications, 1988
- Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noiseIEEE Transactions on Information Theory, 1987
- Polytopes, a novel approach to trackingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Robust nonlinear parameter estimation in the bounded noise casePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimatorsIEEE Transactions on Automatic Control, 1982
- On the value of information in system identification—Bounded noise caseAutomatica, 1982
- A counterexample to Greenberg's algorithm for solving linear inequalitiesNumerische Mathematik, 1976
- An algorithm for determining redundant inequalities and all solutions to convex polyhedraNumerische Mathematik, 1975
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965