Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Rapaić et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: