Dynamic time window based full-view coverage maximization in CSNs

Jingfang Su, Zeqing Li, Hongwei Du () and Shengxin Liu ()
Additional contact information
Jingfang Su: Harbin Institute of Technology (Shenzhen)
Zeqing Li: Harbin Institute of Technology (Shenzhen)
Hongwei Du: Harbin Institute of Technology (Shenzhen)
Shengxin Liu: Harbin Institute of Technology (Shenzhen)

Journal of Combinatorial Optimization, 2024, vol. 48, issue 5, No 6, 18 pages

Abstract: Abstract In order to maximize full-view coverage of moving targets in Camera Sensor Networks (CSNs), a novel method known as “group set cover” is presented in this research. Choosing the best camera angles and placements to accomplish full-view coverage of the moving targets is one of the main focuses of the research in CSNs. Discretize the target into multiple views of [0, 2 $$\pi $$ π ], use a set of views of targets to represent the sensing direction of the camera sensor, and use a group set of views of targets to represent the position of the camera sensor. The total number of targets in a dynamic time window that is visible in full view is calculated. A mixed integer linear programming formulation is employed, which is then approximated using a random rounding method. This approximation approach offers a global estimation of local optimality, particularly for non-submodular optimization problems. Two methods for maximizing overall full-view coverage within a dynamic time window are proposed TSC-FTC-DTW and FTC-TW-DTW. Finally, the proposed methods are verified through experiments.

Keywords: Camera sensor networks; Full-view coverage; Dynamic time windows; Group set cover (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01227-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:48:y:2024:i:5:d:10.1007_s10878-024-01227-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01227-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().