scholarly journals On-Demanding Information Acquisition in Multi-UAV-Assisted Sensor Network: A Satisfaction-Driven Perspective

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Hua Yang ◽  
Jungang Yang ◽  
Wendong Zhao ◽  
Cuntao Liu

When multiple heterogeneous unmanned aerial vehicles (UAVs) provide service for multiple users in sensor networks, users’ diverse priorities and corresponding priority-related satisfaction are rarely concerned in traditional task assignment algorithms. A priority-driven user satisfaction model is proposed, in which a piecewise function considering soft time window and users’ different priority levels is designed to describe the relationship between user priority and user satisfaction. On this basis, the multi-UAV task assignment problem is formulated as a combinatorial optimization problem with multiple constraints, where the objective is maximizing the priority-weighted satisfaction of users while minimizing the total energy consumption of UAVs. A multipopulation-based cooperation genetic algorithm (MPCGA) by adapting the idea of “exploration-exploitation” into traditional genetic algorithms (GAs) is proposed, which can solve the task assignment problem in polynomial time. Simulation results show that compared with the algorithm without considering users’ priority-based satisfaction, users’ weighted satisfaction can be improved by about 47% based on our algorithm in situations where users’ information acquisition is tight time-window constraints. In comparison, UAVs’ energy consumption only increased by about 6%. Besides, compared with traditional GA, our proposed algorithm can also improve users’ weighted satisfaction by about 5% with almost the same energy consumption of UAVs.

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 74542-74557 ◽  
Author(s):  
Moning Zhu ◽  
Xiaoxia Du ◽  
Xuehua Zhang ◽  
He Luo ◽  
Guoqiang Wang

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 734 ◽  
Author(s):  
Hao-Xiang Chen ◽  
Ying Nan ◽  
Yi Yang

This paper considers a reconnaissance task assignment problem for multiple unmanned aerial vehicles (UAVs) with different sensor capacities. A modified Multi-Objective Symbiotic Organisms Search algorithm (MOSOS) is adopted to optimize UAVs’ task sequence. A time-window based task model is built for heterogeneous targets. Then, the basic task assignment problem is formulated as a Multiple Time-Window based Dubins Travelling Salesmen Problem (MTWDTSP). Double-chain encoding rules and several criteria are established for the task assignment problem under logical and physical constraints. Pareto dominance determination and global adaptive scaling factors is introduced to improve the performance of original MOSOS. Numerical simulation and Monte-Carlo simulation results for the task assignment problem are also presented in this paper, whereas comparisons with non-dominated sorting genetic algorithm (NSGA-II) and original MOSOS are made to verify the superiority of the proposed method. The simulation results demonstrate that modified SOS outperforms the original MOSOS and NSGA-II in terms of optimality and efficiency of the assignment results in MTWDTSP.


Author(s):  
Youssef Hami ◽  
Chakir Loqman

This research is an optimal allocation of tasks to processors in order to minimize the total costs of execution and communication. This problem is called the Task Assignment Problem (TAP) with nonuniform communication costs. To solve the latter, the first step concerns the formulation of the problem by an equivalent zero-one quadratic program with a convex objective function using a convexification technique, based on the smallest eigenvalue. The second step concerns the application of the Continuous Hopfield Network (CHN) to solve the obtained problem. The calculation results are presented for the instances from the literature, compared to solutions obtained both the CPLEX solver and by the heuristic genetic algorithm, and show an improvement in the results obtained by applying only the CHN algorithm. We can see that the proposed approach evaluates the efficiency of the theoretical results and achieves the optimal solutions in a short calculation time.


Author(s):  
Subhadarshini Mohanty ◽  
Prashant Kumar Patra ◽  
Subasish Mohapatra

Load balancing is one of the major issue in cloud computing. Load balancing helps in achieving maximum resource utilization and user satisfaction. This mechanism transparently transfer load from heavily loaded process to under loaded process. In this paper we have proposed a hybrid technique for solving task assignment problem in cloud platform. PSO based heuristic has been developed to schedule random task in heterogeneous data centres. Here we have also used variants of Particle Swarm Optimization(PSO) which gives better result than PSO and other heuristics for load balancing in cloud computing environment.


Sign in / Sign up

Export Citation Format

Share Document