Distributed intelligent self-organized mission planning of multi-UAV for dynamic targets cooperative search-attack

This article studies the cooperative search-attack mission problem with dynamic targets and threats, and presents a Distributed Intelligent Self-Organized Mission Planning (DISOMP) algorithm for multiple Unmanned Aerial Vehicles (multi-UAV). The DISOMP algorithm can be divided into four modules: a search module designed based on the distributed Ant Colony Optimization (ACO) algorithm, an attack module designed based on the Parallel Approach (PA) scheme, a threat avoidance module designed based on the Dubins Curve (DC) and a communication module designed for information exchange among the multi-UAV system and the dynamic environment. A series of simulations of multi-UAV searching and attacking the moving targets are carried out, in which the search-attack mission completeness, execution efficiency and system suitability of the DISOMP algorithm are analyzed. The simulation results exhibit that the DISOMP algorithm based on online distributed down-top strategy is characterized by good flexibility, scalability and adaptability, in the dynamic targets searching and attacking problem.     

Contingency target assessment,trajectory design,and analysis for NASA’s NEA scout solar sail mission

The presented study examines contingency target selection and trajectory design for NASA’s Near-Earth Asteroid Scout mission under the assumption of a missed lunar gravity assist. Two previously considered asteroids are selected as potential targets for the given scenario based on favorable orbital characteristics for launch dates ranging from June 27, 2020 through July 26, 2020. Initially, a simplified circular restricted 3-body problem + ideal solar sail model is utilized to survey trajectory options for a month-long launch window. Selected solutions from this data set are then converged in an N-body ephemeris + non-ideal sail model. Results suggest that NEA Scout can still perform asteroid rendezvous mission under the missed lunar gravity assist scenario with new targets, 2019 GF1, 2018 PK21, and 2007 UN12, based on the target launch dates. Further target assessment is carried out for 165 days beyond the current June 27, 2020 launch date.     

Factor graph based navigation and positioning for control system design: A review

Navigation and positioning is an important and challenging problem in many control engineering applications. It provides feedback information to design controllers for systems. In this paper, a bibliographical review on factor graph based navigation and positioning is presented. More specifically, the sensor modeling, the factor graph optimization methods, and the topology factor based cooperative localization are reviewed. The navigation and positioning methods via factor graph are considered a...     

用RTR技术确定SRM燃烧室凝相粒子加入边界条件

由于缺乏有效的实验手段, 目前的ＳＲＭ 颗粒轨道模型很不完善, 其中粒子的加入边界条件完全是建立在人为假设的基础上。针对这种情况, 发展了一种以实验为基础的确定凝相粒子加入边界条件的方法, 首先利用ＲＴＲ技术对实验发动机热试车条件下凝相粒子的运动进行实验研究, 通过图象处理技术获得粒子的运动轨迹, 然后采用轨道模型法计算实验条件下凝相粒子的运动轨迹, 通过轨迹反推法给出了粒子加入边界条件。     

区域多重覆盖Walker星座

本文提出一种新的卫星星座优化方法,得出最优的区域覆盖星座,并给出了应用实例。      

纤维缠绕结构的一种可靠性优化设计方法研究

将纽曼级数展开的蒙特卡罗随机有限元应用于具有随机因素的纤维缠绕结构的应力求解;然后利用蒙特卡罗直接比较法和蔡希布（Ｔｓａｉ－Ｈｉｌｌ）失效判据给出该结构的可靠性算式,最后建立了此类结构的可靠性优化设计迭代法,并给出了一算例。     

火箭结构估重与总体优化设计的数字化实现及应用

火箭新型号总体方案论证时,一般借鉴国内外相近规模和相同推进剂火箭的结构系数进行类比确定子级结构系数,按照比例系数分配贮箱和壳段等部段的质量,但该质量分配不能反映载荷对结构设计的影响,在细化迭代设计中易造成方案无法闭环,导致设计工作反复。为了加快总体方案论证,提出一种基于载荷的箭体结构快速估重方法,开发形成结构估重数字化模块并嵌入总体设计平台。应用案例表明,提出的数字化估重平台能够有效提高估重精度,同时显著缩短论证周期,兼具总体方案比较和优化、全箭质量管理等功能,能有效降低方案推翻重新设计的风险,在新型号总体方案论证中发挥了重要作用。     

基于改进灰狼优化算法的电子干扰机空域划设

在现代化战争中,遂行突防任务的战斗机通常需要与电子干扰机协同配合,来完成特定的任务。为了更高效地利用空域资源,针对突防作战中干扰机的最优空域划设问题,在给出电子干扰下雷达探测范围、航线安全间隔以及有效干扰时间的基础上,建立电子干扰机的最优空域划设模型;在原始灰狼算法中将线性调节参数改为非线性调节参数,同时引入粒子群算法中的记忆功能,改进原始灰狼算法;并采用改进的灰狼优化算法寻找最优的空域基准点,进而确定电子干扰机的最优空域范围。结果表明:对于特定的突防任务,改进的灰狼优化算法比原始灰狼优化算法和粒子群算法更具优越性,能够快速、高效地找到最优的空域基准点;本文所建立的电子干扰机的最优空域划设模型是科学、有效的。     

Shaping low-thrust trajectories with thrust-handling feature

Shape-based methods are becoming popular in low-thrust trajectory optimization due to their fast computation speeds. In existing shape-based methods constraints are treated at the acceleration level but not at the thrust level. These two constraint types are not equivalent since spacecraft mass decreases over time as fuel is expended. This paper develops a shape-based method based on a Fourier series approximation that is capable of representing trajectories defined in spherical coordinates and that enforces thrust constraints. An objective function can be incorporated to minimize overall mission cost, i.e., achieve minimum $\mathrm{\Delta }V$. A representative mission from Earth to Mars is studied. The proposed Fourier series technique is demonstrated capable of generating feasible and near-optimal trajectories. These attributes can facilitate future low-thrust mission designs where different trajectory alternatives must be rapidly constructed and evaluated.     

基于粒子群算法的电帆轨迹优化设计

电帆是一种利用太阳风动量的新颖的无工质空间推进系统,文章研究了以电帆为对象的行星际转移轨迹优化问题。以地球轨道转移到火星、金星轨道为任务对象,采用连续推力模型,研究极坐标系下最小时间转移轨迹优化设计问题。提出了两种基于粒子群算法(PSO)的直接优化方法,避免对协态变量初值敏感的两点边值问题（TPBVP）求解。方法一是通过打靶法直接离散化控制量输入,将最优控制问题转化为非线性规划参数优化问题,采用PSO算法寻优,获得近似最优的转移轨迹。方法二是针对任何连续控制律曲线都能以一定精度的多项式函数进行曲线拟合的特性,设计逼近最优转移轨迹控制律的多项式函数,通过PSO算法优化多项式函数参数获得逼近最优解的转移轨迹。仿真结果表明采用上述两种方法进行转移轨迹优化设计,具有随机猜测初值、全局收敛、鲁棒性强的特点。