共查询到19条相似文献,搜索用时 437 毫秒
1.
2.
3.
4.
5.
6.
对用低轨子星座和椭圆轨道子星座组成的混合卫星星座实现不均匀覆盖进行了研究。给出了低圆轨道和椭圆轨道的设计方法和计算模型。基于对传统粒子群算法的改进,提出了一种自适应变异与非线性单纯形法综合的高效粒子群优化算法对星座进行优化设计,并给出了设计的某混合卫星星座的整体构型。分析结果表明:该法明显优于遗传算法和传统粒子群算法。 相似文献
7.
8.
9.
针对多成像卫星联合调度规划建模难度大和求解复杂度高等问题,通过分析成像卫星的成像过程和工作原理,将成像卫星调度过程分为调度预处理、任务规划和调度优化3个阶段。在调度规划过程中,建立了多星联合调度约束满足最优化模型,采用启发式算法思想,定义了个体适应度评估函数,设计了任务冲突消解方法,提出了一种改进的差分进化算法。在此基础上,采用一些确定性规则对调度规划方案可行解进行了评估和二次优化。结果表明:提出的成像卫星调度问题求解方法能够有效地分配卫星资源,生成优化的调度方案。设计结果也能够为卫星系统最优化设计和效能评估提供必要的决策支持。 相似文献
10.
11.
The particle swarm optimization (PSO) technique is a population-based stochastic method developed in recent years and successfully applied in several fields of research. It mimics the unpredictable motion of bird flocks while searching for food, with the intent of determining the optimal values of the unknown parameters of the problem under consideration. At the end of the process, the best particle (i.e. the best solution with reference to the objective function) is expected to contain the globally optimal values of the unknown parameters. The central idea underlying the method is contained in the formula for velocity updating. This formula includes three terms with stochastic weights. This research applies the particle swarm optimization algorithm to the problem of optimizing impulsive orbital transfers. More specifically, the following problems are considered and solved with the PSO algorithm: (i) determination of the globally optimal two- and three-impulse transfer trajectories between two coplanar circular orbits; (ii) determination of the optimal transfer between two coplanar, elliptic orbits with arbitrary orientation; (iii) determination of the optimal two-impulse transfer between two circular, non-coplanar orbits; (iv) determination of the globally optimal two-impulse transfer between two non-coplanar elliptic orbits. Despite its intuitiveness and simplicity, the particle swarm optimization method proves to be capable of effectively solving the orbital transfer problems of interest with great numerical accuracy. 相似文献
12.
针对空间在轨操作目标分配问题,以分布式卫星系统为研究对象,提出了一种基于粒子群算法的在轨操作多目标分配方法。以分布式卫星机动所消耗的总能量最省为目标函数,建立了在轨操作多目标分配的数学模型。基于固定时间拦截理论,以机动时刻和对应的速度增量作表征,设计实现了单颗卫星最优机动方案。通过合理设计粒子位置与目标分配解的对应关系,采用粒子群算法对问题进行了求解,并详细阐述了算法的实现步骤。算例分析结果表明,建立的模型和算法能够快速得到正确的可行解,可有效解决多约束条件下空间在轨操作的多目标分配问题。 相似文献
13.
14.
针对组合动力水平起飞可重复使用运载器,开展了上升段轨迹优化模型设计与轨迹优化方法研究。首先,针对跨大空/速域飞行须采用多种动力形式协调工作这一问题,考虑动力/气动/轨迹/指标间的复杂耦合关系,建立了运载器动力和气动模型。其次,为降低轨迹优化问题的求解难度,设计了一种全新的飞行剖面,实现了关键优化参数的提取和攻角约束的自动满足,减少了优化算法需要处理的约束数量。然后,提出了一种改进的粒子群优化(PSO)算法完成求解;在收敛性分析的基础上,引入强化学习机制对PSO寻优过程进行自主智能控制,从本质上提升了PSO算法的求解效率。最后通过数学仿真验证了方法的正确性和有效性。 相似文献
15.
A hybrid algorithm combining particle swarm optimization (PSO) algorithm with the Legendre pseudospectral method (LPM) is proposed for solving time-optimal trajectory planning problem of underactuated spacecrafts. At the beginning phase of the searching process, an initialization generator is constructed by the PSO algorithm due to its strong global searching ability and robustness to random initial values, however, PSO algorithm has a disadvantage that its convergence rate around the global optimum is slow. Then, when the change in fitness function is smaller than a predefined value, the searching algorithm is switched to the LPM to accelerate the searching process. Thus, with the obtained solutions by the PSO algorithm as a set of proper initial guesses, the hybrid algorithm can find a global optimum more quickly and accurately. 200 Monte Carlo simulations results demonstrate that the proposed hybrid PSO–LPM algorithm has greater advantages in terms of global searching capability and convergence rate than both single PSO algorithm and LPM algorithm. Moreover, the PSO–LPM algorithm is also robust to random initial values. 相似文献
16.
针对空间机器人动力学奇异的回避问题,提出一种基于组合函数的笛卡尔轨迹规划方法。将梯形规划与正弦函数相结合,对机械臂末端的位姿进行参数化。机械臂沿着某一轨迹运动时,根据阻尼最小方差法(DLS)的特点,提出一种判断是否发生动力学奇异的方法,并据此进行轨迹规划。该方法可以保证空间机械臂运动过程中不会遇到动力学奇异。此外,将基座姿态扰动和机械臂运动时间作为目标函数的一部分,最终,轨迹规划问题转化为多目标优化问题,并利用混合整数规划的混沌粒子群优化算法(CPSO)进行求解。该优化算法能够改善标准粒子群算法(PSO)的“早熟”现象。仿真结果表明,新方法能够有效处理动力学奇异问题,减小基座姿态扰动及运动时间。 相似文献
17.
提出一种考虑在轨运动可靠性的冗余度空间机械臂关节力矩优化方法。首先将机械臂操作空间中点到点的转移任务从笛卡尔空间转换至关节空间,利用七次多项式插值法对各关节变量进行参数化处理,获得粒子群算法的优化控制参数;与传统路径规划方法不同,将机械臂各关节力矩的均值和最小作为粒子群算法优化求解的目标函数;依据该目标函数以及相应优化控制参数,利用粒子群算法对空间机械臂运行轨迹进行优化求解,得到机械臂关节力矩均值和最小的运行路径。仿真实验表明,相比传统路径规划方法及以关节力矩二范数为目标函数的关节力矩优化方法,在降低冗余度空间机械臂关节力矩均值方面,文中方法分别减小了33.57%和10.47%;在降低关节力矩最大值方面,分别减小了43.25%和6.19%。 相似文献
18.
Time-optimal spacecraft slewing maneuvers with path constraints are difficult to compute even with direct methods. This paper examines the use of a hybrid, two-stage approach, in which a heuristic method provides a rough estimate of the solution, which then serves as the input to a pseudospectral optimizer. Three heuristic methods are examined for the first stage: particle swarm optimization (PSO), differential evolution (DE), and bacteria foraging optimization (BFO). In this two-stage method, the PSO-pseudospectral combination is approximately three times faster than the pseudospectral method alone, and the BFO-pseudospectral combination is approximately four times faster; however, the DE does not produce an initial estimate that reduces total computation time. 相似文献