Results 211 to 220 of about 1,465,298 (295)

Stochastic Convergence of Optimal Bounding Ellipsoid Algorithms

Journal of Circuits, Systems and Computers, 1997
Given appropriate persistency of excitation, the ellipsoidal seta associated with optimal bounding ellipsoid (OBE) algorithms with an interpretable optimization (volume) criterion, converge to a point under the condition that the model disturbance process visit the error bounds infinitely often.
Majid Nayeri, J. R. Deller, Ming-Shou Liu   +2 more
openaire   +2 more sources

Multi-Input Multi-Output Ellipsoidal State Bounding

Journal of Optimization Theory and Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Durieu, C., Walter, É., Polyak, B.
openaire   +2 more sources

Automatic bound estimation: a practical development in optimal bounding ellipsoid processing

IEEE Signal Processing Letters, 1997
Practical application of optimal bounding ellipsoid identification is made possible by the optimal bounding ellipsoid algorithm with automatic bound estimation (OBE-ABE), which automatically estimates model error bounds. Lack of tenable bounds in many real problems has rendered these interesting new methods impractical.
T.M. Lin, M. Nayeri, J.R. Deller
openaire   +2 more sources

Unifying the landmark developments in optimal bounding ellipsoid identification

International Journal of Adaptive Control and Signal Processing, 1994
AbstractA general class of optimal bounding elipsoid (OBE) algorithms, including all methods published to date, is unified into a single framework called theunified OBE (UOBE)algorithm. UOBE is based on generalized weighted recursive least squares in which very broad classes of ‘forgetting factors’ and data weights may be employed.
Deller, J. R. jun., Nayeri, M., Liu, M. S.   +2 more
openaire   +2 more sources

Model order reduction for optimal bounding ellipsoid channel models

IEEE Transactions on Magnetics, 1997
This paper presents a new algorithm for performing model order reduction for Volterra series channel models of high-density digital magnetic recording channels. We employ a set-membership approach to the problem in which a set of consistent modeling solutions bounded by an optimal ellipsoid is first developed for the channel.
S.G. McCarthy, R.B. Wells
openaire   +2 more sources

Convergence and colored noise issues in bounding ellipsoid identification

[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992
The convergence and bias properties of a general class of optimal bounding ellipsoid (OBE) algorithms are discussed. OBE algorithms are set-membership (SM) based identification algorithms which are applied to models which are linear-in-parameters, and are closely related to weighted recursive least square error (WRLS) methods. >
M. Nayeri, J.R. Deller, M.M. Krunz
openaire   +2 more sources

Identification of PWARX Model Based on Outer Bounding Ellipsoid Algorithm

International Conference on Secure and Trust Computing, Data Management and Applications, 2020
This paper concerns the identification of a trans-esterification reactor using PWARX (PieceWise AutoRegressive eXogenous) hybrid systems. The OBE (Outer Bounding Ellipsoid) algorithm is then applied in order to estimate the parameters for each sub-system.
Olfa Yahya, Z. Lassoued, K. Abderrahim
semanticscholar   +1 more source

Ellipsoid SLAM with Novel Object Initialization

2022 IEEE 18th International Conference on Automation Science and Engineering (CASE), 2022
Object-based SLAM has been widely studied in recent years. While many research works focus on representing objects as ellipsoids, the initialization is still an open problem.
Yongqi Meng, Benchun Zhou
semanticscholar   +1 more source

Computing output prediction bounds using ellipsoidal parameter bounding

Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207), 1998
The paper presents an algorithm for output prediction in linear ARX models by computing bounds on future output values. Ellipsoidal bounding is used to compute a set of future outputs consistent with the model structure, noise bounds and observed data. Simulation results are presented.
D. Maksarov, Z.S. Chalabi
openaire   +1 more source

Ellipsoidal Bounding Techniques for Parameter Tracking

IFAC Proceedings Volumes, 1997
Abstract This paper deals with outerbounding time-varying parameter vectors. The approach proposed is based on ellipsoidal techniques that offer an attractive alternative to least squares and Kalman filtering. Two measures of the size of an ellipsoid are considered, namely its volume and the sum of the squares of its semi-saxes.
Cécile Durieu, Eric Walter, Boris Polyak   +2 more
openaire   +1 more source