Mission design for compressive sensing with mobile robots

This paper considers mission design strategies for mobile robots whose task is to perform spatial sampling of a static environmental field, in the framework of compressive sensing. According to this theory, we can reconstruct compressible fields using O(log n) nonadaptive measurements (where n is the number of sites of the spatial domain), in a basis that is “incoherent” to the representation basis [1]; random uncorrelated measurements satisfy this incoherence requirement. Because an autonomous vehicle is kinematically constrained and has finite energy and communication resources, it is an open question how to best design missions for CS reconstruction. We compare a two-dimensional random walk, a TSP approximation to pass through random points, and a randomized boustrophedon (lawnmower) strategy. Not unexpectedly, all three approaches can yield comparable reconstruction performance if the planning horizons are long enough; if planning occurs only over short time scales, the random walk will have an advantage.

[1]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[2]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[3]  Piotr Indyk Explicit constructions for compressed sensing of sparse signals , 2008, SODA '08.

[4]  Gaurav S. Sukhatme,et al.  Networked infomechanical systems: a mobile embedded networked sensor platform , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[5]  Antonio Ortega,et al.  Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks , 2009, GSN.

[6]  Gaurav S. Sukhatme,et al.  Adaptive Sampling for Estimating a Scalar Field using a Robotic Boat and a Sensor Network , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[7]  Naomi Ehrich Leonard,et al.  Adaptive Sampling Using Feedback Control of an Autonomous Underwater Glider Fleet , 2003 .

[8]  David M. Fratantoni,et al.  Multi-AUV Control and Adaptive Sampling in Monterey Bay , 2006, IEEE Journal of Oceanic Engineering.

[9]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[10]  Franz S. Hover,et al.  Numerical optimization of generative network parameters , 2010 .

[11]  A. Singh,et al.  Active learning for adaptive mobile sensing networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[12]  Robert D. Nowak,et al.  Wavelet-based statistical signal processing using hidden Markov models , 1998, IEEE Trans. Signal Process..

[13]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

[14]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[15]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[16]  Michael J. McNish Effects of uniform target density on random search. , 1987 .

[17]  R. Calderbank,et al.  Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery , 2009 .

[18]  Wei Wang,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[19]  C. Scholin,et al.  The Environmental Sample Processor (ESP) - An Autonomous Robotic Device for Detecting Microorganisms Remotely using Molecular Probe Technology , 2006, OCEANS 2006.

[20]  A.C. Sanderson,et al.  Adaptive sampling algorithms for multiple autonomous underwater vehicles , 2004, 2004 IEEE/OES Autonomous Underwater Vehicles (IEEE Cat. No.04CH37578).

[21]  Kannan Ramchandran,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[22]  Pradeep Sen,et al.  Compressive cooperative sensing and mapping in mobile networks , 2009, ACC.

[23]  N.M. Patrikalakis,et al.  Path Planning of Autonomous Underwater Vehicles for Adaptive Sampling Using Mixed Integer Linear Programming , 2008, IEEE Journal of Oceanic Engineering.

[24]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[25]  D. Caron,et al.  Design and Development of a Wireless Robotic Networked Aquatic Microbial Observing System , 2007 .