Results 211 to 220 of about 1,686,514 (289)
Some of the next articles are maybe not open access.

Multi-Input Multi-Output Ellipsoidal State Bounding

Journal of Optimization Theory and Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. Durieu, E. Walter, Boris Polyak
semanticscholar   +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.
J. Deller, M. Nayeri, M. S. Liu
semanticscholar   +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. Deller, M. Krunz
semanticscholar   +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. Mccarthy, R. Wells
semanticscholar   +2 more sources

An ellipsoid bounding of reachable systems with delay and bounded peak inputs

IFAC Proceedings Volumes, 2003
Abstract Linear systems with constant coefficients and time-varying delays are considered. We address the problem of finding an ellipsoid that bounds the set of the states (in the Euclidean space) that are reachable from the origin in finite time by inputs with peak value that is bounded by a prechosen positive scalar.
Fridman Emilia, Shaked Uri
semanticscholar   +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   +2 more
openaire   +1 more source

Predictive actuator fault‐tolerant control under ellipsoidal bounding

International Journal of Adaptive Control and Signal Processing, 2015
SummaryThe paper is devoted to the issue of a robust predictive fault‐tolerant control for linear discrete‐time systems with an application of an ellipsoidal inner bounding of a robust invariant set. The crucial issue is to maintain the state of the system inside the robust invariant feasible set, which is a set of states guaranteeing the stability of ...
Witczak, Marcin   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy