CAMPOUT: a control architecture for tightly coupled coordination of multirobot systems for planetary surface exploration

Exploration of high risk terrain areas such as cliff faces and site construction operations by autonomous robotic systems on Mars requires a control architecture that is able to autonomously adapt to uncertainties in knowledge of the environment. We report on the development of a software/hardware framework for cooperating multiple robots performing such tightly coordinated tasks. This work builds on our earlier research into autonomous planetary rovers and robot arms. Here, we seek to closely coordinate the mobility and manipulation of multiple robots to perform examples of a cliff traverse for science data acquisition, and site construction operations including grasping, hoisting, and transport of extended objects such as large array sensors over natural, unpredictable terrain. In support of this work we have developed an enabling distributed control architecture called control architecture for multirobot planetary outposts (CAMPOUT) wherein integrated multirobot mobility and control mechanisms are derived as group compositions and coordination of more basic behaviors under a task-level multiagent planner. CAMPOUT includes the necessary group behaviors and communication mechanisms for coordinated/cooperative control of heterogeneous robotic platforms. In this paper, we describe CAMPOUT, and its application to ongoing physical experiments with multirobot systems at the Jet Propulsion Laboratory in Pasadena, CA, for exploration of cliff faces and deployment of extended payloads.     

A semantically-informed multirobot system for exploration of relevant areas in search and rescue settings

Coordinated multirobot exploration involves autonomous discovering and mapping of the features of initially unknown environments by using multiple robots. Autonomously exploring mobile robots are usually driven, both in selecting locations to visit and in assigning them to robots, by knowledge of the already explored portions of the environment, often represented in a metric map. In the literature, some works addressed the use of semantic knowledge in exploration, which, embedded in a semantic map, associates spatial concepts (like ‘rooms’ and ‘corridors’) with metric entities, showing its effectiveness in improving the total area explored by robots. In this paper, we build on these results and propose a system that exploits semantic information to push robots to explore relevant areas of initially unknown environments, according to a priori information provided by human users. Discovery of relevant areas is significant in some search and rescue settings, in which human rescuers can instruct robots to search for victims in specific areas, for example in cubicles if a disaster happened in an office building during working hours. We propose to speed up the exploration of specific areas by using semantic information both to select locations to visit and to determine the number of robots to allocate to those locations. In this way, for example, more robots could be assigned to a candidate location in a corridor, so the attached rooms can be explored faster. We tested our semantic-based multirobot exploration system within a reliable robot simulator and we evaluated its performance in realistic search and rescue indoor settings with respect to state-of-the-art approaches.     

Decentralized Coordinated Tracking with Mixed Discrete–Continuous Decisions

In this paper, we study the problem of dynamically positioning a team of mobile robots for target tracking. We treat the coordination of mobile robots for target tracking as a joint team optimization to minimize uncertainty in target state estimates over a fixed horizon. The optimization is inherently a function of both the positioning of robots in continuous space and the assignment of robots to targets in discrete space. Thus, the robot team must make decisions over discrete and continuous variables. In contrast to methods that decouple target assignments and robot positioning, our approach avoids the strong assumption that a robot's utility for observing a target is independent of other robots’ observations. We formulate the optimization as a mixed integer nonlinear program and apply integer relaxation to develop an approximate solution in decentralized form. We demonstrate our coordinated multirobot tracking algorithm both in simulation and using a pair of mobile robotic sensor platforms to track moving pedestrians. Our results show that coupling target assignment and robot positioning realizes coordinated behaviors that are not possible with decoupled methods.     

Coordinated multi-robot exploration

In this paper, we consider the problem of exploring an unknown environment with a team of robots. As in single-robot exploration the goal is to minimize the overall exploration time. The key problem to be solved in the context of multiple robots is to choose appropriate target points for the individual robots so that they simultaneously explore different regions of the environment. We present an approach for the coordination of multiple robots, which simultaneously takes into account the cost of reaching a target point and its utility. Whenever a target point is assigned to a specific robot, the utility of the unexplored area visible from this target position is reduced. In this way, different target locations are assigned to the individual robots. We furthermore describe how our algorithm can be extended to situations in which the communication range of the robots is limited. Our technique has been implemented and tested extensively in real-world experiments and simulation runs. The results demonstrate that our technique effectively distributes the robots over the environment and allows them to quickly accomplish their mission.     

Validating human-robot interaction schemes in multitasking environments

