A consistently convergent OBE algorithm with automatic estimation of error bounds

✍ Scribed by T. M. Lin; M. Nayeri; J. R. Deller Jr.

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 257 KB
• Volume: 12
• Category: Article
• ISSN: 0890-6327
• DOI: 10.1002/(sici)1099-1115(199806)12:4<305::aid-acs491>3.0.co;2-v

✦ Synopsis

Conventional optimal bounding ellipsoid (OBE) algorithms require a priori knowledge of error bounds which is unknown in most applications. Conservative (overestimated) error bounds used in practice may lead to inconsistent parameter estimation. This paper presents an enhanced OBE algorithm that is proven to be consistently convergent without a priori knowledge of error bounds. Only a lower bound of the 'tail probability' of the disturbance process is required. Simulations comparing conventional and the enhanced OBE algorithm is provided.