A parallel compact cuckoo search algorithm for three-dimensional path planning

Three-dimensional unmanned aerial vehicle path planning utilizing artificial gorilla troops optimizer incorporating combined mutation and quadratic interpolation operators

In real terrain and dynamic obstacle scenarios, the complexity of the 3D UAV path planning problem greatly increases. Thus, to procure the optimal flight path for UAVs in such scenarios, an augmented Artificial Gorilla Troops Optimizer, denoted as OQMGTO, is proposed. The proposed OQMGTO algorithm introduces three strategies: combination mutation, quadratic interpolation, and random opposition-based learning, aiming to enhance the ability to timely escape from local optimal path areas and rapidly converge to the global optimal path. Given the flight distance, smoothness, terrain collision, and other five realistic factors of UAVs, specific constraint conditions are proposed to address complex scenarios, aiming to construct a path planning model. By optimizing this model, OQMGTO algorithm solves the path planning problem in complex scenarios. The extensive validation of OQMGTO algorithm on CEC2017 test suite enhances its credibility as a powerful optimization tool. Comparison experiments are conducted in simulated terrain scenarios, including six multi-obstacle terrain scenarios and three dynamic obstacle scenarios. The experimental findings validate OOMGTO algorithm can assist UAV in searching for excellent flight paths, featuring high safety and reliability characteristics, which confirms the superiority of OOMGTO algorithm for path planning in simulated terrain scenarios. Furthermore, in four flight missions carried out in real terrains, OQMGTO algorithm demonstrates superior search performance, planning smooth trajectories without mountain collision.

Adaptive UAV Navigation Method Based on AHRS

To address the inaccuracy of the Constant Acceleration/Constant Velocity (CA/CV) model as the state equation in describing the relative motion state in UAV relative navigation, an adaptive UAV relative navigation method is proposed, which is based on the UAV attitude information provided by Attitude and Heading Reference System (AHRS). The proposed method utilizes the AHRS output attitude parameters as the benchmark for dead reckoning and derives a relative navigation state equation with attitude error as process noise. By integrating the extended Kalman filter output for relative state estimation and employing an adaptive decision rule designed using the innovation of the filter update phase, the proposed method recalculates motion states deviating from the actual motion using the Tasmanian Devil Optimization (TDO) algorithm. The simulation results show that, compared with the CA/CV model, the proposed method reduces the relative position errors by 12%, 23%, and 32% in the X, Y, and Z directions, respectively, and that it reduces the relative velocity errors by 350%, 330%, and 300%, respectively. There is a significant improvement in the relative navigation accuracy.

Bald eagle search algorithm for solving a three-dimensional path planning problem

Three-dimensional path planning refers to determining an optimal path in a three-dimensional space with obstacles, so that the path is as close to the target location as possible, while meeting some other constraints, including distance, altitude, threat area, flight time, energy consumption, and so on. Although the bald eagle search algorithm has the characteristics of simplicity, few control parameters, and strong global search capabilities, it has not yet been applied to complex three-dimensional path planning problems. In order to broaden the application scenarios and scope of the algorithm and solve the path planning problem in three-dimensional space, we present a study where five three-dimensional geographical environments are simulated to represent real-life unmanned aerial vehicles flying scenarios. These maps effectively test the algorithm's ability to handle various terrains, including extreme environments. The experimental results have verified the excellent performance of the BES algorithm, which can quickly, stably, and effectively solve complex three-dimensional path planning problems, making it highly competitive in this field.

Integration of path planning and following control for the stratospheric airship with forecasted wind field data

The absence of real-time airspeed sensors, which was more often ignored in previous studies, and low dynamic characteristics render stratospheric airship control challenging. This study creatively overcomes the aforementioned problems in an integrated path planning and following control scheme using forecasted wind field data. Herein, an efficient and practicable path planning algorithm is designed. Further, a smooth vector field guidance law is proposed for solving the problem of complex path following. Subsequently, an event-triggered neural network-based adaptive tracking controller is designed, considering the wind forecast error influence. Finally, these three parts are organically integrated to achieve autonomous flight. The stability of the closed-loop system and the exclusion of Zeno behavior are rigorously proved. The simulation results reveal that the convergence rate is 63.8% improved, essentially exhibiting better optimization, the tracking errors are eliminated within 80 s, and 99.4% control input updating times are saved.

An Enhanced Food Digestion Algorithm for Mobile Sensor Localization

