A novel pairwise comparison algorithm that determines whether a pair of ellipsoids is overlapping, touching, or separated by exploiting two new Mahalanobis distance conditions is presented. These conditions are filtering steps prior to a previously proposed method that transforms the intersection query problem into a least squares minimization over a sphere. The algorithm introduced here is shown to be more computationally efficient than previous methods, which either solve the least squares minimization over a sphere or check the signs of the roots of a fourth order polynomial. The proposed method may be applied in cases when an ellipsoid is an appropriate safety region. The resulting algorithm is useful in applications including, but not limited to, collision detection and avoidance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Conflict Detection Method for Ellipsoidal Safety Regions




    Publication date :

    2019-08-01


    Size :

    1639323 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Space Vehicle Conflict Probability for Ellipsoidal Conflict Volumes (AAS 07-394)

    Patera, R.P. / American Astronautical Society / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2008


    Ellipsoidal Balloon Antenna

    Cramer, P. W. | NTRS | 1985


    Ellipsoidal V-hull

    RICKBORN CHRISTOPHER / RICKBORN SPENCER | European Patent Office | 2016

    Free access