PDF(687 KB)
Dispatchable Processing Method of Resource Constraint in Spacecraft Mission Planning
- CHEN Dexiang1, XU Wenming1, DU Zhiyuan2, XU Rui1
Author information
+
1. School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China
2. Unit 92493 of PLA, Huludao 125000, China
Show less
History
+
| Received |
Revised |
Published |
| 14 Oct 2014 |
01 Jun 2015 |
20 May 2022 |
| Issue Date |
|
| 20 May 2022 |
|
Considering the uncertainty and disturbance of environment in deep space exploration, spacecraft need to use mission planning technology to realize autonomous control. When a spacecraft applies the planning algorithm in aerospace engineering actirities, the time constraints and resource constraints should be considered. By analyzing the relationship between resource constraints, the dispatchable processing method of reusable resources in the execution of planning and the standard to determine whether resource value is dispatchable are proposed. Through the spacecraft simulation example, the dispatchable processing method of reusable resource in planning implementation is demonstrated to be valid.
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
This is a preview of subscription content, contact
us for subscripton.
References
[1] Muscettola N, Morris P, Tsamardinos I. Reformulating temporal plans for efficient execution[C]//Proceedings of the 6th Intelligence Conference on Principles of Knowledge Representation and Reasoning. Trento, Italy:[s.n.], 1998:444-452.
[2] Tsamardinos I, Muscettola N, Morris P. Fast transformation of temporal plans for efficient execution[C]//Proceedings of the 15th National Conference on Artificial Intelligence. Madison, USA :[s. n.], 1998:254-261.
[3] Wallace R J, Freuder E C. Dispatchable execution of schedules involving consumable resources[C]//Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems. Breckenridge, USA:[s.n.], 2000:283-290.
[4] Yalçınkaya Ö, Bayhan G M. A feasible timetable generator simulation modelling framework for train scheduling problem[J]. Simulation Modelling Practice and Theory, 2012,20(1):124-141.
[5] Muscettola N. Computing the envelope for stepwise-constant resource allocations[C]//Principles and Practice of Constraint Programming-CP 2002. Berlin Heidelberg: Springer, 2002:139-154.
[6] 李玉庆,王日新,徐敏强,等.基于改进遗传算法的一类多资源测控调度问题研究[J].宇航学报,2012,33(1):85-90.[Li Y Q,Wang R X,Xu M Q,et al.An improved genetic algorithm for a class of multi-resource range scheduling problem[J]. Journal of Astronautics, 2012,33(1):85-90.]
AI Summary
