多机器人任意队形分布式控制研究

本文针对多智能体协作完成特定任务时难以在全自主控制的前提下协作形成任意队 形和队形向量不易确定的问题，通过由各智能体自主简单的确定自己的队形向量，从理论上 扩展基于队形向量的队形控制原理以生成任意队形，改进机器人的运动方式以提高收敛速度 ，提出一种快速收敛的机器人部队任意队形分布式控制算法．为了解决智能体机器人之间的 冲突问题，提出了一个通信协调模型．仿真实验和实际机器人实验均表明了算法的可行性和 有效性．     

Multirobot Rendezvous With Visibility Sensors in Nonconvex Environments

This paper presents a coordination algorithm for mobile autonomous robots. Relying on distributed sensing, the robots achieve rendezvous, i.e., they move to a common location. Each robot is a point mass moving in a simply connected, nonconvex, unknown environment according to an omnidirectional kinematic model. It is equipped with line-of-sight limited-range sensors, i.e., it can measure the relative position of any object (robots or environment boundary) if and only if the object is within a given distance and there are no obstacles in between. The perimeter minimizing algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. The algorithm provably achieves rendezvous if the interagent sensing graph is connected at any time during the evolution of the group. Simulations illustrate the theoretical results and the performance of the proposed algorithm in asynchronous setups and with measurement errors, control errors, and nonzero robot size. Simulations to illustrate the importance of visibility constraints and comparisons with the optimal centralized algorithm are also included.     

多移动机器人的领航-跟随编队避障控制

针对多移动机器人的编队控制问题,提出了一种结合Polar Histogram避障法的领航-跟随协调编队控制算法。该算法在领航-跟随l-φ编队控制结构的基础上引入虚拟跟随机器人,将编队控制转化为跟随机器人对虚拟跟随机器人的轨迹跟踪控制。结合移动机器人自身传感器技术,在简单甚至复杂的环境下为机器人提供相应的路径运动策略,实现实时导航的目的。以两轮差动Qbot移动机器人为研究对象,搭建半实物仿真平台,进行仿真实验。仿真结果表明:该方法可以有效地实现多移动机器人协调编队和避障控制。     

快速收敛的机器人部队任意队形分布式控制算法

针对多智能体协作完成特定任务时难以在全自主控制的前提下协作形成任意队形和队形向量不易确定的问题 ,通过由各智能体自主简单的确定自己的队形向量 ,从理论上扩展基于队形向量的队形控制原理以生成任意队形 ,改进机器人的运动方式以提高收敛速度 ,提出一种快速收敛的机器人部队任意队形分布式控制算法 .仿真结果表明 ,该算法可以形成任意队形 ,比现有控制算法的收敛速度快 ,队形收敛所需的时间仅为现有算法的 10 %左右     

Decentralised consensus-based formation tracking of multiple differential drive robots

This article investigates the control problem for formation tracking of multiple nonholonomic robots under distributed manner which means each robot only needs local information exchange. A class of general state and input transform is introduced to convert the formation-tracking issue of multi-robot systems into the consensus-like problem with time-varying reference. The distributed observer-based protocol with nonlinear dynamics is developed for each robot to achieve the consensus tracking of the new system, which namely means a group of nonholonomic mobile robots can form the desired formation configuration with its centroid moving along the predefined reference trajectory. The finite-time stability of observer and control law is analysed rigorously by using the Lyapunov direct method, algebraic graph theory and matrix analysis. Numerical examples are finally provided to illustrate the effectiveness of the theory results proposed in this paper.     

From Trajectory Tracking Control to Leader–Follower Formation Control

Abstract

This work investigates the leader–follower formation control of multiple nonholonomic mobile robots. First, the formation control problem is converted into a trajectory tracking problem and a tracking controller based on the dynamic feedback linearization technique drives each follower robot toward its corresponding reference trajectory in order to achieve the formation. The desired orientation for each follower is selected such that the nonholonomic constraint of the robot is respected, and thus the tracking of the reference trajectory for each follower is feasible. An adaptive dynamic controller that considers the actuators dynamics in the design procedure is proposed. The dynamic model of the robots includes the actuators dynamics in order to obtain the velocities as control inputs instead of torques or voltages. Using Lyapunov control theory, the tracking errors are proven to be asymptotically stable and the formation is achieved despite the uncertainty of the dynamic model parameters. In order to assess the proposed control laws, a ROS-framework is developed to conduct real experiments using four ROS-enabled mobile robots TURTLEBOTs. Moreover, the leader fault problem, which is considered as the main drawback of the leader–follower approach, is solved under ROS. An experiment is conducted where in order to overcome this problem, the desired formation and the leader role are modified dynamically during the experiment.     

Motion planning for cooperative unicycle-type mobile robots with limited sensing ranges: A distributed receding horizon approach