The ability of robots to autonomously perform tasks is increasing. More autonomy in robots means that the human managing the robot may have available free time. It is desirable to use this free time productively, and a current trend is to use this available free time to manage multiple robots. We present the notion of neglect tolerance as a means for determining how robot autonomy and interface design determine how free time can be used to support multitasking, in general, and multirobot teams, in particular. We use neglect tolerance to 1) identify the maximum number of robots that can be managed; 2) identify feasible configurations of multirobot teams; and 3) predict performance of multirobot teams under certain independence assumptions. We present a measurement methodology, based on a secondary task paradigm, for obtaining neglect tolerance values that allow a human to balance workload with robot performance.     

Applying a path planner based on RRT to cooperative multirobot box-pushing

Considering robot systems in the real world, a multirobot system where multiple robots work simultaneously without colliding with each other is more practical than a single-robot system where only one robot works. Therefore, solving the path-planning problem in a multirobot system is very important. In this study, we developed a path-planner based on the rapidly exploring random tree (RRT), which is a data structure and algorithm designed for efficiently searching for multirobot box-pushing, and made experiments in real environments. A path planner must construct a plan which avoids the robot colliding with obstacles or with other robots. Moreover, in some cases, a robot must collaborate with other robots to transport the box without colliding with any obstacles. Our proposed path planner constructs a box-transportation plan and the path plans of each robot bearing the above considerations in mind. Experimental results showed that our proposed planner can construct a multirobot box-pushing plan without colliding with obstacles, and that the robots can execute tasks according to the plan in real environments. We also checked that multiple robots can perform problem tasks when only one robot could not transport the box to the goal. This work was presented in part at the 13th International Symposium on Articifial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Robot Teams for Intervention in Confined and Structured Environments

Safety, security, and rescue robotics can be extremely useful in emergency scenarios such as mining accidents or tunnel collapses where robot teams can be used to carry out cooperative exploration, intervention, or logistic missions. Deploying a multirobot team in such confined environments poses multiple challenges that involve task planning, motion planning, localization and mapping, safe navigation, coordination, and communications among all the robots. To complete their mission, robots have to be able to move in the environment with full autonomy while at the same time maintaining communication among themselves and with their human operators to accomplish team collaboration. Guaranteeing connectivity enables robots to explicitly exchange information needed in the execution of collaborative tasks and allows operators to monitor and teleoperate the robots and receive information about the environment. In this work, we present a system that integrates several research aspects to achieve a real exploration exercise in a tunnel using a robot team. These aspects are as follows: deployment planning, semantic feature recognition, multirobot navigation, localization, map building, and real‐time communications. Two experimental scenarios have been used for the assessment of the system. The first is the Spanish Santa Marta mine, a large mazelike environment selected for its complexity for all the tasks involved. The second is the Spanish‐French Somport tunnel, an old railway between Spain and France through the Central Pyrenees, used to carry out the real‐world experiments. The latter is a simpler scenario, but it serves to highlight the real communication issues.     

Cooperative control through objective achievement

Cooperative control is a key issue for multirobot systems in many practical applications. In this paper, we address the problem of coordinating a set of mobile robots in the RoboCup soccer middle-size league. We show how the coordination problem that we face can be cast as a specific coalition formation problem, and we propose a distributed algorithm to efficiently solve it. Our approach is based on the distributed computation of a measure of satisfaction (called Agent Satisfaction) that each agent computes for each task. We detail how each agent computes the Agent Satisfaction by acquiring sensor perceptions through an omnidirectional vision system, extracting aggregated information from the acquired perception, and integrating such information with that communicated by the teammates. We empirically validate our approach in a simulated scenario and within RoboCup competitions. The experiments in the simulated scenario allow us to analyse the behaviour of the algorithm in different situations, while the use of the algorithm in real competitions validates the applicability of our approach to robotic platforms involved in a dynamic and complex scenario.     

Multirobot coordination in pick-and-place tasks on a moving conveyor

This paper considers the problem of multirobot coordination in pick-and-place tasks on a conveyor band. The robot team is composed of identical robots with mutually exclusive, but neighboring workspaces. The products are fed in at one end of the band, move through each workspace sequentially until being picked up and are collected at the other end—if not picked up interim. Each robot has the same task—that is picking up and packaging as many products as possible. We propose an approach based on noncooperative game theory where each robot uses local observations of the conveyor band and their neighbors' actions in order to decide on its actions. The developed algorithm has been implemented and tested in a simulated manufacturing environment using Webots. Results obtained from the simulations are analyzed using a variety of statistical performance measures.     

