State-of-the-art in aerodynamic shape optimisation methods

Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners

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

Treasure hunt : a framework for cooperative, distributed parallel optimization

Orientador: Prof. Dr. Daniel WeingaertnerCoorientadora: Profa. Dra. Myriam Regattieri DelgadoTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa : Curitiba, 27/05/2019Inclui referências: p. 18-20Área de concentração: Ciência da ComputaçãoResumo: Este trabalho propõe um framework multinível chamado Treasure Hunt, que é capaz de distribuir algoritmos de busca independentes para um grande número de nós de processamento. Com o objetivo de obter uma convergência conjunta entre os nós, este framework propõe um mecanismo de direcionamento que controla suavemente a cooperação entre múltiplas instâncias independentes do Treasure Hunt. A topologia em árvore proposta pelo Treasure Hunt garante a rápida propagação da informação pelos nós, ao mesmo tempo em que provê simutaneamente explorações (pelos nós-pai) e intensificações (pelos nós-filho), em vários níveis de granularidade, independentemente do número de nós na árvore. O Treasure Hunt tem boa tolerância à falhas e está parcialmente preparado para uma total tolerância à falhas. Como parte dos métodos desenvolvidos durante este trabalho, um método automatizado de Particionamento Iterativo foi proposto para controlar o balanceamento entre explorações e intensificações ao longo da busca. Uma Modelagem de Estabilização de Convergência para operar em modo Online também foi proposto, com o objetivo de encontrar pontos de parada com bom custo/benefício para os algoritmos de otimização que executam dentro das instâncias do Treasure Hunt. Experimentos em benchmarks clássicos, aleatórios e de competição, de vários tamanhos e complexidades, usando os algoritmos de busca PSO, DE e CCPSO2, mostram que o Treasure Hunt melhora as características inerentes destes algoritmos de busca. O Treasure Hunt faz com que os algoritmos de baixa performance se tornem comparáveis aos de boa performance, e os algoritmos de boa performance possam estender seus limites até problemas maiores. Experimentos distribuindo instâncias do Treasure Hunt, em uma rede cooperativa de até 160 processos, demonstram a escalabilidade robusta do framework, apresentando melhoras nos resultados mesmo quando o tempo de processamento é fixado (wall-clock) para todas as instâncias distribuídas do Treasure Hunt. Resultados demonstram que o mecanismo de amostragem fornecido pelo Treasure Hunt, aliado à maior cooperação entre as múltiplas populações em evolução, reduzem a necessidade de grandes populações e de algoritmos de busca complexos. Isto é especialmente importante em problemas de mundo real que possuem funções de fitness muito custosas. Palavras-chave: Inteligência artificial. Métodos de otimização. Algoritmos distribuídos. Modelagem de convergência. Alta dimensionalidade.Abstract: This work proposes a multilevel framework called Treasure Hunt, which is capable of distributing independent search algorithms to a large number of processing nodes. Aiming to obtain joint convergences between working nodes, Treasure Hunt proposes a driving mechanism that smoothly controls the cooperation between the multiple independent Treasure Hunt instances. The tree topology proposed by Treasure Hunt ensures quick propagation of information, while providing simultaneous explorations (by parents) and exploitations (by children), on several levels of granularity, regardless the number of nodes in the tree. Treasure Hunt has good fault tolerance and is partially prepared to full fault tolerance. As part of the methods developed during this work, an automated Iterative Partitioning method is proposed to control the balance between exploration and exploitation as the search progress. A Convergence Stabilization Modeling to operate in Online mode is also proposed, aiming to find good cost/benefit stopping points for the optimization algorithms running within the Treasure Hunt instances. Experiments on classic, random and competition benchmarks of various sizes and complexities, using the search algorithms PSO, DE and CCPSO2, show that Treasure Hunt boosts the inherent characteristics of these search algorithms. Treasure Hunt makes algorithms with poor performances to become comparable to good ones, and algorithms with good performances to be capable of extending their limits to larger problems. Experiments distributing Treasure Hunt instances in a cooperative network up to 160 processes show the robust scaling of the framework, presenting improved results even when fixing a wall-clock time for the instances. Results show that the sampling mechanism provided by Treasure Hunt, allied to the increased cooperation between multiple evolving populations, reduce the need for large population sizes and complex search algorithms. This is specially important on real-world problems with time-consuming fitness functions. Keywords: Artificial intelligence. Optimization methods. Distributed algorithms. Convergence modeling. High dimensionality

A Novel Path Planning Optimization Algorithm for Semi-Autonomous UAV in Bird Repellent Systems Based in Particle Swarm Optimization

