Distributed outer approximation of the intersection of ellipsoids
The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices modeling the quality of each sensor. We propose a distributed algorithm to solve this problem when these matrices are defined over the network's nodes. This is of particular significance as it is the first decentralized algorithm capable of computing the covariance intersection ellipsoid by combining information from the entire network using only local interactions. The solution is based on a reformulation of the centralized problem, leading to a local protocol based on exact dynamic consensus tools. After reaching consensus, the protocol converges to an outer Lowner-John ellipsoid in finite time, and to the global optimum asymptotically. Formal convergence analysis and numerical experiments are provided to validate the proposal's advantages.
Code (0)
등록된 구현이 없습니다.
Tasks
Sensor FusionSimilar Papers 제목 키워드 기반
Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression
The least squares (LS) estimate is the archetypical solution of linear regression problems. The asymptotic Gaussianity of the scaled LS error is often used to construct approximate confidence ellipsoids around the LS est…
regressionGeneralized Outer Bounds on the Finite Geometric Sum of Ellipsoids
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously …
Ellipsotopes: Combining Ellipsoids and Zonotopes for Reachability Analysis and Fault Detection
Ellipsoids are a common representation for reachability analysis, because they can be transformed efficiently under affine maps, and allow conservative approximation of Minkowski sums, which let one incorporate uncertain…
Fault DetectionDistribution-Free Confidence Ellipsoids for Ridge Regression with PAC Bounds
Linearly parametrized models are widely used in control and signal processing, with the least-squares (LS) estimate being the archetypical solution. When the input is insufficiently exciting, the LS problem may be unsolv…
Event-triggered Observability: A Set-membership Perspective
This work attempts to discuss the observability of linear time-invariant systems with event-triggered measurements. A new notion of observability, namely, $\epsilon$-observability is defined with parameter $\epsilon$, wh…