20 May 2011 A trust-based sensor allocation algorithm in cooperative space search problems
Author Affiliations +
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dan Shen, Dan Shen, Genshe Chen, Genshe Chen, Khanh Pham, Khanh Pham, Erik Blasch, 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); doi: 10.1117/12.882904; https://doi.org/10.1117/12.882904
PROCEEDINGS
9 PAGES


SHARE
Back to Top