Towards a swarm robotic approach for cooperative object recognition

Social insects have inspired the behaviours of swarm robotic systems for the last 20 years. Interactions of the simple individuals in these swarms form solutions to relatively complex problems. A novel swarm robotic method is investigated for future robotic cooperative object recognition tasks. Previous multi-agent systems involve cameras and image analyses to identify objects. They cooperate only to improve their hypotheses of the shape's identity. The system proposed uses agents whose interactions with each other around the physical boundaries of the object's shape allow the distinguishing features found. The agents are a physical embodiment of the vision system, making them suitable for environments where it would not be possible to use a camera. A Simplified Hexagonal Model was developed to simulate and examine the strategies. The hexagonal cells of which can be empty, contain an agent (hBot) or part of an object shape. Initially the hBots are required to identify the valid object shapes from a set of two types of known shapes. To do this the hBots change state when in contact with an object and when touching other hBots of the same state level, where some states are only achieved when neighbouring certain object shapes. The agents are oblivious, anonymous and homogeneous. They also do not know their position or orientation and cannot distinguish between object shapes alone due to their limited sensor range. Further work increased the number of object shapes to provide a range of scenarios

Accurate Localization with Ultra-Wideband Ranging for Multi-Robot Systems

RÉSUMÉ : Avec l’avancement de la technologie matérielle et logicielle, l’application de l’automatisation et de la robotique se développe rapidement. Les systèmes multi-robots sont particulièrement prometteurs en raison de leur grande efficacité et robustesse. De tels systèmes peuvent être utilisés pour aider les humains à effectuer efficacement des tâches dangereuses ou pénibles, telles que l’intervention en cas de catastrophe, l’exploration souterraine, etc. Pour déployer un système multi-robot dans un environnement sans GPS, la coordination des robots dans le système est un défi crucial. Chaque robot doit avoir une estimation précise de sa propre position pour permettre aux robots du système de collaborer pour la réalisation de leur tâche. Comme cette direction de recherche est relativement nouvelle, les approches existantes ne sont pas encore abouties. Elles consistent principalement en des systèmes centralisés qui reposent sur des signaux GPS. La dépendance sur un signal GPS limite l’application aux espaces extérieurs ouverts. De plus, les systèmes centralisés sont confrontés au risque d’un point de défaillance unique, qui limite la robustesse du système. Par ailleurs, un système centralisé n’est pas toujours approprié à une taille grandissante, comme lors d’ajout de nouveaux groupes de robots ou lors de la fusion de différents groupes. Par conséquent, une solution distribuée, décentralisée, et adaptée à de larges groupes de tailles variables pouvant produire une estimation et un suivi du positionnement des robots dans un environnement sans GPS est souhaitée. Dans ce travail, nous adoptons une stratégie descendante pour relever ces défis.----------ABSTRACT : With the advancement of hardware and software technology, the everyday applications of automation and robotics are developing rapidly. Multi-robot systems are particularly promising because of their high efficiency and robustness. Such systems can be used to assist humans in performing dangerous or strenuous tasks, such as disaster response, subterranean exploration, etc. To deploy a multi-robot system in an environment without a global positioning system (GPS), coordinating the robots in the system is a crucial challenge. Each robot needs to have the correct tracking of its own and its teammates positions to enable the robots to cooperate. Because this research direction is relatively new, there are not many mature methods: existing approaches are mainly centralized systems that rely on GPS signals. The dependence on GPS restricts the application to the outdoors or indoor spaces with expensive infrastructure. Centralized systems also face the risk of a single point of failure, which is not acceptable for critical systems. In addition, centralized systems can be hard to scale both statically and dynamically (e.g. adding new groups of robots or merging different groups). Therefore, a distributed and scalable solution with accurate positioning and tracking in a GPS-denied environment is desired. In this work, we follow a top-down strategy to address these challenges

Ultrasonic sensor platforms for non-destructive evaluation

