scholarly journals Efficient Path Planning and Truthful Incentive Mechanism Design for Mobile Crowdsensing

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4408 ◽  
Author(s):  
Xi Tao ◽  
Wei Song
Keyword(s):  
Path Planning ◽  
Mechanism Design ◽  
Heuristic Algorithm ◽  
Incentive Mechanism ◽  
Optimal Solution ◽  
Planning Problem ◽  
Vcg Mechanism ◽  
The Incentive Mechanism ◽  
Incentive Mechanism Design ◽  
Path Planning Problem

Mobile crowdsensing (MCS) is a promising paradigm for large-scale sensing. A group of users are recruited as workers to accomplish various sensing tasks and provide data to the platform and requesters. A key problem in MCS is to design the incentive mechanism, which can attract enough workers to participate in sensing activities and maintain the truthfulness. As the main advantage of MCS, user mobility is a factor that must be considered. We make an attempt to build a technical framework for MCS, which is associated with a truthful incentive mechanism taking the movements of numerous workers into account. Our proposed framework contains two challenging problems: path planning and incentive mechanism design. In the path planning problem, every worker independently plans a tour to carry out the posted tasks according to its own strategy. A heuristic algorithm is proposed for the path planning problem, which is compared with two baseline algorithms and the optimal solution. In the incentive mechanism design, the platform develops a truthful mechanism to select the winners and determine their payments. The proposed mechanism is proved to be computationally efficient, individually rational, and truthful. In order to evaluate the performance of our proposed mechanism, the well-known Vickrey–Clarke–Groves (VCG) mechanism is considered as a baseline. Simulations are conducted to evaluate the performance of our proposed framework. The results show that the proposed heuristic algorithm for the path planning problem outperforms the baseline algorithms and approaches the optimal solution. Meanwhile, the proposed mechanism holds a smaller total payment compared with the VCG mechanism when both mechanisms achieve the same performance. Finally, the utility of a selected winner shows the truthfulness of proposed mechanism by changing its bid.

scholarly journals THE ANALYSIS ON THE POLICY OF ACCESS TO ECONOMICALLY AFFORDABLE HOUSING IN CHINA: AN AREA CALCULATION MODEL BASED ON THE INCENTIVE MECHANISM DESIGN / GALIMYBIŲ GAUTI ĮPERKAMĄ BŪSTĄ KINIJOJE POLITIKOS ANALIZĖ: PLOTO SKAIČIAVIMO MODELIS, PAGRĮSTAS SKATINAMO

2011 ◽  
Vol 15 (3) ◽  
pp. 231-256 ◽  
Author(s):  
Jiankun Zhang ◽  
Jingfeng Yuan ◽  
Mirosław J. Skibniewski
Keyword(s):  
Mechanism Design ◽  
Affordable Housing ◽  
Social Housing ◽  
Incentive Mechanism ◽  
Calculation Model ◽  
Beijing City ◽  
Model Based ◽  
Economically Affordable Housing ◽  
The Incentive Mechanism ◽  
Incentive Mechanism Design

