TY - GEN
T1 - Detecting and tracking level sets of scalar fields using a robotic sensor network
AU - Dantu, Karthik
AU - Sukhatme, Gaurav S.
PY - 2007
Y1 - 2007
N2 - We introduce an algorithm which detects and traces a specified level set of a scalar field (a contour) on a plane. A network of static sensor nodes with limited communication and processing are deployed in a planar environment along with a mobile node which can both sense and move. As the mobile node moves through the environment, it computes the local spatial gradient of the field by communicating with its immediate neighbors in the static sensor network. The algorithm causes the mobile node to perform gradient descent on the scalar field till it arrives at a location on the desired contour. From this point onwards, the algorithm drives the mobile node to trace the desired contour without departing from it Experiments in simulation indicate that the required contour is found with reasonable accuracy (between 80-90%) for networks with node degree of greater than or equal to six. Our results also indicate that the paths generated by our algorithm are near-optimal in terms of the distance traversed by the mobile node. Our preliminary experimental results with a physical robot show that our algorithm is feasible.
AB - We introduce an algorithm which detects and traces a specified level set of a scalar field (a contour) on a plane. A network of static sensor nodes with limited communication and processing are deployed in a planar environment along with a mobile node which can both sense and move. As the mobile node moves through the environment, it computes the local spatial gradient of the field by communicating with its immediate neighbors in the static sensor network. The algorithm causes the mobile node to perform gradient descent on the scalar field till it arrives at a location on the desired contour. From this point onwards, the algorithm drives the mobile node to trace the desired contour without departing from it Experiments in simulation indicate that the required contour is found with reasonable accuracy (between 80-90%) for networks with node degree of greater than or equal to six. Our results also indicate that the paths generated by our algorithm are near-optimal in terms of the distance traversed by the mobile node. Our preliminary experimental results with a physical robot show that our algorithm is feasible.
UR - https://www.scopus.com/pages/publications/36348935179
U2 - 10.1109/ROBOT.2007.364040
DO - 10.1109/ROBOT.2007.364040
M3 - Conference contribution
SN - 1424406021
SN - 9781424406029
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 3665
EP - 3672
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 -