Formation Navigation and Relative Localisation of Multi-Robot Systems

When proceeding from single to multiple robots, cooperative action is one of the most relevant topics. The domain of robotic security systems contains typical applications for a multi-robot system (MRS). Possible scenarios are safety and security issues on airports, harbours, large industry plants or museums. Additionally, the field of environmental supervision is an up-coming issue. Inherent to these applications is the need for an organised and coordinated navigation of the robots, and a vital prerequisite for any coordinated movements is a good localisation. This dissertation will present novel approaches to the problems of formation navigation and relative localisation with multiple ground-based mobile robots. It also looks into the question what kind of metric is applicable for multi-robot navigation problems. Thereby, the focus of this work will be on aspects of 1. coordinated navigation and movement A new potential-field-based approach to formation navigation is presented. In contradiction to classical potential-field-based formation approaches, the proposed method also uses the orientation between neighbours in the formation. Consequently, each robot has a designated position within the formation. Therefore, the new method is called directed potential field approach. Extensive experiments prove that the method is capable of generating all kinds of formation shapes, even in the presence of dense obstacles. All tests have been conducted with simulated and real robots and successfully guided the robot formation through environments with varying obstacle configurations. In comparison, the nondirected potential field approach turns out to be unstable regarding the positions of the robots within formations. The robots strive to switch their positions, e.g. when passing through narrow passages. Under such conditions the directed approach shows a preferable behaviour, called “breathing”. The formation shrinks or inflates depending on the obstacle situation while trying to maintain its shape and keep the robots at their desired positions inside the formation. For a more particular comparison of formation algorithms it is important to have measures that allow a meaningful evaluation of the experimental data. For this purpose a new formation metric is developed. If there are many obstacles, the formation error must be scaled down to be comparable to an empty environment where the error would be small. Assuming that the environment is unknown and possibly non-static, only actual sensor information can be used for these calculations. We developed a special weighting factor, which is inverse proportional to the “density” of obstacles and which turns out to model the influence of the environment adequately. 2. relative localisation A new method for relative localisation between the members of a robot group is introduced. This relative localisation approach uses mutual sensor observations to localise the robots with respect to other objects – without having an environment model. Techniques like the Extended Kalman Filter (EKF) have proven to be powerful tools in the field of single robot applications. This work presents extensions to these algorithms with respect to the use in MRS. These aspects are investigated and combined under the topic of improving and stabilising the performance of the localisation and navigation process. Most of the common localisation approaches use maps and/or landmarks with the intention of generating a globally consistent world-coordinate system for the robot group. The aim of the here presented relative localisation approach, on the other hand, is to maintain only relative positioning between the robots. The presented method enables a group of mobile robots to start at an unknown location in an unknown environment and then to incrementally estimate their own positions and the relative locations of the other robots using only sensor information. The result is a robust, fast and precise approach, which does not need any preconditions or special assumptions about the environment. To validate the approach extensive tests with both, real and simulated, robots have been conducted. For a more specific evaluation, the Mean Localisation Error (MLE) is introduced. The conducted experiments include a comparison between the proposed Extended Kalman Filter and a standard SLAM-based approach. The developed method robustly delivered an accuracy better than 2 cm and performed at least as well as the SLAM approach. The algorithm coped with scattered groups of robots while moving on arbitrarily shaped paths. In summary, this thesis presents novel approaches to the field of coordinated navigation in multi-robot systems. The results facilitate cooperative movements of robot groups as well as relative localisation among the group members. In addition, a solid foundation for a non-environment related metric for formation navigation is introduced

Recent Advances in Multi Robot Systems

