The recent global health crisis also known as the COVID-19 or coronavirus pandemic has attracted the researchers’ attentions to a treatment approach called immune plasma or convalescent plasma once more again. The main idea lying behind the immune plasma treatment is transferring the antibody rich part of the blood taken from the patients who are recovered previously to the critical individuals and its efficiency has been proven by successfully using against great influenza of 1918, H1N1 flu, MERS, SARS and Ebola. In this study, we modeled the mentioned treatment approach and introduced a new meta-heuristic called Immune Plasma (IP) algorithm. The performance of the IP algorithm was investigated in detail and then compared with some of the classical and state-of-art meta-heuristics by solving a set of numerical benchmark problems. Moreover, the capabilities of the IP algorithm were also analyzed over complex engineering optimization problems related with the noise minimization of the electro-encephalography signal measurements. The results of the experimental studies showed that the IP algorithm is capable of obtaining better solutions for the vast majority of the test problems compared to other commonly used meta-heuristic algorithms.

The increasing usage of unmanned aerial vehicles (UAVs) and their variants carrying complex weapon systems, known as unmanned combat aerial vehicles (UCAVs), has triggered a global revolution in complex military and commercial operations and has attracted researcher attention from different engineering disciplines in order to solve challenging problems regarding these modern vehicles. Path planning is a challenging problem for UAV and UCAV systems that requires the calculation of an optimal solution by considering enemy threats, total flight length, fuel or battery consumption, and some kinematic properties such as turning or climbing angles. In this study, the immune plasma (IP or IPA) algorithm, one of the most recent nature-inspired intelligent optimization methods, was modified by changing the default plasma transfer operations with a newly proposed technique called the extended treatment approach; extended IPA (ExtIPA) was then introduced as a path planner. To analyze the solving capabilities of the ExtIPA, 16 cases from five battlefield scenarios were tested by assigning different values to the algorithm-specific control parameters. The paths calculated with ExtIPA were compared with the paths found by planners on the basis of other intelligent optimization techniques. Comparative studies between ExtIPA and other techniques allowed for stating that the extended treatment approach significantly contributes to both the convergence speed and qualities of the obtained solutions and helps ExtIPA in performing better than its rivals in most cases.

The immune plasma algorithm (IP algorithm or IPA) is one of the most recent meta-heuristic techniques and models the fundamental steps of immune or convalescent plasma treatment, attracting researchers’ attention once more with the COVID-19 pandemic. The IP algorithm determines the number of donors and the number of receivers when two specific control parameters are initialized and protects their values until the end of termination. However, determining which values are appropriate for the control parameters by adjusting the number of donors and receivers and guessing how they interact with each other are difficult tasks. In this study, we attempted to determine the number of plasma donors and receivers with an improved mechanism that depended on dividing the whole population into two sub-populations using a statistical measure known as the percentile and then a novel variant of the IPA called the percentile IPA (pIPA) was introduced. To investigate the performance of the pIPA, 22 numerical benchmark problems were solved by assigning different values to the control parameters of the algorithm. Moreover, two complex engineering problems, one of which required the filtering of noise from the recorded signal and the other the path planning of an unmanned aerial vehicle, were solved by the pIPA. Experimental studies showed that the percentile-based donor–receiver selection mechanism significantly contributed to the solving capabilities of the pIPA and helped it outperform well-known and state-of-art meta-heuristic algorithms.

The autonomous task success of an unmanned aerial vehiclel (UAV) or its military specialization called the unmanned combat aerial vehicle (UCAV) has a direct relationship with the planned path. However, planning a path for a UAV or UCAV system requires solving a challenging problem optimally by considering the different objectives about the enemy threats protecting the battlefield, fuel consumption or battery usage and kinematic constraints on the turning maneuvers. Because of the increasing demands to the UAV systems and game-changing roles played by them, developing new and versatile path planning algorithms become more critical and urgent. In this study, a greedy algorithm named as the Back-and-Forth (BaF) was designed and introduced for solving the path planning problem. The BaF algorithm gets its name from the main strategy where a heuristic approach is responsible to generate two predecessor paths, one of which is calculated from the start point to the target point, while the other is calculated in the reverse direction, and combines the generated paths for utilizing their advantageous line segments when obtaining more safe, short and maneuverable path candidates. The performance of the BaF was investigated over three battlefield scenarios and twelve test cases belonging to them. Moreover, the BaF was integrated into the workflow of a well-known meta-heuristic, artificial bee colony (ABC) algorithm, and detailed experiments were also carried out for evaluating the possible contribution of the BaF on the path planning capabilities of another technique. The results of the experiments showed that the BaF algorithm is able to plan at least promising or generally better paths with the exact consistency than other tested meta-heuristic techniques and runs nine or more times faster as validated through the comparison between the BaF and ABC algorithms. The results of the experiments further proved that the integration of the BaF boosts the performance of the ABC and helps it to outperform all of fifteen competitors for nine of twelve test cases.

The unpredictable benefits and low operational costs of unmanned aerial vehicles (UAVs) compared to their conventional counterparts caused a tremendous change in commercial and military concepts, and different solutions to problems regarding modern aerial vehicles were tried to further improve flight and job performances. One of the most challenging problems about the UAVs is known as the path planning problem, and a solution should satisfy some objectives related to the enemy anti-air weapons, fuel or battery consumption, and manoeuvre capability of the UAV being operated optimally. Immune plasma algorithm (IP algorithm or IPA) is a recent meta-heuristic optimiser, and its competitive performance has been validated over a set of engineering problems. In this study, a greedy initialiser that is responsible for generating a population of IPA was first introduced. Also, the treatment schema of the IPA was completely redesigned for more robust and detailed search characteristics without requiring either IPA-specific control parameters or their subtle configurations. The new IPA-based path planner, called greedy initialiser IPA (gintIPA), was tested by using three battlefields and 12 test cases belonging to them, and the obtained results were compared with the results of the well-known meta-heuristic techniques. Comparative studies showed that gintIPA is capable of planning more robust and safe UAV paths than other techniques for $91.6$ of all test cases. The proposed greedy initialiser gives a chance to start optimisation with qualified individuals and the newly designed treatment schema improving both exploitation and exploration routines significantly contributes to the gintIPA when outperforming other path planners.