Robotic vehicles are receiving increasing attention for use in Non-Destructive Evaluation (NDE), due to their attractiveness in terms of cost, safety and their accessibility to areas where manual inspection is not practical. A reconfigurable Lamb wave scanner, using autonomous robotic platforms is presented. The scanner is built from a fleet of wireless miniature robotic vehicles, each with a non-contact ultrasonic payload capable of generating the A0 Lamb wave mode in plate specimens. An embedded Kalman filter gives the robots a positional accuracy of 10mm. A computer simulator, to facilitate the design and assessment of the reconfigurable scanner, is also presented. Transducer behaviour has been simulated using a Linear Systems approximation (LS), with wave propagation in the structure modelled using the Local Interaction Simulation Approach (LISA). Integration of the LS and LISA approaches were validated for use in Lamb wave scanning by comparison with both analytical techniques and more computationally intensive commercial finite element/diference codes. Starting with fundamental dispersion data, the work goes on to describe the simulation of wave propagation and the subsequent interaction with artificial defects and plate boundaries. The computer simulator was used to evaluate several imaging techniques, including local inspection of the area under the robot and an extended method that emits an ultrasonic wave and listens for echos (B-Scan). These algorithms were implemented in the robotic platform and experimental results are presented. The Synthetic Aperture Focusing Technique (SAFT) was evaluated as a means of improving the fidelity of B-Scan data. It was found that a SAFT is only effective for transducers with reasonably wide beam divergence, necessitating small transducers with a width of approximately 5mm. Finally, an algorithm for robot localisation relative to plate sections was proposed and experimentally validated

Path planning, modelling and simulation for energy optimised mobile robotics

