A fuzzified systematic adjustment of the robotic Darwinian PSO

The Darwinian Particle Swarm Optimization (DPSO) is an evolutionary algorithm that extends the Particle Swarm Optimization using natural selection to enhance the ability to escape from sub-optimal solutions. An extension of the DPSO to multi-robot applications has been recently proposed and denoted as Robotic Darwinian PSO (RDPSO), benefiting from the dynamical partitioning of the whole population of robots, hence decreasing the amount of required information exchange among robots. This paper further extends the previously proposed algorithm adapting the behavior of robots based on a set of context-based evaluation metrics. Those metrics are then used as inputs of a fuzzy system so as to systematically adjust the RDPSO parameters (i.e., outputs of the fuzzy system), thus improving its convergence rate, susceptibility to obstacles and communication constraints. The adapted RDPSO is evaluated in groups of physical robots, being further explored using larger populations of simulated mobile robots within a larger scenario

Optimal soaring by a small autonomous glider

Extending the flight time of an autonomous unmanned air vehicle by soaring is considered. A suboptimal controller is developed and successful static soaring is demonstrated with a 6 degree of freedom glider model. Altitude gain rates of between ¼ and ½ m/s are achieved with this simple implementation. A hybrid optimal trajectory generation algorithm is developed and used to find optimal closed cycles in typical wind conditions using a point mass model. The algorithm is shown to be robust to a poor initial guess, with computational performance comparable to a common direct shooting algorithm. A receding horizon optimal controller strategy is investigated for the problem of autonomous soaring. An efficient Riccatti recursion algorithm is used to determine the next step in the Newton Iteration of the Non-Linear optimization problem. A real time strategy for optimal soaring is developed and shown to perform very well for a point mass model, resulting in repeatable trajectories with significant altitude gain. Sensitivity to errors including wind model errors is investigated. The real time algorithm was found to be insensitive to reasonable errors

Quadrotor team modeling and control for DLO transportation

94 p.Esta Tesis realiza una propuesta de un modelado dinámico para el transporte de sólidos lineales deformables (SLD) mediante un equipo de cuadricópteros. En este modelo intervienen tres factores: - Modelado dinámico del sólido lineal a transportar. - Modelo dinámico del cuadricóptero para que tenga en cuenta la dinámica pasiva y los efectos del SLD. - Estrategia de control para un transporte e ciente y robusto. Diferenciamos dos tareas principales: (a) lograr una con guración cuasiestacionaria de una distribución de carga equivalente a transportar entre todos los robots. (b) Ejecutar el transporte en un plano horizontal de todo el sistema. El transporte se realiza mediante una con guración de seguir al líder en columna, pero los cuadricópteros individualmente tienen que ser su cientemente robustos para afrontar todas las no-linealidades provocadas por la dinámica del SLD y perturbaciones externas, como el viento. Los controladores del cuadricóptero se han diseñado para asegurar la estabilidad del sistema y una rápida convergencia del sistema. Se han comparado y testeado estrategias de control en tiempo real y no-real para comprobar la bondad y capacidad de ajuste a las condiciones dinámicas cambiantes del sistema. También se ha estudiado la escalabilidad del sistema

Goal-seeking Behavior-based Mobile Robot Using Particle Swarm Fuzzy Controller

Behavior-based control architecture has successfully demonstrated their competence in mobile robot development. Fuzzy logic system characteristics are suitable to address the behavior design problems. However, there are difficulties encountered when setting fuzzy parameters manually. Therefore, most of the works in the field generate certain interest for the study of fuzzy systems with added learning capabilities. This paper presents the development of fuzzy behavior-based control architecture using Particle Swarm Optimization (PSO). A goal-seeking behaviors based on Particle Swarm Fuzzy Controller (PSFC) are developed using the modified PSO with two stages of the PSFC process. Several simulations and experiments with MagellanPro mobile robot have been performed to analyze the performance of the algorithm.  The promising results have proved that the proposed control architecture for mobile robot has better capability to accomplish useful task in real office-like environment

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

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. 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