Dominance and Equivalence for Sensor-Based Agents

This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. The central element to this work is a notion of dominance of one such system over another. This relation is formally based on the agents' progression through a derived information space, but may informally be understood as describing one agent's ability to "simulate" another. We present some basic properties of this dominance relation and demonstrate its usefulness by applying it to a basic problem in robotics. We argue that this work is of interest to a broad audience of artificial intelligence researchers for two main reasons. First, it calls attention to the possibility of studying belief spaces in way that generalizes both probabilistic and nondeterministic uncertainty models. Second, it provides a means for evaluating the information that an agent is able to acquire (via its sensors and via conformant actions), independent of any optimality criterion and of the task to be completed.

[1]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[2]  Qiang Ji,et al.  Sensor Selection for Active Information Fusion , 2005, AAAI.

[3]  Jason M. O'Kane,et al.  Sloppy motors, flaky sensors, and virtual dirt: Comparing imperfect ill-informed robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  M. Degroot.  Optimal Statistical Decisions , 1970 .

[5]  Christian P. Robert,et al.  The Bayesian choice , 1994 .

[6]  Jason M. O'Kane,et al.  On Comparing the Power of Mobile Robots , 2006, Robotics: Science and Systems.

[7]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[9]  R. Govindan,et al.  Utility-based sensor selection , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[10]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

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

[12]  Michael Sipser,et al.  Introduction to the Theory of Computation: Preliminary Edition , 1996 .

[13]  Stuart J. Russell,et al.  Efficient belief-state AND-OR search, with application to Kriegspiel , 2005, IJCAI.

[14]  J. Horty.  Nonmonotonic Logic , 2001 .

[15]  Jason M. O'Kane,et al.  Comparing the Power of Robots , 2008, Int. J. Robotics Res..

[16]  D. McDermott,et al.  An introduction to nonmonotonic logic , 1979, IJCAI 1979.

[17]  Piergiorgio Bertoli,et al.  Conformant planning via symbolic model checking and heuristic search , 2004, Artif. Intell..

[18]  Eyal Amir,et al.  Logical Filtering , 2003, IJCAI.

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

[20]  Wenju Liu,et al.  A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains , 1997, J. Artif. Intell. Res..