Particle Swarm Optimization Based Source Seeking

Signal source seeking using autonomous vehicles is a complex problem. The complexity increases manifold when signal intensities captured by physical sensors onboard are noisy and unreliable. Added to the fact that signal strength decays with distance, noisy environments make it extremely difficult to describe and model a decay function. This paper addresses our work with seeking maximum signal strength in a continuous electromagnetic signal source with mobile robots, using Particle Swarm Optimization (PSO). A one to one correspondence with swarm members in a PSO and physical Mobile robots is established and the positions of the robots are iteratively updated as the PSO algorithm proceeds forward. Since physical robots are responsive to swarm position updates, modifications were required to implement the interaction between real robots and the PSO algorithm. The development of modifications necessary to implement PSO on mobile robots, and strategies to adapt to real life environments such as obstacles and collision objects are presented in this paper. Our findings are also validated using experimental testbeds.Comment: 13 pages, 12 figure

Two-robot source seeking with point measurements

AbstractA source-seeking process for a pair of simple, low capability robots using only point measurements is proposed and analyzed. The robots are assumed to be memoryless, to lack the capability of performing complex computations and to have no direct communication abilities. Their only implicit form of communication is by sensing their relative position and the only response of a robot to the point measurement it makes is by moving to adjust its distance to the other robot according to a predetermined rule. The proposed algorithm is robust: we prove that the algorithm performs correctly even when the robots frequently err due to noisy sensor readings

Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue

In this report, we try to improve the performance of existing approaches for search operations in multi-robot context. We propose three novel algorithms that are using a triangular grid pattern, i.e., robots certainly go through the vertices of a triangular grid during the search procedure. The main advantage of using a triangular grid pattern is that it is asymptotically optimal in terms of the minimum number of robots required for the complete coverage of an arbitrary bounded area. We use a new topological map which is made and shared by robots during the search operation. We consider an area that is unknown to the robots a priori with an arbitrary shape, containing some obstacles. Unlike many current heuristic algorithms, we give mathematically proofs of convergence of the algorithms. The computer simulation results for the proposed algorithms are presented using a simulator of real robots and environment. We evaluate the performance of the algorithms via experiments with real robots. We compare the performance of our own algorithms with three existing algorithms from other researchers. The results demonstrate the merits of our proposed solution. A further study on formation building with obstacle avoidance for a team of mobile robots is presented in this report. We propose a decentralized formation building with obstacle avoidance algorithm for a group of mobile robots to move in a defined geometric configuration. Furthermore, we consider a more complicated formation problem with a group of anonymous robots; these robots are not aware of their position in the final configuration and need to reach a consensus during the formation process. We propose a randomized algorithm for the anonymous robots that achieves the convergence to a desired configuration with probability 1. We also propose a novel obstacle avoidance rule, used in the formation building algorithm.Comment: arXiv admin note: substantial text overlap with arXiv:1402.5188 by other author

Deformable-Medium Affordances for Interacting with Multi-Robot Systems

In this thesis, I address the issue of human-swarm interactions by proposing a new set of affrodances that make a multi-robot system amenable to human control. An affordance, as defined by Gibson, is a relation between an object and a user, where the object explicitly allows the user to perform a particular action. The affordances we identify when controlling a swarm, include stretching the swarm, molding it into a particular shape, splitting and merging sub-swarms, and mixing of different swarms. The contribution beyond the formulation of these affordances is the coupling of an image recognition framework identified by an effective deformable-medium control interface, and the accompanying algorithms needed to identify the appropriate inputs, and then turn those into decentralized control laws for the individual robots. As result, the developed human-swarm interaction methodology is applied to a team of mobile robots

Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue

Use of multi-robot systems has many advantages over single robot systems in various applications. However, it comes with its own complexity and challenges. In this thesis, we try to improve the performance of existing approaches for search operations in multi-robot context. We propose three novel algorithms that are using a triangular grid pattern, i.e., robots certainly go through the vertices of a triangular grid during the search procedure. The main advantage of using a triangular grid pattern is that it is asymptotically optimal in terms of the minimum number of robots required for the complete coverage of an arbitrary bounded area. Therefore, using the vertices of this triangular grid coverage guarantees complete search of a region as well as shorter search duration. We use a new topological map which is made and shared by robots during the search operation. We consider an area that is unknown to the robots a priori with an arbitrary shape, containing some obstacles. Unlike many current heuristic algorithms, we give mathematically rigorous proofs of convergence with probability 1 of the algorithms. The computer simulation results for the proposed algorithms are presented using a simulator of real robots and environment. We evaluate the performance of the algorithms via experiments with real Pioneer 3DX mobile robots. We compare the performance of our own algorithms with three existing algorithms from other researchers. The results demonstrate the merits of our proposed solution. A further study on formation building with obstacle avoidance for a team of mobile robots is presented in this thesis. We propose a robust decentralized formation building with obstacle avoidance algorithm for a group of mobile robots to move in a defined geometric configuration. Furthermore, we consider a more complicated formation problem with a group of anonymous robots; these robots are not aware of their position in the final configuration and need to reach a consensus during the formation process. We propose a randomized algorithm for the anonymous robots that achieves the convergence to a desired configuration with probability 1. We also propose a novel obstacle avoidance rule, used in the formation building algorithm. A mathematically rigorous proof of the proposed algorithm is given. The performance and applicability of the proposed algorithm are confirmed by the computer simulation results

