Smallest Ellipsoid Containing p-Sum of Ellipsoids With Application to Reachability Analysis

In this article the problem of ellipsoidal bounding of convex set-valued data, where the convex set is obtained by the <inline-formula><tex-math notation="LaTeX">p</tex-math></inline-formula>-sum of finitely many ellipsoids, for any real <inline-formula><te...

Full description

Bibliographic Details

Published in:	IEEE transactions on automatic control Vol. 66; no. 6; pp. 2512 - 2525
Main Author:	Halder, Abhishek
Format:	Journal Article
Language:	English
Published:	IEEE 01.06.2021
Subjects:	Approximation algorithms Collision avoidance Computational modeling Ellipsoidal calculus Ellipsoids Firey <inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> p</tex-math> </inline-formula>-sum optimal ellipsoid outer approximation Programming reach sets Shape Uncertainty
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!