基于可视图和几何逼近算法的避障路径动态规划研究

为了满足实时仿真的需求,CGF装甲车和武装直升机等的路径规划问题都可以简化成二维平面中的路径规划问题.研究了二维平面中路径规划的核心问题--避障路径规划问题.首先以可视图法所建的求解环境为基础,将避障路径规划转化为一个多阶段决策问题,对于每一个阶段的子问题,应用改进可视图法和几何逼近算法进行求解,得出各阶段的最短路径,最后对避障路径规划进行动态规划求解.     

基于空间发射的远程交会路径规划

研究了空间平台发射追踪器的相关技术和组合机动路径规划策略。首先对空间发射方式、发射窗口和发射初始姿态需求进行了系统分析,选择了合理的发射方式,提出了发射方案设计策略。针对空间平台发射追踪器实现与目标远程交会的组合机动问题,进行了基于投放发射的空间交会任务分析。建立了非线性多冲量推进最优变轨数学模型,以及基于空间发射的多约束多参数组合机动路径规划模型。设计了遗传算法+序列二次规划串行混合求解策略进行求解,并对发射方案和参数选择的必要性进行了仿真分析。仿真结果表明,本方法能够有效实现基于空间发射的远程交会任务设计及组合机动路径规划。研究结果为空间发射任务和组合机动路径规划提供了有价值的参考。     

基于多圈Lambert转移的空间交会方法研究

研究了多圈Lambert转移方法在双冲量交会中的应用。利用转移时间与转移轨道的特点,提出了直接求解最大转移圈数的方法,从而提高了多圈Lambert转移问题的求解效率。用该算法对空间交会问题进行了仿真分析,验证了上述方法的有效性,同时也说明在交会时间较长时,利用多圈Lambert交会有利于减少交会所需的能量。     

小行星探测多脉冲交会轨道多目标优化

现有的小行星探测交会轨道研究多集中于二脉冲最优燃料研究,本文则研究了小行星探测多脉冲交会轨道多目标优化问题.基于Lambert交会算法建立了包含地球逃逸轨道和日心转移轨道的多脉冲交会轨道优化模型,以燃料消耗最小和转移时间最短为两个优化目标函数.采用一类典型的多目标进化算法——NSGA -Ⅱ用于Pareto最优解的确定....     

再入机动弹最佳制导问题

本文研究再入机动弹的最佳制导问题,首先分析了再入机动弹的再入弹道特性,提出了制导的要求,然后料用极大原理解出了再入机动弹的最佳制导方程,所得结果完全适用于两卫星的交会制导,在两次冲量最优交会的基础上,提供一种在有限常推力分段连续控制作用下,最优交会的解。     

基于改进多维粒子群的多无人机任务分配方法

针对复杂战场环境下的多无人机任务规划解空间维度不确定、任务需求随时间变化等问题,提出了一种基于改进多维粒子群算法的多无人机任务分配方法。该方法构建了适应度函数集,应用多个适应度函数来限制种群趋向,同时采用基于时变目标价值的映射变量,建立目标价值随时间变化的多无人机目标决策模型;而后引入整数编码机制,构建面向任务序列的多维粒子,利用改进的自适应多维粒子群算法,得到最优维度下多无人机的任务分配优化方案。仿真实验结果表明：基于改进多维粒子群算法的多无人机任务规划方法可在最优解空间下,获得更好的任务动态分配效果,收敛速度更快,具有良好的推广应用前景。     

多目标数据关联的多维Lagrangian松驰法

将多目标跟踪中的数据关联问题提成为一个离散最优化问题 ,并采用 L agrangian松驰算法来克服该问题面临的计算困难 ,这是目前多祯多目标测量数据关联研究发展的重要方向。首先将多祯多目标数据关联问题建立为一个带约束的多维分配问题 ;并在维数大于 2时 ,采用 L agrangian松驰算法来松驰约束条件 ,使问题降维为计算上可接受的二维分配问题。     

随机动态规划的混合算法研究

针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.     

异类传感器动态数据关联算法北大核心

数据关联是异类传感器系统中最核心且最重要的内容之一,典型的数据关联算法可以归结为特定的分配为问题,然而现有的S维分配算法只考虑同一时刻的每个传感器量测的互联。将此静态关联推广到动态关联中,提出了一种适用于异类传感器的(S+1)维动态数据关联算法。该算法首先将同一时刻各传感器的量测与目标轨迹的一步预测值合并,把问题转化为(S+1)维分配问题,然后将各传感器量测估计的位置信息与目标航迹的预测值的差值作为关联代价,并利用LP-SOLVE工具包解决多维分配问题,最后利用求得的全局最优关联解进行滤波和航迹的更新。仿真实验表明提出的关联代价能更精准地反映数据关联的可能性,能够对多目标进行稳定的跟踪。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

Allocation of resources to randomly occurring opportunities

An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity.     

运用动态规划的智能卫星集群星间通信路由算法

通过建立智能卫星集群网络模型,把智能卫星集群星间通信路由问题转换为时延最短路径问题,进而提出一种求解此问题的智能卫星集群星间通信路由算法.该路由算法采用动态规划策略分阶段规划智能卫星集群两个成员之间的星间通信路由,在每个规划阶段,负责发送数据的智能卫星自主调用一种星间通信路由静态规划算法,以求出其在当前时刻的后继卫星来...     

An integer programming algorithm for portfolio selection with fixed charges

A mean-variance portfolio selection model with limited diversification is formulated in which transaction and management costs are incorporated as the sum of a linear cost and a fixed cost. The problem is a fixed charge integer programming problem solved by hypersurface search using dynamic programming. Fathoming is performed in the forward pass of dynamic programming so that values of the state variable which correspond to infeasible solutions are eliminated from the tables. This logic permits the solution of problems with 20–30 possible investments.     

车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。     

The dynamic transportation problem: A survey

The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work.     

A generalized recursive algorithm for a class of non-stationary regeneration (scheduling) problems

Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques.     

Availability of an operating system during a given time interval: A dynamic programming approach

We consider the problem of running a one-unit failure system such that the probability that the system is operating over an entire prespecified time interval (or at least at some time instant during the interval) is maximized. A fixed number of unused units having identically distributed random operating times are at the controller's disposal. Simple assumptions are made on the stochastic failure mechanism. In particular, the time required to activate a unit for the system is supposed to be constant. Analyzing the associated dynamic programming equations yields closed-form solutions. © 1996 John Wiley & Sons, Inc.     

The discrete max-min problem

The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.