This thesis is concerned with an investigation of a solution for mobile robotic platforms to minimize the usage of scarce energy that is available and is not wasted following traditionally planned paths for complex terrain environments. This therefore addresses the need to reduce the total energy cost during a field task or mission. A path planning algorithm is designed by creating a new approach of artificial potential field method that generates a planned path, utilising terrain map. The new approach has the capability of avoiding the local minimum problems which is one of the major problems of traditional potential field method. By solving such problems gives a reliable solution to establish a required path. Therefore the approach results in an energy efficient path of the terrain identified, instead obvious straight line of the terrain. A literature review is conducted which reviews the mainstream path planning algorithms with the applications in mobile robotic platforms was analysed. These path planning algorithms are compared for the purpose of energy optimized planning, which concludes the method of artificial potential field as the path planning algorithm which has the most potential and will be further investigated and improved in this research. The methodology of designing, modelling and simulating a mobile robotic platform is defined and presented for the purpose of energy optimized path planning requirement. The research is to clarify the needs, requirements, and specifications of the design. A complete set of models which include mechanical and electrical modelling, functional concept modelling, modelling of the system are established. Based on these models, an energy optimized path planning algorithm is designed. The modelling of force and the kinematics is established to validate and evaluate the result of the algorithm through simulations. Moreover a simulation environment is established which is constructed for multi perspective simulation. This also enables collaborative simulation using Simulink and ADAMS to for simulating a path generated by the path planning algorithm and assess the energy consumption of the driven and steering mechanism of an exemplar system called AgriRover. This simulation environment allows the capture of simulated result of the total energy consumption, therefore outlines the energy cost behaviour of the AgriRover. A total of two sets of paths was tested in the fields for validation, one being generated by the energy optimized path planning algorithm and the other following a straight path. During the field tests the total cost of energy was captured . Two sets of results are compared with each other and compared with the simulation. The comparison shows a 21.34% of the energy saving by deploying the path generated with the energy optimized path planning algorithm in the field test. This research made the following contribution to knowledge. A comparison and grading of mainstream path planning algorithms from energy optimisation perspective is undertaken using detailed evaluation criteria, including computational power required, extendibility, flexibility and more criteria that is relevant for the energy optimized planning purpose. These algorithms have not been compared from energy optimisation angle before, and the research for energy optimised planning under complex terrain environments have not been investigated. Addressing these knowledge gaps, a methodology of designing, modelling and simulating a mobile platform system is proposed to facilitate an energy optimized path planning. This , leads to a new approach of path planning algorithm that reduces unnecessary energy spend for climbing of the terrain, using the terrain data available. Such a methodology derives several novel methods: Namely, a method for avoiding local minimum problem for artificial potential field path planning using the approach of approximation; A method of achieving high expendability of the path planning algorithm, where this method is capable of generate a path through a large map in a short time; A novel method of multi perspective dynamic simulation, which is capable of simulating the behaviour of internal mechanism and the overall robotic mobile platform with the fully integrated control, The dynamic simulation enables prediction of energy consumption; Finally, a novel method of mathematically modelling and simplifying a steering mechanism for the wheel based mobile vehicle was further investigated.This thesis is concerned with an investigation of a solution for mobile robotic platforms to minimize the usage of scarce energy that is available and is not wasted following traditionally planned paths for complex terrain environments. This therefore addresses the need to reduce the total energy cost during a field task or mission. A path planning algorithm is designed by creating a new approach of artificial potential field method that generates a planned path, utilising terrain map. The new approach has the capability of avoiding the local minimum problems which is one of the major problems of traditional potential field method. By solving such problems gives a reliable solution to establish a required path. Therefore the approach results in an energy efficient path of the terrain identified, instead obvious straight line of the terrain. A literature review is conducted which reviews the mainstream path planning algorithms with the applications in mobile robotic platforms was analysed. These path planning algorithms are compared for the purpose of energy optimized planning, which concludes the method of artificial potential field as the path planning algorithm which has the most potential and will be further investigated and improved in this research. The methodology of designing, modelling and simulating a mobile robotic platform is defined and presented for the purpose of energy optimized path planning requirement. The research is to clarify the needs, requirements, and specifications of the design. A complete set of models which include mechanical and electrical modelling, functional concept modelling, modelling of the system are established. Based on these models, an energy optimized path planning algorithm is designed. The modelling of force and the kinematics is established to validate and evaluate the result of the algorithm through simulations. Moreover a simulation environment is established which is constructed for multi perspective simulation. This also enables collaborative simulation using Simulink and ADAMS to for simulating a path generated by the path planning algorithm and assess the energy consumption of the driven and steering mechanism of an exemplar system called AgriRover. This simulation environment allows the capture of simulated result of the total energy consumption, therefore outlines the energy cost behaviour of the AgriRover. A total of two sets of paths was tested in the fields for validation, one being generated by the energy optimized path planning algorithm and the other following a straight path. During the field tests the total cost of energy was captured . Two sets of results are compared with each other and compared with the simulation. The comparison shows a 21.34% of the energy saving by deploying the path generated with the energy optimized path planning algorithm in the field test. This research made the following contribution to knowledge. A comparison and grading of mainstream path planning algorithms from energy optimisation perspective is undertaken using detailed evaluation criteria, including computational power required, extendibility, flexibility and more criteria that is relevant for the energy optimized planning purpose. These algorithms have not been compared from energy optimisation angle before, and the research for energy optimised planning under complex terrain environments have not been investigated. Addressing these knowledge gaps, a methodology of designing, modelling and simulating a mobile platform system is proposed to facilitate an energy optimized path planning. This , leads to a new approach of path planning algorithm that reduces unnecessary energy spend for climbing of the terrain, using the terrain data available. Such a methodology derives several novel methods: Namely, a method for avoiding local minimum problem for artificial potential field path planning using the approach of approximation; A method of achieving high expendability of the path planning algorithm, where this method is capable of generate a path through a large map in a short time; A novel method of multi perspective dynamic simulation, which is capable of simulating the behaviour of internal mechanism and the overall robotic mobile platform with the fully integrated control, The dynamic simulation enables prediction of energy consumption; Finally, a novel method of mathematically modelling and simplifying a steering mechanism for the wheel based mobile vehicle was further investigated

Evolution of behaviour trees for collective transport with robot swarms

Swarm robotics, inspired by natural swarms, studies how simple robots with only local sensing capabilities and no centralised control may cooperate to achieve a common goal in a robust, flexible and scalable way. A robotic system with such properties constitutes an interesting alternative to the platforms currently used in warehouses and distribution plants, where workers are at risk of injury and the space and budget available for complex infrastructure is limited. Swarm behaviours are emergent, which makes the task of designing the controllers of the individual robots particularly challenging. In this work, we propose a method for a swarm of industrial robots to collectively transport items that are too heavy for a single agent to carry. We use artificial evolution to evolve behaviour tree controllers for the swarm agents and we conceive a decentralised coordination strategy based on local messaging. The method is developed and tested in a simulated environment, using a combination of freely available open source libraries. The results show that a homogeneous swarm equipped with our solution is able to successfully find the items placed in the environment and transport them back to a nest region. We suggest further tuning of the evolutionary parameters and the introduction of noise in the simulator in order to improve the observed performance of the controllers in simulation and their expected performance the real worldObjectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructur

A Multi-Vehicle Cooperative Localization Approach for an Autonomy Framework

Offensive techniques produced by technological advancement present opportunities for adversaries to threaten the operational advantages of our joint and allied forces. Combating these new methodologies requires continuous and rapid development towards our own set of \game-changing technologies. Through focused development of unmanned systems and autonomy, the Air Force can strive to maintain its technological superiority. Furthermore, creating a robust framework capable of testing and evaluating the principles that define autonomy allows for the exploration of future capabilities. This research presents development towards a hybrid reactive/deliberative architecture that will allow for the testing of the principles of task, cognitive, and peer flexibility. Specifically, this work explores peer flexibility in multi-robot systems to solve a localization problem using the Hybrid Architecture for Multiple Robots (HAMR) as a basis for the framework. To achieve this task a combination of vehicle perception and navigation tools formulate inferences on an operating environment. These inferences are then used for the construction of Factor Graphs upon which the core algorithm for localization implements iSAM2, a high performing incremental matrix factorization method. A key component for individual vehicle control within the framework is the Unified Behavior Framework (UBF), a behavior-based control architecture which uses modular arbitration techniques to generate actions that enable actuator control. Additionally, compartmentalization of a World Model is explored through the use of containers to minimize communication overhead and streamline state information. The design for this platform takes on a polymorphic approach for modularity and robustness enabling future development

Decentralized algorithm of dynamic task allocation for a swarm of homogeneous robots

The current trends in the robotics field have led to the development of large-scale swarm robot systems, which are deployed for complex missions. The robots in these systems must communicate and interact with each other and with their environment for complex task processing. A major problem for this trend is the poor task planning mechanism, which includes both task decomposition and task allocation. Task allocation means to distribute and schedule a set of tasks to be accomplished by a group of robots to minimize the cost while satisfying operational constraints. Task allocation mechanism must be run by each robot, which integrates the swarm whenever it senses a change in the environment to make sure the robot is assigned to the most appropriate task, if not, the robot should reassign itself to its nearest task. The main contribution in this thesis is to maximize the overall efficiency of the system by minimizing the total time needed to accomplish the dynamic task allocation problem. The near-optimal allocation schemes are found using a novel hybrid decentralized algorithm for a dynamic task allocation in a swarm of homogeneous robots, where the number of the tasks is more than the robots present in the system. This hybrid approach is based on both the Simulated Annealing (SA) optimization technique combined with the Discrete Particle Swarm Optimization (DPSO) technique. Also, another major contribution in this thesis is the formulation of the dynamic task allocation equations for the homogeneous swarm robotics using integer linear programming and the cost function and constraints are introduced for the given problem. Then, the DPSO and SA algorithms are developed to accomplish the task in a minimal time. Simulation is implemented using only two test cases via MATLAB. Simulation results show that PSO exhibits a smaller and more stable convergence characteristics and SA technique owns a better quality solution. Then, after developing the hybrid algorithm, which combines SA with PSO, simulation instances are extended to include fifteen more test cases with different swarm dimensions to ensure the robustness and scalability of the proposed algorithm over the traditional PSO and SA optimization techniques. Based on the simulation results, the hybrid DPSO/SA approach proves to have a higher efficiency in both small and large swarm sizes than the other traditional algorithms such as Particle Swarm Optimization technique and Simulated Annealing technique. The simulation results also demonstrate that the proposed approach can dislodge a state from a local minimum and guide it to the global minimum. Thus, the contributions of the proposed hybrid DPSO/SA algorithm involve possessing both the pros of high quality solution in SA and the fast convergence time capability in PSO. Also, a parameters\u27 selection process for the hybrid algorithm is proposed as a further contribution in an attempt to enhance the algorithm efficiency because the heuristic optimization techniques are very sensitive to any parameter changes. In addition, Verification is performed to ensure the effectiveness of the proposed algorithm by comparing it with results of an exact solver in terms of computational time, number of iterations and quality of solution. The exact solver that is used in this research is the Hungarian algorithm. This comparison shows that the proposed algorithm gives a superior performance in almost all swarm sizes with both stable and small execution time. However, it also shows that the proposed hybrid algorithm\u27s cost values which is the distance traveled by the robots to perform the tasks are larger than the cost values of the Hungarian algorithm but the execution time of the hybrid algorithm is much better. Finally, one last contribution in this thesis is that the proposed algorithm is implemented and extensively tested in a real experiment using a swarm of 4 robots. The robots that are used in the real experiment called Elisa-III robots

Communication-based UAV Swarm Missions

Unmanned aerial vehicles have developed rapidly in recent years due to technological advances. UAV technology can be applied to a wide range of applications in surveillance, rescue, agriculture and transport. The problems that can exist in these areas can be mitigated by combining clusters of drones with several technologies. For example, when a swarm of drones is under attack, it may not be able to obtain the position feedback provided by the Global Positioning System (GPS). This poses a new challenge for the UAV swarm to fulfill a specific mission. This thesis intends to use as few sensors as possible on the UAVs and to design the smallest possible information transfer between the UAVs to maintain the shape of the UAV formation in flight and to follow a predetermined trajectory. This thesis presents Extended Kalman Filter methods to navigate autonomously in a GPS-denied environment. The UAV formation control and distributed communication methods are also discussed and given in detail

An Approach Based on Particle Swarm Optimization for Inspection of Spacecraft Hulls by a Swarm of Miniaturized Robots

The remoteness and hazards that are inherent to the operating environments of space infrastructures promote their need for automated robotic inspection. In particular, micrometeoroid and orbital debris impact and structural fatigue are common sources of damage to spacecraft hulls. Vibration sensing has been used to detect structural damage in spacecraft hulls as well as in structural health monitoring practices in industry by deploying static sensors. In this paper, we propose using a swarm of miniaturized vibration-sensing mobile robots realizing a network of mobile sensors. We present a distributed inspection algorithm based on the bio-inspired particle swarm optimization and evolutionary algorithm niching techniques to deliver the task of enumeration and localization of an a priori unknown number of vibration sources on a simplified 2.5D spacecraft surface. Our algorithm is deployed on a swarm of simulated cm-scale wheeled robots. These are guided in their inspection task by sensing vibrations arising from failure points on the surface which are detected by on-board accelerometers. We study three performance metrics: (1) proximity of the localized sources to the ground truth locations, (2) time to localize each source, and (3) time to finish the inspection task given a 75% inspection coverage threshold. We find that our swarm is able to successfully localize the present so