A direct method for checking overlap of two hyperellipsoids

In this work, we propose a method for checking whether two arbitrary-dimensional hyperellipsoids overlap without making use of any optimization or root-finding methods. This is achieved by formulating an overlap condition as a polynomial root counting problem, which can be solved directly. The addressed challenges involve the inversion of a polynomial matrix using a direct method. The proposed approach extends one of our earlier results, which was restricted to certain combinations of ellipsoids and yields a fixed run-time for a fixed problem dimensionality. Thus, for the first time, an algorithm for checking overlap of arbitrary hyperellipsoids is proposed that can be evaluated in closed form. That is, in the absence of cut-off errors, the proposed method yields an exact result after a finite number of steps.

[1]  Uwe D. Hanebeck.  Lokalisierung eines mobilen Roboters mittels effizienter Auswertung von Sensordaten und mengenbasierter Zustandsschätzung , 1997 .

[2]  Xiaohong Jia,et al.  An algebraic approach to continuous collision detection for ellipsoids , 2011, Comput. Aided Geom. Des..

[3]  Uwe D. Hanebeck,et al.  A robust computational test for overlap of two arbitrary-dimensional ellipsoids in fault-detection of Kalman filters , 2012, 2012 15th International Conference on Information Fusion.

[4]  Gershon Elber,et al.  Continuous Collision Detection for Ellipsoids , 2009, IEEE Transactions on Visualization and Computer Graphics.

[5]  Wenping Wang,et al.  An algebraic condition for the separation of two ellipsoids , 2001, Comput. Aided Geom. Des..

[6]  Antonio Visioli,et al.  Digital Control Engineering: Analysis and Design , 2009 .

[7]  Wenping Wang,et al.  Continuous Collision Detection for Two Moving Elliptic Disks , 2006, IEEE Transactions on Robotics.

[8]  M. Coste.  AN INTRODUCTION TO SEMIALGEBRAIC GEOMETRY , 2002 .

[9]  T. Kerr.  Real-time failure detection: A nonlinear optimization problem that yields a two-ellipsoid overlap test , 1977 .

[10]  Thomas H. Kerr.  Statistical analysis of a two-ellipsoid overlap test for real-time failure detection , 1980 .

[11]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[12]  T. Kerr.  A two ellipsoid overlap test for real time failure detection and isolation by confidence regions , 1974, CDC 1974.

[13]  Pramook Khungurn.  Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms , 2007 .

[14]  Salvatore Alfano,et al.  Determining If Two Solid Ellipsoids Intersect , 2003 .

[15]  J. Perram,et al.  Statistical Mechanics of Hard Ellipsoids. I. Overlap Algorithm and the Contact Function , 1985 .

[16]  Federico Thomas,et al.  An ellipsoidal calculus based on propagation and fusion , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[17]  Claude-Pierre Jeannerod,et al.  Essentially optimal computation of the inverse of generic polynomial matrices , 2005, J. Complex..

[18]  Arne Storjohann,et al.  On the complexity of inverting integer and polynomial matrices , 2015, computational complexity.

[19]  Basil G. Mertzios.  Leverrier's algorithm for singular systems , 1984 .

[20]  Pramook Khungurn,et al.  Minimum converging precision of the QR-factorization algorithm for real polynomial GCD , 2007, ISSAC '07.

[21]  Kiyoshi Shirayanagi,et al.  A Theory of Stabilizing Algebraic Algorithms , 1995 .