Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots

Swarms of robots can use their sensing abilities to explore unknown environments and deploy on sites of interest. In this task, a large number of robots is more effective than a single unit because of their ability to quickly cover the area. However, the coordination of large teams of robots is not an easy problem, especially when the resources for the deployment are limited. In this paper, the Distributed Bees Algorithm (DBA), previously proposed by the authors, is optimized and applied to distributed target allocation in swarms of robots. Improved target allocation in terms of deployment cost efficiency is achieved through optimization of the DBA’s control parameters by means of a Genetic Algorithm. Experimental results show that with the optimized set of parameters, the deployment cost measured as the average distance traveled by the robots is reduced. The cost-efficient deployment is in some cases achieved at the expense of increased robots’ distribution error. Nevertheless, the proposed approach allows the swarm to adapt to the operating conditions when available resources are scarce

Distributed bees algorithm for task allocation in swarm of robots

In this paper, we propose the distributed bees algorithm (DBA) for task allocation in a swarm of robots. In the proposed scenario, task allocation consists in assigning the robots to the found targets in a 2-D arena. The expected distribution is obtained from the targets' qualities that are represented as scalar values. Decision-making mechanism is distributed and robots autonomously choose their assignments taking into account targets' qualities and distances. We tested the scalability of the proposed DBA algorithm in terms of number of robots and number of targets. For that, the experiments were performed in the simulator for various sets of parameters, including number of robots, number of targets, and targets' utilities. Control parameters inherent to DBA were tuned to test how they affect the final robot distribution. The simulation results show that by increasing the robot swarm size, the distribution error decreased

Swarm intelligence: novel tools for optimization, feature extraction, and multi-agent system modeling

Abstract Animal swarms in nature are able to adapt to dynamic changes in their envi-ronment, and through cooperation they can solve problems that are crucial for their survival. Only by means of local interactions with other members of the swarm and with the environment, they can achieve a common goal more efficiently than it would be done by a single individual. This problem-solving behavior that results from the multiplicity of such interactions is referred to as Swarm Intelligence. The mathematical models of swarming behavior in nature were initially proposed to solve optimization problems. Nevertheless, this decentralized approach can be a valuable tool for a variety of applications, where emerging global patterns represent a solution to the task at hand. Methods for the solution of difficult computational problems based on Swarm Intelligence have been experimentally demonstrated and reported in the literature. However, a general framework that would facilitate their design does not exist yet. In this dissertation, a new general design methodology for Swarm Intelligence tools is proposed. By defining a discrete space in which the members of the swarm can move, and by modifying the rules of local interactions and setting the adequate objective function for solutions evaluation, the proposed methodology is tested in various domains. The dissertation presents a set of case studies, and focuses on two general approaches. One approach is to apply Swarm Intelligence as a tool for optimization and feature extraction, and the other approach is to model multi-agent systems such that they resemble swarms of animals in nature providing them with the ability to autonomously perform a task at hand. Artificial swarms are designed to be autonomous, scalable, robust, and adaptive to the changes in their environment. In this work, the methods that exploit one or more of these features are presented. First, the proposed methodology is validated in a real-world scenario seen as a combinatorial optimization problem. Then a set of novel tools for feature extraction, more precisely the adaptive edge detection and the broken-edge linking in digital images is proposed. A novel data clustering algorithm is also proposed and applied to image segmentation. Finally, a scalable algorithm based on the proposed methodology is developed for distributed task allocation in multi-agent systems, and applied to a swarm of robots. The newly proposed general methodology provides a guideline for future developers of the Swarm Intelligence tools. Los enjambres de animales en la naturaleza son capaces de adaptarse a cambios dinamicos en su entorno y, por medio de la cooperación, pueden resolver problemas ´ cruciales para su supervivencia. Unicamente por medio de interacciones locales con otros miembros del enjambre y con el entorno, pueden lograr un objetivo común de forma más eficiente que lo haría un solo individuo. Este comportamiento problema-resolutivo que es resultado de la multiplicidad de interacciones se denomina Inteligencia de Enjambre. Los modelos matemáticos de comportamiento de enjambres en entornos naturales fueron propuestos inicialmente para resolver problemas de optimización. Sin embargo, esta aproximación descentralizada puede ser una herramienta valiosa en una variedad de aplicaciones donde patrones globales emergentes representan una solución de las tareas actuales. Aunque en la literatura se muestra la utilidad de los métodos de Inteligencia de Enjambre, no existe un entorno de trabajo que facilite su diseño. En esta memoria de tesis proponemos una nueva metodologia general de diseño para herramientas de Inteligencia de Enjambre. Desarrollamos herramientas noveles que representan ejem-plos ilustrativos de su implementación. Probamos la metodología propuesta en varios dominios definiendo un espacio discreto en el que los miembros del enjambre pueden moverse, modificando las reglas de las interacciones locales y fijando la función objetivo adecuada para evaluar las soluciones. La memoria de tesis presenta un conjunto de casos de estudio y se centra en dos aproximaciones generales. Una aproximación es aplicar Inteligencia de Enjambre como herramienta de optimización y extracción de características mientras que la otra es modelar sistemas multi-agente de tal manera que se asemejen a enjambres de animales en la naturaleza a los que se les confiere la habilidad de ejecutar autónomamente la tarea. Los enjambres artificiales están diseñados para ser autónomos, escalables, robustos y adaptables a los cambios en su entorno. En este trabajo, presentamos métodos que explotan una o más de estas características. Primero, validamos la metodología propuesta en un escenario del mundo real visto como un problema de optimización combinatoria. Después, proponemos un conjunto de herramientas noveles para ex-tracción de características, en concreto la detección adaptativa de bordes y el enlazado de bordes rotos en imágenes digitales, y el agrupamiento de datos para segmentación de imágenes. Finalmente, proponemos un algoritmo escalable para la asignación distribuida de tareas en sistemas multi-agente aplicada a enjambres de robots. La metodología general recién propuesta ofrece una guía para futuros desarrolladores deherramientas de Inteligencia de Enjambre

