Autonomous data collection from underwater sensor networks using acoustic communication

We examine the problem of planning paths for an autonomous underwater vehicle (AUV) to collect data from an underwater sensor network. The sensors in the network are equipped with acoustic modems that provide noisy, range-limited communication. The AUV must plan a path that maximizes the information collected while minimizing travel time or fuel expenditure. This problem is closely related to the classical Traveling Salesperson Problem (TSP), but differs in that data from a particular sensor has a probability of being collected depending on the quality of communication. We propose methods for solving this problem by extending approximation algorithms for variants of TSP, and we compare our proposed algorithms to baseline strategies through simulated experiments with varying levels of communication quality. Our simulations utilize a realistic model of acoustic communication to determine the probability of acquiring data from each sensor. The results demonstrate that planning the tour for the entire network while exploiting the communication model during planning improves performance versus myopic methods.

[1]  Giorgio Ausiello,et al.  The online Prize-Collecting Traveling Salesman Problem , 2008, Inf. Process. Lett..

[2]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[3]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[4]  Teofilo F. Gonzalez.  Prize-Collecting Traveling Salesman and Related Problems , 2007 .

[5]  Geoffrey A. Hollinger,et al.  Distributed coordination and data fusion for underwater search , 2011, 2011 IEEE International Conference on Robotics and Automation.

[6]  Volkan Isler,et al.  Data gathering tours for mobile robots , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[8]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[9]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[10]  Urbashi Mitra,et al.  Effects of underwater communication constraints on the control of marine robot teams , 2009, 2009 Second International Conference on Robot Communication and Coordination.

[11]  Milica Stojanovic,et al.  On the relationship between capacity and distance in an underwater acoustic communication channel , 2007, MOCO.

[12]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[13]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[14]  Gaurav S. Sukhatme,et al.  Planning and Implementing Trajectories for Autonomous Underwater Vehicles to Track Evolving Ocean Processes Based on Predictions from a Regional Ocean Model , 2010, Int. J. Robotics Res..

[15]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[16]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[17]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[18]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[19]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[20]  Giorgio Ausiello,et al.  Prize-Collecting Traveling Salesman and Related Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[21]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[22]  Milica Stojanovic,et al.  On the relationship between capacity and distance in an underwater acoustic communication channel , 2006, Underwater Networks.