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

基于Grid-GSA算法的植保無(wú)人機(jī)路徑規(guī)劃方法
CSTR:
作者:
作者單位:

作者簡(jiǎn)介:

通訊作者:

中圖分類號(hào):

基金項(xiàng)目:

公益性行業(yè)(農(nóng)業(yè))科研專項(xiàng)(201303011)和國(guó)家現(xiàn)代農(nóng)業(yè)產(chǎn)業(yè)技術(shù)體系建設(shè)專項(xiàng)(CARS-04-PS22)


Path Planning Method Based on Grid-GSA for Plant Protection UAV
Author:
Affiliation:

Fund Project:

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

    為了提高植保無(wú)人機(jī)的作業(yè)效率,研究了一種路徑規(guī)劃方法,。運(yùn)用柵格法構(gòu)建環(huán)境模型,,根據(jù)實(shí)際的作業(yè)區(qū)域規(guī)模、形狀等環(huán)境信息和無(wú)人機(jī)航向,,為相應(yīng)柵格賦予概率,,無(wú)人機(jī)優(yōu)先選擇概率高的柵格行進(jìn)。基于上述機(jī)制實(shí)現(xiàn)了在形狀不規(guī)則的作業(yè)區(qū)域內(nèi)進(jìn)行往復(fù)回轉(zhuǎn)式全覆蓋路徑規(guī)劃,;以每次植保作業(yè)距離為變量,,根據(jù)仿真算法得出返航點(diǎn)數(shù)量與位置來確定尋優(yōu)模型中的變量維數(shù)范圍,以往返飛行,、電池更換與藥劑裝填等非植保作業(yè)耗費(fèi)時(shí)間最短為目標(biāo)函數(shù),,通過采用引力搜索算法,實(shí)現(xiàn)對(duì)返航點(diǎn)數(shù)量與位置的尋優(yōu),;為無(wú)人機(jī)設(shè)置必要的路徑糾偏與光順機(jī)制,,使無(wú)人機(jī)能夠按既定路線與速度飛行。對(duì)提出的路徑規(guī)劃方法進(jìn)行了實(shí)例檢驗(yàn),,結(jié)果顯示,,相比于簡(jiǎn)單規(guī)劃與未規(guī)劃的情況,運(yùn)用Grid-GSA規(guī)劃方法得出的結(jié)果中往返飛行距離總和分別減少了14%與68%,,非植保作業(yè)時(shí)間分別減少了21%與36%,,其它各項(xiàng)指標(biāo)也均有不同程度的提高。在驗(yàn)證測(cè)試試驗(yàn)中,,實(shí)際的往返距離總和減少了322m,,實(shí)際路徑與規(guī)劃路徑存在較小偏差。驗(yàn)證了路徑規(guī)劃方法具有合理性,、可行性以及一定的實(shí)用性,。

    Abstract:

    Due to the limited battery power and pesticide capacity, the plant protection UAV need return to the supply point frequently in the process of plant protection. With the work area increasing, more time would be spent on battery replacement, pesticide filling and round trips between each return point and the supply point. So an appropriate path with the optimal return points must be planned before starting the work, in order to minimize the total time and improve the efficiency of the plant protection. For the purpose, a research was conducted on the path planning method for the plant protection UAV. Firstly, aiming at building an environment model which could describe the working area, the grid method was selected to divide the working area into small grids with the initialized weights, which were depended on the working area’s size and shape. Secondly, the UAV was made to fly from the current grid to the adjacent one with the highest probability, which was calculated according to both the grids’ initialized weights and the heading direction of the UAV. Incentive coefficients were added to the weights of the grids located in the front, left rear and right rear of the UAV so that the parallel routes were followed which moved from one extreme of the working area to the other alternately and turned at the boundary. Then the quantity and position of the return point could be outputted by controlling the distance in the spraying mode. Thirdly, a mathematical model was established. The quantities of the return times in the artificial planned path and the unplanned path were taken as the upper and lower limits of the search space respectively. The distance of each flight in the spraying mode was chosen as the variable, and the dimensions of which were depended on the search space. The objective was to obtain the optimal return points with the minimum time in the non-praying mode. After that the gravitational search algorithm (GSA) was applied to solve the model. Based on the methods and processes above, a new path planning method was proposed. Then the method would output the planned path with return points automatically by inputting the data about the environment and the UAV such as the size of the working area, the direction of the crop row and the speed of the UAV. At last, for the test of the performance of the proposed path planning method, a 700m×100m working area with the irregular boundary was taken as an example for the path calculation. The path calculated by the proposed method was also compared with the artificial planned path and the unplanned path respectively, which showed the non-praying distance of the proposed method was reduced by 14% and 68%, while the non-praying time was reduced by 21% and 36%. Furthermore, a field experiment with the real UAV was used to test the proposed deviation rectification algorithm. Finally, the study indicated that the proposed method which could produce paths with less working time was a reasonable, feasible and useful solution for the path planning problem of the plant protection UAV.

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

王宇,陳海濤,李煜,李海川.基于Grid-GSA算法的植保無(wú)人機(jī)路徑規(guī)劃方法[J].農(nóng)業(yè)機(jī)械學(xué)報(bào),2017,48(7):29-37. WANG Yu, CHEN Haitao, LI Yu, LI Haichuan. Path Planning Method Based on Grid-GSA for Plant Protection UAV[J]. Transactions of the Chinese Society for Agricultural Machinery,2017,48(7):29-37.

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