A collaborative localization tolerant to recognition error by double-check particle exchange

Statistical algorithms using particle filters for collaborative multi-robot localization have been proposed. In these algorithms, by synchronizing every robot’s belief or exchanging particles of the robots with each other, fast and accurate localization is attained. These algorithms assume correct recognition of other robots, and the effects of recognition errors are not discussed. However, if the recognition of other robots is incorrect, a large amount of error in localization can occur. This article describes this problem. Furthermore, an algorithm for collaborative multi-robot localization is proposed in order to cope with this problem. In the proposed algorithm, the particles of a robot are sent to other robots according to measurement results obtained by the sending robot. At the same time, some particles remain in the sending robot. Particles received from other robots are evaluated using measurement results obtained by the receiving robot. The proposed method is tolerant to recognition error by the remaining particles and evaluating the exchanged particles in the sending and receiving robots twice, and if there is no recognition error, the proposed method increases the accuracy of the estimation by these two evaluations. These properties of the proposed method are argued mathematically. Simulation results show that incorrect recognition of other robots does not cause serious problems in the proposed method.     

基于声音的分布式多机器人相对定位

提出了一种基于声音的分布式多机器人相对定位方法.首先,每个机器人通过声源定位算法估计发声机器人在其局部坐标系下的坐标;然后,每个机器人（不含发声机器人）通过无线通信方式将发声机器人在其坐标系下的坐标广播给所有其他机器人,通过坐标变换每个机器人可计算出所有其他机器人在其坐标系下的坐标,从而实现分布式相对定位.理论推导及实验证明只要两个机器人先后发声,通过本文所提方法即可实现多机器人相对定位.室内外环境中采用6个自制小型移动机器人实验表明,所提方法在3米的范围内可实现16厘米的相对定位精度.     

Distributed multi-robot coordination in area exploration

This paper proposes a reliable and efficient multi-robot coordination algorithm to accomplish an area exploration task given that the communication range of each robot is limited. This algorithm is based on a distributed bidding model to coordinate the movement of multiple robots. Two measures are developed to accommodate the limited-range communications. First, the distances between robots are considered in the bidding algorithm so that the robots tend to stay close to each other. Second, a map synchronization mechanism, based on a novel sequence number-based map representation and an effective robot map update tracking, is proposed to reduce the exchanged data volume when robot subnetworks merge. Simulation results show the effectiveness of the use of nearness measure, as well as the map synchronization mechanism. By handling the limited communication range we can make the coordination algorithms more realistic in multi-robot applications.     

基于特征粒子的Monte Carlo自定位方法

提出了一种基于Monte Carlo方法的多机器人自定位方法．该方法在机器人进行自定位时，对用来估计机器人位置的MCL(Monte Carlo Localization)粒子空间进行栅格划分，然后采用可变栅格法获得能代表所有粒子整体特性的特征粒子集．因为特征粒子的数量较粒子总数大大减少，该方法能避免直接将Monte Carlo方法应用于多机器人定位中产生的维数灾的问题，可以在保证精度的情况下降低运算复杂度．仿真结果表明，该方法能较好地满足多机器人自定位的要求．     

面向观测融合和吸引因子的多机器人主动SLAM

针对未知环境下多机器人主动SLAM(simultaneous localization and mapping)存在不能完全遍历环境、定位精度不理想等问题,本文基于EKF-SLAM(extended Kalman filter-simultaneous localization and mapping)算法提出一种多机器人主动SLAM算法。通过引入吸引因子,增强多机器人系统之间的交流,提升机器人自身定位精度与环境建图精度,同时又引导多机器人团队进行探索环境。当同一地标被多个机器人观测到,采用凸组合融合方法融合各个机器人对地标的估计,从而降低被估计地标的不确定度。仿真结果表明,所提算法能够对环境进行覆盖遍历,提升对地标估计的定位精度。     

多机器人协同SLAM技术研究进展

由于单机器人同步定位与建图（SLAM）技术在实际应用中的局限性,多机器人协同SLAM技术以较强的灵活性和鲁棒性受到研究人员的广泛关注,并且在农业生产、环境监测、海上搜救等领域具有巨大应用前景。多机器人协同SLAM是多机器人协同工作的核心及大范围复杂环境内及时获得场景感知信息的关键,能使多个机器人在协同工作时共同定位并构建任务空间地图,主要基于单机器人SLAM算法、多机器人系统架构、地图融合等技术实现。结合多机器人协同SLAM的发展历程,对比分析当前主流的多机器人协同SLAM算法。从传感器的角度,将多机器人协同SLAM分为激光协同SLAM、视觉协同SLAM以及激光视觉融合协同SLAM三类,并对多机器人协同SLAM的架构选择、多机通信、相对位姿、地图融合和后端优化问题进行讨论,同时指出异构机器人协同、基于深度学习的语义SLAM是多机器人协同SLAM的未来发展趋势。     