Mobile sensors can extend the range of monitoring and overcome static sensors' limitations and are increasingly used in real-life applications. Since there can be significant errors in mobile sensor localization using the Monte Carlo Localization (MCL), this paper improves the food digestion algorithm (FDA). This paper applies the improved algorithm to the mobile sensor localization problem to reduce localization errors and improve localization accuracy. Firstly, this paper proposes three inter-group communication strategies to speed up the convergence of the algorithm based on the topology that exists between groups. Finally, the improved algorithm is applied to the mobile sensor localization problem, reducing the localization error and achieving good localization results.

A path planning method using modified harris hawks optimization algorithm for mobile robots

Path planning is a critical technology that could help mobile robots accomplish their tasks quickly. However, some path planning algorithms tend to fall into local optimum in complex environments. A path planning method using a modified Harris hawks optimization (MHHO) algorithm is proposed to address the problem and improve the path quality. The proposed method improves the performance of the algorithm through multiple strategies. A linear path strategy is employed in path planning, which could straighten the corner segments of the path, making the obtained path smooth and the path distance short. Then, to avoid getting into the local optimum, a local search update strategy is applied to the HHO algorithm. In addition, a nonlinear control strategy is also used to improve the convergence accuracy and convergence speed. The performance of the MHHO method was evaluated through multiple experiments in different environments. Experimental results show that the proposed algorithm is more efficient in path length and speed of convergence than the ant colony optimization (ACO) algorithm, improved sparrow search algorithm (ISSA), and HHO algorithms.

An Improved Grey Wolf Optimization with Multi-Strategy Ensemble for Robot Path Planning

Grey wolf optimization (GWO) is a meta-heuristic algorithm inspired by the hierarchy and hunting behavior of grey wolves. GWO has the superiorities of simpler concept and fewer adjustment parameters, and has been widely used in different fields. However, there are some disadvantages in avoiding prematurity and falling into local optimum. This paper presents an improved grey wolf optimization (IGWO) to ameliorate these drawbacks. Firstly, a modified position update mechanism for pursuing high quality solutions is developed. By designing an ameliorative position update formula, a proper balance between the exploration and exploitation is achieved. Moreover, the leadership hierarchy is strengthened by proposing adaptive weights of α, β and δ. Then, a dynamic local optimum escape strategy is proposed to reinforce the ability of the algorithm to escape from the local stagnations. Finally, some individuals are repositioned with the aid of the positions of the leaders. These individuals are pulled to new positions near the leaders, helping to accelerate the convergence of the algorithm. To verify the effectiveness of IGWO, a series of contrast experiments are conducted. On the one hand, IGWO is compared with some state-of-the-art GWO variants and several promising meta-heuristic algorithms on 20 benchmark functions. Experimental results indicate that IGWO performs better than other competitors. On the other hand, the applicability of IGWO is verified by a robot global path planning problem, and simulation results demonstrate that IGWO can plan shorter and safer paths. Therefore, IGWO is successfully applied to the path planning as a new method.

Path planning for spot welding robots based on improved ant colony algorithm

A welding path can be planned effectively for spot welding robots using the ant colony algorithm, but the initial parameters of the ant colony algorithm are usually selected through human experience, resulting in an unreasonable planned path. This paper combines the ant colony algorithm with the particle swarm algorithm and uses the particle swarm algorithm to train the initial parameters of the ant colony algorithm to plan an optimal path. Firstly, a mathematical model for spot welding path planning is established using the ant colony algorithm. Then, the particle swarm algorithm is introduced into the ant colony algorithm to find the optimal combination of parameters by treating the initial parameters $\alpha$ and $\beta$ of the ant colony algorithm and as two-dimensional coordinates in the particle swarm algorithm. Finally, the simulation analysis was carried out using MATLAB to obtain the paths of the improved ant colony algorithm for six different sets of parameters with an average path length of 10,357.7509 mm, but the average path length obtained by conventional algorithm was 10,830.8394 mm. Convergence analysis of the improved ant colony algorithm showed that the average number of iterations was 17. Therefore, the improved ant colony algorithm has higher solution quality and converges faster.

An adaptive dimension differential evolution algorithm based on ranking scheme for global optimization

In recent years, evolutionary algorithms based on swarm intelligence have drawn much attention from researchers. This kind of artificial intelligent algorithms can be utilized for various applications, including the ones of big data information processing in nowadays modern world with heterogeneous sensor and IoT systems. Differential evolution (DE) algorithm is one of the important algorithms in the field of optimization because of its powerful and simple characteristics. The DE has excellent development performance and can approach global optimal solution quickly. At the same time, it is also easy to get into local optimal, so it could converge prematurely. In the view of these shortcomings, this article focuses on the improvement of the algorithm of DE and proposes an adaptive dimension differential evolution (ADDE) algorithm that can adapt to dimension updating properly and balance the search and the development better. In addition, this article uses the elitism to improve the location update strategy to improve the efficiency and accuracy of the search. In order to verify the performance of the new ADDE, this study carried out experiments with other famous algorithms on the CEC2014 test suite. The comparison results show that the ADDE is more competitive.

