亚洲一区欧美在线,日韩欧美视频免费观看,色戒的三场床戏分别是在几段,欧美日韩国产在线人成

多約束情形下的農(nóng)機(jī)全覆蓋路徑規(guī)劃方法
作者:
作者單位:

作者簡介:

通訊作者:

中圖分類號:

基金項(xiàng)目:

國家重點(diǎn)研發(fā)計(jì)劃項(xiàng)目(2019YFB1312301)


Full Coverage Path Planning Method of Agricultural Machinery under Multiple Constraints
Author:
Affiliation:

Fund Project:

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

    為滿足自主作業(yè)農(nóng)機(jī)自動導(dǎo)航作業(yè)的需求并優(yōu)化農(nóng)機(jī)作業(yè)效率,在處理多種車輛轉(zhuǎn)彎方式約束和農(nóng)業(yè)地塊約束的基礎(chǔ)上,基于模擬退火算法提出一種混合規(guī)則路徑規(guī)劃方法。在多種作業(yè)約束處理方面,引入了農(nóng)機(jī)轉(zhuǎn)彎代價鄰接矩陣來量化農(nóng)機(jī)地頭轉(zhuǎn)彎方式的影響,通過采用內(nèi)縮改進(jìn)的道格拉斯-普克(Douglas-Peucker)擬合算法與求解采樣點(diǎn)的最小凸包分別處理地塊邊界及障礙物邊界。在使用角平分線的平行偏移法求得轉(zhuǎn)向預(yù)留地塊后,以轉(zhuǎn)彎代價最小為優(yōu)化條件對多種形狀地塊進(jìn)行了最優(yōu)作物行生成。在農(nóng)機(jī)遍歷順序方面,利用模擬退火算法求解得到最優(yōu)路徑集,并通過單元拆解及合成的方式求解全覆蓋遍歷順序,解決了傳統(tǒng)規(guī)則遍歷走法適應(yīng)性差和大規(guī)模農(nóng)機(jī)作業(yè)時經(jīng)典模擬退火算法易陷入局部最優(yōu)解的問題。實(shí)驗(yàn)表明,本文方法所得路徑平均作業(yè)覆蓋率達(dá)90.78%,平均作業(yè)占空比達(dá)85.10%。在同等作業(yè)條件下,利用本文方法所得路徑比傳統(tǒng)規(guī)則路徑最多可節(jié)約距離消耗30.3%,比模擬退火算法所生成路徑節(jié)約6.9%。 說明本文規(guī)劃算法可在多種約束下對農(nóng)機(jī)進(jìn)行作業(yè)路徑規(guī)劃,且具有較好的規(guī)劃效果。

    Abstract:

    In order to meet the requirements for automatic navigation operations and optimize the efficiency of agricultural machinery operations, a path planning algorithm formed by mixed rules was proposed based on simulated annealing method, after dealing with the constraints of various turning methods and agricultural plots. In terms of multi-constraint processing, the adjacency matrix of agricultural machinery turning cost was introduced to quantify the influence of different turning modes, and the block boundary and obstacle boundary were respectively dealt by using improved Douglas-Peucker fitting algorithm and the minimum convex hull of sampling points was solved. After the reserved area for turning were obtained by using the parallel migration of angle bisectors, the optimal crop rows of multi-shape parcels were generated in order to reduce the cost of turning. In traversal order of agricultural machinery, full coverage traversal order was formed by disassembling crop rows into units, solving the optimal units with simulated annealing method and assembling to a whole path. The algorithm solved the problem that traditional planning methods were hard to adapt to different conditions and classical simulated annealing method fell into local optimal solution easily in large scale planning. The experiment results showed that coverage of the paths obtained by proposed method was up to 90.78% in average and the average duty cycle was 85.10%. Under the same conditions, the proposed path can save up to 30.3% distance consumption compared with the traditional path, and 6.9% compared with the path formed by simulated annealing algorithm. The results showed that the proposed algorithm can plan the operation path for agricultural machinery under various constraints and reach a better planning effect.

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

陳凱,解印山,李彥明,劉成良,莫錦秋.多約束情形下的農(nóng)機(jī)全覆蓋路徑規(guī)劃方法[J].農(nóng)業(yè)機(jī)械學(xué)報(bào),2022,53(5):17-26,43. CHEN Kai, XIE Yinshan, LI Yanming, LIU Chengliang, MO Jinqiu. Full Coverage Path Planning Method of Agricultural Machinery under Multiple Constraints[J]. Transactions of the Chinese Society for Agricultural Machinery,2022,53(5):17-26,43.

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