🤖 AI Summary
This work addresses the optimal deployment of underwater sensors for two-dimensional barrier coverage, aiming to maximize the detection probability of vessels traversing a surveillance region whose trajectories follow a Log-Gaussian Cox Line Process (LGCLP). To tackle the inherent complexity of optimizing over random line processes, we propose a novel line-to-point transformation framework that maps trajectory distributions into a transformed domain, thereby converting the geometric barrier coverage problem into a tractable and scalable optimization of a probabilistic detection function. Leveraging AIS historical trajectory data, we design a data-driven numerical algorithm to compute near-optimal sensor placements. Experimental evaluation on real maritime datasets demonstrates that our approach achieves a barrier-wide detection probability of 98.3%, significantly outperforming conventional grid-based and greedy deployment strategies.
📝 Abstract
This paper addresses the deployment of sensors for a 2-D barrier coverage system. The challenge is to compute near-optimal sensor placements for detecting targets whose trajectories follow a log-Gaussian Cox line process. We explore sensor deployment in a transformed space, where linear target trajectories are represented as points. While this space simplifies handling the line process, the spatial functions representing sensor performance (i.e. probability of detection) become less intuitive. To illustrate our approach, we focus on positioning sensors of the barrier coverage system on the seafloor to detect passing ships. Through numerical experiments using historical ship data, we compute sensor locations that maximize the probability all ship passing over the barrier coverage system are detected.