A Fuzzy Logic Approach and Path Algorithm for Time and Energy Management of Smart Cleaning Robots

Smart home technologies (SHM) or devices provide some degree of digitally connected, automated, or enhanced services to building occupants in residential areas and have been becoming increasingly popular in recent years. SHM have the potential to improve home comfort, convenience, security and energy management. Different technologies are used to equip household parts for smarter monitoring, movement and remote control and to allow effective harmonic interaction between them. Especially, energy management and path-planning algorithms are some of the important problems for such technologies to get optimum efficiency and benefit. Smart vacuum cleaning robot is one of the applications of such devices with various functions. These cleaning robots have limited battery power and battery sizes, thus effective cleaning is critical. Additionally, the shortest / optimal path planning is essential for the efficient operation of effective cleaning based on the battery time. In this article, two distinct algorithms, which are Search algorithm and CSP algorithm are utilized to obtain distinct optimal minimum path lengths for keeping the home's total dirt level as low as possible. Depending on various types of linguistic, abstract, or perceptual variables, these algorithms are not enough for the energy management of the battery. Therefore, the fuzzy logic-based inference system is proposed for obtaining the charge durability of battery of the cleaning robot, in addition to these algorithms. The inputs affecting the charge durability are considered as floor type, dirt level and the width of area for the fuzzy approach.

Nature-inspired metaheuristics model for gene selection and classification of biomedical microarray data

Identifying a small subset of informative genes from a gene expression dataset is an important process for sample classification in the fields of bioinformatics and machine learning. In this process, there are two objectives: first, to minimize the number of selected genes, and second, to maximize the classification accuracy of the used classifier. In this paper, a hybrid machine learning framework based on a nature-inspired cuckoo search (CS) algorithm has been proposed to resolve this problem. The proposed framework is obtained by incorporating the cuckoo search (CS) algorithm with an artificial bee colony (ABC) in the exploitation and exploration of the genetic algorithm (GA). These strategies are used to maintain an appropriate balance between the exploitation and exploration phases of the ABC and GA algorithms in the search process. In preprocessing, the independent component analysis (ICA) method extracts the important genes from the dataset. Then, the proposed gene selection algorithms along with the Naive Bayes (NB) classifier and leave-one-out cross-validation (LOOCV) have been applied to find a small set of informative genes that maximize the classification accuracy. To conduct a comprehensive performance study, proposed algorithms have been applied on six benchmark datasets of gene expression. The experimental comparison shows that the proposed framework (ICA and CS-based hybrid algorithm with NB classifier) performs a deeper search in the iterative process, which can avoid premature convergence and produce better results compared to the previously published feature selection algorithm for the NB classifier.

Multi-objective optimization technique for trajectory planning of multi-humanoid robots in cluttered terrain

Humanoid robots hold a decent advantage over wheeled robots because of their ability to mimic human exile. The presented paper proposes a novel strategy for trajectory planning in a cluttered terrain using the hybridized controller modeled on the basis of modified MANFIS (multiple adaptive neuro-fuzzy inference system) and MOSFO (multi-objective sunflower optimization) techniques. The controller works in a two-step mechanism. The input parameters, i.e., obstacle distances and target direction, are first fed to the MANFIS controller, which generates a steering angle in both directions of an obstacle to dodge it. The intermediate steering angles are obtained based on the training model. The final steering angle to avoid obstacles is selected based on the direction of the target and additional obstacles in the path. It is further works as input for the MOSFO technique, which provides the ultimate steering angle. Using the proposed technique, various simulations are carried out in the WEBOT simulator, which shows a deviation under 5% when the results are validated in real-time experiments, revealing the technique to be robust. To resolve the complication of providing preference to the robot during deadlock condition in multi-humanoids system, the dining philosopher controller is implemented. The efficiency of the proposed technique is examined through the comparisons with the default controller of NAO based on toques produces at various joints that present an average improvement of 6.12%, 7.05% and 15.04% in ankle, knee and hip, respectively. It is further compared against the existed navigational strategy in multiple robot systems that also displays an acceptable improvement in travel length. In comparison in reference to the existing controller, the proposed technique emerges to be a clear winner by portraying its superiority.