Bird damage to fruit crops causes significant monetary losses to farmers annually. The application of traditional bird repelling methods such as bird cannons and tree netting became inefficient in the long run, keeping high maintenance and reduced mobility. Due to their versatility, Unmanned Aerial Vehicles (UAVs) can be beneficial to solve this problem. However, due to their low battery capacity that equals low flight duration, it is necessary to evolve path planning optimization. A path planning optimization algorithm of UAVs based on Particle Swarm Optimization (PSO) is presented in this dissertation. This technique was used due to the need for an easy implementation optimization algorithm to start the initial tests. The PSO algorithm is simple and has few control parameters while maintaining a good performance. This path planning optimization algorithm aims to manage the drone's distance and flight time, applying optimization and randomness techniques to overcome the disadvantages of the traditional systems. The proposed algorithm's performance was tested in three study cases: two of them in simulation to test the variation of each parameter and one in the field to test the influence on battery management and height influence. All cases were tested in the three possible situations: same incidence rate, different rates, and different rates with no bird damage to fruit crops. The proposed algorithm presents promising results with an outstanding reduced average error in the total distance for the path planning obtained and low execution time. However, it is necessary to point out that the path planning optimization algorithm may have difficulty finding a suitable solution if there is a bad ratio between the total distance for path planning and points of interest. The field tests were also essential to understand the algorithm's behavior of the path planning algorithm in the UAV, showing that there is less energy discharged with fewer points of interest, but that do not correlates with the flight time. Also, there is no association between the maximum horizontal speed and the flight time, which means that the function to calculate the total distance for path planning needs to be adjusted.Anualmente, os danos causados pelas aves em pomares criam perdas monetárias significativas aos agricultores. A aplicação de métodos tradicionais de dispersão de aves, como canhões repelentes de aves e redes nas árvores, torna-se ineficiente a longo prazo, sendo ainda de alta manutenção e de mobilidade reduzida. Devido à sua versatilidade, os Veículos Aéreos Não Tripulados (VANT) podem ser benéficos para resolver este problema. No entanto, devido à baixa capacidade das suas baterias, que se traduz num baixo tempo de voo, é necessário otimizar o planeamento dos caminhos. Nesta dissertação, é apresentado um algoritmo de otimização para planeamento de caminhos para VANT baseado no Particle Swarm Optimization (PSO). Para se iniciarem os primeiros testes do algoritmo proposto, a técnica utilizada foi a supracitada devido à necessidade de um algoritmo de otimização fácil de implementar. O algoritmo PSO é simples e possuí poucos parâmetros de controlo, mantendo um bom desempenho. Este algoritmo de otimização de planeamento de caminhos propõe-se a gerir a distância e o tempo de voo do drone, aplicando técnicas de otimização e de aleatoriedade para superar a sua desvantagem relativamente aos sistemas tradicionais. O desempenho do algoritmo de planeamento de caminhos foi testado em três casos de estudo: dois deles em simulação para testar a variação de cada parâmetro e outro em campo para testar a capacidade da bateria. Todos os casos foram testados nas três situações possíveis: mesma taxa de incidência, taxas diferentes e taxas diferentes sem danos de aves. Os resultados apresentados pelo algoritmo proposto demonstram um erro médio muto reduzido na distância total para o planeamento de caminhos obtido e baixo tempo de execução. Porém, é necessário destacar que o algoritmo pode ter dificuldade em encontrar uma solução adequada se houver uma má relação entre a distância total para o planeamento de caminhos e os pontos de interesse. Os testes de campo também foram essenciais para entender o comportamento do algoritmo na prática, mostrando que há menos energia consumida com menos pontos de interesse, sendo que este parâmetro não se correlaciona com o tempo de voo. Além disso, não há associação entre a velocidade horizontal máxima e o tempo da missão, o que significa que a função de cálculo da distância total para o planeamento de caminhos requer ser ajustada

Kinematic Performance Measures and Optimization of Parallel Kinematics Manipulators: A Brief Review

This chapter covers a number of kinematic performance indices that are instrumental in designing parallel kinematics manipulators. These indices can be used selectively based on manipulator requirements and functionality. This would provide the very practical tool for designers to approach their needs in a very comprehensive fashion. Nevertheless, most applications require a more composite set of requirements that makes optimizing performance more challenging. The later part of this chapter will discuss single-objective and multi-objectives optimization that could handle certain performance indices or a combination of them. A brief description of most common techniques in the literature will be provided

