Discrete particle swarm optimization algorithm for solving optimal sensor deployment problem | Zendy

Milan R. Rapaić | Zendy; Željko Kanović | Zendy; Zoran D. Jeličić | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Discrete particle swarm optimization algorithm for solving optimal sensor deployment problem

Author(s) -

Milan R. Rapaić,

Željko Kanović,

Zoran D. Jeličić

Publication year - 2008

Publication title -

journal of automatic control

Language(s) - English

Resource type - Journals

eISSN - 2406-0984

pISSN - 1450-9903

DOI - 10.2298/jac0801009r

Subject(s) - computer science , mathematical optimization , software deployment , particle swarm optimization , minification , integer programming , metaheuristic , combinatorial optimization , swarm behaviour , discrete space , algorithm , mathematics , artificial intelligence , mathematical analysis , operating system

This paper addresses the Optimal Sensor Deployment Problem (OSDP). The goal is to maximize the probability of target detection, with simultaneous cost minimization. The problem is solved by the Discrete PSO (DPSO) algorithm, a novel modification of the PSO algorithm, originally presented in the current paper. DPSO is general-purpose optimizer well suited for conducting search within a discrete search space. Its applicability is not limited to OSDP, it can be used to solve any combinatorial and integer programming problem. The effectiveness of the DPSO in solving OSDP was demonstrated on several examples

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research