Abstract: Aimming at coordination question of multiple robots, this paper presents a distributed coordination algorithm for collision avoidance between robots in unknown environments. This algorithm is based on a distributed bidding model to coordinate the movement of multiple robots. Past assumptions are not used in the coordination algorithm. Both the data error of the sensors and physical size of the robot are taken into account. By adjusting adaptively the bidding time parameter, the efficiency of the algorithm is improved. To overcome the problem of information inconsistency caused by communication delay, a probing method is developed by the prior order. Simulation test is made to prove the feasibility of the algorithm.

Key words: unknown environments, multi-robot coordination, collision avoidance

摘要： 针对多机器人协作问题，提出一种未知环境下分布式多机器人协作避碰算法。该算法基于分布式投标模型协调多机器人运动，改进过去算法的前提假设，综合考虑机器人的实际尺寸和传感误差，通过自适应设定投标时间，提高算法的效率，针对通信延时引起的信息不一致，采用按优先级顺序进行探测的方法。仿真实验验证了该算法的可行性。

关键词: 未知环境, 多机器人协作, 避碰

CLC Number: 

• TP24