Multi-objective particle swarm optimization for the structural design of concentric tube continuum robots for medical applications

Concentric tube robots belong to the class of continuum robotic systems whose morphology is described by continuous tangent curvature vectors. They are composed of multiple, interacting tubes nested inside one another and are characterized by their inherent flexibility. Concentric tube continuum robots equipped with tools at their distal end have high potential in minimally invasive surgery. Their morphology enables them to reach sites within the body that are inaccessible with commercial tools or that require large incisions. Further, they can be deployed through a tight lumen or follow a nonlinear path. Fundamental research has been the focus during the last years bringing them closer to the operating room. However, there remain challenges that require attention. The structural synthesis of concentric tube continuum robots is one of these challenges, as these types of robots are characterized by their large parameter space. On the one hand, this is advantageous, as they can be deployed in different patients, anatomies, or medical applications. On the other hand, the composition of the tubes and their design is not a straightforward task but one that requires intensive knowledge of anatomy and structural behavior. Prior to the utilization of such robots, the composition of tubes (i.e. the selection of design parameters and application-specific constraints) must be solved to determine a robotic design that is specifically targeted towards an application or patient. Kinematic models that describe the change in morphology and complex motion increase the complexity of this synthesis, as their mathematical description is highly nonlinear. Thus, the state of the art is concerned with the structural design of these types of robots and proposes optimization algorithms to solve for a composition of tubes for a specific patient case or application. However, existing approaches do not consider the overall parameter space, cannot handle the nonlinearity of the model, or multiple objectives that describe most medical applications and tasks. This work aims to solve these fundamental challenges by solving the parameter optimization problem by utilizing a multi-objective optimization algorithm. The main concern of this thesis is the general methodology to solve for patient- and application-specific design of concentric tube continuum robots and presents key parameters, objectives, and constraints. The proposed optimization method is based on evolutionary concepts that can handle multiple objectives, where the set of parameters is represented by a decision vector that can be of variable dimension in multidimensional space. Global optimization algorithms specifically target the constrained search space of concentric tube continuum robots and nonlinear optimization enables to handle the highly nonlinear elasticity modeling. The proposed methodology is then evaluated based on three examples that include cooperative task deployment of two robotic arms, structural stiffness optimization under the consideration of workspace constraints and external forces, and laser-induced thermal therapy in the brain using a concentric tube continuum robot. In summary, the main contributions are 1) the development of an optimization methodology that describes the key parameters, objectives, and constraints of the parameter optimization problem of concentric tube continuum robots, 2) the selection of an appropriate optimization algorithm that can handle the multidimensional search space and diversity of the optimization problem with multiple objectives, and 3) the evaluation of the proposed optimization methodology and structural synthesis based on three real applications

Process control for WAAM using computer vision

This study is mainly about the vision system and control algorithm programming for wire arc additive manufacturing (WAAM). Arc additive manufacturing technology is formed by the principle of heat source cladding produced by welders using molten inert gas shielded welding (MIG), tungsten inert gas shielded welding (TIG) and layered plasma welding power supply (PA). It has high deposition efficiency, short manufacturing cycle, low cost, and easy maintenance. Although WAAM has very good uses in various fields, the inability to control the adding process in real time has led to defects in the weld and reduced quality. Therefore, it is necessary to develop the real-time feedback through computer vision and algorithms for WAAM to ensure that the thickness and the width of each layer during the addition process are the same

Motion Planning of Redundant Manipulator With Variable Joint Velocity Limit Based on Beetle Antennae Search Algorithm

Redundant manipulators play important roles in many industrial and service applications by assisting people fulfill heavy and repetitive jobs. However, redundant manipulators are coupled highly-nonlinear systems which exert difficulty of redundancy resolution computation. Conventional methods such as pseudo-inverse-based approaches obtain the resolved joint angles from joint velocity level, which may bring about more computational cost and may neglect joint velocity limits. In this work, a motion planning method based on beetle antennae search algorithm (BAS) is proposed for motion planning of redundant manipulators with the variable joint velocity limit. Such proposed work does not need to resolve the velocity kinematics equation as the conventional methods do, and the proposed method can directly deal with the forward kinematics equation to resolve the desired joint angles. The simulation and experiment on the five-link planar manipulator and the Kuka industrial manipulator system demonstrate the efficiency of the proposed method for motion planning of redundant manipulator, and reveal the reliable performance of the BAS algorithm as compared with genetic algorithm (GA), particle swarm optimization (PSO), firefly algorithm(FA) and quantum behaved particle swarm algorithm(QPSO) methods