scholarly journals Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 225 ◽  
Author(s):  
Xianghua Xu ◽  
Chengwei Zhao ◽  
Tingcong Ye ◽  
Tao Gu

Perimeter barriers can provide intrusion detection for a closed area. It is efficient for practical applications, such as coastal shoreline monitoring and international boundary surveillance. Perimeter barrier coverage construction in some regions of interest with irregular boundaries can be represented by its minimum circumcircle and every point on the perimeter can be covered. This paper studies circle barrier coverage in Bistatic Radar Sensor Network (BRSN) which encircles a region of interest. To improve the coverage quality, it is required to construct a circle barrier with a predefined width. Firstly, we consider a BR deployment problem to constructing a single BR circular barrier with minimum threshold of detectability. We study the optimized BR placement patterns on the single circular ring. Then the unit costs of the BR sensor are taken into account to derive the minimum cost placement sequence. Secondly, we further consider a circular BR barrier with a predefined width, which is wider than the breadth of Cassini oval sensing area with minimum threshold of detectability. We propose two segment strategies to efficiently divide a circular barrier to several adjacent sub-ring with some appropriate width: Circular equipartition strategy and an adaptive segmentation strategy. Finally, we propose approximate optimization placement algorithms for minimum cost placement of BR sensor for circular barrier coverage with required width and detection threshold. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.

2016 ◽  
Vol 65 (2) ◽  
pp. 577-588 ◽  
Author(s):  
Bang Wang ◽  
Jiaoyan Chen ◽  
Wenyu Liu ◽  
Laurence T. Yang

2019 ◽  
Vol 23 (2) ◽  
pp. 1361-1380
Author(s):  
Xianghua Xu ◽  
Chengwei Zhao ◽  
Zichen Jiang ◽  
Zongmao Cheng ◽  
Jinjun Chen

2016 ◽  
Vol 24 (1) ◽  
pp. 259-271 ◽  
Author(s):  
Xiaowen Gong ◽  
Junshan Zhang ◽  
Douglas Cochran ◽  
Kai Xing

2020 ◽  
Vol 20 (3) ◽  
pp. 1-23
Author(s):  
Jiaoyan Chen ◽  
Laurence T. Yang ◽  
Xianjun Deng ◽  
Xianggong Hong ◽  
Lingzhi Yi

2016 ◽  
Vol 2016 ◽  
pp. 1-21 ◽  
Author(s):  
Xiang Zou ◽  
Peng Cheng ◽  
Bang An ◽  
Jingyan Song

Current airspace is sectorized according to some predefined rules that are not flexible. To facilitate utilizing the airspace more efficiently, methods to design sectors need to be promoted. In this paper, we propose an undirected graph cut-based approach that employs a memetic local search-embedded constrained evolution algorithm, NSGA-II, to generate nondominated airspace configurations. We also propose a new concave hull-based method to automatically depict sector boundaries. In addition, we also study the configuration transition problem. We define the similarity of the two different configurations and calculate their similarity with a bisection diagram and a minimum cost flow algorithm. We build a forward network to represent configuration transitions across several consecutive time periods and use multiobjective dynamic programming to determine a series of nondominated configuration links from the first period to the end. We test our approaches by simulation in high-altitude airspace controlled by Beijing Area Control Center. The results show that our sectorization method outperforms the current configuration in practice, providing a lower sector number, lower intersector flow, more balanced workload distribution among the different sectors, and no constraint violations, so that the proposed approach shows its significant potential as practical applications for dynamic airspace configuration.


Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 1994 ◽  
Author(s):  
Guibin Sun ◽  
Rui Zhou ◽  
Bin Di ◽  
Zhuoning Dong ◽  
Yingxun Wang

In this paper, a multi-robot persistent coverage of the region of interest is considered, where persistent coverage and cooperative coverage are addressed simultaneously. Previous works have mainly concentrated on the paths that allow for repeated coverage, but ignored the coverage period requirements of each sub-region. In contrast, this paper presents a combinatorial approach for path planning, which aims to cover mission domains with different task periods while guaranteeing both obstacle avoidance and minimizing the number of robots used. The algorithm first deploys the sensors in the region to satisfy coverage requirements with minimum cost. Then it solves the travelling salesman problem to obtain the frame of the closed path. Finally, the approach partitions the closed path into the fewest segments under the coverage period constraints, and it generates the closed route for each robot on the basis of portioned segments of the closed path. Therefore, each robot can circumnavigate one closed route to cover the different task areas completely and persistently. The numerical simulations show that the proposed approach is feasible to implement the cooperative coverage in consideration of obstacles and coverage period constraints, and the number of robots used is also minimized.


Sign in / Sign up

Export Citation Format

Share Document