Modified Mayfly Algorithm for UAV Path Planning

The unmanned aerial vehicle (UAV) path planning problem is primarily concerned with avoiding collision with obstacles while determining the best flight path to the target position. This paper first establishes a cost function to transform the UAV route planning issue into an optimization issue that meets the UAV’s feasible path requirements and path safety constraints. Then, this paper introduces a modified Mayfly Algorithm (modMA), which employs an exponent decreasing inertia weight (EDIW) strategy, adaptive Cauchy mutation, and an enhanced crossover operator to effectively search the UAV configuration space and discover the path with the lowest overall cost. Finally, the proposed modMA is evaluated on 26 benchmark functions as well as the UAV route planning problem, and the results demonstrate that it outperforms the other compared algorithms.

HDPP: High-Dimensional Dynamic Path Planning Based on Multi-Scale Positioning and Waypoint Refinement

Algorithms such as RRT (Rapidly exploring random tree), A* and their variants have been widely used in the field of robot path planning. A lot of work has shown that these detectors are unable to carry out effective and stable results for moving objects in high-dimensional space, which generate a large number of multi-dimensional corner points. Although some filtering mechanisms (such as splines and valuation functions) reduce the calculation scale, the chance of collision is increased, which is fatal to robots. In order to generate fewer but more effective and stable feature points, we propose a novel multi-scale positioning method to plan the motion of the high-dimensional target. First, a multi-scale feature extraction and refinement scheme for waypoint navigation and positioning is proposed to find the corner points that are more important to the planning, and gradually eliminate the unnecessary redundant points. Then, in order to obtain a stable planning effect, we balance the gradient of corner point classification detection to avoid over-optimizing some of them during the training phase. In addition, considering the maintenance cost of the robot in actual operation, we pay attention to the mechanism of anti-collision in the model design. Our approach can achieve a complete obstacle avoidance rate for high-dimensional space simulation and physical manipulators, and also work well in low-dimensional space for path planning. The experimental results demonstrate the superiority of our approach through a comparison with state-of-the-art models.

Efficient Network Architecture Search Using Hybrid Optimizer

Manually designing a convolutional neural network (CNN) is an important deep learning method for solving the problem of image classification. However, most of the existing CNN structure designs consume a significant amount of time and computing resources. Over the years, the demand for neural architecture search (NAS) methods has been on the rise. Therefore, we propose a novel deep architecture generation model based on Aquila optimization (AO) and a genetic algorithm (GA). The main contributions of this paper are as follows: Firstly, a new encoding strategy representing the CNN coding structure is proposed, so that the evolutionary computing algorithm can be combined with CNN. Secondly, a new mechanism for updating location is proposed, which incorporates three typical operators from GA cleverly into the model we have designed so that the model can find the optimal solution in the limited search space. Thirdly, the proposed method can deal with the variable-length CNN structure by adding skip connections. Fourthly, combining traditional CNN layers and residual blocks and introducing a grouping strategy provides greater possibilities for searching for the optimal CNN structure. Additionally, we use two notable datasets, consisting of the MNIST and CIFAR-10 datasets for model evaluation. The experimental results show that our proposed model has good results in terms of search accuracy and time.

A Soar-Based Space Exploration Algorithm for Mobile Robots

Space exploration is a hot topic in the application field of mobile robots. Proposed solutions have included the frontier exploration algorithm, heuristic algorithms, and deep reinforcement learning. However, these methods cannot solve space exploration in time in a dynamic environment. This paper models the space exploration problem of mobile robots based on the decision-making process of the cognitive architecture of Soar, and three space exploration heuristic algorithms (HAs) are further proposed based on the model to improve the exploration speed of the robot. Experiments are carried out based on the Easter environment, and the results show that HAs have improved the exploration speed of the Easter robot at least 2.04 times of the original algorithm in Easter, verifying the effectiveness of the proposed robot space exploration strategy and the corresponding HAs.

Time-optimal cornering trajectory planning for car-like mobile robots containing actuator dynamics

