Sciweavers

5 search results - page 1 / 1
» A coverage algorithm for a class of non-convex regions
Sort
View
CDC
2008
IEEE
215views Control Systems» more  CDC 2008»
13 years 10 months ago
A coverage algorithm for a class of non-convex regions
— The paper describes a framework for solving the coverage problem for a class of non-convex domains. In [1] we have shown how a diffeomorphism can be used to transform a non-con...
Carlos H. Caicedo-Nunez, Milos Zefran
AHSWN
2006
148views more  AHSWN 2006»
13 years 4 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
DCOSS
2009
Springer
13 years 11 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
CVIU
2006
168views more  CVIU 2006»
13 years 4 months ago
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant ...
Ugur Murat Erdem, Stan Sclaroff
HYBRID
2009
Springer
13 years 11 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...