To design a team of robots which is able to perform given tasks is a great concern of many members of robotics community. There are many problems left to be solved in order to have the fully functional robot team. Robotics community is trying hard to solve such problems (navigation, task allocation, communication, adaptation, control, ...). This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field. It is focused on the challenging issues of team architectures, vehicle learning and adaptation, heterogeneous group control and cooperation, task selection, dynamic autonomy, mixed initiative, and human and robot team interaction. The book consists of 16 chapters introducing both basic research and advanced developments. Topics covered include kinematics, dynamic analysis, accuracy, optimization design, modelling, simulation and control of multi robot systems

Behaviour Based Simulated Low-Cost Multi-Robot Exploration

Institute of Perception, Action and BehaviourThe use of multiple robots for exploration holds the promise of improved performance over single robot systems. To exploit effectively the advantage of having several robots, the robots must be co-ordinated which requires communication. Previous research relies on a fixed communication network topology, a single lead explorer, and flat communication. This thesis presents a novel architecture to keep a group of robots as a single connected and adaptable communication network to explore and map the environment. This architecture, BERODE (BEhavioural ROle DEcentralized), aims to be robust, efficient and scalable to large numbers of robots. The network is adaptable, the number of explorers variable, and communications hierarchical (local/global). The network is kept connected by an MST (Minimum Spanning Tree) control network, a subnetwork containing only the minimum necessary links to be a fully connected network. As the robots explore, the MST control network is updated either partially (local network) or globally to improve signal quality. The local network for a robot is formed by the robots that are within a certain retransmission distance in the MST control network. BERODE implements a hierarchic approach to distributing information to improve scalability with respect to the number of robots. The robots share information at two levels: frequently within their local network and less frequently to the entire robot network. The robots coordinate by assuming behaviours depending on their connections in the MST control network. The behavioural roles balance between the tasks of exploration and network maintenance where the Explorer role is the most focused on the exploration task. This improves efficiency by allowing varying number of robots to take the Explorer role depending on circumstances. The roles generate reactive plans that ensure the connectivity of the network. These plans are based on the imposition of heterogeneous virtual spring forces. Our simulations show that BERODE is more efficient, scalable and robust with respect to communications than the previous approaches that rely on fixed control networks. BERODE is more efficient because it required less time to build a complete map of the environment than the fixed control networks. BERODE is more scalable because it keeps the robots as a single connected network for more time than the fixed control networks. BERODE is more robust because it has a better success rate at finishing the exploration

Autonomous robot systems and competitions: proceedings of the 12th International Conference

This is the 2012’s edition of the scientific meeting of the Portuguese Robotics Open (ROBOTICA’ 2012). It aims to disseminate scientific contributions and to promote discussion of theories, methods and experiences in areas of relevance to Autonomous Robotics and Robotic Competitions. All accepted contributions are included in this proceedings book. The conference program has also included an invited talk by Dr.ir. Raymond H. Cuijpers, from the Department of Human Technology Interaction of Eindhoven University of Technology, Netherlands.The conference is kindly sponsored by the IEEE Portugal Section / IEEE RAS ChapterSPR-Sociedade Portuguesa de Robótic

Mobile Robots Navigation

Mobile robots navigation includes different interrelated activities: (i) perception, as obtaining and interpreting sensory information; (ii) exploration, as the strategy that guides the robot to select the next direction to go; (iii) mapping, involving the construction of a spatial representation by using the sensory information perceived; (iv) localization, as the strategy to estimate the robot position within the spatial map; (v) path planning, as the strategy to find a path towards a goal location being optimal or not; and (vi) path execution, where motor actions are determined and adapted to environmental changes. The book addresses those activities by integrating results from the research work of several authors all over the world. Research cases are documented in 32 chapters organized within 7 categories next described

The coordinated control of space robot teams for the on-orbit construction of large flexible space structures

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2009.Includes bibliographical references (leaves 95-103).Teams of autonomous space robots are needed for future space missions such as the construction of large solar power stations and large space telescopes in earth orbit. This work focuses on the control of teams of robots performing construction tasks such as manipulation and assembly of large space structures. The control of the robot structure system is difficult. The space structures are flexible and there are significant dynamic interactions between the robots and the structures. Forces applied by the robots may excite undesirable vibrations in the structures. Furthermore, the changing configuration of the system results in the system dynamics being described by a set of non-linear partial differential equations. Limited sensing and actuation in space present additional challenges. The approach proposed here is to transform the system dynamics into a set of linear time-varying ordinary differential equations. The control of the high-frequency robots can be decoupled from the control of the low-frequency structures. This approach allows the robots to apply forces to the structures and control the dynamic interactions between the structures and the robots. The approach permits linear optimal control theory to be used. Simulation studies and experimental verification demonstrate the validity of the approach.by Peggy Boning.Ph.D

Evolutionary Robot Swarms Under Real-World Constraints

Tese de doutoramento em Engenharia Electrotécnica e de Computadores, na especialidade de Automação e Robótica, apresentada ao Departamento de Engenharia Electrotécnica e de Computadores da Faculdade de Ciências e Tecnologia da Universidade de CoimbraNas últimas décadas, vários cientistas e engenheiros têm vindo a estudar as estratégias provenientes da natureza. Dentro das arquiteturas biológicas, as sociedades que vivem em enxames revelam que agentes simplistas, tais como formigas ou pássaros, são capazes de realizar tarefas complexas usufruindo de mecanismos de cooperação. Estes sistemas abrangem todas as condições necessárias para a sobrevivência, incorporando comportamentos de cooperação, competição e adaptação. Na “batalha” sem fim em prol do progresso dos mecanismos artificiais desenvolvidos pelo homem, a ciência conseguiu simular o primeiro comportamento em enxame no final dos anos oitenta. Desde então, muitas outras áreas, entre as quais a robótica, beneficiaram de mecanismos de tolerância a falhas inerentes da inteligência coletiva de enxames. A área de investigação deste estudo incide na robótica de enxame, consistindo num domínio particular dos sistemas robóticos cooperativos que incorpora os mecanismos de inteligência coletiva de enxames na robótica. Mais especificamente, propõe-se uma solução completa de robótica de enxames a ser aplicada em contexto real. Nesta ótica, as operações de busca e salvamento foram consideradas como o caso de estudo principal devido ao nível de complexidade associado às mesmas. Tais operações ocorrem tipicamente em cenários dinâmicos de elevadas dimensões, com condições adversas que colocam em causa a aplicabilidade dos sistemas robóticos cooperativos. Este estudo centra-se nestes problemas, procurando novos desafios que não podem ser ultrapassados através da simples adaptação da literatura da especialidade em algoritmos de enxame, planeamento, controlo e técnicas de tomada de decisão. As contribuições deste trabalho sustentam-se em torno da extensão do método Particle Swarm Optimization (PSO) aplicado a sistemas robóticos cooperativos, denominado de Robotic Darwinian Particle Swarm Optimization (RDPSO). O RDPSO consiste numa arquitetura robótica de enxame distribuída que beneficia do particionamento dinâmico da população de robôs utilizando mecanismos evolucionários de exclusão social baseados na sobrevivência do mais forte de Darwin. No entanto, apesar de estar assente no caso de estudo do RDPSO, a aplicabilidade dos conceitos aqui propostos não se encontra restrita ao mesmo, visto que todos os algoritmos parametrizáveis de enxame de robôs podem beneficiar de uma abordagem idêntica. Os fundamentos em torno do RDPSO são introduzidos, focando-se na dinâmica dos robôs, nos constrangimentos introduzidos pelos obstáculos e pela comunicação, e nas suas propriedades evolucionárias. Considerando a colocação inicial dos robôs no ambiente como algo fundamental para aplicar sistemas de enxames em aplicações reais, é assim introduzida uma estratégia de colocação de robôs realista. Para tal, a população de robôs é dividida de forma hierárquica, em que são utilizadas plataformas mais robustas para colocar as plataformas de enxame no cenário de forma autónoma. Após a colocação dos robôs no cenário, é apresentada uma estratégia para permitir a criação e manutenção de uma rede de comunicação móvel ad hoc com tolerância a falhas. Esta estratégia não considera somente a distância entre robôs, mas também a qualidade do nível de sinal rádio frequência, redefinindo assim a sua aplicabilidade em cenários reais. Os aspetos anteriormente mencionados estão sujeitos a uma análise detalhada do sistema de comunicação inerente ao algoritmo, para atingir uma implementação mais escalável do RDPSO a cenários de elevada complexidade. Esta elevada complexidade inerente à dinâmica dos cenários motivaram a ultimar o desenvolvimento do RDPSO, integrando para o efeito um mecanismo adaptativo baseado em informação contextual (e.g., nível de atividade do grupo). Face a estas considerações, o presente estudo pode contribuir para expandir o estado-da-arte em robótica de enxame com algoritmos inovadores aplicados em contexto real. Neste sentido, todos os métodos propostos foram extensivamente validados e comparados com alternativas, tanto em simulação como com robôs reais. Para além disso, e dadas as limitações destes (e.g., número limitado de robôs, cenários de dimensões limitadas, constrangimentos reais limitados), este trabalho contribui ainda para um maior aprofundamento do estado-da-arte, onde se propõe um modelo macroscópico capaz de capturar a dinâmica inerente ao RDPSO e, até certo ponto, estimar analiticamente o desempenho coletivo dos robôs perante determinada tarefa. Em suma, esta investigação pode ter aplicabilidade prática ao colmatar a lacuna que se faz sentir no âmbito das estratégias de enxames de robôs em contexto real e, em particular, em cenários de busca e salvamento.Over the past decades, many scientists and engineers have been studying nature’s best and time-tested patterns and strategies. Within the existing biological architectures, swarm societies revealed that relatively unsophisticated agents with limited capabilities, such as ants or birds, were able to cooperatively accomplish complex tasks necessary for their survival. Those simplistic systems embrace all the conditions necessary to survive, thus embodying cooperative, competitive and adaptive behaviours. In the never-ending battle to advance artificial manmade mechanisms, computer scientists simulated the first swarm behaviour designed to mimic the flocking behaviour of birds in the late eighties. Ever since, many other fields, such as robotics, have benefited from the fault-tolerant mechanism inherent to swarm intelligence. The area of research presented in this Ph.D. Thesis focuses on swarm robotics, which is a particular domain of multi-robot systems (MRS) that embodies the mechanisms of swarm intelligence into robotics. More specifically, this Thesis proposes a complete swarm robotic solution that can be applied to real-world missions. Although the proposed methods do not depend on any particular application, search and rescue (SaR) operations were considered as the main case study due to their inherent level of complexity. Such operations often occur in highly dynamic and large scenarios, with harsh and faulty conditions, that pose several problems to MRS applicability. This Thesis focuses on these problems raising new challenges that cannot be handled appropriately by simple adaptation of state-of-the-art swarm algorithms, planning, control and decision-making techniques. The contributions of this Thesis revolve around an extension of the Particle Swarm Optimization (PSO) to MRS, denoted as Robotic Darwinian Particle Swarm Optimization (RDPSO). The RDPSO is a distributed swarm robotic architecture that benefits from the dynamical partitioning of the whole swarm of robots by means of an evolutionary social exclusion mechanism based on Darwin’s survival-of-the-fittest. Nevertheless, although currently applied solely to the RDPSO case study, the applicability of all concepts herein proposed is not restricted to it, since all parameterized swarm robotic algorithms may benefit from a similar approach The RDPSO is then proposed and used to devise the applicability of novel approaches. The fundamentals around the RDPSO are introduced by focusing on robots’ dynamics, obstacle avoidance, communication constraints and its evolutionary properties. Afterwards, taking the initial deployment of robots within the environment as a basis for applying swarm robotics systems into real-world applications, the development of a realistic deployment strategy is proposed. For that end, the population of robots is hierarchically divided, wherein larger support platforms autonomously deploy smaller exploring platforms in the scenario, while considering communication constraints and obstacles. After the deployment, a way of ensuring a fault-tolerant multi-hop mobile ad hoc communication network (MANET) is introduced to explicitly exchange information needed in a collaborative realworld task execution. Such strategy not only considers the maximum communication range between robots, but also the minimum signal quality, thus refining the applicability to real-world context. This is naturally followed by a deep analysis of the RDPSO communication system, describing the dynamics of the communication data packet structure shared between teammates. Such procedure is a first step to achieving a more scalable implementation by optimizing the communication procedure between robots. The highly dynamic characteristics of real-world applications motivated us to ultimate the RDPSO development with an adaptive strategy based on a set of context-based evaluation metrics. This thesis contributes to the state-of-the-art in swarm robotics with novel algorithms for realworld applications. All of the proposed approaches have been extensively validated in benchmarking tasks, in simulation, and with real robots. On top of that, and due to the limitations inherent to those (e.g., number of robots, scenario dimensions, real-world constraints), this Thesis further contributes to the state-of-the-art by proposing a macroscopic model able to capture the RDPSO dynamics and, to some extent, analytically estimate the collective performance of robots under a certain task. It is the author’s expectation that this Ph.D. Thesis may shed some light into bridging the reality gap inherent to the applicability of swarm strategies to real-world scenarios, and in particular to SaR operations.FCT - SFRH/BD /73382/201

