A tree-based approach for efficient and accurate conjunction analysis

Michael Mercurio, Puneet Singla

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Conjunction analysis is the study of possible collisions between objects in space. Conventional conjunction analysis algorithms are geared towards computing the collision probability between any two resident space objects. Currently, there are few heuristic methods available to select which objects should be considered for a detailed collision analysis. A simple all-on-all collision analysis results in an O(N2) procedure, which quickly becomes intractable for large datasets. The main objective of this research work is to preemptively determine which catalogued objects should be considered for a more detailed conjunction analysis, significantly reducing the number of object pairs to be investigated. The heart of the approach lies in the efficient kd-tree algorithm. It has been found that this binary search method significantly reduces computational cost to a tractable complexity of O(N logN). The conventional tree-based search is modified slightly by accounting for probabilistic nearest neighbors via the Hellinger Distance. Finally, the method is extended to account for Non-Gaussian errors via the inclusion of Gaussian Mixture Models. It has been found that the reduced computational complexity of the kd-tree is maintained, while the applicability of the method is extended to uncertain cases.

Original languageEnglish (US)
Pages (from-to)229-256
Number of pages28
JournalCMES - Computer Modeling in Engineering and Sciences
Volume111
Issue number3
StatePublished - Jan 1 2016

Fingerprint

Collision
Heuristic methods
Kd-tree
Computational complexity
Hellinger Distance
Binary search
Algorithm Analysis
Gaussian Mixture Model
Tree Algorithms
Costs
Heuristic Method
Search Methods
Large Data Sets
Computational Cost
Nearest Neighbor
Computational Complexity
Inclusion
Object
Computing

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Computer Science Applications

Cite this

@article{340f41883bb94347a06701b3fadfe52a,
title = "A tree-based approach for efficient and accurate conjunction analysis",
abstract = "Conjunction analysis is the study of possible collisions between objects in space. Conventional conjunction analysis algorithms are geared towards computing the collision probability between any two resident space objects. Currently, there are few heuristic methods available to select which objects should be considered for a detailed collision analysis. A simple all-on-all collision analysis results in an O(N2) procedure, which quickly becomes intractable for large datasets. The main objective of this research work is to preemptively determine which catalogued objects should be considered for a more detailed conjunction analysis, significantly reducing the number of object pairs to be investigated. The heart of the approach lies in the efficient kd-tree algorithm. It has been found that this binary search method significantly reduces computational cost to a tractable complexity of O(N logN). The conventional tree-based search is modified slightly by accounting for probabilistic nearest neighbors via the Hellinger Distance. Finally, the method is extended to account for Non-Gaussian errors via the inclusion of Gaussian Mixture Models. It has been found that the reduced computational complexity of the kd-tree is maintained, while the applicability of the method is extended to uncertain cases.",
author = "Michael Mercurio and Puneet Singla",
year = "2016",
month = "1",
day = "1",
language = "English (US)",
volume = "111",
pages = "229--256",
journal = "CMES - Computer Modeling in Engineering and Sciences",
issn = "1526-1492",
publisher = "Tech Science Press",
number = "3",

}

A tree-based approach for efficient and accurate conjunction analysis. / Mercurio, Michael; Singla, Puneet.

In: CMES - Computer Modeling in Engineering and Sciences, Vol. 111, No. 3, 01.01.2016, p. 229-256.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A tree-based approach for efficient and accurate conjunction analysis

AU - Mercurio, Michael

AU - Singla, Puneet

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Conjunction analysis is the study of possible collisions between objects in space. Conventional conjunction analysis algorithms are geared towards computing the collision probability between any two resident space objects. Currently, there are few heuristic methods available to select which objects should be considered for a detailed collision analysis. A simple all-on-all collision analysis results in an O(N2) procedure, which quickly becomes intractable for large datasets. The main objective of this research work is to preemptively determine which catalogued objects should be considered for a more detailed conjunction analysis, significantly reducing the number of object pairs to be investigated. The heart of the approach lies in the efficient kd-tree algorithm. It has been found that this binary search method significantly reduces computational cost to a tractable complexity of O(N logN). The conventional tree-based search is modified slightly by accounting for probabilistic nearest neighbors via the Hellinger Distance. Finally, the method is extended to account for Non-Gaussian errors via the inclusion of Gaussian Mixture Models. It has been found that the reduced computational complexity of the kd-tree is maintained, while the applicability of the method is extended to uncertain cases.

AB - Conjunction analysis is the study of possible collisions between objects in space. Conventional conjunction analysis algorithms are geared towards computing the collision probability between any two resident space objects. Currently, there are few heuristic methods available to select which objects should be considered for a detailed collision analysis. A simple all-on-all collision analysis results in an O(N2) procedure, which quickly becomes intractable for large datasets. The main objective of this research work is to preemptively determine which catalogued objects should be considered for a more detailed conjunction analysis, significantly reducing the number of object pairs to be investigated. The heart of the approach lies in the efficient kd-tree algorithm. It has been found that this binary search method significantly reduces computational cost to a tractable complexity of O(N logN). The conventional tree-based search is modified slightly by accounting for probabilistic nearest neighbors via the Hellinger Distance. Finally, the method is extended to account for Non-Gaussian errors via the inclusion of Gaussian Mixture Models. It has been found that the reduced computational complexity of the kd-tree is maintained, while the applicability of the method is extended to uncertain cases.

UR - http://www.scopus.com/inward/record.url?scp=85028851674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028851674&partnerID=8YFLogxK

M3 - Article

VL - 111

SP - 229

EP - 256

JO - CMES - Computer Modeling in Engineering and Sciences

JF - CMES - Computer Modeling in Engineering and Sciences

SN - 1526-1492

IS - 3

ER -