论文信息 - A compact algorithm for the intersection and approximation of N -dimensional polytopes - 字舞流文

A compact algorithm for the intersection and approximation of N -dimensional polytopes

V. Broman | M. Shensa

[1] J. P. Norton,et al. Fast and robust algorithm to compute exact polytope parameter bounds , 1990 .

[2] E. Walter,et al. Exact and recursive description of the feasible parameter set for bounded error models , 1987, 26th IEEE Conference on Decision and Control.

[3] J. Norton. Identification of parameter bounds for ARMAX models from records with bounded noise , 1987 .

[4] V. Broman,et al. Polytopes, a novel approach to tracking , 1986, 1986 25th IEEE Conference on Decision and Control.

[5] Arjan van der Schaft,et al. 25th IEEE Conference on Decision and Control , 1986 .

[6] M. Milanese,et al. Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimators , 1982 .

[7] B. Barmish,et al. The propagation of parametric uncertainty via polytopes , 1979 .

[8] H. Witsenhausen. Sets of possible states of linear systems given perturbed observations , 1968 .

[9] F. Schweppe. Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .