A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

This paper addresses the multi-robot 2-cyclic scheduling problem in a no-wait robotic cell where exactly two parts enter and leave the cell during each cycle and multiple robots on a single track are responsible for transporting parts between machines. We develop a polynomial algorithm to find the minimum number of robots for all feasible cycle times. Consequently, the optimal cycle time for any given number of robots can be obtained with the algorithm. The proposed algorithm can be implemented in O(N⁷) time, where N is the number of machines in the considered robotic cell.     

Balancing task allocation in multi-robot systems using K-means clustering and auction based mechanisms

This paper aims to solve the balanced multi-robot task allocation problem. Multi-robot systems are becoming more and more significant in industrial, commercial and scientific applications. Effectively allocating tasks to multi-robots i.e. utilizing all robots in a cost effective manner becomes a tedious process. The current attempts made by the researchers concentrate only on minimizing the distance between the robots and the tasks, and not much importance is given to the balancing of work loads among robots. It is also found from the literature that the multi-robot system is analogous to Multiple Travelling Salesman Problem (MTSP). This paper attempts to develop mechanism to address the above two issues with objective of minimizing the distance travelled by ‘m’ robots and balancing the work load between ‘m’ robots equally. The proposed approach has two fold, first develops a mathematical model for balanced multi-robot task allocation problem, and secondly proposes a methodology to solve the model in three stages. Stage I groups the ‘N’ tasks into ‘n’ clusters of tasks using K-means clustering technique with the objective of minimizing the distance between the tasks, stage II calculates the travel cost of robot and clusters combination, stage III allocates the robot to the clusters in order to utilise all robot in a cost effective manner.     

RoboNetSim: An integrated framework for multi-robot and network simulation

In networked multi-robot systems, communication plays a major role defining system’s dynamics and performance. Unfortunately, existing multi-robot simulators do not provide advanced communication models. Therefore, given the intrinsic unreliability of wireless communications, significant differences might be observed between simulation and real-world results.Addressing these issues, we present RoboNetSim, an integrated simulation framework for communication-realistic simulation of networked multi-robot systems. RoboNetSim integrates multi-robot simulators with network simulators. We present two model implementations based on ARGoS at the robotic side, and NS-2 and NS-3 as network simulators. We evaluate the framework in terms of accuracy and computational performance, showing that it can efficiently simulate systems consisting of hundreds of robots.Using the Stage simulator as an example, we also show the integration of a robotic simulator with RoboNetSim by only adapting robot controllers, without the need to adapt the general code of the simulator.Finally, we demonstrate the effects of communication on mobile multi-robot systems. We consider two different case studies: a distributed coordination and task assignment scenario, and a coordinated mobility scenario. We compare realistic network simulation with simplified communication models and algorithms, and we study the resulting behavior and performance of the multi-robot system and the impact of different parameters.     

A team of mobile robots and monitoring sensors—from concept to experiment

This paper describes the underlying concepts, architecture and implementation of a robotic system consisting of heterogenous mobile robots and stationary sensors, cooperating in a task of collective perception and world modeling. The navigation capability of a group of robots can be improved by sharing available information about the state of the environment (the environment model) and information about the relative position estimates. The information sharing can be especially beneficial to the robots when there are also some stationary monitoring sensors (e.g. cameras) available in the environment, which can serve as external navigation aids. In the article, information processing performed by individual members of the team—robots and sensors—is analyzed and a unifying multi-agent blackboard architecture is described. For information sharing between robots and monitoring sensors, a framework based on the idea of the Contract Net Protocol is proposed. The communication backbone provides agents with unified communication interfaces. The experimental set-up is described. The results of tests validating the correctness of the design on the tasks of cooperative localization and world-model building are reported. A discussion and comparison to other multi-robot systems closes the article.     

分布式多机器人运动控制的离散事件系统方法