We establish a highly feasible algorithm for time-optimal cornering trajectory planning (TP) for car-like mobile robots (CLMRs) based on a dynamic model that contains actuator dynamics. First, we formulate an accurate dynamic model of a robot that contains DC motor actuators; this includes steering braking (caused by the lateral force of the front steering wheel) and two types of friction (viscous and Coulomb) under a nonslip condition. Our TP algorithm can utilize the full power of the DC motor actuators within proper pulse width modulation bounds and generated torque limits. Then, we establish an algorithm for a time-optimal cornering trajectory planning for CLMRs (TOCTP-CLMR). Our algorithm divides the trajectory into five sections comprising three turnings and two translations to minimize the travel distance. Then, we utilize the quickest rotation when turning to construct the time-optimal trajectory that satisfies the bang-bang principle. In addition, simulations are performed to demonstrate the validity of this method. Finally, we conduct open-loop experiments to validate our dynamic model and a trajectory tracking experiment to demonstrate the feasibility of the TOCTP-CLMR trajectory.

Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios

The amount of internet traffic generated during mass public events is significantly growing in a way that requires methods to increase the overall performance of the wireless network service. Recently, legacy methods in form of mobile cell sites, frequently called cells on wheels, were used. However, modern technologies are allowing the use of unmanned aerial vehicles (UAV) as a platform for network service extension instead of ground-based techniques. This results in the development of flying base stations (FBS) where the number of deployed FBSs depends on the demanded network capacity and specific user requirements. Large-scale events, such as outdoor music festivals or sporting competitions, requiring deployment of more than one FBS need a method to optimally distribute these aerial vehicles to achieve high capacity and minimize the cost. In this paper, we present a mathematical model for FBS deployment in large-scale scenarios. The model is based on a location set covering problem and the goal is to minimize the number of FBSs by finding their optimal locations. It is restricted by users' throughput requirements and FBSs' available throughput, also, all users that require connectivity must be served. Two meta-heuristic algorithms (cuckoo search and differential evolution) were implemented and verified on a real example of a music festival scenario. The results show that both algorithms are capable of finding a solution. The major difference is in the performance where differential evolution solves the problem six to eight times faster, thus it is more suitable for repetitive calculation. The obtained results can be used in commercial scenarios similar to the one used in this paper where providing sufficient connectivity is crucial for good user experience. The designed algorithms will serve for the network infrastructure design and for assessing the costs and feasibility of the use-case.

Optimized cuckoo search algorithm using tournament selection function for robot path planning

Acceptability of mobile robots in various applications has led to an increase in mobile robots’ research areas. Path planning is one of the core areas which needs to be improvised at a higher level. Optimization is playing a more prominent role these days. The nature-inspired algorithm is contributing to a greater extent in achieving optimization. This article presents the modified cuckoo search algorithm using tournament selection function for robot path planning. Path length and Path time are the algorithm’s parameters to validate the effectiveness and acceptability of the output. The cuckoo search algorithm’s fundamental working principle is taken as the baseline, and the tournament selection function is adapted to calculate the optimum path for robots while navigating from its initial position to final position. The tournament selection function is replacing the concept of random selection done by the cuckoo search algorithm. The use of tournament selection overcomes local minima for robots while traversing in the configuration space and increases the probability of giving more optimum results. The conventional cuckoo search algorithm whose random selection mechanism may lead to premature convergence may fall into the local minima. The use of tournament selection function increases the probability of giving better results as it allows all the possible solution to take part in the tournament. The results are analysed and compared with other relevant work like cuckoo search algorithm and particle swarm optimization technique and presented in the article. The proposed method produced a better output in terms of path length and path time.

Optimization for medical logistics robot based on model of traveling salesman problems and vehicle routing problems

Fast medicine dispensing system (FMDS) as a kind of medical logistic robot can dispense many drugs for one prescription at the same time. To guarantee the sustainability of drug dispensation, it is required that FMDS replenish drugs rapidly. The traditional order picking model (OPM) is difficult to meet the demand of prompt replenishment. To solve the problems of prolonged refilling route and inefficiency of drugs replenishment, a mixed refilling model based on multiple steps traveling salesman problem model (MTSPM) and vehicle routing problem model (VRPM) is proposed, and it is deployed in two circumstances of FMDS, including temporary replenishment mode (TRM) and concentrate replenishment mode (CRM). It not only meted the demand under different circumstances of drug replenishment but also shortened the refilling route significantly. First, the new pick sets were generated. Then, the orders of pick sets were optimized and the new paths were achieved. When the number of pickings is varied no more than 20, experiment results declared that the refilling route is the shortest by utilizing MTSPM when working under the TRM condition. Comparing MTSPM with OPM, the rate of refilling route length decreased up to 32.18%. Under the CRM condition, the refilling route is the shortest by utilizing VRPM. Comparing VRPM with OPM, the rate of refilling route length decreased up to 58.32%. Comparing VRPM with MTSPM, the rate of refilling route length has dropped more than 43.26%.