Comparison of optimization algorithms in the sensor selection for predictive target tracking Articles uri icon

publication date

  • September 2014

start page

  • 182

end page

  • 192

volume

  • 20

International Standard Serial Number (ISSN)

  • 1570-8705

Electronic International Standard Serial Number (EISSN)

  • 1570-8713

abstract

  • This paper addresses the selection of sensors for target localization and tracking under nonlinear and nonGaussian dynamic conditions. We have used the Posterior Cramer-Rao lower Bound (PCRB) as the performance-based optimization criteria because of its built-in capability to produce online estimation performance predictions, a "must" for high maneuverable targets or when slow-response sensors are used. In this paper, we analyze, and compare, three optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and a new discrete-variant of the cuckoo search algorithm (CS). Finally, we propose local-search versions of the previous optimization algorithms that provide a significant reduction of the computation time. (C) 2014 Elsevier B.V. All rights reserved.

keywords

  • combinatorial optimization; wireless sensor network; target localization; networks; clutter; models