Currently, the subject of housing in China is of great interest to many researchers, since improvements in living conditions for the largest population in the world have not kept pace with the territory's economic growth. This paper describes basic social housing situations in China, and assesses the inequality in housing reform since 1990s as a result of overall economic improvement. In order to reduce the degree of inequality in China's social housing, this paper is focusing on the policy management of access to economically affordable housing because housing affordability in China is a pressing social and economic issue, particularly for low-income families due to an unreasonable mechanism. The related policies are analyzed in is paper by using incentive mechanism design, which reveals that supervision and announcement system, the restriction in current mechanism, and the area of economically affordable house are critical for the effectiveness of present polices. Furthermore, a housing area calculation model based on the incentive mechanism design is presented and an illustrated case of Beijing City is also conducted, which can maximize the utility of government considering incentive compatibility. Finally, some policy suggestions are explored including enhancing external environment and establishing internal mechanism. Santrauka Būsto tema Kinijoje šiuo metu itin domina daug mokslininkų, nes šalyje, kuri turi daugiausia gyventojų pasaulyje, gyvenimo sąlygų gerėjimas atsiliko nuo šalies ekonominio augimo. Šiame darbe nusakoma bazinio socialinio būsto padėtis Kinijoje ir vertinamas XX a. 10-ajame dešimtmetyje dėl bendros ūkio padėties gerėjimo prasidėjusios būsto reformos netolygumas. Siekiant mažinti Kinijos socialinio būsto skirtumų lygį, šiame darbe daugiausia dėmesio skiriama politinėms priemonėms, kurias pasitelkus valdoma prieiga prie įperkamo būsto, nes dėl neracionalaus mechanizmo būsto įperkamumas Kinijoje yra neatidėliotina socialinė ir ekonominė problema, o ypač mažas pajamas gaunančioms šeimoms. Atitinkamos politikos kryptys šiame darbe nagrinėjamos pasitelkus skatinamojo mechanizmo projektavimą, kuris rodo, kad priežiūros ir praneši-mų sistema, dabartinio mechanizmo suvaržymas ir įperkamo būsto plotas turi lemiamą reikšmę dabartinių politikos krypčių veiksmingumui. Be to, pateikiamas skatinamojo mechanizmo projektavimu pagristas būsto ploto skaičiavimo modelis ir atliekamas Pekino atvejo tyrimas, kuris, atsižvelgiant į skatinamųjų priemonių suderinamumą, gali maksimaliai padidinti vyriausybės naudingumą. Pabaigoje nagrinėjami keli politiniai siūlymai, įskaitant išorinės aplinkos gerinimą ir vidinio mechanizmo sukūrimą.

scholarly journals An Improved Heuristic Algorithm for UCAV Path Planning

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Kun Zhang ◽  
Peipei Liu ◽  
Weiren Kong ◽  
Jie Zou ◽  
Min Liu
Keyword(s):  
Mathematical Model ◽  
Path Planning ◽  
Heuristic Algorithm ◽  
Task Demands ◽  
Planning Problem ◽  
Aerial Vehicle ◽  
Constrained Conditions ◽  
Path Planning Problem ◽  
And Task

The study of unmanned combat aerial vehicle (UCAV) path planning is increasingly important in military and civil field. This paper presents a new mathematical model and an improved heuristic algorithm based on Sparse A⁎ Search (SAS) for UCAV path planning problem. In this paper, flight constrained conditions will be considered to meet the flight restrictions and task demands. With three simulations, the impacts of the model on the algorithms will be investigated, and the effectiveness and the advantages of the model and algorithm will be validated.

Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach

2015 ◽  
Vol 21 (4) ◽  
pp. 949-964 ◽  
Author(s):  
Alejandro Hidalgo-Paniagua ◽  
Miguel A. Vega-Rodríguez ◽  
Joaquín Ferruz ◽  
Nieves Pavón
Keyword(s):  
Path Planning ◽  
Mobile Robotics ◽  
Planning Problem ◽  
Multi Objective ◽  
Path Planning Problem

Collision-Free Motion Planning for an Aligned Multiple-turret System Operating in Extreme Environment

Robotica ◽  
2021 ◽  
pp. 1-30
Author(s):  
Ümit Yerlikaya ◽  
R.Tuna Balkan
Keyword(s):  
Path Planning ◽  
Extreme Environment ◽  
Configuration Spaces ◽  
Planning Problem ◽  
Different Types ◽  
Planning Algorithm ◽  
Line Path ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
System Operating

Abstract Instead of using the tedious process of manual positioning, an off-line path planning algorithm has been developed for military turrets to improve their accuracy and efficiency. In the scope of this research, an algorithm is proposed to search a path in three different types of configuration spaces which are rectangular-, circular-, and torus-shaped by providing three converging options named as fast, medium, and optimum depending on the application. With the help of the proposed algorithm, 4-dimensional (D) path planning problem was realized as 2-D + 2-D by using six sequences and their options. The results obtained were simulated and no collision was observed between any bodies in these three options.

Path Planning for Spheres in Three Dimensional Environments With Low Interference Index

1994 ◽  
Author(s):  
Duane W. Storti ◽  
Debasish Dutta
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Configuration Space ◽  
Local Knowledge ◽  
Three Dimensional ◽  
Target Point ◽  
Planning Problem ◽  
Spherical Object ◽  
Starting Point ◽  
Path Planning Problem

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.

Sign in / Sign up

Export Citation Format

Share Document