Real-time exploration of a multi-robot rescue system in disaster areas

A system procedure is proposed for a multi-robot rescue system that performs real-time exploration over disaster areas. Real-time exploration means that every robot exploring the area always has a communication path to human operators standing by at a base station and that the communication path is configured by ad hoc wireless networking. Real-time exploration is essential in multi-robot systems for USAR (urban search and rescue) because operators must communicate with every robot to support the victim detection process and ad hoc networking is suitable to configure a communication path among obstacles. The proposed system procedure consists of the autonomous classification of robots into search and relay types and behavior algorithms for each class of robot. Search robots explore the areas and relay robots act as relay terminals between search robots and the base station. The rule of the classification and the behavior algorithm refer to the forwarding table of each robot constructed for ad hoc networking. The table construction is based on DSDV (destination-sequenced distance vector) routing that informs each robot of its topological position in the network and other essentials. Computer simulations are executed with a specific exploration strategy of search robots. The results show that a multi-robot rescue system can perform real-time exploration with the proposed system procedure and reduce exploration time in comparison with the case where the proposed scheme is not adopted.     

Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system

Coverage and connectivity are the two main functionalities of wireless sensor network. Stochastic node deployment or random deployment almost always cause hole in sensing coverage and cause redundant nodes in area. In the other hand precise deployment of nodes in large area is very time consuming and even impossible in hazardous environment. One of solution for this problem is using mobile robots with concern on exploration algorithm for mobile robot. In this work an autonomous deployment method for wireless sensor nodes is proposed via multi-robot system which robots are considered as node carrier. Developing an exploration algorithm based on spanning tree is the main contribution and this exploration algorithm is performing fast localization of sensor nodes in energy efficient manner. Employing multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor nodes deployment. A novel improvement of this technique in deployment of nodes is having obstacle avoidance mechanism without concern on shape and size of obstacle. The results show using spanning tree exploration along with multi-robot system helps to have fast deployment behind efficiency in energy.     

基于改进生物激励神经网络算法的多移动机器人协同变电站巡检作业

针对大型变电站巡检作业效率低的问题,利用改进的生物激励神经网络算法和优先级启发式算法,结合基于变切线长的无障碍物区域分割法,提出一种多移动机器人协同全区域覆盖巡检以及多任务点协同巡检的方法.首先,分析生物激励神经网络算法的不足,如规划的路径曲折、转角大等问题,并提出一种改进方法,利用改进的算法和Hungarian算法实...     

A robust extended H∞ filtering approach to multi-robot cooperative localization in dynamic indoor environments

Multi-robot cooperative localization serves as an essential task for a team of mobile robots to work within an unknown environment. Based on the real-time laser scanning data interaction, a robust approach is proposed to obtain optimal multi-robot relative observations using the Metric-based Iterative Closest Point (MbICP) algorithm, which makes it possible to utilize the surrounding environment information directly instead of placing a localization-mark on the robots. To meet the demand of dealing with the inherent non-linearities existing in the multi-robot kinematic models and the relative observations, a robust extended $H_{\infty }$ filtering (REHF) approach is developed for the multi-robot cooperative localization system, which could handle non-Gaussian process and measurement noises with respect to robot navigation in unknown dynamic scenes. Compared with the conventional multi-robot localization system using extended Kalman filtering (EKF) approach, the proposed filtering algorithm is capable of providing superior performance in a dynamic indoor environment with outlier disturbances. Both numerical experiments and experiments conducted for the Pioneer3-DX robots show that the proposed localization scheme is effective in improving both the accuracy and reliability of the performance within a complex environment.     

Master-followed Multiple Robots Cooperation SLAM Adapted to Search and Rescue Environment

