基于模糊多目标的高超声速飞行器再入轨迹设计

针对多约束条件下的高超声速飞行器再入轨迹的优化问题,考虑多个具有不同重要性等级的优化指标,提出基于模糊多目标的轨迹设计方法.首先,利用直接配点法,将最优控制问题转化为带优先级的非线性多目标规划问题;然后,基于模糊满意优化的思想,根据更重要目标具有更高满意度的原则,将优先级表示为满意度序,并设计两步式优化模型.通过调节参数,能获得同时满足优化和重要性等级要求的最优轨迹.仿真结果表明了所提出方法的有效性.     

基于粒子群算法的飞行器再入轨迹优化

提出将粒子群优化算法（PSO）应用于飞行器再入轨迹优化。以最小控制能量高超声速飞行器再入轨迹优化为例,对飞行器运动模型进行简化和控制量参数化,粒子群算法采用自适应权值,并充分利用飞行器再入时的运动特性来设置PSO算法初始参数,分析比较仿真步数对结果的影响。仿真结果表明提出方法的有效性和优越性。     

高超声速飞行器多约束参考轨迹快速规划算法

针对多约束的高超声速滑翔飞行器的再入轨迹优化时对初值敏感的问题,提出一种参考轨迹快速规划算法。对运动方程进行了无量纲处理并引入适合优化求解的替代变量,通过纵向再入走廊和侧向制导的规划使所有过程约束和终端约束完全满足。仿真结果表明,得到的参考轨迹接近最优解,大幅缩短了后续优化工作所需的时间,具有重要的工程实用价值。     

基于改进粒子群算法的再入飞行器轨迹优化

采用基于距离量度和自适应惩罚相结合的约束处理技术的改进粒子群优化算法(PSO)应用于再入飞行器轨迹优化,避免适应值函数中复杂的罚函数及罚因子的设计,提高优化算法的通用性.以高超声速飞行器最小控制量再入轨迹优化为例,并对飞行器运动模型进行简化及控制量参数化.对两种不同的高超声速飞行器模型进行优化,仿真结果验证算法的有效性...     

多无人机模糊多目标分布式地面目标协同追踪

针对城市环境中多约束条件下多无人机协同追踪地面目标问题,综合考虑具有不同重要性等级的多个优化目标,提出了一种基于分布式预测控制的模糊多目标航迹规划方法.首先,考虑城市环境中建筑物对无人机视线遮挡、无人机和传感器能量消耗等因素,分别采用目标覆盖度、控制输入代价和开关量形式传感器能耗等为目标函数,将多无人机协同追踪航迹规划转化为多目标优化问题;然后,基于分布式预测控制框架,利用每架无人机未来有限时域内的预测状态,构建多无人机之间的避碰约束,并结合最小转弯半径等约束,形成分布式协同航迹规划模型;最后,针对多个优化目标的不同重要性等级要求,利用模糊满意优化思想将目标模糊化,并根据更重要目标具有更重要满意度的原则,将优先等级表示为松弛满意度序,通过在线求解得到有限时域内每架无人机的局部航迹;与传统多目标加权算法仿真结果对比,验证了所提方法的有效性,充分说明了该方法能够获得同时满足目标优化和重要性等级要求的最优航迹.     

Two-Step Interactive Satisfactory Method for Fuzzy Multiple Objective Optimization With Preemptive Priorities

This paper presents a two-step interactive satisfactory optimization method for fuzzy multiple objective optimization with preemptive priorities. In contrast to previous works, this proposed approach guarantees the order of satisfactory degrees consistent with priorities. The decision-maker not only acquires satisfactory solution of all the objectives, but also realizes the preemptive priority requirement among them. The originally complex optimization problem is simplified and divided into two subproblems that are solved in sequence. Numerical examples and actual application show the proposed method's effectiveness, flexibility and efficiency in comparison with results from the literature.     

hp自适应RPM在四旋翼无人机轨迹优化中的应用

通过分析四旋翼无人机动力学模型并获取实际参数,利用hp自适应Radau伪谱法(Radau pseudospectral method RPM)优化四旋翼无人机避障轨迹。hp自适应RPM利用Legendre-Gauss-Radau(LGR)点将连续最优控制问题转化为非线性规划问题,根据不同点处的误差进行自适应的细化区间或增加配点,以最快的速度逼近状态变量和控制变量。根据仿真结果显示,在以轨迹最短为目标的情况下,hp自适应RPM效率较高,目标轨迹更短,优化结果较为满意。     

Cross-border logistics with fleet management: A goal programming approach

