JPL Technical Report Server

Orbit clustering based on transfer cost

Show simple item record

dc.contributor.author Gustafson, Eric D.
dc.contributor.author Arrieta-Camacho, Juan J.
dc.contributor.author Petropoulos, Anastassios E.
dc.date.accessioned 2013-12-11T00:24:40Z
dc.date.available 2013-12-11T00:24:40Z
dc.date.issued 2013-02-10
dc.identifier.citation 23rd AAS/AIAA Spaceflight Mechanics Meeting, Kauai, Hawaii, February 10-14 2013 en_US
dc.identifier.clearanceno 13-0724
dc.identifier.uri http://hdl.handle.net/2014/44065
dc.description.abstract We 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. en_US
dc.description.sponsorship NASA/JPL en_US
dc.language.iso en_US en_US
dc.publisher Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2013 en_US
dc.subject cluster analysis en_US
dc.subject orbit transfers en_US
dc.subject combinatorial optimization en_US
dc.title Orbit clustering based on transfer cost en_US
dc.type Preprint en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account