Aerial-ground collaborative routing with time constraints

The advancement of autonomous technology makes electric-powered drones an excellent choice for flexible logistics services at the last mile delivery stage. To reach a balance between green transportation and competitive edge, the collaborative routing of drones in the air and trucks on the ground is increasingly invested in the next generation of delivery, where it is particularly reasonable to consider customer time windows and time-dependent travel times as two typical time-related factors in daily services. In this paper, we propose the Vehicle Routing Problem with Drones under Time constraints (VRPD-T) and focus on the time constraints involved in realistic scenarios during the delivery. A mixed-integer linear programming model has been developed to minimize the total delivery completion time. Furthermore, to overcome the limitations of standard solvers in handling large-scale complex issues, a space-time hybrid heuristic-based algorithm has been developed to effectively identify a high-quality solution. The numerical results produced from randomly generated instances demonstrate the effectiveness of the proposed algorithm.     

Parameterized design of abort trajectories with a lunar flyby for a crewed mission

This article proposes an analytical preliminary design method for abort trajectory with a lunar flyby and the trajectory ergodic representation based on parameterization, as well as their application in studying the abort trajectories’ characteristics. First, by introducing two parameters, the perilune altitude and the perilune transfer time, the preliminary solution is developed parametrically using pseudostate theory to connect two special Lambert processes. The fast convergence of the improved differential correction under the high-fidelity gravity field verifies the accuracy of the proposed preliminary design method. Next, the two parameters are regarded as a set of variables to define an abort trajectory. Based on this, an ergodic representation of the abort trajectory with a certain abort time is yielded using the proposed design method, which offers a global view of the feasible abort trajectories. In addition, the influences of some factors on the performance of these abort trajectories are investigated based on the proposed design method and ergodic representation. The simulation results show that the abort time and the transfer time of the nominal trajectory significantly affect the ergodic representation and characteristics of the abort trajectory.     

Four-body cislunar quasi-periodic orbits and their application to ballistic lunar transfer design

Examining the properties of quasi-periodic orbits provides insight into the Sun-perturbed environment in cislunar space. In this investigation, quasi-periodic trajectories and their properties are explored in the Sun-Earth-Moon four-body problem. Computation and the stability characteristics of families of invariant tori are detailed. Furthermore, this investigation offers a framework for construction of ballistic lunar transfer trajectories in the four-body problem. The framework leverages manifold trajectories to supply a set of initial conditions for construction of periapsis Poincaré maps. Periapsis maps reduce the dimensionality of the space and illuminate solutions of interest as a basis to produce feasible families of transfers. Through a continuation process, families of ballistic transfers and families of transfers that include powered lunar flybys are constructed. Ultimately, these solutions supply an initial guess for transition to the Sun-Earth-Moon ephemeris model.     

一阶微分方程终值问题拟解的存在性

利用拟上下解方法,研究了一阶微分方程终值问题u′(t)=f()t,u(t),u(T)=xT拟解的存在性,并通过构造单调迭代序列得到该终值问题的最大最小拟解。     

基于贪婪算法的航空存储资源共享机制研究

航空存储网格存储服务是汇聚航空高性能计算中心、各个组织服务器以及单个PC机贡献的存储资源,按照一定规则为用户提供数据存储的注册、分配、调度、释放的共享资源的三级存储架构。在此条件下的资源共享问题属于NP完全问题。为此,我们提出启发式贪婪算法,并对系统性能进行仿真,得出用户请求与负载关系。