Coordinate-Free Coverage In Sensor Networks With Controlled Boundaries Via Homology  

Oleh:

[s.n]

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: The International Journal of Robotics Research vol. 25 no. 12 (Dec. 2006), page 1205-1222.
Topik: sensor networks; coverage; multi-agent autonomous systems; homology; pursuit-evasion
Fulltext: 1205.pdf (1.1MB)

Isi artikel

Tools from computational homology are introduced to verify coverage in an idealized sensor network. These methods are unique in that, while they are coordinate-free and assume no localization or orientation capabilities for the nodes, there are also no probabilistic assumptions. The key ingredient is the theory of homology from algebraic topology. The robustness of these tools is demonstrated by adapting them to a variety of settings, including static planar coverage, 3-D barrier coverage, and time-dependent sweeping coverage. Results are also given on hole repair, error tolerance, optimal coverage, and variable radii. An overview of implementation is given.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali