Story validation and approximate path inference with a sparse network of heterogeneous sensors

Given a story from an agent (sensor outputs from a robot or a tale told by a human) and recordings from a spare network of heterogeneous sensors, this paper provides efficient algorithms that validate whether it is possible to reconstruct a path compatible with the sensor recordings that is also “close” to the agent's story. In solving the proposed problems, we show that effective exploitation of a unique finite automaton structure yields time complexity linear in both the length of the story and the length of the sensor observation history. Besides immediate applicability towards security and forensics problems, the idea of behavior validation using external sensors also appears promising in complementing design time model verification.

[1]  Wolfram Burgard,et al.  A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Auton. Robots.

[2]  J. Singh,et al.  Tracking Multiple Targets Using Binary Proximity Sensors , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Keiji Nagatani,et al.  Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization , 2001, IEEE Trans. Robotics Autom..

[5]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

[6]  Hugh F. Durrant-Whyte,et al.  A solution to the simultaneous localization and map building (SLAM) problem , 2001, IEEE Trans. Robotics Autom..

[7]  Leonidas J. Guibas,et al.  Counting Targets: Building and Managing Aggregates in Wireless Sensor Networks , 2002 .

[8]  Steven M. LaValle,et al.  Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances , 2007, IEEE Transactions on Robotics.

[9]  Nisheeth Shrivastava,et al.  Target tracking with binary proximity sensors , 2009, TOSN.

[10]  Hadas Kress-Gazit,et al.  Valet parking without a valet , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Steven M. LaValle,et al.  Tracking hidden agents through shadow information spaces , 2008, 2008 IEEE International Conference on Robotics and Automation.

[12]  Steven M. LaValle,et al.  Filtering and Planning in Information Spaces , 2009 .

[13]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[14]  Nisheeth Shrivastava,et al.  Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms , 2006, SenSys '06.

[15]  Yuliy Baryshnikov,et al.  Target Enumeration via Integration over Planar Sensor Networks , 2008, Robotics: Science and Systems.

[16]  Joel I. Seiferas,et al.  Correcting Counter-Automaton-Recognizable Languages , 1978, SIAM J. Comput..

[17]  Hadas Kress-Gazit,et al.  Where's Waldo? Sensor-Based Temporal Logic Motion Planning , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[18]  Ronald Parr,et al.  DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks , 2003, IJCAI.

[19]  Fred Cohen,et al.  Sensor Beams, Obstacles, and Possible Paths , 2008, WAFR.

[20]  Robert A. Wagner,et al.  Order-n correction for regular languages , 1974, CACM.

[21]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[22]  Steven M. LaValle,et al.  Cyber Detectives: Determining When Robots or People Misbehave , 2010, WAFR.

[23]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[24]  E. Myers,et al.  Approximate matching of regular expressions. , 1989, Bulletin of mathematical biology.

[25]  Hugh F. Durrant-Whyte,et al.  A Fully Decentralized Multi-Sensor System For Tracking and Surveillance , 1993, Int. J. Robotics Res..

[26]  J. M. M. Montiel,et al.  The SPmap: a probabilistic framework for simultaneous localization and map building , 1999, IEEE Trans. Robotics Autom..

[27]  Gonzalo Navarro,et al.  A guided tour to approximate string matching , 2001, CSUR.

[28]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[29]  Cyril Allauzen,et al.  Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton , 2009, ArXiv.

[30]  Sebastian Thrun,et al.  FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.

[31]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.