This paper presents a decentralized motion planner for a team of nonholonomic mobile robots subject to constraints imposed by sensors and the communication network. The motion planning scheme consists of decentralized receding horizon planners that reside on each vehicle to achieve coordination among flocking agents. The advantage of the proposed algorithm is that each vehicle only requires local knowledge of its neighboring vehicles. The main requirement for designing an optimal conflict-free trajectory in a decentralized way is that each robot does not deviate too far from its presumed trajectory designed without taking the coupling constraints into account. A comparative study between the proposed algorithm and other existing algorithms is provided in order to show the advantages, especially in terms of computing time. Finally, experiments are performed on a team of three mobile robots to demonstrate the validity of the proposed approach.     

A generalized framework of dynamic role assignment for robot formation control

A dynamic role assignment algorithm is proposed in the paper for formation control of multiple mobile robots. The goal of the algorithm is to reassign a role for each robot automatically during a formation is forming or switching. Many formation control systems have been successfully implemented and validated by supporting experimental results. Nevertheless, this research aims at providing an efficient algorithm of role assignment for a class of formation control systems employing the concept of combinational optimization problems. Specifically, by exploring spatial relationship between robots and information of obstacles surrounding the robots, a character cost function is found to represent the degree of difficulty for a robot been assigned a specified role in a formation. Instead of using complex cost minimization procedure, a solution is provided by calculating the largest value of character set fitness, and a new formation is selected for robots accordingly. The developed algorithm is applied to the formation control of a group omni-directional driven robots. Simulation and experimentation are performed with real platform to verify the proposed algorithm and the results show that the performance of the proposed dynamic role assignment algorithm is efficient for robot formation control.     

Coordination of multiple mobile robots with limited communication range in pursuit of single mobile target in cluttered environment

This paper addresses the problem of coordinating multiple mobile robots in searching for and capturing a mobile target, with the aim of reducing the capture time. Compared with the previous algorithms, we assume that the target can be detected by any robot and captured successfully by two or more robots. In this paper, we assume that each robot has a limited communication range. We maintain the robots within a mobile network to guarantee the successful capture. In addition, the motion of the target is modeled and incorporated into directing the motion of the robots to reduce the capture time. A coordination algorithm considering both aspects is proposed. This algorithm can greatly reduce the expected time of capturing the mobile target. Finally, we validate the algorithm by the simulations and experiments.     

Finite‐time formation control of multiple nonholonomic mobile robots

This paper considers finite‐time formation control problem for a group of nonholonomic mobile robots. The desired formation trajectory is represented by a virtual dynamic leader whose states are available to only a subset of the followers and the followers have only local interaction. First of all, a continuous distributed finite‐time observer is proposed for each follower to estimate the leader's states in a finite time. Then, a continuous distributed cooperative finite‐time tracking control law is designed for each mobile robot. Rigorous proof shows that the group of mobile robots converge to the desired geometric formation pattern in finite time. At the same time, all the robots can track the desired formation trajectory in finite time. Simulation example illustrates the effectiveness of our method. Copyright © 2012 John Wiley & Sons, Ltd.     

基于行为的多机器人任意队形的控制

针对多机器人队形优化控制任务,提出一种快速收敛的机器人任意队形的控制算法。各机器人在奔向目标的过程中以队形的几何中心为参考点,自主地确定队形向量。在保持队形的过程中,采用动态死区法,通过对各个区域大小的控制达到对机器人速度的控制,维持规定队形。采用反向避碰、切线避障,根据各机器人间的位置,引入整体队形向量约束机器人的方向,达到机器人整体队形的方向与机器人运动方向一致。实验结果表明该算法可以快速、有效地完成各种编队任务。     

Cooperative exploration based on supervisory control of multi-robot systems

When multiple mobile robots cooperatively explore an unknown environment, the advantages of robustness and redundancy are guaranteed. However, available traditional economy approaches for coordination of multi-robot systems (MRS) exploration lack efficient target selection strategy under a few of situations and rely on a perfect communication. In order to overcome the shortages and endow each robot autonomy, a novel coordinated algorithm based on supervisory control of discrete event systems and a variation of the market approach is proposed in this paper. Two kinds of utility and the corresponding calculation schemes which take into account of cooperation between robots and covering the environment in a minimal time, are defined. Different moving target of each robot is determined by maximizing the corresponding utility at the lower level of the proposed hierarchical coordinated architecture. Selection of a moving target assignment strategy, dealing with communication failure, and collision avoidance are modeled as behaviors of each robot at the upper level. The proposed approach distinctly speeds up exploration process and reduces the communication requirement. The validity of our algorithm is verified by computer simulations.     

Formation path following control of unicycle-type mobile robots

This paper presents a control strategy for the coordination of multiple mobile robots. A combination of the virtual structure and path following approaches is used to derive the formation architecture. A formation controller is proposed for the kinematic model of two-degree-of-freedom unicycle-type mobile robots. The approach is then extended to consider the formation controller by taking into account the physical dimensions and dynamics of the robots. The controller is designed in such a way that the path derivative is left as a free input to synchronize the robot’s motion. Simulation results with three robots are included to show the performance of our control system. Finally, the theoretical results are experimentally validated on a multi-robot platform.     

