NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Orbit Clustering Based on Transfer CostWe propose using cluster analysis to perform quick screening for combinatorial global optimization problems. The key missing component currently preventing cluster analysis from use in this context is the lack of a useable metric function that defines the cost to transfer between two orbits. We study several proposed metrics and clustering algorithms, including k-means and the expectation maximization algorithm. We also show that proven heuristic methods such as the Q-law can be modified to work with cluster analysis.
Document ID
20150007330
Acquisition Source
Jet Propulsion Laboratory
Document Type
Conference Paper
External Source(s)
Authors
Gustafson, Eric D.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Arrieta-Camacho, Juan J.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Petropoulos, Anastassios E.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
May 5, 2015
Publication Date
February 10, 2013
Subject Category
Astrodynamics
Report/Patent Number
AAS 13-297
Meeting Information
Meeting: AAS/AIAA Space Flight Mechanics Meeting
Location: Kauai, HI
Country: United States
Start Date: February 10, 2013
End Date: February 14, 2013
Sponsors: American Astronautical Society, American Inst. of Aeronautics and Astronautics
Distribution Limits
Public
Copyright
Other
Keywords
combinatorial optimization
orbit transfers
cluster analysis

Available Downloads

There are no available downloads for this record.
No Preview Available