A trust-based sensor allocation algorithm in cooperative space search problems

Dan Shen; Genshe Chen; Khanh Pham; Erik Blasch

doi:10.1117/12.882904

20 May 2011 A trust-based sensor allocation algorithm in cooperative space search problems

Dan Shen, Genshe Chen, Khanh Pham, Erik Blasch

Proceedings Volume 8044, Sensors and Systems for Space Applications IV; 80440C (2011) https://doi.org/10.1117/12.882904
Event: SPIE Defense, Security, and Sensing, 2011, Orlando, Florida, United States

Abstract

Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

Citation Download Citation

Dan Shen, Genshe Chen, Khanh Pham, and Erik Blasch "A trust-based sensor allocation algorithm in cooperative space search problems", Proc. SPIE 8044, Sensors and Systems for Space Applications IV, 80440C (20 May 2011); https://doi.org/10.1117/12.882904

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available