检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Sébastien Goulet Vincent Debout Patrice Mathieu Vincent Cucchietti Maxime Journot Julien Asquier Romain Garmier Laurène Beauvalet Thierry Ceolin Laurent Chausson Pascal Parraud
机构地区:[1]Flight Dynamics Team,CS Group,Toulouse,31500,France
出 处:《Astrodynamics》2025年第1期77-88,共12页航天动力学(英文)
摘 要:Establishing a sustainable mining expedition for the asteroids of the main belt over the 2035–2050 horizon is the visionary problem of the 12th Global Trajectory Optimisation Competition. A fleet of mining ships must rendezvous twice with asteroids to deploy miners and collect minerals. In this paper, we describe the approach of the CS Group team, OptimiCS, to solve this challenging problem. We present the symmetrical construction of upstream and downstream semi-sequences of asteroids, maximizing the mining time expectancy via a beam search with tabu iterations, and the composition of these semi-sequences into complete fleet routes, maximizing the total collected mass via simulated annealing. While representative Earth–asteroid legs are precomputed, the delta-V costs of the asteroid-to-asteroid hops composing the sequences are initially approximated during exploration via a method that refines the accuracy of the maximum initial mass. The resulting high-fidelity trajectories are adjusted and optimized via a direct method and nonlinear programming.
关 键 词:GTOC trajectory optimization LOW-THRUST delta-V approximation asteroid sequence beam search tabu iterations
分 类 号:V476[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170