An evolutionary trajectory planning algorithm for multi-UAV-assisted MEC system

Bird's Eye View feature selection for high-dimensional data

In machine learning, an informative dataset is crucial for accurate predictions. However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. To tackle this challenge, the Bird's Eye View (BEV) feature selection technique is introduced. This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. The proposed strategy in this paper leads to improved classification performance and a reduced number of features compared to conventional methods, as demonstrated by outperforming state-of-the-art feature selection techniques across multiple benchmark datasets.

Location and Time Aware Multitask Allocation in Mobile Crowd-Sensing Based on Genetic Algorithm

Mobile crowd-sensing (MCS) is a well-known paradigm used for obtaining sensed data by using sensors found in smart devices. With the rise of more sensing tasks and workers in the MCS system, it is now essential to design an efficient approach for task allocation. Moreover, to ensure the completion of the tasks, it is necessary to incentivise the workers by rewarding them for participating in performing the sensing tasks. In this paper, we aim to assist workers in selecting multiple tasks while considering the time constraint of the worker and the requirements of the task. Furthermore, a pricing mechanism is adopted to determine each task budget, which is then used to determine the payment for the workers based on their willingness factor. This paper proves that the task-allocation is a non-deterministic polynomial (NP)-complete problem, which is difficult to solve by conventional optimization techniques. A worker multitask allocation-genetic algorithm (WMTA-GA) is proposed to solve this problem to maximize the workers welfare. Finally, theoretical analysis demonstrates the effectiveness of the proposed WMTA-GA. We observed that it performs better than the state-of-the-art algorithms in terms of average performance, workers welfare, and the number of assigned tasks.