传统多机器人系统的运动控制主要依赖于机器人的动力学方程或运动学方程,通过求解微分方程组来获得机器人的输入控制信号.随着系统中机器人数量的增加和运行环境的复杂化,动力学方程很难描述多机器人系统的运动行为,且无法很好地解决诸如死锁等逻辑故障.本文简略综述了国内外的研究现状,重点介绍笔者所在研究组开展的关于离散事件系统方法在多机器人运动控制方面的应用性研究工作.其动机在于:1)基于离散事件系统方法的运动控制能够有效地解决系统运行过程中产生的诸如死锁等逻辑故障.首先,利用离散事件系统模型对多机器人系统的运动进行建模,从而降低计算复杂性;其次,基于所得离散事件系统模型,设计分布式安全运动控制算法,使各个机器人可以自主地、无碰撞地、无死锁地运动;设计分布式鲁棒运动控制算法,使得失效的机器人对系统的影响最小.2)基于离散事件系统方法的运动控制策略可以结合传统的基于运动学方程的运动控制方法,从而使系统不但能够避免顶层的逻辑故障,而且能够确定机器人执行器的输入信号.     

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.     

Sequencing and Scheduling in Robotic Cells: Recent Developments

A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated from one another by certain characteristics, including robot type, robot travel-time, number of robots, types of parts processed, and use of parallel machines within stages. We focus on cyclic production of parts. A cycle is specified by a repeatable sequence of robot moves designed to transfer a set of parts between the machines for their processing.We start by providing a classification scheme for robotic cell scheduling problems that is based on three characteristics: machine environment, processing restrictions, and objective function, and discuss the influence of these characteristics on the methods of analysis employed. In addition to reporting recent results on classical robotic cell scheduling problems, we include results on robotic cells with advanced features such as dual gripper robots, parallel machines, and multiple robots. Next, we examine implementation issues that have been addressed in the practice-oriented literature and detail the optimal policies to use under various combinations of conditions. We conclude by describing some important open problems in the field.     

MuRoCo: A Framework for Capability- and Situation-Aware Coalition Formation in Cooperative Multi-Robot Systems

One problem in cooperative multi-robot systems is to reach a group agreement on the distribution of tasks among the robots, known as multi-robot task allocation problem. In case the tasks require a tight cooperation among the robots the formation of adequate subteams, so-called coalitions, is needed which is known to be a NP-complete problem. Here the MuRoCo framework is presented, which solves the coalition formation problem for cooperative heterogeneous multi-robot systems. MuRoCo yields a lower increase of the worst-case complexity compared to previous solutions, while still guaranteeing optimality for sequential multi-robot task assignments. These include also the, in related work often neglected, optimal subtask assignment. In order to reduce the average complexity, which is commonly more relevant in the practical operation, pruning strategies are used that consider system-specific characteristics to reduce the number of potential solutions already in an early phase. To ensure a robust operation in dynamic environments, MuRoCo takes potential disturbances and the environmental uncertainty explicitly into account. This way MuRoCo yields capability- and situation-aware solutions for real world systems. The framework is theoretically analyzed and is practically validated in a cooperative service scenario, showing its suitability to complex applications, its robustness to environmental changes and its ability to recover from failures. Finally a benchmark evaluation shows the realizable problem sizes of the current implementation.     

Deterministic annealing with Potts neurons for multi-robot routing

A deterministic annealing (DA) method is presented for solving the multi-robot routing problem with min–max objective. This is an NP-hard problem belonging to the multi-robot task allocation set of problems where robots are assigned to a group of sequentially ordered tasks such that the cost of the slowest robot is minimized. The problem is first formulated in a matrix form where the optimal solution of the problem is the minimum-cost permutation matrix without any loops. The solution matrix is then found using the DA method is based on mean field theory applied to a Potts spin model which has been proven to yield near-optimal results for NP-hard problems. Our method is bench-marked against simulated annealing and a heuristic search method. The results show that the proposed method is promising for small-medium sized problems in terms of computation time and solution quality compared to the other two methods.

     

Search and tracking algorithms for swarms of robots: A survey

