Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Towards a general theory of topological maps
Artificial Intelligence
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Probabilistic self-localization for sensor networks
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Learning topological maps with weak local odometric information
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Tracking many objects with many sensors
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Topological mapping through distributed, passive sensors
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bridging the gaps between cameras
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Nonparametric belief propagation for self-localization of sensor networks
IEEE Journal on Selected Areas in Communications
A distributed topological camera network representation for tracking applications
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Hi-index | 0.00 |
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this problem, our technique operates on timestamp freeobservational data; i.e.no timing information is exploited by our algorithm except the ordering. We first give a theoretical analysis of this version of the problem, and then we show that by considering a sliding window over the observations, the problem can be re-formulated as a version of set-covering. We present two heuristics based on this set-covering formulation and evaluate them with numerical simulations. The experiments demonstrate that promising results can be obtained using a greedy algorithm.