面向试验任务的通信综合网络管理系统应用

分析了目前试验任务通信网络管理的现状,实现了一套基于现有通信网络传输方式、立足目前通信系统值勤模式、面向执行试验任务过程中通信保障的综合通信网络管理系统,举例说明了该套系统在试验任务中的应用情况,总结分析了该通信综合网管系统的特点,为通信综合网管系统的推广应用进行了有益的实践探索。     

Group dynamics in a long-term blind endeavor on Earth: An analog for space missions (Lewis & Clark Expedition group dynamic analysis)

In 1803, President Thomas Jefferson set fourth a military expedition led by Captains M. Lewis and W. Clark (Lewis and Clark Expedition) on an exploration that would become an everlasting part of US national history and pride. Looking back at the events of this exploration, there are many similarities to the experiences future human space explorers will face as we look to colonize the Moon and travel to Mars and beyond (NASA Vision for Space Exploration, 2004):

–

The Lewis and Clark Expedition lasted almost three years and involved a crew of 43 men traveling up the Missouri River to explore the unknown lands and a possible water route to the Pacific Ocean;     

基于三分图的非共面卫星分布式加注任务规划

分布式加注规划的目的在于规划加注过程的交会路径,使任务在满足约束的情况下整体燃料消耗最优。针对异面圆轨道卫星间的分布式加注策略,建立了分布式加注任务规划问题的数学模型,把该规划问题归结为非完全赋权三分图的匹配问题,并将整体最少燃料消耗作为规划目标。其次,进行了算法的流程设计,采用了Kuhn-Mundres图论算法和整数遗传算法相结合的LSGA算法加快了收敛的速度保证了全局最优。最后,选取了两个具有小角度轨道偏差的异面卫星星座对该问题进行分析。计算得到了优化后的双冲量机动下加注任务的服务关系与燃料代价,规划算法的有效性也得到了验证。     

深空探测器约束简化与任务规划方法研究

针对深空探测器现有的任务规划方法在处理系统间复杂约束时存在的约束复杂度高、实时响应能力差、计算效率低等问题,提出一种新的约束简化方法和启发式连续任务规划方法。首先,在时间线规划模型中根据两两子系统间的实时状态关系定义启发式因子,并利用该因子在规划周期内的取值建立子系统间时间线临时从属关系,从而合理地降低规划过程中的约束复杂程度;然后,在规划算法中采用时间线状态扩展策略,根据时间线临时从属关系对各子系统间的状态进行横向和纵向扩展,从而实现对目标任务规划进行快速排序。仿真结果表明由启发式因子建立的时间线临时从属关系有效简化了任务规划过程中的时间约束和资源约束、提高了任务规划的效率和灵活性。     

Fast calculation method for mission opportunities in orbital interception and rendezvous problems

This paper proposes a fast calculation method to solve all mission opportunities for orbital interception and orbital rendezvous under the impulse-magnitude constraint. Different from the existing search methods, the proposed method does not need to solve Lambert’s problem in the whole process. Three cases are considered for either departure time or transfer time being free, or both being free. For fixed departure time, the feasible windows of transfer time are obtained by solving a single-variable nonlinear equation only of terminal true anomaly. Similarly, for fixed interception (or rendezvous) time, the feasible windows of departure time are obtained. For free departure time and free transfer time, all mission opportunities are obtained by using a one-dimensional search strategy. The hyperbolic-transfer and the multiple-revolution cases are also analyzed. Numerical results show that the proposed method is superior to the typical pork-chop plot method and the two-dimensional launch window method in computational time.