Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
