2019 IEEE 17th International Conference on Industrial Informatics (INDIN) 2019
DOI: 10.1109/indin41052.2019.8972176
|View full text |Cite
|
Sign up to set email alerts
|

An Availability Metric and Optimization Algorithms for Simultaneous Coverage of Targets and Areas by Wireless Visual Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

3
1

Authors

Journals

citations
Cited by 4 publications
(10 citation statements)
references
References 26 publications
0
10
0
Order By: Relevance
“…Table 1 summarizes the reviewed articles related to spatial coverage quality. We can notice some works as Li et al [38] and Costa et al [35] addressing both target and area coverage. Li et al [38] propose an area coverage quality formulation to deal with a target coverage application, while Costa et al [35] propose a evaluation of simultaneous target and area coverage applications, addressing quality through both target and area coverage rate.…”
Section: Evaluating the Spatial Coverage Objectivesmentioning
confidence: 98%
See 2 more Smart Citations
“…Table 1 summarizes the reviewed articles related to spatial coverage quality. We can notice some works as Li et al [38] and Costa et al [35] addressing both target and area coverage. Li et al [38] propose an area coverage quality formulation to deal with a target coverage application, while Costa et al [35] propose a evaluation of simultaneous target and area coverage applications, addressing quality through both target and area coverage rate.…”
Section: Evaluating the Spatial Coverage Objectivesmentioning
confidence: 98%
“…The paramount quality metric in target coverage applications is the achieved number of covered targets, which defines the coverage rate, i.e., the percentage of the covered targets among all the targets [31][32][33][34][35]. Target coverage is commonly stated in terms of k-coverage, requiring that each target must be covered by at least k visual nodes [36,37].…”
Section: Target Coveragementioning
confidence: 99%
See 1 more Smart Citation
“…In this case, each sensor node will be reorientated in order to compute the highest AQM . Actually, this is a simple way to improve the value of QoM, while keeping lower computational costs as compared with other approaches, although greedy algorithms may provide suboptimal results since they only evaluate local information [30]. The proposed Greedy approach is detailed in Algorithm 1.…”
Section: A Greedymentioning
confidence: 99%
“…The WVSN considered in this article is composed of a set of visual sensor nodes , which are deployed over a two-dimensional area . Each camera may assume different values for their parameters, however, without loss of generality, we consider in this work that all visual sensors are identical and so they are configured with the same values [ 21 ]. Each sensor is expected to be equipped with a camera, having a viewing angle and an orientation , as shown in Figure 1 , where the camera is represented by the small red circle.…”
Section: Definitions and Basic Conceptsmentioning
confidence: 99%