To solve the problem of minimum time-to-climb, building a dynamic model of motion in the vertical direction and taking the flight mode as the linear load control.
以飞机在垂直平面的运动方程为基础，采用线性时间负荷控制的飞行模式，提出了求解飞机最短时间爬升轨迹的格点搜寻算法。
In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
Firstly the optimal control problem of minimum-time strike trajectory was translated into two-point-boundary-value problem by using Pontryagin maximum principle.
首先，利用庞特里亚金极大值原理将时间最短打击轨道的最优控制问题转化为两点边值问题。
Depending on the strategy of choosing initial transformations many a time, the local minimum problem in process of iterative detection have been solved.
通过多次选择初始变换的搜索策略，解决了搜索过程中出现的局部极小值问题。
There are factors such as nonlinearity, high complexity, time varying, swell-and-shrink phenomena and non-minimum phase dynamics which make water level control problem of SG very challenging.
非线性、高复杂性、时变、“膨胀”和“收缩”现象以及非最小相位等特性致使SG水位控制成为一直以来的难题。
There are factors such as nonlinearity, high complexity, time varying, swell-and-shrink phenomena and non-minimum phase dynamics which make water level control problem of SG very challenging.
非线性、高复杂性、时变、“膨胀”和“收缩”现象以及非最小相位等特性致使SG水位控制成为一直以来的难题。
应用推荐