Hybrid Intelligent Optimization Methods for Engineering Problems

The purpose of optimization is to obtain the best solution under certain conditions. There are numerous optimization methods because different problems need different solution methodologies; therefore, it is difficult to construct patterns. Also mathematical modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not a simple one and mostly multi-modal. Another issue is differentiability. Engineering design problems are usually nonlinear and they sometimes exhibit discontinuous derivatives for the objective and constraint functions. Due to these difficulties, non-gradient-based algorithms have become more popular in recent decades. Genetic algorithms (GA) and particle swarm optimization (PSO) algorithms are popular, non-gradient based algorithms. Both are population-based search algorithms and have multiple points for initiation. A significant difference from a gradient-based method is the nature of the search methodologies. For example, randomness is essential for the search in GA or PSO. Hence, they are also called stochastic optimization methods. These algorithms are simple, robust, and have high fidelity. However, they suffer from similar defects, such as, premature convergence, less accuracy, or large computational time. The premature convergence is sometimes inevitable due to the lack of diversity. As the generations of particles or individuals in the population evolve, they may lose their diversity and become similar to each other. To overcome this issue, we studied the diversity concept in GA and PSO algorithms. Diversity is essential for a healthy search, and mutations are the basic operators to provide the necessary variety within a population. After having a close scrutiny of the diversity concept based on qualification and quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

Analysis and Comparison of Clothoid and Dubins Algorithms for UAV Trajectory Generation

The differences between two types of pose-based UAV path generation methods clothoid and Dubins are analyzed in this thesis. The Dubins path is a combination of circular arcs and straight line segments; therefore its curvature will exhibit sudden jumps between constant values. The resulting path will have a minimum length if turns are performed at the minimum possible turn radius. The clothoid path consists of a similar combination of arcs and segments but the difference is that the clothoid arcs have a linearly variable curvature and are generated based on Fresnel integrals. Geometrically, the generation of the clothoid arc starts with a large curvature that decreases to zero. The clothoid path results are longer than the Dubins path between the same two poses and for the same minimum turn radius. These two algorithms are the focus of this research because of their geometrical simplicity, flexibility, and low computational requirements.;The comparison between clothoid and Dubins algorithms relies on extensive simulation results collected using an ad-hoc developed automated data acquisition tool within the WVU UAV simulation environment. The model of a small jet engine UAV has been used for this purpose. The experimental design considers several primary factors, such as different trajectory tracking control laws, normal and abnormal flight conditions, relative configuration of poses, and wind and turbulence. A total of five different controllers have been considered, three conventional with fixed parameters and two adaptive. The abnormal flight conditions include locked or damaged actuators (stabilator, aileron, or rudder) and sensor bias affecting roll, pitch, or yaw rate gyros that are used in the feedback control loop. The relative configuration of consecutive poses is considered in terms of heading (required turn angle) and relative location of start and end points (position quadrant). Wind and turbulence effects were analyzed for different wind speed and direction and several levels of turbulence severity. The evaluation and comparison of the two path generation algorithms are performed based on generated and actual path length and tracking performance assessed in terms of tracking errors and control activity.;Although continuous position and velocity are ensured, the Dubins path yields discontinuous changes in path curvature and hence in commanded lateral accelerations at the transition points between the circular arcs and straight segments. The simulation results show that this generally leads to increased trajectory tracking errors, longer actual paths, and more intense control surface activity. The gradual (linear) change in clothoid curvature yields a continuous change in commanded lateral accelerations with general positive effects on the overall UAV performance based on the metrics considered. The simulation results show general similar trends for all factors considered. As a result, it may be concluded that, due to the continuous change in commanded lateral acceleration, the clothoid path generation algorithm provides overall better performance than the Dubins algorithm, at both normal and abnormal flight conditions, if the UAV mission involves significant maneuvers requiring intense lateral acceleration commands

INTELLIGENT UAV SCOUTING FOR FIELD CONDITION MONITORING

Precision agriculture requires detailed and timely information about field condition. In less than the short flight time a UAV (Unmanned Aerial Vehicle) can provide, an entire field can be scanned at the highest allowed altitude. The resulting NDVI (Normalized Difference Vegetation Index) imagery can then be used to classify each point in the field using a FIS (Fuzzy Inference System). This identifies areas that are expected to be similar, but only closer inspection can quantify and diagnose crop properties. In the remaining flight time, the goal is to scout a set of representative points maximizing the quality of actionable information about the field condition. This quality is defined by two new metrics: the average sampling probability (ASP) and the total scouting luminance (TSL). In simulations, the scouting flight plan created using a GA (Genetic Algorithm) significantly outperformed plans created by grid sampling or human experts, obtaining over 99% ASP while improving TSL by an average of 285%

Advanced Path Planning and Collision Avoidance Algorithms for UAVs

The thesis aims to investigate and develop innovative tools to provide autonomous flight capability to a fixed-wing unmanned aircraft. Particularly it contributes to research on path optimization, tra jectory tracking and collision avoidance with two algorithms designed respectively for path planning and navigation. The complete system generates the shortest path from start to target avoiding known obstacles represented on a map, then drives the aircraft to track the optimum path avoiding unpredicted ob jects sensed in flight. The path planning algorithm, named Kinematic A*, is developed on the basis of graph search algorithms like A* or Theta* and is meant to bridge the gap between path-search logics of these methods and aircraft kinematic constraints. On the other hand the navigation algorithm faces concurring tasks of tra jectory tracking and collision avoidance with Nonlinear Model Predictive Control. When A* is applied to path planning of unmanned aircrafts any aircraft kinematics is taken into account, then practicability of the path is not guaranteed. Kinematic A* (KA*) generates feasible paths through graph-search logics and basic vehicle characteristics. It includes a simple aircraft kinematic-model to evaluate moving cost between nodes of tridimensional graphs. Movements are constrained with minimum turning radius and maximum rate of climb. Furtermore, separation from obstacles is imposed, defining a volume around the path free from obstacles (tube-type boundaries). Navigation is safe when the tracking error does not exceed this volume. The path-tracking task aims to link kinematic information related to desired aircraft positions with dynamic behaviors to generate commands that minimize the error between reference and real tra jectory. On the other hand avoid obstacles in flight is one of the most challenging tasks for autonomous aircrafts and many elements must be taken into account in order to implement an effective collision avoidance maneuver. Second part of the thesis describes a Nonlinear Model Predictive Control (NMPC) application to cope with collision avoidance and path tracking tasks. First contribution is the development of a navigation system able to match concurring problems: track the optimal path provided with KA* and avoid unpredicted obstacles detected with sensors. Second Contribution is the Sense & Avoid (S&A) technique exploiting spherical camera and visual servoing control logics