Spatial Formation Control

In this thesis, we study robust spatial formation control from several aspects. First, we study robust adaptive attitude synchronization for a network of rigid body agents using various attitude error functions defined on SO(3). Our results are particularly useful for networks with large initial attitude difference. We devise an adaptive geometric approach to cope with situations where the inertia matrices are not available for measurement. We use the Frobenius norm as a measure for the difference between the actual values of inertia matrices and their estimated values, to construct the individual adaptive laws of the agents. Compared to the previous methods for synchronization on SO(3) such as those which are based on quaternions, our proposed approach does not contain any attitude representation ambiguity. As the final part of our studies from the attitude synchronization aspect, we analyze robustness to external disturbances and unmodeled dynamics, and propose a method to attenuate such effects. Simulation results illustrate the effectiveness of the proposed approach. In the next part of the thesis, we study the distributed localization of the extremum point of unknown quadratic functions representing various physical or artificial signal potential fields. It is assumed that the value of such functions can be measured at each instant. Using high pass filtering of the measured signals, a linear parametric model is obtained for system identification. For design purposes, we add a consensus term to modify the identification subsystem. Next, we analyze the exponential convergence of the proposed estimation scheme using algebraic graph theory. In addition, we derive a distributed identifiability condition and use it for the construction of distributed extremum seeking control laws. In particular, we show that for a network of connected agents, if each agent contains a portion of the dithering signals, it is still possible to drive the system states to the extremum point provided that the distributed identifiability condition is satisfied. In the final part of this research, several robust control problems for general linear time invariant multi-agent systems are studied. We consider the robust consensus problem in the presence of unknown Lipschitz nonlinearities and polytopic uncertainties in the model of each agent. Next, this problem is solved in the presence of external disturbances. A set of control laws is proposed for the network to attain the consensus task and under the zero initial condition, achieves the desired H-infinity performance. We show that by implementing the modified versions of these control laws, it is possible to perform two-time scales formation control

Robust Hybrid Systems for Control, Learning, and Optimization in Networked Dynamical Systems

The deployment of advanced real-time control and optimization strategies in socially-integratedengineering systems could significantly improve our quality of life whilecreating jobs and economic opportunity. However, in cyber-physical systems such assmart grids, transportation networks, healthcare, and robotic systems, there still existseveral challenges that prevent the implementation of intelligent control strategies.These challenges include the existence of limited communication networks, dynamicand stochastic environments, multiple decision makers interacting with the system,and complex hybrid dynamics emerging from the feedback interconnection of physicalprocesses and computational devices.In this dissertation, we study the problem of designing robust control and optimizationalgorithms for cyber-physical systems using the framework of hybrid dynamicalsystems. We propose different theoretical frameworks for the design and analysis offeedback mechanisms that optimize the performance of dynamical systems without requiringan explicit characterization of their mathematical model, i.e., in a model-freeway. The closed-loop system that emerges of the interconnection of the plant with thefeedback mechanism describes, in general, a set-valued hybrid dynamical system. Thesetypes of systems combine continuous-time and discrete-time dynamics, and they usuallylack the uniqueness of solutions property. The framework of set-valued hybriddynamical systems allows us to study many complex dynamical systems that emerge indifferent engineering applications, such as networked multi-agent systems with switching graphs, non-smooth mechanical systems, dynamic pricing mechanisms in transportationsystems, autonomous robots with logic-based controllers, etc. We proposea step-by-step approach to the design of different types of discrete-time, continuous-time,hybrid, and stochastic controllers for different types of applications, extendingand generalizing different results in the literature in the area of extremum seeking control,sampled-data extremization, robust synchronization, and stochastic learning innetworked systems. Our theoretical results are illustrated via different simulations andnumerical examples