Target search and tracking is a classical but difficult problem in many research domains, including computer vision, wireless sensor networks and robotics. We review the seminal works that addressed this problem in the area of swarm robotics, which is the application of swarm intelligence principles to the control of multi-robot systems. Robustness, scalability and flexibility, as well as distributed sensing, make swarm robotic systems well suited for the problem of target search and tracking in real-world applications. We classify the works we review according to the variations and aspects of the search and tracking problems they addressed. As this is a particularly application-driven research area, the adopted taxonomy makes this review serve as a quick reference guide to our readers in identifying related works and approaches according to their problem at hand. By no means is this an exhaustive review, but an overview for researchers who are new to the swarm robotics field, to help them easily start off their research.     

Adaptive control of redundant multiple robots in cooperative motion

A redundant robot has more degrees of freedom than what is needed to uniquely position the robot end-effector. In practical applications the extra degrees of freedom increase the orientation and reach of the robot. Also the load carrying capacity of a single robot can be increased by cooperative manipulation of the load by two or more robots. In this paper, we develop an adaptive control scheme for kinematically redundant multiple robots in cooperative motion.In a usual robotic task, only the end-effector position trajectory is specified. The joint position trajectory will therefore be unknown for a redundant multi-robot system and it must be selected from a self-motion manifold for a specified end-effector or load motion. In this paper, it is shown that the adaptive control of cooperative multiple redundant robots can be addressed as a reference velocity tracking problem in the joint space. A stable adaptive velocity control law is derived. This controller ensures the bounded estimation of the unknown dynamic parameters of the robots and the load, the exponential convergence to zero of the velocity tracking errors, and the boundedness of the internal forces. The individual robot joint motions are shown to be stable by decomposing the joint coordinates into two variables, one which is homeomorphic to the load coordinates, the other to the coordinates of the self-motion manifold. The dynamics on the self-motion manifold are directly shown to be related to the concept of zero-dynamics. It is shown that if the reference joint trajectory is selected to optimize a certain type of objective functions, then stable dynamics on the self-motion manifold result. The overall stability of the joint positions is established from the stability of two cascaded dynamic systems involving the two decomposed coordinates.     

求解柔性机器人车间调度问题的混合蚁群算法

在柔性作业车间调度问题的基础上,考虑多台搬运机器人执行不同工序在不同机床之间的搬运,形成柔性机器人作业车间调度问题,提出混合蚁群算法。用改进析取图对问题进行描述,使用混合选择策略、自适应伪随机比例规则和改进信息素更新规则优化蚁群算法,结合遗传算子完成机床选择和工序排序。使用一种多机器人排序算法完成搬运机器人分配和搬运工序排序。通过多组算例仿真测试并与其他算法进行比较,验证了算法的有效性和可靠性。     

异构多机器人编队相互通信时延精确控制

编队控制是多机器人协同控制领域研究的重点问题。考虑实际复杂环境,对异构多机器人系统的编队控制研究更具工程意义。再者,当异构多机器人编队系统存在通信时延时,同时对系统中不同阶机器人进行一致性分析的难度增大。针对以上问题,提出一种基于一致性理论的异构系统编队控制算法。考虑零时延与固定时延两种情况,首先,利用一致性思想将领航跟随者模式下的异构多机器人系统编队控制问题转换为稳定性问题。然后,根据矩阵分析与Routh-Hurwitz定理,推导出零时延系统实现编队控制的充要条件。进一步构造Lyapunov-Razumikhin函数,利用Newton-Leibniz公式与Lyapunov定理,推导出固定时延系统实现编队控制的充分条件。仿真结果表明：基于一致性算法的异构多机器人系统能够实现相互通信时延条件下的编队精确控制。     

Towards temporal verification of swarm robotic systems

A robot swarm is a collection of simple robots designed to work together to carry out some task. Such swarms rely on the simplicity of the individual robots; the fault tolerance inherent in having a large population of identical robots; and the self-organised behaviour of the swarm as a whole. Although robot swarms present an attractive solution to demanding real-world applications, designing individual control algorithms that can guarantee the required global behaviour is a difficult problem. In this paper we assess and apply the use of formal verification techniques for analysing the emergent behaviours of robotic swarms. These techniques, based on the automated analysis of systems using temporal logics, allow us to analyse whether all possible behaviours within the robot swarm conform to some required specification. In particular, we apply model-checking, an automated and exhaustive algorithmic technique, to check whether temporal properties are satisfied on all the possible behaviours of the system. We target a particular swarm control algorithm that has been tested in real robotic swarms, and show how automated temporal analysis can help to refine and analyse such an algorithm.     

