Abstract
Acting efficiently and meeting deadlines requires autonomous robots to schedule their activities. It also requires them to act flexibly: to exploit opportunities and avoid problems as they occur. Scheduling activities to meet these requirements is an important research problem in its own right. In addition, it provides us with a problem domain where modern symbolic AI planning techniques could considerably improve the robots’ behavior.
This paper describes ppsd, a novel planning technique that enables autonomous robots to impose order constraints on concurrent percept-driven plans to increase the plans’ efficiency. The basic idea is to generate a schedule under simplified conditions and then to iteratively detect, diagnose, and eliminate behavior flaws caused by the schedule based on a small number of randomly sampled symbolic execution scenarios. The paper discusses the integration of ppsd into the controller of an autonomous robot office courier and gives an example of its use.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Beetz and M. Bennewitz. Planning, scheduling, and plan execution for autonomous robot office couriers. In R. Bergmann and A. Kott, editors, Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, volume Workshop Notes 98-02. AAAI Press, 1998.
C. Boutilier, T. Dean, and S. Hanks. Decision theoretic planning: Structural assumptions and computational leverage. Journal of AI research, 1998.
M. Beetz. Structured reactive controllers — a computational model of everyday activity. In Proceedings of the Third International Conference on Autonomous Agents, 1999. to appear.
M. Beetz and H. Grosskreutz. Causal models of mobile service robot behavior. In R. Simmons, M. Veloso, and S. Smith, editors, Fourth International Conference on AI Planning Systems, pages 163–170, Morgan Kaufmann, 1998.
M. Beetz and D. McDermott. Fast probabilistic plan debugging. In Recent Advances in AI Planning. Proceedings of the 1997 European Conference on Planning, pages 77–90. Springer Publishers, 1997.
N. Kushmerick, S. Hanks, and D. Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76:239–286, 1995.
C. McVey, E. Atkins, E. Durfee, and K. Shin. Development of iterative real-time scheduler to planner feedback. In “Proceedings of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI-87)”, pages 1267–1272, 1997.
D. McDermott. A reactive plan language. Research Report YALEU/DCS/RR-864, Yale University, 1991.
D. McDermott. Transformational planning of reactive behavior. Research Report YALEU/DCS/RR-941,Yale University, 1992.
D. McDermott. An algorithm for probabilistic, totally-ordered temporal projection. Research Report YALEU/DCS/RR-1014,Yale University, 1994.
B. Pell, D. Bernard, S. Chien, E. Gat, N. Muscettola, P. Nayak, M. Wagner, and B. Williams. An autonomous spacecraft agent prototype. In Proceedings of the First International Conference on Autonomous Agents, 1997.
Reid Simmons. The role of associational and causal reasoning in problem solving. AI Journal, 53, 1992.
G. Sussman. A Computer Model of Skill Acquisition, volume 1 of Aritficial Intelligence Series. American Elsevier, NewYork, NY, 1977.
S. Thrun, A. Bücken, W. Burgard, D. Fox, T. Fröhlinghaus, D. Hennig, T. Hofmann, M. Krell, and T. Schmidt. Map learning and high-speed navigation in RHINO. In D. Kortenkamp, R. P. Bonasso, and R. Murphy, editors, AI-based Mobile Robots: Case studies of successful robot systems. MIT Press, Cambridge, MA, 1998.
M. Williamson and S. Hanks. Utility-directed planning. In Proc. of AAAI-94, page 1498, 1994.
E. Yampratoom. Using simulation-based projection to plan in an uncertain and temporally complex world. Technical Report 531, University of Rochester, CS Deptartment, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beetz, M., Bennewitz, M., Grosskreutz, H. (1999). Probabilistic, Prediction-Based Schedule Debugging for Autonomous Robot Office Couriers. In: Burgard, W., Cremers, A.B., Cristaller, T. (eds) KI-99: Advances in Artificial Intelligence. KI 1999. Lecture Notes in Computer Science(), vol 1701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48238-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-48238-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66495-6
Online ISBN: 978-3-540-48238-3
eBook Packages: Springer Book Archive