相关论文: Covering a line segment with variable radius discs

Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \cite{Li09}. In this paper we have proposed an {\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed…

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks,…

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of…

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the sides…

A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given $n$ objects that need to be tracked, each following its own trajectory, and $m$ stationary traffic control stations,…

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

In this paper, we consider a facility location problem to find a minimum-sum coverage of n points by disks centered at a fixed line. The cost of a disk with radius r has a form of a non-decreasing function f(r) = r^a for any a >= 1. The…

This paper regards the problem of optimally placing unreliable sensors in a one-dimensional environment. We assume that sensors can fail with a certain probability and we minimize the expected maximum distance from any point in the…

A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…

In aerial visual area coverage missions, the camera footprint changes over time based on the camera position and orientation -- a fact that complicates the whole process of coverage and path planning. This article proposes a solution to the…

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited…

We investigate the problem of using mobile robots equipped with 2D range sensors to optimally guard perimeters or regions, i.e., 1D or 2D sets. Given such a set of arbitrary shape to be guarded, and $k$ mobile sensors where the $i$-th…

We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper…

Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical overlaps with other rows indicate set intersections and their…

Although monitoring and covering are fundamental goals of a wireless sensor network (WSN), the accidental death of sensors or the running out of their energy would result in holes in the WSN. Such holes have the potential to disrupt the…

We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…

One of the fundamental issue in wireless sensor network is conserving energy and thus extending the lifetime of the network. In this paper we investigate the coverage problem in camera sensor networks by developing two algorithms which…

Network partitioning has gained recent attention as a pathway to enable decentralized operation and control in large-scale systems. This paper addresses the interplay between partitioning, observability, and sensor placement (SP) in dynamic…

Optimization problems with drones are widely studied in a variety of civilian tasks, mainly due to their ability to traverse rough terrains and to carry cameras and other sensors for surveillance tasks. The limited battery life of these…

We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by…