查询词典 optimal path

In the paper, the researches and conclusions are:The basic theory and technique ofgeography information system, Introduce the history of the GIS technique developmentand it develops the trend, the GIS modernizes the meaning of the construction and thepurpose and the meaning of the topic researches to the our army artillery.The design ofartillerist numeric map, Make use of the soft strong graphics function of the SuperMapgeography information system, from how made the numerical map of artillery tocommence, carried on the processing and processed the piece to the artilleryappropriative paper quality diagram to manufacture the numerical map of artillery.Themold of choosing the position of artillerist and excavating the position of spacedata;Rules of space clustering analyzing and space relationship on the basis ofmathematics configuration;Choosing the path of positing convert;optimalpath arithmetic on the basis of chart theory and realize optimal path analyze.

论文研究内容有：地理信息系统的基本理论与技术，介绍GIS技术发展的历史及其发展趋势，GIS对我军炮兵现代化建设的意义和课题研究的目的及意义；炮兵地图数字化设计与制作，利用SuperMap地理信息系统软强大的制图功能，从如何制炮兵数字地图入手，对炮兵专用的纸质地图进行处理和加工件来制作炮兵数字地图；炮兵阵地选取分析模型、阵地空间数据挖掘模型的建立和挖掘过程，基于数学形态学的空间聚类分析法、空间关联规则法的挖掘模型；阵地转移的路径选择，对炮兵阵地转移路径进行分析，基于图论中的Dijkstra最优路径算法，实现转移最佳路径分析。

Analyzed the similarity between scheme solving problem and traveling salesman problem, the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed.

摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。

An optimal path planning algorithm of the observer is proposed in this paper, which is based on the dynamic programming. Based on the data measured at the current stage, the optimal moving direction of the observer at the next stage is calculated aiming at the maximum area of the target feasible region convergence.

该算法在当前测量时刻所测数据的基础上，以目标位置可行域收敛面积最大化为目标，分析出观测站运动到下一测量时刻的最优运动方向，从而达到缩短定位时间和抑制定位误差的目的，实现整个测量路线的最优化。

To take an example for 3-node brigade level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest.

以3节点旅级网络中心战演示实验平台为例，提出了一种计算网络中心战架构中端到端时延和获取路径信息的算法，开发了Server/Client架构计算程序，选取探测器到火力控制单元之间的最小网络时延的链路作为最优路径。

A bionics algorithm for robot path planning in static environment is proposed, in which the environmental models are established with grid method, the foraging behavior of ant colonies is simulated and optimal path search is finished by many ants cooperatively.

描述了一种静态环境下的机器人路径规划仿生算法。该算法用栅格法对场景进行建模，模拟蚂蚁的觅食行为，由多只蚂蚁协作完成最优路径的搜索。

Emulation test result makes clear, these improve measure to make of optimal path search fast and efficient, although be below the environment with very complex fraise, also plan quickly to give an optimal way.

仿真实验结果表明，这些改进办法使最优路径的寻找快速而高效，即使在障碍物非常复杂的环境下，也能迅速地规划出一条最优路径。

Then we discuss the choice of optimal path in path sampling ,which turns out to have close connection with the Jeffreys prior density and the Rao and Hellinger distances between two densities.

接着讨论了路径抽样中最优路径的选择问题，它与Jeffreys先验密度及两密度间的Rao和Hellinger距离有密切关系。

To easily form preconditional curvilinear paths within the trust region subproblem, we employ the stable Bunch-Parlett factorization method of symmetric matrices and use the unit lower triangular matrix as a preconditioner of the optimal path and modified gradient path.

使用对称矩阵的稳定Bunch-Parlett易于形成信赖域子问题的弧线路径，使用单位下三角矩阵作为最优路径和修正梯度路径的预条件因子。

Moreover we formulize the optimal path according to the theory of B-spline Curve, so the path which is composed by the grid point can transform into a continuous and smooth curve. By formulizing path we can also calculate angular velocity, angle acceleration, and torque in dynamics.

另外我们根据B-spline Curve的理论将最佳路径参数化，使由格点所组成的最佳路径转换为一条连续且平滑的曲线，藉此我们也可以计算动力学中的瞬间角速度、角加速度与力矩。

Aiming at the problem of path planning algorithm for a mobile robot based on artificial neural network, in this paper we use the method of revising path partially and path tension to fulfill the optimal path, so as to fit to different interference degree of the path with every obstacles and be able to get optimal path in all of complex environments.

针对移动机器人路径规划的人工神经网络算法所存在的问题，提出应用局部路径修正和路径&张紧&法加以改进，以便适应多个障碍物的不同要求，在复杂环境下实现规划路径最优化，并证验其有效性。

Next time I see you,I shall give you a black eye.

下次我看见你，我会打你一顿。

In this paper,design scheme of classification system of wood surface color is established.

提出了木质板材颜色分类的系统设计方案。