The Compass That Steered Robotics
Robotics researchers will be aware of Dexter Kozen’s contributions to algebraic algorithms, which have enabled the widespread use of the theory of real closed fields and polynomial arithmetic for motion planning. However, Dexter has also made several important contributions to the theory of information invariants, and produced some of the most profound results in this field. These are first embodied in his 1978 paper On the Power of the Compass, with Manuel Blum. This work has had a wide impact in robotics and nanoscience.
Starting with Dexter’s insights, robotics researchers have explored the problem of determining the information requirements to perform robot tasks, using the concept of information invariants. This represents an attempt to characterize a family of complicated and subtle issues concerned with measuring robot task complexity.
In this vein, several measures have been proposed  to measure the information complexity of a task: (a) How much internal state should the robot retain? (b) How many cooperating robots are required, and how much communication between them is necessary? (c) How can the robot change (side-effect) the environment in order to record state or sensory information to perform a task? (d) How much information is provided by sensors? and (e) How much computation is required by the robot? We have considered how one might develop a kind of “calculus” on (a) – (e) in order to compare the power of sensor systems analytically. To this end, information invariants is a theory whereby one sensor can be “reduced” to another (much in the spirit of computation-theoretic reductions), by adding, deleting, and reallocating (a) – (e) among collaborating autonomous robots. As we show below, this work steers using Dexter’s compass.
KeywordsMobile Robot Turing Machine Robotic Research Manipulation Task Autonomous Mobile Robot
Unable to display preview. Download preview PDF.
- 2.Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 132–142. IEEE Computer Society (1978)Google Scholar
- 3.Blum, M., Sakoda, W.J.: On the capability of finite automata in 2 and 3 dimensional space. In: 18th Annual Symposium on Foundations of Computer Science, pp. 147–161 (1977)Google Scholar
- 5.Böhringer, K.-F., Donald, B.R.: Algorithmic MEMS. In: Proceedings of the 3rd International Workshop on the Algorithmic Foundations of Robotics WAFR, Houston, TX (March 1998)Google Scholar
- 8.Böhringer, K.-F., Donald, B.R., MacDonald, N.: Upper and lower bounds for programmable vector fields with applications to MEMS and vibratory plate parts feeders. In: Laumond, J.P., Overmars, M. (eds.) Algorithms for Robotic Motion and Manipulation, pp. 255–276. A. K. Peters, Wellesley (1997)Google Scholar
- 9.Böhringer, K.-F., Donald, B.R., MacDonald, N.C.: Programmable Vector Fields for Distributed Manipulation, with Applications to MEMS Actuator Arrays and Vibratory Parts Feeders. International Journal of Robotics Research 18(2) (February 1999)Google Scholar
- 10.Böhringer, K.-F., Donald, B.R., MacDonald, N.C., Mihailovich, R.: Sensorless manipulation using massively parallel micro-fabricated actuator arrays. In: Proc. IEEE International Conference on Robotics and Automation, San Diego, CA (May 1994)Google Scholar
- 11.Böhringer, K.-F., Donald, B.R., MacDonald, N.C., Mihailovich, R.: A theory of manipulation and control for microfabricated actuator arrays. In: Proc. 7th IEEE Workshop on Micro Electro Mechanical Systems (MEMS 1994), Kanagawa, Japan (January 1994)Google Scholar
- 12.Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer, New York (1991)Google Scholar
- 15.Donald, B.R., et al.: MEMS Videos. Department of Computer Science, Duke University (July 2008), http://www.cs.duke.edu/donaldlab/research_movies_mems.php
- 16.Donald, B.R., et al.: Robotics Videos. Department of Computer Science, Duke University (July 2008), http://www.cs.duke.edu/donaldlab/research_movies_robots.php
- 17.Donald, B.R., Jennings, J., Rus, D.: Towards a theory of information invariants for cooperating autonomous mobile robots. In: Proceedings of the International Symposium of Robotics Research ISRR, Hidden Valley, PA (October 1993)Google Scholar
- 26.Erdmann, M.: On Probabilistic Strategies for Robot Tasks. PhD thesis, MIT Department of EECS, MIT Department of EECS, MIT A.I. Lab, Cambridge MIT-AI-TR 1155 (1989)Google Scholar
- 27.Erdmann, M.: Towards task-level planning: Action-based sensor design. Technical report, Carnegie-Mellon, Carnegie-Mellon School of Computer Science, Tech. report, CMU-CS-92-116 (February 1991)Google Scholar
- 28.Erdmann, M., Mason, M.: An exploration of sensorless manipulation. In: Proceedings of the 1986 IEEE International Conference on Robotics and Automation, vol. 3, pp. 1569–1574 (April 1986)Google Scholar
- 33.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)Google Scholar
- 34.Jennings, J., Donald, B.R.: Sensor interpretation and task-directed planning using perceptual equivalence classes. In: Proc. IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 190–197 (April 1991)Google Scholar
- 35.Jennings, J., Donald, B.R.: Constructive recognizability for task-directed robot programming. In: Proc. IEEE International Conference on Robotics and Automation, Nice, France, pp. 2446–2452 (May 1992)Google Scholar
- 37.Jennings, J., Rus, D.: Active model acquisition for near-sensorless manipulation with mobile robots. In: International Association of Science and Technology for Development (IASTED) International Conference on Robotics and Manufacturing, Oxford, England (1993)Google Scholar
- 38.Kozen, D.: Automata and planar graphs. In: Proceedings of the 2nd Symposium on Fundamentals of Computing Theory, FCT 1979, Berlin, pp. 243–254 (1979)Google Scholar
- 41.Lumelsky, V.J., Stepanov, A.A.: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 403–430 (1987)Google Scholar
- 44.Natarajan, B.K.: On planning assemblies. In: Proceedings of the fourth Annual Symposium on Computational Geometry, pp. 299–308. ACM (1988)Google Scholar
- 45.Rees, J., Donald, B.R.: Program mobile robots in scheme. In: Proc. IEEE International Conference on Robotics and Automation, Nice, France, pp. 2681–2688 (May 1992)Google Scholar
- 46.Reif, J.H.: Complexity of the mover’s problem and generalizations. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 421–427 (1979); Schwartz, J., Hopcroft, J., Sharir, M.: Planning, Geometry and Complexity of Robot Motion, ch. 11, pp. 267–281. Ablex publishing corp., New Jersey (1987) Google Scholar
- 47.Rosenschein, S.J.: Synthesizing information-tracking automata from environment descriptions. Technical report, Teleos Research TR No. 2 (1989)Google Scholar
- 48.Rus, D., Donald, B.R., Jennings, J.: Moving furniture with teams of autonomous mobile robots. In: Proc. IEEE/Robotics Society of Japan International Workshop on Intelligent Robots and Systems, Pittsburgh, PA, pp. 235–242 (1995)Google Scholar
- 50.Tarski, A.: A decision method for elementary algebra and geometry. Rand report. Rand Corp. (1948)Google Scholar