156 search results - page 11 / 32 » Decomposing Coverings and the Planar Sensor Cover Problem |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Knowledge of the driving environment is essential for robotic vehicles to comply with traffic rules while autonomously traversing intersections. However, due to limite...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
TPDS
2008
13 years 7 months ago
2008
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...