The master-followed multiple robots interactive cooperation simultaneous localization and mapping (SLAM) schemes were designed in this paper, which adapts to search and rescue (SAR) cluttered environments. In our multi-robots SLAM, the proposed algorithm estimates each of multiple robots’ current local sub-map, in this occasion, a particle represents each of moving multi-robots, and simultaneously, also represents the pose of a motion robot. The trajectory of the robot’s movement generated a local sub-map; the sub-maps can be looked on as the particles. Each robot efficiently forms a local sub-map; the global map integrates over these local sub-maps; identifying SAR objects of interest, in which, each of multi-robots acts as local-level features collector. Once the object of interest (OOI) is detected, the location in the global map could be determined by the SLAM. The designed multi-robot SLAM architecture consists of PC remote control center, a master robot, and multi-followed robots. Through mobileRobot platform, the master robot controls multi-robots team, the multiple robots exchange information with each other, and then performs SLAM tasks; the PC remote control center can monitor multi-robot SLAM process and provide directly control for multi-robots, which guarantee robots conducting safety in harsh SAR environments. This SLAM method has significantly improved the objects identification, area coverage rate and loop-closure, and the corresponding simulations and experiments validate the significant effects.     

Relative observation for multi-robot collaborative localisation based on multi-source signals

This paper describes a synthesising method for multi-robot collaborative localisation. A distributed extended Kalman filter (EKF) based on robot odometry and external North Star signals for data fusion is first designed for the localisation of individuals in the robot group. Relying on relative observation by infrared sensors and gyroscopes mounted on robots, and the ‘uncertainty volume’ strategy, the positions estimated by EKFs are further corrected for precising the localisation process. The localisation accuracy based on different sensing regimes is tested. Sensor correlations and uncertainties are analysed for predicting error propagation and to accommodate sensing deviations. The multi-source signals are then synthesised for the collaborative localisation for a multi-robot system without introducing excessive computation. Finally, this work is verified by both simulation and experiments with real robots, i.e. the Festo Robotinos under different scenarios.     

基于协助校正方法的多机器人主动同时定位与建图

协作策略是多机器人主动同时定位与建图(SLAM)的关键。文中提出一种多机器人相互校正的协作策略, 称为协助校正。 该方法通过优化机器人对陆标的观测来提高定位与建图的精度, 共包括弱协助校正和强协助校正两种模式。 前者是一种间接的协助模式, 可应用于所有机器人自身定位均不准确的情形。 后者是一种直接的协助模式, 由自身定位精度较高的机器人主动校正其它机器人及相应陆标。 文中将这两种协助校正模式利用状态机统一到多机器人主动SLAM应用中。在仿真实验中将协助校正与其它多机器人主动SLAM方法进行对比以验证其精度优势, 并与单机器人主动SLAM对比以验证其导航代价极低的优势。最后在两台Poineer3-DX移动机器人上进行真实环境实验,实验结果证实协助校正方法可在实际应用中有效提高多机器人主动SLAM的探索效率和精度。     

Application of Localization Based on the DC Magnetic Field that Occurs in the Environment on Wheel-Type Mobile Agricultural Robots

A wheel-type mobile robot is simply able to localize with odometry. However, for mobile agricultural robots, it is necessary to consider that the environment is uneven terrain. Therefore, odometry is unreliable and it is necessary to augment the odometry by measuring the position of the robot relative to known objects in the environments. This paper describes the application of localization based on the DC magnetic field that occurs in the environment on mobile agricultural robots. In this research, a magnetic sensor is applied to scan the DC magnetic field to build a magnetic database. The robot localizes by matching magnetic sensor readings against the magnetic database. The experimental results indicate that the robot is able to localize accurately with the proposed method and the cumulative error can be eliminated by applying the localization results to compensate for the odometry.     

无人仓多搬运机器人协同作业轨迹自动控制研究

由于无人仓多搬运机器人协同作业线路较为复杂,导致协同作业轨迹控制难度增加,为了保证多搬运机器人能够按照规划路线执行搬运作业,提出了无人仓多搬运机器人协同作业轨迹自动控制方法;采用栅格图建模法,结合无人仓内货架的实际分布情况,建立无人仓环境场景;从组成结构、运动学以及动力学3个方面,构建搬运机器人的数学模型;遵循就近原则分配多机器人搬运任务,规划多搬运机器人的协同作业轨迹,根据多搬运机器人实时位姿的自动检测结果计算控制量,利用作业轨迹自动控制器的安装与运行,完成无人仓多搬运机器人协同作业轨迹的自动控制任务;实验结果表明,在该方法应用后,多搬运机器人在无人仓中的作业轨迹与规划轨迹基本相同,计算得出的平均位置控制误差和姿态角控制误差分别为2.27 cm和0.05°,搬运机器人的碰撞次数能被控制在规定范围内,实际应用效果好。     

