<th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
<progress id="5nh9l"><noframes id="5nh9l">

兩種改進的最優路徑規劃算法

Two improved optimum path planning algorithms

  • 摘要: 在對經典Dijkstra算法和A*算法分析的基礎上對它們分別進行了改進.在經典Dijkstra算法中,針對當前不相連節點間路徑長度為無窮大這一特點,首先對兩個節點是否相連進行判斷;若發現兩個節點并不相連時,則舍去相應計算,從而減小計算量.針對A*算法在實際應用中搜索效率低的缺點,將經典A*算法搜索出的原始最優路徑中的節點依次進行封堵后,再按照經典A*算法搜索出相應的新最優路徑,最后再將原始最優路徑與這些新最優路徑進行對比,以便確定最終的最優路徑.仿真研究表明:改進的Dijkstra算法可以減少大量的無關節點計算,提高運算的效率;改進的A*算法則可以提高搜索到最優路徑的成功率.

     

    Abstract: An improved Dijkstra's and an improved A* algorithm were proposed based on the analysis of their drawbacks. In the traditional Dijkstra's algorithm, the distance between two unconnected nodes is infinite and some relative calculations are useless. The improved Dijkstra's algorithm proposed that the connection between nodes should be tested at first so that it can decrease the computing overhead to a great extent. When the traditional A* algorithm is used in practice, its efficiency is not satisfied. The improved A* algorithm includes such steps as the following:firstly, the original optimum path should be planned by the traditional A* algorithm; secondly the nodes in the original optimum path; should be blocked in turn and the traditional A* algorithm is used again in order to look for another new optimum path, finally, these new optimum paths should be compared with the original one so that the final optimum path can be selected. Simulation results show that the improved Dijkstra's algorithm can enhance the calculation efficiency and the improved A* algorithm can find the more optimum path.

     

/

返回文章
返回
<th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
<progress id="5nh9l"><noframes id="5nh9l">
259luxu-164