Control and coordination for a group of mobile robots in unknown environments

This thesis studies the trajectory tracking and cooperative behavior for a team of mobile robots using nonlinear and intelligent algorithms to more efficiently achieve the mission outcome. There are many practical applications where specific tasks are more resourcefully achieved by using a group of mobile robots rather than a single robot. Mobile robots can subdivide and multi-task the mission with speed and accuracy and the ability to be individually modified for precise tasks makes them ideally suited for applications such as search and rescue, exploration or entertainment. When comparing the mission outcome of a group of multi mobile robots (MMR) to that of a single robot, we see that the performance of the MMR group improves the specific task allocation, safety, the time duration required and the system effectiveness to achieve the outcome. In order to create the most effective control algorithm for trajectory tracking, we present three different techniques including Lyapunov technique, intelligent control (fuzzy control) and the exponential version of sliding mode. The developed algorithms instruct a robot to keep moving on their desired trajectory while simultaneously reducing tracking errors. The experimental results when using a single mobile robot are presented to demonstrate the potential and capability of the developed algorithms. In order to coordinate a group of mobile robots to achieve a common outcome, the goal is to create efficient system architecture and a control algorithm that enables them to work both individually and in meaningful robot formations. This is achieved by employing coordination and trajectory tracking techniques with the knowledge derived by the localization of the robots from their environment. Three different hierarchical controllers are presented based on nonlinear and intelligent techniques in order to construct an algorithm that exhibits both group cooperation and coordination for a team of mobile robots. These controllers consist of Lyapunov technique, intelligent control (fuzzy control) and the exponential version of sliding mode. For improved trajectory tracking, each robot is fitted with onboard sensors. When an obstacle is detected by any of the robots’ sensors, they direct that robot to move around the obstacle by changing its velocity and direction. As well as obstacle avoidance, the controllers work to make the MMR group arrive concurrently at their target points by adjusting each of the individual robots’ velocities as they move along their desired trajectories. This means the group will arrive at their destination within the same time duration, regardless of the length of each individual trajectory or number of obstacles that confront each robot. The experimental results obtained using three mobile robots display the performance of these control algorithms in producing a cooperative and coordinated behavior for the robot group

Development of Path Following and Cooperative Motion Control Algorithms for Autonomous Underwater Vehicles

Research on autonomous underwater vehicle (AUV) is motivating and challenging owing to their specific applications such as defence, mine counter measure, pipeline inspections, risky missions e.g. oceanographic observations, bathymetric surveys, ocean floor analysis, military uses, and recovery of lost man-made objects. Motion control of AUVs is concerned with navigation, path following and co-operative motion control problems. A number of control complexities are encountered in AUV motion control such as nonlinearities in mass matrix, hydrodynamic terms and ocean currents. These pose challenges to develop efficient control algorithms such that the accurate path following task and effective group co-ordination can be achieved in face of parametric uncertainties and disturbances and communication constraints in acoustic medium. This thesis first proposes development of a number of path following control laws and new co-operative motion control algorithms for achieving successful motion control objectives. These algorithms are potential function based proportional derivative path following control laws, adaptive trajectory based formation control, formation control of multiple AUVs steering towards a safety region, mathematical potential function based flocking control and fuzzy potential function based flocking control. Development of a path following control algorithm aims at generating appropriate control law, such that an AUV tracks a predefined desired path. In this thesis first path following control laws are developed for an underactuated (the number of inputs are lesser than the degrees of freedom) AUV. A potential function based proportional derivative (PFPD) control law is derived to govern the motion of the AUV in an obstacle-rich environment (environment populated by obstacles). For obstacle avoidance, a mathematical potential function is exploited, which provides a repulsive force between the AUV and the solid obstacles intersecting the desired path. Simulations were carried out considering a special type of AUV i.e. Omni Directional Intelligent Navigator (ODIN) to study the efficacy of the developed PFPD controller. For achieving more accuracy in the path following performance, a new controller (potential function based augmented proportional derivative, PFAPD) has been designed by the mass matrix augmentation with PFPD control law. Simulations were made and the results obtained with PFAPD controller are compared with that of PFPD controlle