Model Continuity to Support Software Development for Distributed Robotic Systems: A Team Formation Example

Modeling, design and testing of the software underlying distributed robotic systems is a challenging task, especially when a large number of mobile robots and task coordination are involved. Model continuity, the ability to use the same model of a system throughout its design phases, provides an effective way to manage this development complexity and maintain consistency of the software. In this paper, we describe the design and implementation of a team-formation multi-robot system. This is used as an example to demonstrate how a modeling and simulation environment, based on the DEVS formalism, can support model continuity in the design of distributed robotic systems. This example shows how the intelligent control models of the robots are first designed and tested via simulation and, when verified mapped to physical robots with DEVS-on-a-chip brains for execution.     

一种基于情绪量的多机器人冲突消解方法

针对动态非结构化环境下多机器人之间存在的空间冲突问题,提出了一种基于情绪量的多机器人冲突消解方法。该方法可以使机器人根据情绪量自主判定对其他机器人的躲避半径,无须预先设定固定的避碰优先级或进行机器人之间的协商。仿真结果表明该方法是一种有效的多机器人冲突消解方法。     

Altruistic coordination for multi-robot cooperative pathfinding

When multiple robots perform tasks in a shared workspace, they might be confronted with the risk of blocking each other’s ways, which will lead to conflicts or interference among them. Planning collision-free paths for all the robots is a challenge for a multi-robot system, which is also known as the multi-robot cooperative pathfinding problem in which each robot has to navigate from its starting location to the destination while keeping avoiding stationary obstacles as well as the other robots. In this paper, we present a novel fully decentralized approach to this problem. Our approach allows robots to make real-time responses to dynamic environments and can resolve a set of benchmark deadlock situations subject to complex spatial constraints in a shared workspace by means of altruistic coordination. Specifically, when confronted with congested situations, each robot can employ waiting, moving-forwards, dodging, retreating and turning-head strategies to make local adjustments. Most importantly, each robot only needs to coordinate and communicate with the others that are located within its coordinated network in our approach, which can reduce communication overhead in fully decentralized multi-robot systems. In addition, experimental results also show that our proposed approach provides an efficient and competitive solution to this problem.     

动作预测在多机器人强化学习协作中的应用

在多机器人系统中,协作环境探索的强化学习的空间规模是机器人个数的指数函数,学习空间非常庞大造成收敛速度极慢。为了解决这个问题,将基于动作预测的强化学习方法及动作选择策略应用于多机器人协作研究中,通过预测机器人可能执行动作的概率以加快学习算法的收敛速度。实验结果表明,基于动作预测的强化学习方法能够比原始算法更快速地获取多机器人的协作策略。     

Particle Filter for Collaborative Multi-Robot Localization Tolerant to Recognition Error

Statistical algorithms using particle filters have been proposed previously for collaborative multi-robot localization. In these algorithms, by synchronizing each robot's belief or exchanging the particles of the robots, fast and accurate localization is attained. However, there algorithms assume correct recognition of other robots and the effects of recognition error are not considered. If the recognition of other robots is incorrect, a large amount of error in localization can occur. This paper describes this problem. Furthermore, in order to cope with the problem, an algorithm for collaborative multi-robot localization is proposed. In the proposed algorithm, the particles of a robot are exchanged with those of other robots according to measurement results obtained by the sending robot. At the same time, some particles remain in the sending robot. Received particles from other robots are evaluated using measurement results obtained by the receiving robot. The proposed method copes with recognition error by using the remaining particles, and increases the accuracy of estimation by twice evaluating the exchanged particles of the sending and receiving robots. 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.     

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.