未知环境下一种群机器人盲目探索算法OA
Blind Exploration Algorithm for Swarm Robots in Unknown Environment
群机器人在进行未知环境的盲目探索时,仅可通过机器人之间的通信进行机器人群的方向规划.论文以基于地图边缘点的盲目探索策略为基础,针对简化虚拟受力模型(SVF)对机器人相对位置关注不足的缺陷,提出依据地图边缘点的相对虚拟受力模型(OSVF).OSVF首先将每次迭代中机器人群的各机器人位置投影于地图对角线上,而后计算投影之间的斥力与地图边缘点作用力,使得机器人群中各机器人分配到相对均匀的前进方向.之后将OSVF与基于期望速度方向的避障策略结合,最终完成在未知环境下的盲目探索任务.通过在仿真环境下以同样的参数,测试OSVF与SVF在不同避障策略下的方向分配效果,实验结果表明,论文算法在相同机器人数量的情况下,得到的路径长度较其余算法提升了1.91%~5.78%,而每次迭代相对距离标准差降低了31.32%~62.88%.
When swarm robots are blindly exploring unknown environments,they can only plan the direction of swarm robots through the communication between robots.Based on the blind exploration strategy based on the edge points of the map,aiming at the defect that Simplified Virtual-Force Model(SVF)does not pay enough attention to the relative position of robot,Opposite Sim-plified Virtual-Force Model(OSVF)based on map edge points is proposed.In OSVF,the positions of each robot crowd in each iter-ation are projected onto the diagonal of the map,and then the repulsive forces between the projections and the forces at the edge of the map are calculated.Then,the OSVF is combined with the obstacle avoidance strategy based on the desired speed direction to complete the blind exploration task in the unknown environment.By using the same parameters in the simulation environment,the direction allocation effect of OSVF and SVF under different obstacle avoidance strategies is tested,Experimental results show that with the same number of robots,the path length of the proposed algorithm is increased by 1.91%~5.78%compared with other algo-rithms,and the standard deviation of the relative distance of each iteration is reduced by 31.32%~62.88%.
陈锲;范菁
云南民族大学电气信息工程学院 昆明 650500云南民族大学电气信息工程学院 昆明 650500
信息技术与安全科学
未知环境群机器人群体智能盲目探索虚拟受力模型地图边缘点相对距离
unknown environmentswarm robotsswarm intelligenceblind explorationsimplified virtual-force modelmap edge pointsrelative distance
《计算机与数字工程》 2026 (6)
1580-1583,1587,5
评论