首页> 外文OA文献 >Design of Spacecraft Missions to Remove Multiple Orbital Debris Objects
【2h】

Design of Spacecraft Missions to Remove Multiple Orbital Debris Objects

机译:去除多个轨道碎片物体的航天器飞行任务设计

摘要

The amount of hazardous debris in Earth orbit has been increasing, posing an evergreater danger to space assets and human missions. In January of 2007, a Chinese ASAT test produced approximately 2600 pieces of orbital debris. In February of 2009, Iridium 33 collided with an inactive Russian satellite, yielding approximately 1300 pieces of debris. These recent disastrous events and the sheer size of the Earth orbiting population make clear the necessity of removing orbital debris. In fact, experts from both NASA and ESA have stated that 10 to 20 pieces of orbital debris need to be removed per year to stabilize the orbital debris environment. However, no spacecraft trajectories have yet been designed for removing multiple debris objects and the size of the debris population makes the design of such trajectories a daunting task. Designing an efficient spacecraft trajectory to rendezvous with each of a large number of orbital debris pieces is akin to the famous Traveling Salesman problem, an NP-complete combinatorial optimization problem in which a number of cities are to be visited in turn. The goal is to choose the order in which the cities are visited so as to minimize the total path distance traveled. In the case of orbital debris, the pieces of debris to be visited must be selected and ordered such that spacecraft propellant consumption is minimized or at least kept low enough to be feasible. Emergent Space Technologies, Inc. has developed specialized algorithms for designing efficient tour missions for near-Earth asteroids that may be applied to the design of efficient spacecraft missions capable of visiting large numbers of orbital debris pieces. The first step is to identify a list of high priority debris targets using the Analytical Graphics, Inc. SOCRATES website and then obtain their state information from Celestrak. The tour trajectory design algorithms will then be used to determine the itinerary of objects and v requirements. These results will shed light on how many debris pieces can be visited for various amounts of propellant, which launch vehicles can accommodate such missions, and how much margin is available for debris removal system payloads.
机译:地球轨道上的危险碎片数量不断增加,对空间资产和人类飞行任务构成了越来越大的危险。 2007年1月,中国的ASAT测试产生了大约2600片轨道碎片。 2009年2月,铱33卫星与一颗不活动的俄罗斯卫星相撞,产生了约1300件碎片。这些最近的灾难性事件和绕地球轨道飞行的庞大人口清楚地表明了清除轨道碎片的必要性。实际上,来自NASA和ESA的专家都表示,每年需要清除10至20片轨道碎片,以稳定轨道碎片环境。然而,还没有为去除多个碎片物体而设计的航天器轨道,并且碎片总数的大小使这种轨道的设计成为艰巨的任务。设计有效的航天器轨迹以与大量的轨道碎片会合,类似于著名的“旅行推销员”(Traveling Salesman)问题,这是一个NP完全组合优化问题,需要依次访问许多城市。目的是选择游览城市的顺序,以使经过的总路径距离最小。在轨道碎片的情况下,必须选择和订购待碎片化的碎片,以使航天器的推进剂消耗最小化或至少保持足够低的可行性。 Emergent Space Technologies,Inc.开发了专门的算法,用于设计近地小行星的有效飞行任务,该算法可用于设计能够访问大量轨道碎片的有效航天器任务。第一步是使用Analytical Graphics,Inc. SOCRATES网站确定高优先级碎片目标的列表,然后从Celestrak获取其状态信息。然后,将使用游览轨迹设计算法来确定对象和v需求的路线。这些结果将阐明各种数量的推进剂可检出多少碎片,运载火箭可进行此类任务,以及碎片清除系统的有效载荷有多少余量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号