Stretch-Contract Operator in the Ellipsoidal Approximation of the Minkowski Sum of Convex Sets
DOI:
https://doi.org/10.47839/ijc.21.1.2517Keywords:
stretch-contract operator, state space, attainability set, ellipsoidal approximation, linear control system, multidimensional volume of an ellipsoid, sum of positive degrees of ellipsoid semiaxes, criterion for minimizing an ellipsoidAbstract
The space expansion-contraction operator was originally developed to solve mathematical programming problems. However, it can be successfully applied to solve the problem of ellipsoidal approximation of the information set in the state space analytically specified. In this case, a main property of the operator - space compression is used to minimize the approximating ellipsoid by a multidimensional volume. The paper shows the use of the specified expansion-contraction operator to approximate a set of attainability of the linear control system as an example. The main goal of the paper is to give analytical and geometric representations of the specified operator in order to show its action in the approximation problem. For this purpose, the paper shows an analytical derivation of the operator and a geometric illustration of each parameter of the operator. The results of minimum approximation modeling by this operator compared with other known solutions have been also presented. The simulation results are given both numerically and graphically. Based on the results of comparison, conclusions are made and recommendations are given in the use of ellipsoidal approximation of information sets according to different criteria for minimizing the approximating ellipsoid. Typical examples of ellipsoidal approximation, which show when it is expedient to use the proposed of expansion-contraction operator, have been given.
References
F. L. Chernousko, “Ellipsoidal approximation of attainability sets of a linear system with indeterminate matrix,” Journal of Applied Mathematics and Mechanics, vol. 60, issue 6, pp. 921-931, 1996. https://doi.org/10.1016/S0021-8928(96)00114-1.
W. M. J. Firey, “p-Means of convex bodies,” Mathematica Scandinavica, vol. 10, pp. 17–24, 1962. https://doi.org/10.7146/math.scand.a-10510.
D. M. Mount, Computational Geometry. University of Maryland. 2002. 122 p.
K. Matsuura, A. Tsuchiya, “Matrix geometry for ellipsoids,” Progress of Theoretical and Experimental Physics, vol. 2020, issue 3, 033B05, 2020. https://doi.org/10.1093/ptep/ptz171.
L. Rotem, “Support functions and mean width for -concave function,” Advances in Mathematics, vol. 243, pp. 168-186, 2013. https://doi.org/10.1016/j.aim.2013.03.023.
F. Dabbene, D. Henrion, “Set approximation via minimum-volume polynomial sublevel sets,” Proceedings of the European Control Conference, 2013, pp. 1114-1119, https://doi.org/10.23919/ECC.2013.6669148.
N. Z. Shor, “The cut-off method with space stretching for solving convex programming problems,” Cybernetics, issue 1, pp. 94-95, 1977. https://doi.org/10.1007/BF01071394.
O. V. Sholokhov, “Investigation and simulating of algorithm of building of set of attainability of linear controlled system,” Proceedings of the 4th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2007,” Dortmund, Germany, September 6-8, 2007, pp. 355-360. https://doi.org/10.1109/IDAACS.2007.4488439.
O.V. Sholokhov, “Minimum-volume ellipsoidal approximation of the sum of two ellipsoids,” Cybernetics and Systems Analysis, vol. 47, pp. 954–960, 2011. https://doi.org/10.1007/s10559-011-9375-6.
P. Brunovský, “A classification of linear controllable systems,” Kybernetika, vol. 6, issue 3, pp. 173-188, 1970. [Online]. Available at: http://dml.cz/dmlcz/125221.
A. Sadegh et al., Marks Standard Handbook for Mechanical Engineers, 12th Edition. McGraw-Hill. 2017, 1536 p.
M. Runger, P. Tabuada, “Computing robust controlled invariant sets of linear systems,” IEEE Transaction Automatic Control, vol. 62, no. 7, pp. 3665-3670, 2017, https://doi.org/10.1109/TAC.2017.2672859.
T. Anevlavis, P. Tabuada, “Computing controlled invariant sets in two moves,” Proceedings of the 2019 IEEE 58th Conference on Decision and Control, 2019, pp. 6248-6254, https://doi.org/10.1109/CDC40024.2019.9029610.
A. Wintenberg, N. Ozay, “Implicit invariant sets for high-dimensional switched affine systems,” Proceedings of the 59th IEEE Conference on Decision and Control, 2020, pp. 3291-3297, https://doi.org/10.1109/CDC42340.2020.9303986.
J. Zhang, M. Söpper, F. Holzapfel, “Attainable moment set optimization to support configuration design: a required moment set based approach,” Applied Sciences, vol. 11, issue 8, 3685, 2021, https://doi.org/10.3390/app11083685.
E. Lutwak, “The Brunn-Minkowski-Firey theory I: Mixed volumes and the Minkowski problem,” Journal of Differential Geometry, vol. 38, no. 1, pp. 131–150, 1993. https://doi.org/10.4310/jdg/1214454097.
E. Lutwak, “The Brunn-Minkowski-Firey theory II: Affine and geominimal surface areas,” Advances in Mathematics, vol. 118, no. 2, pp. 244–294, 1996. https://doi.org/10.1006/aima.1996.0022.
H.-P. Shröcker, “Uniqueness results for minimal enclosing ellipsoids,” Computer Aided Geometric Design, vol 25, issue 9, 2008, pp. 756-762. https://doi.org/10.1016/j.cagd.2008.07.007.
N.D. Pankratova, O.V. Sholokhov, “Development of the robust algorithm of guaranteed ellipsoidal estimation and its application for orientation of the artificial earth satellite,” Cybernetics and Systems Analysis, vol. 55, pp. 81–89, 2019. https://doi.org/10.1007/s10559-019-00114-x.
V.A. Khonin, “Guaranteed estimates of the state of linear systems using ellipsoids,” Evolutionary Systems in Estimation Problems, Sverdlovsk: Ural Scientific Center of the Academy of Sciences of the USSR, pp. 104-123, 1985.
F. You, H. Zhang, F. Wang, “A new set-membership estimation method based on zonotopes and ellipsoids,” Transactions of the Institute of Measurement and Control, vol. 40, issue 7, pp. 2091-2099, 2018. https://doi.org/10.1177/0142331216655398.
W. Tang, Q., Zhang, Z. Wang, Y. Shen, “Ellipsoid bundle and its application to set-membership estimation,” IFAC-Papers online, vol. 53, issue 2, pp. 13688-13693, 2020. https://doi.org/10.1016/j.ifacol.2020.12.871.
M. Althoff, G. Frehse, A. Girard, “Set propagation techniques for reachability analysis. annual review of control, robotics, and autonomous systems,” Annual Reviews, vol. 4, issue 1, 2021. https://doi.org/10.1146/annurev-control-071420-081941.
A. Halder, “Smallest ellipsoid containing p-sum of ellipsoids with application to reachability analysis,” IEEE Transaction on Automatic Control, vol. 66, issue 6, pp. 2512-2525, 2020. https://doi.org/10.1109/TAC.2020.3009036.
Y. Becis-Aubry, N. Ramdani, “State-bounding estimation for nonlinear models with multiple measurements,” 2012 American Control Conference Fairmont Queen Elizabeth, Montreal, Canada, June 27-29, 2012. https://doi.org/10.1109/ACC.2012.6315596.
L. Asselborn, D. Groß, O. Stursberg, “Control of uncertain nonlinear systems using ellipsoidal reachability calculus,” Proceedings of the 9th IFAC Symposium on Nonlinear Control Systems, Toulouse, France, September 4-6, 2013, pp. 50-55. https://doi.org/10.3182/20130904-3-FR-2041.00204.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
