Abstract
A robot that forestalls flaws in its intended course of action while carrying out its jobs must perform difficult and complex computations at a speed that is fast compared to the time that it takes to execute plans. The computational processes must infer the purpose of subplans, find subplans with a particular purpose, automatically generate a plan that can achieve some goal, determine flaws in the behavior that is caused by subplans, and estimate how good the behavior caused by a subplan is with respect to the robot’s utility model. The computational problems these processes try to solve are, in their general form, unsolvable, or at the very least computationally intractable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2000). Transparent Reactive Plans. In: Concurrent Reactive Plans. Lecture Notes in Computer Science(), vol 1772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46436-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-46436-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67241-8
Online ISBN: 978-3-540-46436-5
eBook Packages: Springer Book Archive