Swarm robotics search & rescue: A novel artificial intelligence-inspired optimization approach

In this paper, a novel heuristic algorithm is proposed to solve continuous non-linear optimization problems. The presented algorithm is a collective global search inspired by the swarm artificial intelligent of coordinated robots. Cooperative recognition and sensing by a swarm of mobile robots have been fundamental inspirations for development of Swarm Robotics Search & Rescue (SRSR). Swarm robotics is an approach with the aim of coordinating multi-robot systems which consist of numbers of mostly uniform simple physical robots. The ultimate aim is to emerge an eligible cooperative behavior either from interactions of autonomous robots with the environment or their mutual interactions between each other. In this algorithm, robots which represent initial solutions in SRSR terminology have a sense of environment to detect victim in a search & rescue mission at a disaster site. In fact, victim’s location refers to global best solution in SRSR algorithm. The individual with the highest rank in the swarm is called master and remaining robots will play role of slaves. However, this leadership and master position can be transitioned from one robot to another one during mission. Having the supervision of master robot accompanied with abilities of slave robots for sensing the environment, this collaborative search assists the swarm to rapidly find the location of victim and subsequently a successful mission. In order to validate effectiveness and optimality of proposed algorithm, it has been applied on several standard benchmark functions and a practical electric power system problem in several real size cases. Finally, simulation results have been compared with those of some well-known algorithms. Comparison of results demonstrates superiority of presented algorithm in terms of quality solutions and convergence speed.     

基于多智能体深度强化学习的协作导航应用

多机器人协作导航目前广泛应用于搜索救援、物流等领域, 协作策略与目标导航是多机器人协作导航面临的主要挑战. 为提高多个移动机器人在未知环境下的协作导航能力, 本文提出了一种新的分层控制协作导航(hierarchical control cooperative navigation, HCCN) 策略, 利用高层目标决策层和低层目标导航层, 为每个机器人分配一个目标点, 并通过全局路径规划和局部路径规划算法, 引导智能体无碰撞地到达分配的目标点. 通过Gazebo平台进行实验验证, 结果表明, 文中所提方法能够有效解决协作导航过程中的稀疏奖励问题, 训练速度至少可提高16.6%, 在不同环境场景下具有更好的鲁棒性, 以期为进一步研究多机器人协作导航提供理论指导, 应用至更多的真实场景中.     

Cooperative localization method for multi-robot based on PF-EKF

A method of cooperative localization for multi-robot in an unknown environment is described. They share information and perform localization by using relative observations and necessary communication. At initial time, robots do not know their positions. Once the robot that can obtain the absolute position information has its position, other robots use particle filter to fuse relative observations and maintain a set of samples respectively representing their positions. When the particles are close to s Gsussian distribution after a number of steps, we switch to an EKF to track the pose of the robots. Simulation results and real experiment show that PF-EKF method combines the robustness of PF and the efficiency of EKF. Robots can share the absolute position information and effectively localize themselves in an unknown environment.     

基于协同多目标算法的多机器人路径规划

多机器人路径规划是群体机器人协同工作的前提,其特点是在防碰撞与避障的前提下追求多方面资源的最小消耗.针对这一特点,提出协同非支配排序遗传算法,解决具有多个优化目标的多机器人路径规划问题;运用改进的多目标优化算法,克服多目标优化取权值的不足,同时考虑机器人能源与时间两大资源,以多机器人的路径总长度、总平滑度、总耗时为规划目标.同时引入合作型协同算法框架,将难以求解的多变量问题分组求解.每个机器人的路径视为子种群,子种群通过带精英策略的非支配排序遗传算法,进化并筛选出子种群的部分进入协同进化,每次迭代更新外部的精英解集,最终生成一组非支配路径解.仿真结果表明,在栅格地图环境下,本文算法可有效实现多移动机器人的多优化目标路径规划.     

一种新的多智能体强化学习算法及其在多机器人协作任务中的应用

在多机器人系统中，评价一个机器人行为的好坏常常依赖于其它机器人的行为，此 时必须采用组合动作以实现多机器人的协作，但采用组合动作的强化学习算法由于学习空间 异常庞大而收敛得极慢．本文提出的新方法通过预测各机器人执行动作的概率来降低学习空 间的维数，并应用于多机器人协作任务之中．实验结果表明，基于预测的加速强化学习算法 可以比原始算法更快地获得多机器人的协作策略．