scholarly journals Efficient task assignment in spatial crowdsourcing with worker and task privacy protection

2017 ◽  
Vol 22 (2) ◽  
pp. 335-362 ◽  
Author(s):  
An Liu ◽  
Weiqi Wang ◽  
Shuo Shang ◽  
Qing Li ◽  
Xiangliang Zhang
2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Shengxiang Wang ◽  
Xiaofan Jia ◽  
Qianqian Sang

Spatial crowdsourcing assigns location-related tasks to a group of workers (people equipped with smart devices and willing to complete the tasks), who complete the tasks according to their scope of work. Since space crowdsourcing usually requires workers’ location information to be uploaded to the crowdsourcing server, it inevitably causes the privacy disclosure of workers. At the same time, it is difficult to allocate tasks effectively in space crowdsourcing. Therefore, in order to improve the task allocation efficiency of spatial crowdsourcing in the case of large task quantity and improve the degree of privacy protection for workers, a new algorithm is proposed in this paper, which can improve the efficiency of task allocation by disturbing the location of workers and task requesters through k-anonymity. Experiments show that the algorithm can improve the efficiency of task allocation effectively, reduce the task waiting time, improve the privacy of workers and task location, and improve the efficiency of space crowdsourcing service when facing a large quantity of tasks.


2021 ◽  
Author(s):  
Zhigang Jia ◽  
Weiwei Zhao ◽  
Jie Luo ◽  
Yang Chen ◽  
ChangJing Xu

2018 ◽  
Vol 10 (2) ◽  
pp. 18-25 ◽  
Author(s):  
Yongxin Tong ◽  
Zimu Zhou

2020 ◽  
Vol 2 (4) ◽  
pp. Manuscript
Author(s):  
D.A. Nguyen ◽  
Long Le Ngoc Bao

This paper proposes a heuristic approach named A* algorithm to find shortest route for Inter-Terminal Transport Monorail System (ITT system) that are being applied in Busan Port (Korea). In every transport system, vehicle routing and task assignment are significant problems that affects strongly the overall system’s efficiency, especially the travel cost and the time taking. The proposed ITT system will use shuttles to carry containers along a monorail that links the internal terminals. A* algorithm is used to guide the shuttles in a shortest way automatically from a known loading position to a designated unloading one. In the first part of the paper, we will describe briefly about the ITT system that being considered in Korea. Next, we will explain why and how we implement A* algorithm in dispatching. Finally, we will give some comparisons between performances of new ITT system and traditional transport system through simulation in MATLAB.


2018 ◽  
Vol 9 (3) ◽  
pp. 1-26 ◽  
Author(s):  
Luan Tran ◽  
Hien To ◽  
Liyue Fan ◽  
Cyrus Shahabi

Author(s):  
Zhao Liu ◽  
Kenli Li ◽  
Xu Zhou ◽  
Ningbo Zhu ◽  
Yunjun Gao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document