Multi-robot collaboration for robust exploration

This paper presents a new sensing modality for multirobot exploration. The approach is based on using a pair of robots that observe each other, and act in concert to reduce odometry errors. We assume the robots can both directly sense nearby obstacles and see each other. The proposed approach improves the quality of the map by reducing the inaccuracies that occur over time from dead reckoning errors. Furthermore, by exploiting the ability of the robots to see each other, we can detect opaque obstacles in the environment independently of their surface reflectance properties. Two different algorithms, based on the size of the environment, are introduced, with a complexity analysis, and experimental results in simulation and with real robots. This revised version was published online in August 2006 with corrections to the Cover Date.     

动态环境下分布式异构多机器人避障方法研究

多机器人系统在联合搜救、智慧车间、智能交通等领域得到了日益广泛的应用。目前,多个机器人之间、机器人与动态环境之间的路径规划和导航避障仍需依赖精确的环境地图,给多机器人系统在非结构环境下的协调与协作带来了挑战。针对上述问题,本文提出了不依赖精确地图的分布式异构多机器人导航避障方法,建立了基于深度强化学习的多特征策略梯度优化算法,并考虑了人机协同环境下的社会范式,使分布式机器人能够通过与环境的试错交互,学习最优的导航避障策略;并在Gazebo仿真环境下进行了最优策略的训练学习,同时将模型移植到多个异构实体机器人上,将机器人控制信号解码,进行真实环境测试。实验结果表明:本文提出的多特征策略梯度优化算法能够通过自学习获得最优的导航避障策略,为分布式异构多机器人在动态环境下的应用提供了一种技术参考。     

Current research in multirobot systems

As research progresses in distributed robotic systems, more and more aspects of multirobot systems are being explored. This article describes advances in multirobot systems, and surveys the current state of the art. The focus is principally on research that has been demonstrated in physical robot implementations. I have identified eight primary research topics within multirobot systems—biological inspirations, communication, architectures, localization/mapping/exploration, object transport and manipulation, motion coordination, reconfigurable robots, and learning—and discuss the current state of research in these areas. As I describe each research area, I identify some key open issues in multirobot team research, and conclude by identifying several additional open research issues in distributed mobile robotic systems. This work was presented, in part, at the Seventh International Symposium on Artificial Life and Robotics, Oita, Japan, January 16–18, 2002     

Scalable and practical pursuit-evasion with networked robots

In this paper, we consider the design and implementation of practical pursuit-evasion games with networked robots, where a communication network provides sensing-at-a-distance as well as a communication backbone that enables tighter coordination between pursuers. We first develop, using the theory of zero-sum games, an algorithm that computes the minimal completion time strategy for pursuit-evasion when pursuers and evaders have same speed, and when all players make optimal decisions based on complete knowledge. Then, we extend this algorithm to when evader are significantly faster than pursuers. Unfortunately, these algorithms do not scale beyond a small number of robots. To overcome this problem, we design and implement a partition algorithm where pursuers capture evaders by decomposing the game into multiple multi-pursuer single-evader games. We show that the partition algorithm terminates, has bounded capture time, is robust, and is scalable in the number of robots. We then describe the design of a real-world mobile robot-based pursuit evasion game. We validate our algorithms by experiments in a moderate-scale testbed in a challenging office environment. Overall, our work illustrates an innovative interplay between robotics and communication.     

Local communication of multiple mobile robots: Design of optimal communication area for cooperative tasks

This paper presents an optimal design for local communication between multiple mobile robots. In previous studies of local communication in multirobot systems, the area of communication was not designed using mathematical analysis, but only time-consuming simulations of multirobot communications. We analyzed the information transmission efficiency and created an optimal communication area that minimizes the information transmission time to multiple robots. This optimization comprises two steps. First, we derive the “information transmission probability” for various task models. Next, the derived information transmission probability is used to minimize the information transmission time. The optimal communication design is tested for various tasks, using system parameters. The analytical results are further verified by using computer simulations of multirobot communications and experiments with local communication. © 1998 John Wiley & Sons, Inc.     

A hierarchical gene regulatory network for adaptive multirobot pattern formation