In this paper, we introduce the cross-border logistics problem with fleet management. A major phenomenon of implementation of open-door policy in China is the move of Hong Kong-based manufacturers’ production lines to China, crossing the border to take advantages of lower production costs, lower wages and lower rental costs. The finished products are then transshipped to Hong Kong, an efficient logistics hub well-equipped with reliable transportation facility, for exporting. We present a preemptive goal programming model for multi-objective cross-border logistics problem, in which three objectives are optimized hierarchically. We also describe a framework for incorporating decision-makers’ opinions for determination of goal priorities and target values. A set of Hong Kong data have been used to test the effectiveness and efficiency of the proposed model. Results demonstrate the decision-makers can find the flexibility and robustness of the proposed model by adjusting the goal priorities with respect to the importance of each objective.     

HGV平衡滑翔式轨迹可达区域计算方法研究

针对滑翔式高超声速飞行器(HGV)平衡滑翔轨迹可达区域的高精度快速计算问题,研究了一种基于降阶动力学模型和连续凸优化方法的可达区域计算方法。首先,根据“准平衡滑翔假设”条件,将再入飞行器三自由度动力学方程进行降阶处理,得到以速度为自变量的三阶动力学方程。然后,将可达区域计算问题描述为一系列满足再入走廊约束和初、末状态约束下的横程最大优化问题,将动力学方程进行线性化、离散化处理后,采用连续凸优化方法对该问题进行求解,得到了滑翔飞行器不同末端速度下的可达区域。最后,以CAV-H飞行器模型为例进行了仿真验证,结果表明,该方法具有较高的求解效率和可达区域计算精度。     

带有优先级的分层满意优化控制算法研究

满意控制作为预测控制的实用发展,是基于模型在线实现有约束多目标多自由度优化（CMMO）,并由操作者参与决策的一种实用控制方法。针对有约束多目标多自由度优化中输出变量逼进期望值时存在的优先级结构,将一般的用二次规划表示的满意优化控制问题转化为一个分两层进行的直接优先级优化的满意优化控制问题,使用宽容分层优化方法进行分层,使用变可行域优化方法进行每层的优化,最终决策者得到满意解。     

基于伪谱法的双摆吊车时间最优消摆轨迹规划策略

在工业生产过程中,桥式吊车系统经常会体现出双摆系统的特性,导致更多欠驱动状态量的出现,增大控制难度.基于此,论文提出了一种针对双摆桥式吊车系统的时间最优轨迹规划方法,可以得到全局时间最优且具有消摆能力的轨迹.具体而言,为方便地构造以时间为代价函数的优化问题,首先对系统运动学模型进行相应的变换;在此基础上,考虑包括两级摆角及台车速度和加速度上限值在内的多种约束,构造出相应的优化问题;然后,利用高斯伪谱法(Gauss-pseudospectral method, GPM)将该带约束的优化问题转化为更易于求解的非线性规划问题,且在转化过程中,可以非常方便地考虑轨迹约束.求解该非线性规划问题,即可得到时间最优的台车轨迹.不同于已有的大多数方法,该方法可获得全局时间最优的结果.最后,通过仿真与实验结果验证了这种时间最优轨迹规划方法具有满意的控制性能.     

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization. A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal configurations. The feasibility of the formulated optimization problem is guaranteed under derived conditions. The optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/procedure. Simulation results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.      

可重复使用航天器时间协同飞行轨迹优化

针对可重复使用航天器(RLV)时间协同飞行轨迹优化问题,提出了一种基于Radau伪谱法的轨迹优化方法。方法以再入飞行时间可知性、可控性为目标,使用Radau伪谱法对RLV的飞行时间进行预测,进而协调出多RLV的再入协同飞行时间,以此再入飞行时间为终端约束使用Radau伪谱法生成满足协同飞行要求的再入轨迹。仿真结果表明,上述轨迹优化方法可以得到满足时间协同约束、状态约束和控制约束的飞行轨迹,具有较高的稳定性和较快的求解速度。所提方法满足多架RLV时间协同再入飞行的需求,具有很强的实用价值。     

A fuzzy particle swarm optimization algorithm for computer communication network topology design

Particle swarm optimization (PSO) is a powerful optimization technique that has been applied to solve a number of complex optimization problems. One such optimization problem is topology design of distributed local area networks (DLANs). The problem is defined as a multi-objective optimization problem requiring simultaneous optimization of monetary cost, average network delay, hop count between communicating nodes, and reliability under a set of constraints. This paper presents a multi-objective particle swarm optimization algorithm to efficiently solve the DLAN topology design problem. Fuzzy logic is incorporated in the PSO algorithm to handle the multi-objective nature of the problem. Specifically, a recently proposed fuzzy aggregation operator, namely the unified And-Or operator (Khan and Engelbrecht in Inf. Sci. 177: 2692–2711, 2007), is used to aggregate the objectives. The proposed fuzzy PSO (FPSO) algorithm is empirically evaluated through a preliminary sensitivity analysis of the PSO parameters. FPSO is also compared with fuzzy simulated annealing and fuzzy ant colony optimization algorithms. Results suggest that the fuzzy PSO is a suitable algorithm for solving the DLAN topology design problem.     

