Planning Routes through uncertain territory
Artificial Intelligence
Formal theories of knowledge in AI and robotics
New Generation Computing
Reasoning about knowledge: an overview
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The synthesis of digital machines with provable epistemic properties
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Distributed Artificial Intelligence
Distributed Artificial Intelligence
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Formulation of tradeoffs in planning under uncertainty
Formulation of tradeoffs in planning under uncertainty
Planning and control
Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
On social laws for artificial agent societies: off-line design
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
An algorithmic approach to the automated design of parts orienters
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Diversity-based inference of finite automata
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On stable multi-agent behavior in face of uncertainty
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Learning by knowledge sharing in autonomous intelligent systems
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
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.