Skip to main content
Log in

Resource-bounded sensing and planning in autonomous systems

  • Published:
Autonomous Robots Aims and scope Submit manuscript

Abstract

This paper is concerned with the implications of limited computational resources and uncertainty on the design of autonomous systems. To address this problem, we redefine the principal role of sensor interpretation and planning processes. Following Agre and Chapman's plan-as-communication approach, sensing and planning are treated as computational processes that provide information to an execution architecture and thus improve the overall performance of the system. We argue that autonomous systems must be able to trade off the quality of this information with the computational resources required to produce it. Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for time-critical sensing and planning in robotic systems. In our earlier work, we introduced a compilation scheme for optimal composition of anytime algorithms. This paper demonstrates the applicability of the compilation technique to the construction of autonomous systems. The result is a flexible approach to construct systems that can operate robustly in real-time by exploiting the tradeoff between time and quality in planning, sensing and plan execution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Agre, P. E. and Chapman, D. 1990. What are plans for? Robotics and Autonomous Systems, 6:17–34.

    Google Scholar 

  • Alterman, R. 1988. Adaptive planning. Cognitive Science, 12:393–422.

    Google Scholar 

  • Boddy, M. and Dean, T. L. 1994. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67(2):245–285.

    Google Scholar 

  • Bresina, J. and Drummond, M. 1990. Integrating planning and reaction. In J. Hendler, Ed., AAAI Spring Symposium on Planning in Uncertain, Unpredictable or Changing Environments, Stanford, California, pp. 24–28.

  • Carver, N. and Lesser, V. R. 1991. A new framework for sensor interpretation: Planning to resolve sources of uncertainty. In Proc. 9th National Conference on Artificial Intelligence, pp. 724–731.

  • Christensen, J. 1990. A hierarchical planner that creates its own hierarchies. In Proc. 8th National Conference on Artificial Intelligence, Boston, Massachusetts, pp. 1004–1009.

  • Cohen, P. R. 1995. Empirical Methods for Artificial Intelligence. MIT Press: Cambridge, Massachusetts.

    Google Scholar 

  • D'Ambrosio, B. 1989. Resource bounded agents in an uncertain world. In Proc. IJCAI-89 Workshop on Real-Time Artificial Intelligence Problems, Detroit, Michigan.

  • Dean, T. L. and Boddy, M. 1988. An analysis of time-dependent planning. In Proc. 7th National Conference on Artificial Intelligence, Minneapolis, Minnesota, pp. 49–54.

  • Drummond, M. and Tate, A. 1989. AI Planning: A Tutorial and Review. Technical Report AIAI-TR-30, AI Applications Institute, University of Edinburgh.

  • Elkan, C. 1990. Incremental, approximate planning. In Proc. 8th National Conference on Artificial Intelligence, Boston, Massachusetts, pp. 145–150.

  • Fikes, R. E., Hart, P. E. and Nilsson, N. J. 1972. Learning and executing generalized robot plans. Artificial Intelligence, 3(4):251–288.

    Google Scholar 

  • Fox, B. R. and Kempf, K. G. 1985. Opportunistic scheduling for robotic assembly. In IEEE International Conference on Robotics and Automation, pp. 880–889.

  • Fraichard, T. and Laugier, C. 1991. On-line reactive planning for a non-holonomic mobile in a dynamic world. In IEEE International Conference on Robotics and Automation, Sacramento, California, pp. 432–437.

  • Gat, E. 1992. Integration planning and reacting in a heterogeneous asynchronous architecture for controlling real-world mobile robots. In Proc. 10th National Conference on Artificial Intelligence, San Jose, California, pp. 809–815.

  • Hager, G. and Mintz, M. 1987. Searching for information. In Proc. AAAI Workshop on Spatial Reasoning and Multi-Sensor Fusion, Los Altos, California: Morgan Kaufmann, pp. 313–322.

    Google Scholar 

  • Hammond, K. J. 1990. Explaining and repairing plans that fail. Artificial Intelligence, 45:173–228.

    Google Scholar 

  • Hanks, S. 1990. Practical temporal projection. In Proc. 8th National Conference on Artificial Intelligence, Boston, Massachusetts, pp. 158–163.

  • Hanks, S., Pollack, M. and Cohen, P. R. 1993. Benchmarks, Testbeds, Controlled Experimentation, and the Design of Agent Architectures. AI Magazine, 14(4):17–42.

    Google Scholar 

  • Hansen, E. A. and Zilberstein, S. 1995. Monitoring the progress of anytime algorithms. In Proc. IJCAI-95 Workshop on Anytime Algorithms and Deliberation Scheduling, Montreal, Canada, pp. 28–32.

  • Hayes-Roth, B. et al. 1992. Guardian: A prototype intelligent agent for intensive-care monitoring. Artificial Intelligence in Medicine, 4:165–185.

    Google Scholar 

  • Hendler, J., Tate, A. and Drummond, M. 1990. AI planning: Systems and techniques. AI Magazine, 11(2):61–77.

    Google Scholar 

  • Horvitz, E. J. 1989. Reasoning about beliefs and actions under computational resource constraints. In Uncertainty in Artificial Intelligence, Vol. 3, Eds. L.N. Kanal, T.S. Levitt and J.F. Lemmer, pp. 301–324, North-Holland: Amsterdam.

    Google Scholar 

  • Horvitz, E. J., Suermondt, H. J. and Cooper, G. F. 1989. Bounded conditioning: Flexible inference for decision under scarce resources. In Proc. Workshop on Uncertainty in Artificial Intelligence, Windsor, Ontario, pp. 182–193.

  • Howard, R. A. 1966. Information value theory. IEEE Transactions on Systems Science and Cybernetics, SSC-2(1):22–26.

    Google Scholar 

  • Howe, A. E., Hart, D. M. and Cohen, P. R. 1990. Addressing real-time constraints in the design of autonomous agents. In the Journal of Real-Time Systems, 2(1/2):81–97.

    Google Scholar 

  • Hutchinson, S. A. and Kak, A. C. 1989. Planning sensing strategies in a robot work cell with multi-sensor capabilities. IEEE Transactions on Robotics and Automation, 5(6):765–783.

    Google Scholar 

  • Ingrand, F. F., Georgeff, M. P. and Rao, A. S. 1992. An architecture for real-time reasoning and system control. IEEE Expert, December 1992, pp. 34–44.

  • Knoblock, C. A. 1990. Learning abstraction hierarchies for problem solving. In Proc. 8th National Conference on Artificial Intelligence, Boston, Massachusetts, pp. 923–928.

  • Lozano-Pérez, T. and Brooks, R. A. 1984. An approach to automatic robot programming. In Solid Modeling by Computers, M. S. Pickett and J. W. Boyse, Eds. pp. 293–327, Plenum: New York.

    Google Scholar 

  • Lyons, D. M. and Hendriks, A. J. 1992. A practical approach to integrating reaction and deliberation. In Proc. First International Conference on AI Planning Systems, College Park, Maryland, pp 153–162.

  • Michalski, R. S. and Winston, P. H. 1986. Variable precision logic. Artificial Intelligence 29(2):121–146.

    Google Scholar 

  • Musliner, D. J., Durfee, E. H. and Shin, K. G. 1995. World modeling for the dynamic construction of real-time control plans. Artificial Intelligence, 74:83–127.

    Google Scholar 

  • Newell, A. and Simon, H. A. 1976. Computer science as empirical inquiry: Symbols and search. Communications of the ACM, 12:113–126.

    Google Scholar 

  • Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann: Los Altos, California.

    Google Scholar 

  • Russell, S. J. and Wefald, E. H. 1991. Do the Right Thing: Studies in limited rationality. MIT Press: Cambridge, Massachusetts.

    Google Scholar 

  • Russell, S. J. and Zilberstein, S. 1991. Composing real-time systems. In Proc. 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, pp. 212–217.

  • Sacerdoti, E. D. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5:115–135.

    Google Scholar 

  • Sacerdoti, E. D. 1977. A Structure for Plans and Behavior. American Elsevier: New York.

    Google Scholar 

  • Simon, H. A. 1982. Models of Bounded Rationality, Volume 2. MIT Press: Cambridge, Massachusetts.

    Google Scholar 

  • Tate, A. 1995. Representing plans as a set of constraints — the <I-N-OVA> model. ACM SIGART Bulletin, 6(1):26–32.

    Google Scholar 

  • Wellman, M. P. and Liu, C.-L. 1994. State-space abstraction for anytime evaluation of probabilistic networks. In Proc. 10th Conference on Uncertainty in Artificial Intelligence, Seattle, Washington, pp. 567–574.

  • Xiaodong, X. and Bekey, G. A. 1988. Sroma: An adaptive scheduler for robotic assembly systems. In IEEE International Conference on Robotics and Automation, Philadelphia, Penn, pp. 1282–1287.

  • Zilberstein, S. 1993. Operational Rationality Through Compilation of Anytime Algorithms. Ph.D Dissertation, Computer Science Division, University of California, Berkeley, CA.

    Google Scholar 

  • Zilberstein, S. 1995. Optimizing decision quality with contract algorithms. In Proc. 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, pp. 1576–1582.

  • Zilberstein, S. and Russell, S. J. 1993. Anytime sensing, planning and action: A practical model for robot control. In Proc. 13th International Joint Conference on Artificial Intelligence, Chambery, France, pp. 1402–1407.

  • Zilberstein, S. and Russell, S. J. 1996. Optimal composition of real-time systems. To appear in Artificial Intelligence.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zilberstein, S. Resource-bounded sensing and planning in autonomous systems. Auton Robot 3, 31–48 (1996). https://doi.org/10.1007/BF00162466

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00162466

Keywords

Navigation