ass日本风韵熟妇pics男人扒开女人屁屁桶到爽|扒开胸露出奶头亲吻视频|邻居少妇的诱惑|人人妻在线播放|日日摸夜夜摸狠狠摸婷婷|制服 丝袜 人妻|激情熟妇中文字幕|看黄色欧美特一级|日本av人妻系列|高潮对白av,丰满岳妇乱熟妇之荡,日本丰满熟妇乱又伦,日韩欧美一区二区三区在线

基于骨架關(guān)鍵點(diǎn)重規(guī)劃的Voronoi圖法路徑規(guī)劃
CSTR:
作者:
作者單位:

作者簡(jiǎn)介:

通訊作者:

中圖分類號(hào):

基金項(xiàng)目:

國(guó)家重點(diǎn)研發(fā)計(jì)劃項(xiàng)目(2019YFB1310000),、湖北省重點(diǎn)研發(fā)計(jì)劃項(xiàng)目(2020BAB098)和武漢市應(yīng)用基礎(chǔ)前沿項(xiàng)目(2019010701011404)


Voronoi Diagram Path Planning Based on Skeleton Key Points Re-planning
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 圖/表
  • |
  • 訪問統(tǒng)計(jì)
  • |
  • 參考文獻(xiàn)
  • |
  • 相似文獻(xiàn)
  • |
  • 引證文獻(xiàn)
  • |
  • 資源附件
  • |
  • 文章評(píng)論
    摘要:

    針對(duì)目前的Voronoi路徑規(guī)劃算法生成的Voronoi圖彎曲冗余,依據(jù)Voronoi地圖規(guī)劃路徑實(shí)時(shí)性差,,規(guī)劃出的路徑彎曲,,機(jī)器人導(dǎo)航時(shí)轉(zhuǎn)折次數(shù)多、時(shí)間成本高,、效率低等問題,,提出一種基于骨架關(guān)鍵點(diǎn)重規(guī)劃的Voronoi圖法路徑規(guī)劃算法。首先對(duì)機(jī)器人構(gòu)建的二維柵格地圖進(jìn)行預(yù)處理,,去掉地圖中的噪點(diǎn)和毛邊,,填充邊界上細(xì)微的裂縫,然后提取地圖的骨架,,搜索出骨架中的關(guān)鍵點(diǎn),,將關(guān)鍵點(diǎn)按原來的相鄰點(diǎn)連接關(guān)系重新連接,生成新的筆直的骨架,,并采用降梯度采樣方法平滑依據(jù)骨架規(guī)劃出的路徑,。在經(jīng)過多次仿真實(shí)驗(yàn)和實(shí)際實(shí)驗(yàn)驗(yàn)證后,證明本文算法生成的骨架比目前的Voronoi圖和骨架更加簡(jiǎn)潔,,數(shù)據(jù)量更小,,機(jī)器人基于優(yōu)化后的Voronoi地圖能夠更加快速規(guī)劃出筆直的路徑,具有良好的實(shí)時(shí)性,,規(guī)劃出的路徑更短,,轉(zhuǎn)折次數(shù)更少,機(jī)器人導(dǎo)航過程中能夠迅速到達(dá)目標(biāo)點(diǎn),,導(dǎo)航效率高,。

    Abstract:

    The Voronoi diagram generated by the current Voronoi path planning algorithm is bending redundant. Real-time performance of planning path based on Voronoi map is poor. Robots have many turning points, high time cost and low efficiency when navigating. A Voronoi diagram path planning algorithm based on skeleton key points re-planning was proposed. Firstly, robots built a two-dimensional environmental grid map with a mapping algorithm. The grid map constructed by the robot was pretreated. The noise and edges in the map was removed, and the tiny cracks on the boundary were filled. Secondly, the skeleton of the map was extracted. The key points in the skeleton were searched. Then the extracted key points were divided into end points and branch points. The connection relationship between each key point was found and the key points were reconnected according to the new connection relationship between adjacent points to generate a new and simpler skeleton. Finally, the path planned in each navigation was sampled down gradiently and smoothed. It was proved that the skeleton generated by the proposed algorithm was more concise and had less data than the current Voronoi diagram and skeleton.The robot can plan the straight path more quickly and had good real-time performance based on the optimized Voronoi map. The planned path was shorter. Robot had less turning points. And robot can quickly arrive at destination in the navigation process, and the navigation efficiency was high.

    參考文獻(xiàn)
    相似文獻(xiàn)
    引證文獻(xiàn)
引用本文

朱建陽(yáng),張旭陽(yáng),蔣林,李峻,雷斌.基于骨架關(guān)鍵點(diǎn)重規(guī)劃的Voronoi圖法路徑規(guī)劃[J].農(nóng)業(yè)機(jī)械學(xué)報(bào),2022,53(3):215-224,250. ZHU Jianyang, ZHANG Xuyang, JIANG Lin, LI Jun, LEI Bin. Voronoi Diagram Path Planning Based on Skeleton Key Points Re-planning[J]. Transactions of the Chinese Society for Agricultural Machinery,2022,53(3):215-224,,250.

復(fù)制
分享
文章指標(biāo)
  • 點(diǎn)擊次數(shù):
  • 下載次數(shù):
  • HTML閱讀次數(shù):
  • 引用次數(shù):
歷史
  • 收稿日期:2021-11-07
  • 最后修改日期:
  • 錄用日期:
  • 在線發(fā)布日期: 2022-03-10
  • 出版日期:
文章二維碼