Sciweavers

156 search results - page 15 / 32
» Decomposing Coverings and the Planar Sensor Cover Problem
Sort
View
LCN
2005
IEEE
14 years 1 months ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
MOBICOM
2005
ACM
14 years 1 months ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora
ICRA
2009
IEEE
139views Robotics» more  ICRA 2009»
14 years 2 months ago
Laser-based navigation enhanced with 3D time-of-flight data
— Navigation and obstacle avoidance in robotics using planar laser scans has matured over the last decades. They basically enable robots to penetrate highly dynamic and populated...
Fang Yuan, Agnes Swadzba, Roland Philippsen, Orhan...
CDC
2010
IEEE
149views Control Systems» more  CDC 2010»
13 years 2 months ago
Nonuniform coverage and cartograms
In this paper, we investigate nonuniform coverage of a planar region by a network of autonomous, mobile agents. We derive centralized nonuniform coverage control laws from uniform ...
Francois Lekien, Naomi Ehrich Leonard