發(fā)布時間：2019-03-13 11:18

【摘要】：為了使機器人在復雜動態(tài)環(huán)境中實現(xiàn)最優(yōu)路徑規(guī)劃,提出了改進人工蜂群算法的路徑規(guī)劃方法。分析了傳統(tǒng)的人工蜂群算法原理,引入了小步長偵查蜂為跟隨蜂提供障礙物分布的先驗信息;為了防止機器人與動態(tài)障礙物發(fā)生碰撞,對動態(tài)障礙物周圍的可行節(jié)點進行障礙化處理,將節(jié)點障礙指數(shù)與節(jié)點與目標點距離糅合為節(jié)點選擇準則,同時提出了障礙避撞預測和障礙避撞策略。由仿真實驗可以看出,改進算法不僅成功實現(xiàn)避撞,而且規(guī)劃出避撞條件下的最優(yōu)路徑。
[Abstract]:In order to realize optimal path planning of robot in complex dynamic environment, a path planning method based on improved artificial colony algorithm is proposed. The principle of traditional artificial bee colony algorithm is analyzed, and a small step-size detection bee is introduced to provide prior information of obstacle distribution for follow-up bee. In order to prevent the robot from colliding with the dynamic obstacle, the feasible nodes around the dynamic obstacle are treated with obstacles, and the node obstacle index and the distance between the node and the target point are combined as the node selection criteria. At the same time, the prediction of obstacle avoidance and the strategy of obstacle avoidance are put forward. It can be seen from the simulation experiment that the improved algorithm not only successfully realizes collision avoidance, but also plans the optimal path under the condition of collision avoidance.
【作者單位】： 上海第二工業(yè)大學;
【基金】：國家自然科學基金(61272470) 上海第二工業(yè)大學校級重點學科建設資助(NO:XXKPY1603)
【分類號】：TP242

【相似文獻】

相關期刊論文 前10條

1 郝博;秦麗娟;趙慧靜;;未知環(huán)境下的多機器人協(xié)作圍捕方法[J];火力與指揮控制;2011年03期

2 趙杰;姜健;臧希U，

本文編號：2439343