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 ef.cient algorithms that validate whether it is possible to reconstruct a path compatible with the sensor recordings that is also closeto the agens story. In solving the proposed problems, we show that effective exploitation of a unique .nite 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 veri.cation.
Jingjin Yu Steven M. LaValle
Department of Electrical and Computer Engineering University of Illinois Urbana,IL 61801 USA Department of Computer Science University of Illinois Urbana,IL 61801 USA
国际会议
2011 IEEE International Conference on Robotics and Automation(2011年IEEE世界机器人与自动化大会 ICRA 2011)
上海
英文
4980-4985
2011-05-09(万方平台首次上网日期,不代表论文的发表时间)