Most existing multirobot systems for pattern formation rely on a predefined pattern, which is impractical for dynamic environments where the pattern to be formed should be able to change as the environment changes. In addition, adaptation to environmental changes should be realized based only on local perception of the robots. In this paper, we propose a hierarchical gene regulatory network (H-GRN) for adaptive multirobot pattern generation and formation in changing environments. The proposed model is a two-layer gene regulatory network (GRN), where the first layer is responsible for adaptive pattern generation for the given environment, while the second layer is a decentralized control mechanism that drives the robots onto the pattern generated by the first layer. An evolutionary algorithm is adopted to evolve the parameters of the GRN subnetwork in layer 1 for optimizing the generated pattern. The parameters of the GRN in layer 2 are also optimized to improve the convergence performance. Simulation results demonstrate that the H-GRN is effective in forming the desired pattern in a changing environment. Robustness of the H-GRN to robot failure is also examined. A proof-of-concept experiment using e-puck robots confirms the feasibility and effectiveness of the proposed model.     

Dynamic Frontier-Led Swarming: Multi-Robot Repeated Coverage in Dynamic Environments

A common assumption of coverage path planning research is a static environment.Such environments require only a single visit to each area to achieve coverage.However,some real-world environments are characterised by the presence of unexpected,dynamic obstacles.They require areas to be revisited periodically to maintain an accurate coverage map,as well as reactive obstacle avoidance.This paper proposes a novel swarmbased control algorithm for multi-robot exploration and repeated coverage in envir...     

Probabilistic network formation through coverage and freeze-tag

We address the problem of propagating a piece of information among robots scattered in an environment. Initially, a single robot has the information. This robot searches for other robots to pass it along. When a robot is discovered, it can participate in the process by searching for other robots. Since our motivation for studying this problem is to form an ad hoc network, we call it the Network Formation Problem. In this paper, we study the case where the environment is a rectangle and the robots’ locations are unknown but chosen uniformly at random. We present an efficient network formation algorithm, Stripes, and show that its expected performance is within a logarithmic factor of the optimal performance. We also compare Stripes with an intuitive network formation algorithm in simulations. The feasibility of Stripes is demonstrated with a proof-of-concept implementation.     

一种基于行为效用理论的多移动机器人编队协调方法

本文提出了一种基于行为效用理论的多移动机器人编队协调方法，用于解决多移动机器人编队初始化问题，实现自治的多移动机器人按特定的空间结构进行编队以完成特定的任务．我们对编队问题协调控制策略和算法进行了研究，给出了行为效用方程及两个衡量值，并针对编队问题的协调控制过程中目标点重复决策问题及偏远目标的选择问题进行了探讨并给出了相应的改进协调方案，计算机仿真试验验证了本文所提方法的有效性和可行性．     

Distributed Motion Constraints for Algebraic Connectivity of Robotic Networks

This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed coordination algorithm that allows the robots to decide whether a desired collective motion breaks connectivity. We build on this procedure to design a second coordination algorithm that allows the robots to modify a desired collective motion to guarantee that connectivity is preserved. These algorithms work under imperfect information caused by delays in communication and the robots’ mobility. Under very outdated information, the proposed algorithms might prevent some or all of the robots from moving. We analyze the correctness of our algorithms by formulating them as games against a hypothetical adversary who chooses system states consistent with observed information. The technical approach combines tools from algebraic graph theory, linear algebra, and nonsmooth analysis.     

Team NimbRo at MBZIRC 2017: Fast landing on a moving target and treasure hunting with a team of micro aerial vehicles

The Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2017 has defined ambitious new benchmarks to advance the state‐of‐the‐art in autonomous operation of ground‐based and flying robots. This study covers our approaches to solve the two challenges that involved micro aerial vehicles (MAV). Challenge 1 required reliable target perception, fast trajectory planning, and stable control of an MAV to land on a moving vehicle. Challenge 3 demanded a team of MAVs to perform a search and transportation task, coined “Treasure Hunt,” which required mission planning and multirobot coordination as well as adaptive control to account for the additional object weight. We describe our base MAV setup and the challenge‐specific extensions, cover the camera‐based perception, explain control and trajectory‐planning in detail, and elaborate on mission planning and team coordination. We evaluated our systems in simulation as well as with real‐robot experiments during the competition in Abu Dhabi. With our system, we—as part of the larger team NimbRo—won the MBZIRC Grand Challenge and achieved a third place in both subchallenges involving flying robots.