Design and implementation of a relative localization system for ground and aerial robotic teams

The main focus of this thesis is to address the relative localization problem of a heterogenous team which comprises of both ground and micro aerial vehicle robots. This team configuration allows to combine the advantages of increased accessibility and better perspective provided by aerial robots with the higher computational and sensory resources provided by the ground agents, to realize a cooperative multi robotic system suitable for hostile autonomous missions. However, in such a scenario, the strict constraints in flight time, sensor pay load, and computational capability of micro aerial vehicles limits the practical applicability of popular map-based localization schemes for GPS denied navigation. Therefore, the resource limited aerial platforms of this team demand simpler localization means for autonomous navigation. Relative localization is the process of estimating the formation of a robot team using the acquired inter-robot relative measurements. This allows the team members to know their relative formation even without a global localization reference, such as GPS or a map. Thus a typical robot team would benefit from a relative localization service since it would allow the team to implement formation control, collision avoidance, and supervisory control tasks, independent of a global localization service. More importantly, a heterogenous team such as ground robots and computationally constrained aerial vehicles would benefit from a relative localization service since it provides the crucial localization information required for autonomous operation of the weaker agents. This enables less capable robots to assume supportive roles and contribute to the more powerful robots executing the mission. Hence this study proposes a relative localization-based approach for ground and micro aerial vehicle cooperation, and develops inter-robot measurement, filtering, and distributed computing modules, necessary to realize the system. The research study results in three significant contributions. First, the work designs and validates a novel inter-robot relative measurement hardware solution which has accuracy, range, and scalability characteristics, necessary for relative localization. Second, the research work performs an analysis and design of a novel nonlinear filtering method, which allows the implementation of relative localization modules and attitude reference filters on low cost devices with optimal tuning parameters. Third, this work designs and validates a novel distributed relative localization approach, which harnesses the distributed computing capability of the team to minimize communication requirements, achieve consistent estimation, and enable efficient data correspondence within the network. The work validates the complete relative localization-based system through multiple indoor experiments and numerical simulations. The relative localization based navigation concept with its sensing, filtering, and distributed computing methods introduced in this thesis complements system limitations of a ground and micro aerial vehicle team, and also targets hostile environmental conditions. Thus the work constitutes an essential step towards realizing autonomous navigation of heterogenous teams in real world applications