A decomposition-based dynamic constrained multi-objective task assignment for heterogeneous crowdsensing

doi:10.1016/j.swevo.2024.101788

Return

A decomposition-based dynamic constrained multi-objective task assignment for heterogeneous crowdsensing

2025-02-01

PRE

DOI：10.1016/j.swevo.2024.101788

Original

Original request for help

Save

Abstract

En 中文

Efficient task allocation is a crucial issue of Mobile crowdsensing (MCS). Generally, only homogeneous mobile users like human are selected as the participants, causing a difficulty to meet the spatiotemporal coverage demand on human-unreachable regions. To overcome this drawback, unmanned aerial vehicles are introduced to form heterogeneous MCS, which can be formulated into a dynamic constrained multi-objective task allocation model. Taking the maximum average sensing quality of all tasks and the maximum average remaining budget for each subtask as the optimization objectives, an improved decomposition-based multi- objective evolutionary algorithm is presented to find the optimal allocation scheme. Specifically, the problem is first decomposed into a set of dynamic constrained scalar subproblems. For each subproblem, a stochastic configuration network (SCN)-based initialization is developed to produce the promising population, in which SCNs learn the probabilities of mobile users being allocated to each task. Following that, a reinforcement learning-based autonomous evolutionary strategy is adopted to recommend the most appropriate solvers in terms of the state of current population. A hybrid population update mechanism is then employed to form the high-quality offspring, with the purpose of balancing the feasibility, convergence and diversity. The extensive experiments on 20 dynamic instances are conducted to demonstrate the effectiveness of proposed algorithm compared to other task allocation algorithms.

Keywords:

Heterogeneous mobile crowdsensing

Task assignment

Dynamic optimization

Constrained multi-objective optimization