Interleaving Planning and Execution for Autonomous Robots [Hardcover]

Interleaving Planning and Execution for Autonomous Robots develops a formal representation for interleaving planning and execution in the context of incomplete information. This work bridges the gap between theory and practice in robotics by presenting control architectures that are provably sound, complete and optimal, and then describing real-world implementations of these robot architectures. Dervish, winner of the 1994 AAAI National Robot Contest, is one of the robots featured.
Interleaving Planning and Execution for Autonomous Robots is based on the author's PhD research, covering the same material taught in CS 224, the very popular Introduction to Robot Programming Laboratory taught at Stanford for four years by Professor Michael Genesereth and the author.Interleaving Planning and Execution for Autonomous Robots develops a formal representation for interleaving planning and execution in the context of incomplete information. This work bridges the gap between theory and practice in robotics by presenting control architectures that are provably sound, complete and optimal, and then describing real-world implementations of these robot architectures. Dervish, winner of the 1994 AAAI National Robot Contest, is one of the robots featured.
Interleaving Planning and Execution for Autonomous Robots is based on the author's PhD research, covering the same material taught in CS 224, the very popular Introduction to Robot Programming Laboratory taught at Stanford for four years by Professor Michael Genesereth and the author.Preface. 1. Introduction. 2. Perception and Action. 3. Formalizing Incomplete Information. 4. Goal-Directed Control Systems. 5. Interleaving Planning and Execution. 6. Using Assumptions to Oversimplify. 7. Strategic Subgoaling: Using Abstraction Systems. 8. Generalized Beyond State Sets. 9. Conclusions. Bibliography. lÃF