A Traveling Salesman Problem-Based Approach to Observation Scheduling for Satellite Constellation

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 115
  • Download : 0
This paper addresses observation task scheduling of a heterogeneous satellite constellation in low-Earth-orbits. The goal of scheduling is to find a sequence and times for observing the ground objects to maximize the sum of values of the observed ground objects while satisfying all the constraints associated with complex mission specifications. The method develops an instance of the asymmetric traveling salesman problem (ATSP) for this scheduling, and solves the resulting ATSP using a well-established Lin-Kernighan-Helsgaun algorithm. Numerical experiments demonstrate the characteristics, efficiency, and scalability of the proposed scheduling approach, in particular, compared to the first-in first-out strategy-based greedy algorithm.
Publisher
SPRINGER
Issue Date
2019-06
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF AERONAUTICAL AND SPACE SCIENCES, v.20, no.2, pp.553 - 560

ISSN
2093-274X
DOI
10.1007/s42405-019-00151-y
URI
http://hdl.handle.net/10203/262743
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0