Topological Mapping Through Distributed, Passive Sensors

Abstract

In this paper we address the problem of inferring the topology, or inter-node navigability, of a sensor network given non-discriminating observations of activity in the environment. By exploiting motion present in the environment, our approach is able to recover a probabilistic model of the sensor network connectivity graph and the underlying traffic trends. We employ a reasoning system made up of a stochastic Expectation Maximization algorithm and a higher level search strategy employing the principle of Occam's Razor to look for the simplest solution explaining the data. The technique is assessed through numerical simulations and experiments conducted on a real sensor network. URL: https://www.cim.mcgill.ca/~mrl/pubs/dmarinak/ijcai07.pdf

Cite

Text

Marinakis and Dudek. "Topological Mapping Through Distributed, Passive Sensors." International Joint Conference on Artificial Intelligence, 2007.

Markdown

[Marinakis and Dudek. "Topological Mapping Through Distributed, Passive Sensors." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/marinakis2007ijcai-topological/)

BibTeX

@inproceedings{marinakis2007ijcai-topological,
  title     = {{Topological Mapping Through Distributed, Passive Sensors}},
  author    = {Marinakis, Dimitri and Dudek, Gregory},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2007},
  pages     = {2147-2152},
  url       = {https://mlanthology.org/ijcai/2007/marinakis2007ijcai-topological/}
}