Two novel methods for heart disease prediction, which use the kurtosis of the features and the Maxwell–Boltzmann distribution, are presented. A Majority Voting approach is applied, and two base classifiers are derived through statistical weight calculation. First, exploitation of attribute kurtosis and attribute Kolmogorov–Smirnov test (KS test) result is done by plugging the base categorizer into a Bagging Classifier. Second, fitting Maxwell random variables to the components and summating KS statistics are used for weight assignment. We have compared state-of-the-art methods to the proposed classifiers and reported the results. According to the findings, our Gaussian distribution and kurtosis-based Majority Voting Bagging Classifier (GKMVB) and Maxwell Distribution-based Majority Voting Bagging Classifier (MKMVB) outperform SVM, ANN, and Naive Bayes algorithms. In this context, which also indicates, especially when we consider that the KS test and kurtosis hack is intuitive, that the proposed routine is promising. Following the state-of-the-art, the experiments were conducted on two well-known datasets of Heart Disease Prediction, namely Statlog, and Spectf. A comparison of Optimized Precision is made to prove the effectiveness of the methods: the newly proposed methods attained 85.6 and 81.0 for Statlog and Spectf, respectively (while the state of the heart attained 83.5 and 71.6, respectively). We claim that the Majority Voting family of classifiers is still open to new developments through appropriate weight assignment. This claim is obvious, especially when its simple structure is fused with the Ensemble Methods’ generalization ability and success.

In this article, an online path planning algorithm for multiple unmanned aerial vehicles (UAVs) has been proposed. The aim is to gather information from target areas (desired regions) while avoiding forbidden regions in a fixed time window starting from the present time. Vehicles should not violate forbidden zones during a mission. Additionally, the significance and reliability of the information collected about a target are assumed to decrease with time. The proposed solution finds each vehicle’s path by solving an optimization problem over a planning horizon while obeying specific rules. The basic structure in our solution is the centralized task assignment problem, and it produces near-optimal solutions. The solution can handle moving, pop-up targets, and UAV loss. It is a complicated optimization problem, and its solution is to be produced in a very short time. To simplify the optimization problem and obtain the solution in nearly real time, we have developed some rules. Among these rules, there is one that involves the kinematic constraints in the construction of paths. There is another which tackles the real-time decision-making problem using heuristics imitating human-like intelligence. Simulations are realized in MATLAB environment. The planning algorithm has been tested on various scenarios, and the results are presented.

In this article, multi-objective trajectory planning has been carried out for a quadrotor carrying a slung load. The goal is to obtain non-dominated solutions for path length, mission duration, and dissipated energy cost functions. These costs are optimized by imposing constraints on the slung-load quadrotor system’s endpoints, borders, obstacles, and dynamical equations. The dynamic model of a slung-load quadrotor system is used in the Euler-Lagrange formulation. Although the differential flatness feature is mostly used in this system’s trajectory planning, a fully dynamic model has been used in our study. A new multi-objective Genetic Algorithm has been developed to solve path planning, aiming to optimize trajectory length, mission time, and energy consumed during the mission. The solution process has a three-phase algorithm: Phase-1 is about randomly generating waypoints, Phase-2 is about constructing the initial non-dominated pool, and the final phase, Phase-3, is obtaining the solution. In addition to conventional genetic operators, simple genetic operators are proposed to improve the trajectories locally. Pareto Fronts have been obtained corresponding to exciting scenarios. The method has been tested, and results have been presented at the end. A comparison of the solutions obtained with MOGA operators and MOPSO over hypervolume values is also presented.

Electromyography (EMG) signal classification is vital to diagnose musculoskeletal abnormalities and control devices by motion intention detection. Machine learning assists both areas by classifying conditions or motion intentions. This paper proposes a novel window length insensitive EMG classification method utilizing the Entropy feature. The main goal of this study is to show that entropy can be used as the only feature for fast real-time classification of EMG signals of hand gestures. The main goal of this study is to show that entropy can be used as the only feature for fast real-time classification of EMG signals of hand gestures. Additionally, the entropy feature can classify feature vectors of different sliding window lengths without including them in the training data. Many kinds of entropy feature succeeded in electroencephalography (EEG) and electrocardiography (ECG) classification research. However, to the best of our knowledge, the Entropy Feature proposed by Shannon stays untested for EMG classification to this day. All the machine learning models are tested on datasets NinaPro DB5 and the newly collected SingleMyo. As an initial analysis to test the entropy feature, classic Machine Learning (ML) models are trained on the NinaPro DB5 dataset. This stage showed that except for the K Nearest Neighbor (kNN) with high inference time, Support Vector Machines (SVM) gave the best validation accuracy. Later, SVM models trained with feature vectors created by 1 s (200 samples) sliding windows are tested on feature vectors created by 250 ms (50 samples) to 1500 ms (300 samples) sliding windows. This experiment resulted in slight accuracy differences through changing window length, indicating that the Entropy feature is insensitive to this parameter. Lastly, Locally Parsed Histogram (LPH), typical in standard entropy functions, makes learning hard for ML methods. Globally Parsed Histogram (GPH) was proposed, and classification accuracy increased from 60.35% to 89.06% while window length insensitivity is preserved. This study shows that Shannon’s entropy is a compelling feature with low window length sensitivity for EMG hand gesture classification. The effect of the GPH approach against an easy-to-make mistake LPH is shown. A real-time classification algorithm for the entropy features is tested on the newly created SingleMyo dataset.

We propose a control structure for a quadrotor carrying a slung load with swing-angle constraints. This quadrotor is supposed to pass through the waypoints at specified speeds. First, a cascaded PID autopilot is designed, which adaptively gives attention to position and speed requirements as a function of their errors. Its parameters are found from an optimization problem solved using the PSO algorithm. Second, this controller’s performance is improved by adding the Complementary Controller employing an ANN. 5. Training data for the ANN is created by solving optimal control problems. The ANN is activated when the swing angle constraint is about to be violated. It is trained using optimal control values corresponding to the cases where the swing angle falls in a particular band about the upper swing angle constraint. Simulations are performed in a MATLAB environment. Finally, some of the simulation results are validated on a physical system.