结合Kriging和物理规划的多目标代理优化算法

遗传算法处理高耗时且具有黑箱性的工程优化问题效率不足。为了提高工程优化效率，结合Kriging代理优化和物理规划，提出了基于Kriging和物理规划的多目标代理优化算法。在处理多目标问题时，使用物理规划将多目标问题转换成单目标问题，再使用Kriging代理优化对单目标问题进行求解。通过两个多目标数值算例和一个工程实例对提出的算法进行验证。结果表明，提出的算法能够求出符合偏好设置的Pareto最优解，且算法的效率更高。     

Intuitionistic fuzzy optimization technique for solving multi-objective reliability optimization problems in interval environment

In designing phase of systems, design parameters such as component reliabilities and cost are normally under uncertainties. This paper presents a methodology for solving the multi-objective reliability optimization model in which parameters are considered as imprecise in terms of triangular interval data. The uncertain multi-objective optimization model is converted into deterministic multi-objective model including left, center and right interval functions. A conflicting nature between the objectives is resolved with the help of intuitionistic fuzzy programming technique by considering linear as well as the nonlinear degree of membership and non-membership functions. The resultants max–min problem has been solved with particle swarm optimization (PSO) and compared their results with genetic algorithm (GA). Finally, a numerical instance is presented to show the performance of the proposed approach.     

A NEW HYBRID ALGORITHM FOR MULTI-OBJECTIVE DISTRIBUTION FEEDER RECONFIGURATION

This article proposes an efficient hybrid algorithm for multi-objective distribution feeder reconfiguration. The hybrid algorithm is based on the combination of discrete particle swarm optimization (DPSO), ant colony optimization (ACO), and fuzzy multi-objective approach called DPSO-ACO-F. The objective functions are to reduce real power losses, deviation of nodes voltage, the number of switching operations, and the balancing of the loads on the feeders. Since the objectives are not the same, it is not easy to solve the problem by traditional approaches that optimize a single objective. In the proposed algorithm, the objective functions are first modeled with fuzzy sets to calculate their imprecise nature and then the hybrid evolutionary algorithm is applied to determine the optimal solution. The feasibility of the proposed optimization algorithm is demonstrated and compared with the solutions obtained by other approaches over different distribution test systems.     

模糊时间窗VRP的动态规划和禁忌搜索混合算法

为优化具有模糊时间窗的车辆路径问题,以物流配送成本和顾客平均满意度为目标,建立了多目标数学规划模型。基于Pareto占优的理论给出了求解多目标优化问题的并行多目标禁忌搜索算法,算法中嵌入同时优化顾客满意度的动态规划方法,运用阶段划分,把原问题分解为关于紧路径的优化子问题。对模糊时间窗为线性分段函数形式和非线性凹函数形式的隶属度函数,分别提出了次梯度有限迭代算法和次梯度中值迭代算法来优化顾客的最优开始服务时间。通过Solomon的标准算例,与次梯度投影算法的比较验证了动态规划方法优化服务水平的有效性,与主流的NSGA-II算法的对比实验表明了该研究提出的多目标禁忌搜索算法的优越性。     

飞行器上升段轨迹的优化设计

针对飞行器上升段轨迹优化求解困难的问题,提出一种基于正交配点的优化求解方法。该方法以第二类切比雪夫正交多项式的零点作为系统控制变量和状态变量的离散点,利用拉格朗日插值多项式对状态和控制变量进行拟合。通过对多项式的求导将动力学微分方程约束转化为代数约束,从而把无限维的最优控制问题转化为一个有限维的非线性规划(Nonlinear Programming,NLP)问题。随后,利用序列二次规划(Sequential Quadratic Program-ming,SQP)方法求解转化后的NLP问题,获得最优的飞行轨迹。最后,飞行器上的仿真结果验证了所提方法的有效性。研究成果可为飞行器的制导控制提供可行的飞行轨迹,有一定的工程应用价值。     

A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters

Operational planning within public transit companies has been extensively tackled but still remains a challenging area for operations research models and techniques. This phase of the planning process comprises vehicle-scheduling, crew-scheduling and rostering problems. In this paper, a new integer mathematical formulation to describe the integrated vehicle-crew-rostering problem is presented. The method proposed to obtain feasible solutions for this binary non-linear multi-objective optimization problem is a sequential algorithm considered within a preemptive goal programming framework that gives a higher priority to the integrated vehicle-crew-scheduling goal and a lower priority to the driver rostering goals. A heuristic approach is developed where the decision maker can choose from different vehicle-crew schedules and rosters, while respecting as much as possible management’s interests and drivers’ preferences. An application to real data of a Portuguese bus company shows the influence of vehicle-crew-scheduling optimization on rostering solutions.