Cited 7 time in
Optimal Scheduling of Imaging Missions for Multiple Satellites Using Linear Programming Model
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ayana, Selewondim Eshetu | - |
| dc.contributor.author | Kim, Hae-Dong | - |
| dc.date.accessioned | 2023-01-05T00:47:05Z | - |
| dc.date.available | 2023-01-05T00:47:05Z | - |
| dc.date.issued | 2023-04 | - |
| dc.identifier.issn | 2093-274X | - |
| dc.identifier.issn | 2093-2480 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/30000 | - |
| dc.description.abstract | Efficient scheduling of multiple missions for Earth-monitoring satellites contributes to an essential upgrade in the optimality of spacecraft observation systems for lower Earth orbit (LEO). Nowadays, tasks of a satellite are getting more complex due to advances in the satellite's operating and controlling mechanisms. As a result of these changes, the satellite's mission scheduling problem needs to consider its parametrical properties and computing resources. Since it is challenging to consider various mission constraints and parameters manually, it is necessary to design an effective optimization model for scheduling problems. For this purpose, we proposed a new mixed-integer linear programming (MILP) strategy that utilizes a branch and bound (BB) method to compute satellites' imaging mission scheduling. The proposed optimization model maximizes the value of an objective function considering different factors such as satellite resource consumption and user-request priority. In addition, to validate the effectiveness of the proposed strategy, we assumed complex imaging missions for satellite control systems containing various satellites with multiple operational modes. The simulation considered three different operating modes for satellites (i.e., 'general mode,' 'commercial mode,' and 'tactical mode') to confirm the efficiency of the proposed optimization model. As a result, the proposed strategy provides an optimal solution with an improved computational time. Finally, the developed model provides a better result compared to a previously used suboptimal metaheuristic genetic algorithm. | - |
| dc.format.extent | 11 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | The Korean Society for Aeronautical & Space Sciences | - |
| dc.title | Optimal Scheduling of Imaging Missions for Multiple Satellites Using Linear Programming Model | - |
| dc.title.alternative | Optimal Scheduling of Imaging Missions for Multiple Satellites Using Linear Programming Model | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.doi | 10.1007/s42405-022-00543-7 | - |
| dc.identifier.scopusid | 2-s2.0-85141780115 | - |
| dc.identifier.wosid | 000882741300001 | - |
| dc.identifier.bibliographicCitation | International Journal of Aeronautical and Space Sciences, v.24, no.2, pp 559 - 569 | - |
| dc.citation.title | International Journal of Aeronautical and Space Sciences | - |
| dc.citation.volume | 24 | - |
| dc.citation.number | 2 | - |
| dc.citation.startPage | 559 | - |
| dc.citation.endPage | 569 | - |
| dc.type.docType | Article | - |
| dc.identifier.kciid | ART002955455 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | kci | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Aerospace | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordPlus | OPTIMIZATION | - |
| dc.subject.keywordAuthor | Scheduling optimization | - |
| dc.subject.keywordAuthor | Multiple mission | - |
| dc.subject.keywordAuthor | Operation mode | - |
| dc.subject.keywordAuthor | Resource constraint | - |
| dc.subject.keywordAuthor | MILP | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
