On Planning while Learning

This paper introduces a framework for Planning while Learning where an agent is given a goal to achieve in an environment whose behavior is only partially known to the agent. We discuss the tractability of various plan-design processes. We show that for a large natural class of Planning while Learning systems, a plan can be presented and verified in a reasonable time. However, coming up algorithmically with a plan, even for simple classes of systems is apparently intractable. We emphasize the role of off-line plan-design processes, and show that, in most natural cases, the verification (projection) part can be carried out in an efficient algorithmic manner.

[1]  David H. D. Warren,et al.  Generating Conditional Plans and Programs , 1976, AISB.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Yoav Shoham,et al.  Agent-Oriented Programming , 1992, Artif. Intell..

[4]  Sam Steel,et al.  Integrating Planning, Execution and Monitoring , 1988, AAAI.

[5]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[6]  Illah R. Nourbakhsh,et al.  Time-Saving Tips for Problem Solving with Incomplete Information , 1993, AAAI.

[7]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[8]  Michael P. Wellman.  Formulation of tradeoffs in planning under uncertainty , 1988 .

[9]  Balas K. Natarajan.  An algorithmic approach to the automated design of parts orienters , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[11]  Robert C. Moore.  Reasoning About Knowledge and Action , 1977, IJCAI.

[12]  James A. Hendler,et al.  Readings in Planning , 1994 .

[13]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[14]  Ronald L. Rivest,et al.  Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[15]  Drew McDermott,et al.  Planning Routes Through Uncertain Territory , 1983, Artif. Intell..

[16]  Leora Morgenstern,et al.  Knowledge Preconditions for Actions and Plans , 1988, IJCAI.

[17]  V. S. Subrahmanian,et al.  On the Complexity of Domain-Independent Planning , 1992, AAAI.

[18]  Michael P. Wellman,et al.  Planning and Control , 1991 .

[19]  Joseph Y. Halpern,et al.  Reasoning About Knowledge: An Overview. , 1988 .

[20]  Moses Moshe TennenholtzFaculty.  Oo-line Reasoning for On-line Eeciency: Knowledge Bases , 1996 .

[21]  Moshe Tennenholtz,et al.  On Social Laws for Artificial Agent Societies: Off-Line Design , 1995, Artif. Intell..

[22]  Tom Bylander,et al.  Complexity Results for Serial Decomposability , 1992, AAAI.

[23]  Leslie Pack Kaelbling,et al.  The Synthesis of Digital Machines With Provable Epistemic Properties , 1986, TARK.

[24]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

[25]  Moshe Tennenholtz,et al.  Off-line Reasoning for On-line Efficiency , 1993, IJCAI.

[26]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[27]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[28]  Moshe Tennenholtz,et al.  On Cooperation in a Multi-Entity Model , 1989, IJCAI.

[29]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[30]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[31]  Rodney A. Brooks,et al.  A Robust Layered Control Syste For A Mobile Robot , 2022 .

[32]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .