TY - GEN
T1 - Adaptive embedded roadmaps for sensor networks
AU - Alankus, Gazihan
AU - Atay, Nuzhet
AU - Lu, Chenyang
AU - Bayazit, O. Burchan
PY - 2007
Y1 - 2007
N2 - In this paper, we propose a new approach to wireless sensor network assisted navigation while avoiding moving dangers. Our approach relies on an embedded roadmap in the sensor network that always contains safe paths. The roadmap is adaptive, i.e., it adapts its topology to changing dangers. Mobile robots in the environment use the roadmap to reach their destinations. We evaluated the performance of embedded roadmap both in simulations using realistic conditions and with real hardware. Our results show that the proposed navigation algorithm is better suited for sensor networks than traditional navigation field based algorithms. Our observations suggest that there are two drawbacks of traditional navigation field based algorithms, (i) increased power consumption, (ii) message congestion that can prevent important danger avoidance messages to be received by the robots. In contrast, our approach significantly reduces the number of messages on the network (up to 160 times in some scenarios) while increasing the navigation performance.
AB - In this paper, we propose a new approach to wireless sensor network assisted navigation while avoiding moving dangers. Our approach relies on an embedded roadmap in the sensor network that always contains safe paths. The roadmap is adaptive, i.e., it adapts its topology to changing dangers. Mobile robots in the environment use the roadmap to reach their destinations. We evaluated the performance of embedded roadmap both in simulations using realistic conditions and with real hardware. Our results show that the proposed navigation algorithm is better suited for sensor networks than traditional navigation field based algorithms. Our observations suggest that there are two drawbacks of traditional navigation field based algorithms, (i) increased power consumption, (ii) message congestion that can prevent important danger avoidance messages to be received by the robots. In contrast, our approach significantly reduces the number of messages on the network (up to 160 times in some scenarios) while increasing the navigation performance.
UR - https://www.scopus.com/pages/publications/36349004269
U2 - 10.1109/ROBOT.2007.364037
DO - 10.1109/ROBOT.2007.364037
M3 - Conference contribution
AN - SCOPUS:36349004269
SN - 1424406021
SN - 9781424406029
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 3645
EP - 3652
BT - 2007 IEEE International Conference on Robotics and Automation, ICRA'07
T2 - 2007 IEEE International Conference on Robotics and Automation, ICRA'07
Y2 - 10 April 2007 through 14 April 2007
ER -