| 注册
首页|期刊导航|计算机与数字工程|未知环境下一种群机器人盲目探索算法

未知环境下一种群机器人盲目探索算法

陈锲 范菁

计算机与数字工程2026,Vol.54Issue(6):1580-1583,1587,5.
✕
计算机与数字工程2026,Vol.54Issue(6):1580-1583,1587,5.DOI:10.3969/j.issn.1672-9722.2026.06.007

未知环境下一种群机器人盲目探索算法

Blind Exploration Algorithm for Swarm Robots in Unknown Environment

陈锲 1范菁1

作者信息

  • 1. 云南民族大学电气信息工程学院 昆明 650500
  • 折叠

摘要

Abstract

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%.

关键词

未知环境/群机器人/群体智能/盲目探索/虚拟受力模型/地图边缘点/相对距离

Key words

unknown environment/swarm robots/swarm intelligence/blind exploration/simplified virtual-force model/map edge points/relative distance

分类

信息技术与安全科学

引用本文复制引用

陈锲,范菁..未知环境下一种群机器人盲目探索算法[J].计算机与数字工程,2026,54(6):1580-1583,1587,5.

计算机与数字工程

1672-9722

访问量0
|
下载量0
段落导航相关论文