一种改进多机器人分布式滚动路径规划算法

针对多移动机器人全局静态环境未知的路径规划问题,采用了一个全局性能指标,在保证路径较优的情况下,最小化机器人的停顿时间,提出机器人之间以修正局部路径为主的协调策略。根据多机器人滚动路径算法的原理,设计了改进的多机器人分布式滚动路径规划算法。在已有仿真系统上进行测试,比较了所提出的协调策略与改变机器人移动速度协调策略对性能指标的影响。仿真结果表明,静态环境未知情况下,机器人可以并行规划各自的协调路径。     

多移动机器人组成任意队形的控制研究

本文将多移动机器人组成队形的整体行为分解为机器人个体分别向对应目标点运动的子行为加以研究．提出了基于两层监控模式的分布式控制框架,监控模块作为统一的指挥协调中枢,确定各机器人合理的对应目标点,避免机器人在目标区域内绕路,使得多移动机器人能够快速流畅地组成任意队形．实验证明了控制方法的有效性．     

非完整移动机器人的复合编队控制

主要研究了非完整自主机器人之间的队形保持和避障问题,提出了一种新的复合编队控制方法,该方法根据机器人的期望位置在其运动约束区域内外的不同,分别以一种灵活的反馈线性化算法和最优近似目标算法来建立控制规则,并提出了编队环境中存在静态障碍物时的队形控制策略,从而实现多机器人的稳定编队控制．该方法降低了传统线性反馈控制对编队初始误差范围的要求,并且解决了非完整机器人编队的避障问题．实验结果表明了该编队控制方法的可行性和有效性．     

一类非完整移动机器人编队控制方法

针对大部分两轮非完整移动机器人轮轴中心与几何中心不重合的特点, 提出一种多机器人协调编队控制算法. 构造队形参数矩阵确定编队形状, 根据领航机器人和相关队形参数生成虚拟机器人, 把编队控制分解为跟随机器人对虚拟机器人的轨迹跟踪. 建立虚拟机器人与跟随机器人之间误差系统模型, 利用Lyapunov 理论设计相应控制器, 从而实现队形保持和变换. 应用microsoft robotics developer studio 4(MRDS4) 搭建3D 仿真平台, 设计3 组实验, 结果进一步验证了所提出方法的有效性.

     

Nash-optimization distributed model predictive control for multi mobile robots formation

This paper investigates the distributed model predictive control (DMPC) problem for multi mobile robots. The distributed system model is obtained by the kinematic model of single mobile robot. By including the coupling terms in the cost function, cooperation between subsystems can be incorporated in the distributed control problem. Then, each robot has its own optimal control problem, and neighboring subsystems can exchange information with one another by using wireless communication. The distributed model predictive control problem is formulated by the local cost function and solved by using Nash-optimization algorithm. The convergence condition of the proposed algorithm is presented. Finally, an illustrative example is given to demonstrate the effectiveness of the proposed method.     

Punctual versus continuous auction coordination for multi-robot and multi-task topological navigation

This paper addresses the interest of using punctual versus continuous coordination for mobile multi-robot systems where robots use auction sales to allocate tasks between them and to compute their policies in a distributed way. In continuous coordination, one task at a time is assigned and performed per robot. In punctual coordination, all the tasks are distributed in Rendezvous phases during the mission execution. However, tasks allocation problem grows exponentially with the number of tasks. The proposed approach consists in two aspects: (1) a control architecture based on topological representation of the environment which reduces the planning complexity and (2) a protocol based on sequential simultaneous auctions (SSA) to coordinate Robots’ policies. The policies are individually computed using Markov Decision Processes oriented by several goal-task positions to reach. Experimental results on both real robots and simulation describe an evaluation of the proposed robot architecture coupled wih the SSA protocol. The efficiency of missions’ execution is empirically evaluated regarding continuous planning.     

Conflict free coordinated path planning for multiple robots using a dynamic path modification sequence

In this paper, a practically viable approach for conflict free, coordinated motion planning of multiple robots is proposed. The presented approach is a two phase decoupled method that can provide the desired coordination among the participating robots in offline mode. In the first phase, the collision free path with respect to stationary obstacles for each robot is obtained by employing an A* algorithm. In the second phase, the coordination among multiple robots is achieved by resolving conflicts based on a path modification approach. The paths of conflicting robots are modified based on their position in a dynamically computed path modification sequence (PMS). To assess the effectiveness of the developed methodology, the coordination among robots is also achieved by different strategies such as fixed priority sequence allotment for motion of each robot, reduction in the velocities of joints of the robot, and introduction of delay in starting of each robot. The performance is assessed in terms of the length of path traversed by each robot, time taken by the robot to realize the task and computational time. The effectiveness of the proposed approach for multi-robot motion planning is demonstrated with two case studies that considered the tasks with three and four robots. The results obtained from realistic simulation of multi-robot environment demonstrate that the proposed approach assures rapid, concurrent and conflict free coordinated path planning for multiple robots.