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

Optimal Path Planning for Aerial Load Transportation in Complex Environments using PSO-Improved Artificial Potential Fields

In this article, we investigate the optimal path planning for aerial load transportation in complex, dynamic, and static environments using Particle Swarm Optimization (PSO). A hierarchical optimal control system is designed for a quadrotor equipped with a cable-suspended payload, employing Euler-Lagrange equations of motion. To navigate through obstacles, an improved artificial potential field combined with the PSO algorithm is used to determine the shortest path for a virtual point, acting as a leader. This leader guides the system toward the target point while avoiding collisions with both fixed and moving obstacles. The gravitational and repulsion coefficient forces using various PSO methods are fine-tuned to achieve the best trajectory and minimize time duration. The identified point serves as the desired location for quadrotor position control, based on a sliding mode strategy. Finally, we present numerical results to demonstrate the successful transportation of the payload by the system

Quadcopter Attitude Control Optimization and Multi-Agent Coordination

This thesis presents a method of automated control gain tuning for a Quadcopter Unmanned Aerial Vehicle and proposes a method of coordination multiple autonomous robotic agents capable for formation aggregation. Sliding Mode Control for Quadcopter altitude and attitude stabilization is presented and tuned using Particle Swarm Optimization. Different configurations for the optimization process are compared to determine an effective and time-efficient setup to complete the control gain tuning. The multi-agent coordination scheme expands upon an existing adjustable swarm framework based on an Artificial Potential Field Sliding Mode Controller. The original leader-follower scheme is modified with the goal of producing a leaderless swarm where agents move towards specific locations to aggregate a desired formation. Analysis of the swarm control scheme pays particular attention to maintaining proper distance between agents. Using Lyapunov methods following that of the original controller analysis, stability under first order and general higher order dynamics is analyzed. Numerical simulations of the swarm controller using agents with nonlinear Quadcopter or second order point mass dynamics are presented to illustrate the capabilities of this algorithm. The automatically tuned Quadcopter controller is used in simulations when applicable. The development of an experimental test platform is discussed with the intention of validating the simulation results on physical Quadcopters

Step-Optimized Particle Swarm Optimization

Particle swarm optimization (PSO) is widely used in industrial and academic research to solve optimization problems. Recent developments of PSO show a direction towards adaptive PSO (APSO). APSO changes its behaviour during the optimization process based on information gathered at each iteration. It has been shown that APSO is able to solve a wide range of difficult optimization problems efficiently and effectively. In classical PSO, all parameters are fixed for the entire swarm. In particular, all particles share the same settings of their velocity weights. We propose four APSO variants in which every particle has its own velocity weights. We use PSO to optimize the settings of the velocity weights of every particle at every iteration, thereby creating a step-optimized PSO (SOPSO). We implement four known PSO variants (global best PSO, decreasing weight PSO, time-varying acceleration coefficients PSO, and guaranteed convergence PSO) and four proposed APSO variants (SOPSO, moving bounds SOPSO, repulsive SOPSO, and moving bound repulsive SOPSO) in a PSO software package. The PSO software package is used to compare the performance of the PSO and APSO variants on 22 benchmark problems. Test results show that the proposed APSO variants outperform the known PSO variants on difficult optimization problems that require large numbers of function evaluations for their solution. This suggests that the SOPSO strategy of optimizing the settings of the velocity weights of every particle improves the robustness and performance of PSO

A face - off - classical and heuristic - based path planning approaches

Robot path planning is a computational problem to find a valid sequence of configurations to move a robot from an initial to a final destination. Several classical and heuristic-based methods exist that can be used to solve the problem. This paper compares the performance of a classical method based on potential field, Lyapunov-based Control Scheme, with those of the standard and stepping ahead Firefly Algorithms. The performance comparison is based on the optimal path distance and time. The results show that the stepping ahead Firefly algorithm finds a shorter path in lesser duration when compared with the Lyapunov-based method. The LbCS also inherently faces the local minima problem when the start, target, and obstacle’s center coordinates are collinear. This problem is solved using the firefly algorithm where the diversification of the fireflies helps escape local minima

