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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Conflict Detection Method for Ellipsoidal Safety Regions


    Beteiligte:


    Erscheinungsdatum :

    01.08.2019


    Format / Umfang :

    1639323 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    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 | Europäisches Patentamt | 2016

    Freier Zugriff