IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2022i1p137-d1017064.html
   My bibliography  Save this article

A Closed-Form Parametrization and an Alternative Computational Algorithm for Approximating Slices of Minkowski Sums of Ellipsoids in R 3

Author

Listed:
  • Amirreza Fahim Golestaneh

    (Department of Mechanical Engineering, National University of Singapore, Singapore 117575, Singapore)

Abstract

The current work aims to develop an approximation of the slice of a Minkowski sum of finite number of ellipsoids, sliced up by an arbitrarily oriented plane in Euclidean space R 3 that, to the best of the author’s knowledge, has not been addressed yet. This approximation of the actual slice is in a closed form of an explicit parametric equation in the case that the slice is not passing through the zones of the Minkowski surface with high curvatures, namely the “corners”. An alternative computational algorithm is introduced for the cases that the plane slices the corners, in which a family of ellipsoidal inner and outer bounds of the Minkowski sum is used to construct a “narrow strip” for the actual slice of Minkowski sum. This strip can narrow persistently for a few more number of constructing bounds to precisely coincide on the actual slice of Minkowski sum. This algorithm is also applicable to the cases with high aspect ratio of ellipsoids. In line with the main goal, some ellipsoidal inner and outer bounds and approximations are discussed, including the so-called “Kurzhanski’s” bounds, which can be used to formulate the approximation of the slice of Minkowski sum.

Suggested Citation

  • Amirreza Fahim Golestaneh, 2022. "A Closed-Form Parametrization and an Alternative Computational Algorithm for Approximating Slices of Minkowski Sums of Ellipsoids in R 3," Mathematics, MDPI, vol. 11(1), pages 1-21, December.
  • Handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:137-:d:1017064
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/1/137/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/1/137/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. C. Durieu & É. Walter & B. Polyak, 2001. "Multi-Input Multi-Output Ellipsoidal State Bounding," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 273-303, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liao, Wei & Liang, Taotao & Wei, Xiaohui & Yin, Qiaozhi, 2022. "Probabilistic reach-Avoid problems in nondeterministic systems with time-Varying targets and obstacles," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    2. Zhang, Liang & Feng, Zhiguang & Jiang, Zhengyi & Zhao, Ning & Yang, Yang, 2020. "Improved results on reachable set estimation of singular systems," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    3. Yongchun Jiang & Hongli Yang & Ivan Ganchev Ivanov, 2024. "Reachable Set Estimation and Controller Design for Linear Time-Delayed Control System with Disturbances," Mathematics, MDPI, vol. 12(2), pages 1-10, January.
    4. Ligang Sun & Hamza Alkhatib & Boris Kargoll & Vladik Kreinovich & Ingo Neumann, 2019. "Ellipsoidal and Gaussian Kalman Filter Model for Discrete-Time Nonlinear Systems," Mathematics, MDPI, vol. 7(12), pages 1-22, December.
    5. Nguyen D. That & Phan T. Nam & Q. P. Ha, 2013. "Reachable Set Bounding for Linear Discrete-Time Systems with Delays and Bounded Disturbances," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 96-107, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2022:i:1:p:137-:d:1017064. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.