3D Formation Control in Multi-Robot Teams Using Artificial Potential Fields

Multi-robot teams find applications in emergency response, search and rescue operations, convoy support and many more. Teams of autonomous aerial vehicles can also be used to protect a cargo of airplanes by surrounding them in some geometric shape. This research develops a control algorithm to attract UAVs to one or a set of bounded geometric shapes while avoiding collisions, re-configuring in the event of departure or addition of UAVs and maneuvering in mission space while retaining the configuration. Using potential field theory, weighted vector fields are described to attract UAVs to a desired formation. In order to achieve this, three vector fields are defined: one attracts UAVs located outside the formation towards bounded geometric shape; one pushes them away from the center towards the desired region and the third controls collision avoidance and dispersion of UAVs within the formation. The result is a control algorithm that is theoretically justified and verified using MATLAB which generates velocity vectors to attract UAVs to a loose formation and maneuver in the mission space while remaining in formation. This approach efficiently scales to different team sizes

Hybrid Swarm Algorithm for Mobile Robot Path Planning

           The adoption of lightweight and effective swarm algorithms is required for low resource usage algorithms for mobile robot path planning crises. We present a hybrid swarm approach in this study that combines the best features of particle swarm optimization and river formation dynamics. This method looks for the shortest route while keeping the path as smooth as feasible. The best qualities of both approaches are combined and leveraged by the hybrid RFD-PSO methodology. While the RFD algorithm is well known for its smooth path discovery, it needs a lot of drops for good convergence and suffers from sinuosity problems. The generated hybrid RFD-PSO algorithm synergistically balances PSO's fast convergence with the river method's adaptive exploration and exploitation. Comparing the simulation results of the proposed method versus the Ant Colony Optimization (ACO), modified Ant Colony Optimization ACO*, PSO, RFD, A*, and Dijkstra’s, Hybrid RFD-PSO have better results in creating optimal path

Optical Communication System for Remote Monitoring and Adaptive Control of Distributed Ground Sensors Exhibiting Collective Intelligence

Comprehensive management of the battle-space has created new requirements in information management, communication, and interoperability as they effect surveillance and situational awareness. The objective of this proposal is to expand intelligent controls theory to produce a uniquely powerful implementation of distributed ground-based measurement incorporating both local collective behavior, and interoperative global optimization for sensor fusion and mission oversight. By using a layered hierarchal control architecture to orchestrate adaptive reconfiguration of autonomous robotic agents, we can improve overall robustness and functionality in dynamic tactical environments without information bottlenecks. In this concept, each sensor is equipped with a miniaturized optical reflectance modulator which is interactively monitored as a remote transponder using a covert laser communication protocol from a remote mothership or operative. Robot data-sharing at the ground level can be leveraged with global evaluation criteria, including terrain overlays and remote imaging data. Information sharing and distributed intelli- gence opens up a new class of remote-sensing applications in which small single-function autono- mous observers at the local level can collectively optimize and measure large scale ground-level signals. AS the need for coverage and the number of agents grows to improve spatial resolution, cooperative behavior orchestrated by a global situational awareness umbrella will be an essential ingredient to offset increasing bandwidth requirements within the net. A system of the type described in this proposal will be capable of sensitively detecting, tracking, and mapping spatial distributions of measurement signatures which are non-stationary or obscured by clutter and inter- fering obstacles by virtue of adaptive reconfiguration. This methodology could be used, for example, to field an adaptive ground-penetrating radar for detection of underground structures in urban environments and to detect chemical species concentrations in migrating plumes. Given is our research in these areas and a status report of our progress

A review on robot motion planning approaches

The ability of a robot to plan its own motion seems pivotal to its autonomy, and that is why the motion planning has become part and parcel of modern intelligent robotics. In this paper, about 100 research are reviewed and briefly described to identify and classify the amount of the existing work for each motion planning approach. Meanwhile, around 200 research were used to determine the percentage of the application of each approach. The paper includes comparative tables and charts showing the application frequency of each approach in the last 30 years. Finally, some open areas and challenging topics are presented based on the reviewed papers