An Approach for Spacecraft Operational Task Scheduling Considering Constrained Space–Ground TT&C Resources and Task Splitting
Guardat en:
| Publicat a: | Aerospace vol. 12, no. 12 (2025), p. 1077-1108 |
|---|---|
| Autor principal: | |
| Altres autors: | , , , , |
| Publicat: |
MDPI AG
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3286238531 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2226-4310 | ||
| 024 | 7 | |a 10.3390/aerospace12121077 |2 doi | |
| 035 | |a 3286238531 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 231330 |2 nlm | ||
| 100 | 1 | |a Tang, Jianqiang | |
| 245 | 1 | |a An Approach for Spacecraft Operational Task Scheduling Considering Constrained Space–Ground TT&C Resources and Task Splitting | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a This paper proposes a scheduling approach for multi-type spacecraft operational tasks that can be interleaved, considering constrained space–ground telemetry, tracking, and command (TT&C) resources, as well as task splitting. A mixed-integer linear programming model is formulated to maximize the total task completion reward under service time-window constraints for splittable and unsplittable routine tasks, continuous tracking requirements, coupling relationships between routine and continuous tracking tasks, temporal logic dependencies, visibility constraints, and non-overlapping scheduling conditions. To improve solution efficiency and scheduling performance, a heuristic algorithm that combines priority rules with partial backtracking is developed. Task priorities are determined based on completion rewards, due times, execution durations, and temporal relationships, and scheduling is refined to avoid conflicts with predefined constraints. A partial backtracking mechanism guided by task release times enables effective adjustment when TT&C requirements cannot be satisfied. Comparative experiments with CPLEX and four heuristic algorithms validate the effectiveness of the proposed method. | |
| 653 | |a Linear programming | ||
| 653 | |a Task scheduling | ||
| 653 | |a Splitting | ||
| 653 | |a Integer programming | ||
| 653 | |a Mathematical models | ||
| 653 | |a Space stations | ||
| 653 | |a Tracking | ||
| 653 | |a Spacecraft | ||
| 653 | |a Heuristic | ||
| 653 | |a Heuristic methods | ||
| 653 | |a Mathematical programming | ||
| 653 | |a Scheduling | ||
| 653 | |a Temporal logic | ||
| 653 | |a Telemetry | ||
| 653 | |a Genetic algorithms | ||
| 653 | |a Effectiveness | ||
| 653 | |a Algorithms | ||
| 653 | |a Astronauts | ||
| 653 | |a Mixed integer | ||
| 653 | |a Satellites | ||
| 653 | |a Constraints | ||
| 653 | |a Optimization algorithms | ||
| 653 | |a Data transmission | ||
| 653 | |a Conflict resolution | ||
| 700 | 1 | |a Hou Yueyi | |
| 700 | 1 | |a Wu, Shan | |
| 700 | 1 | |a Si Zhaokai | |
| 700 | 1 | |a Xu, Jin | |
| 700 | 1 | |a Chao, Qi | |
| 773 | 0 | |t Aerospace |g vol. 12, no. 12 (2025), p. 1077-1108 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3286238531/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3286238531/fulltextwithgraphics/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3286238531/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |