E-Book, Englisch, 300 Seiten, Web PDF
Allen / Kautz / Pelavin Reasoning About Plans
1. Auflage 2014
ISBN: 978-1-4832-9596-1
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 300 Seiten, Web PDF
ISBN: 978-1-4832-9596-1
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark
This book presents four contributions to planning research within an integrated framework. James Allen offers a survey of his research in the field of temporal reasoning, and then describes a planning system formalized and implemented directly as an inference process in the temporal logic. Starting from the same logic, Henry Kautz develops the first formal specification of the plan recognition process and develops a powerful family of algorithms for plan recognition in complex situations. Richard Pelavin then extends the temporal logic with model operators that allow the representation to support reasoning about complex planning situations involving simultaneous interacting actions, and interaction with external events. Finally, Josh Tenenberg introduces two different formalisms of abstraction in planning systems and explores the properties of these abstraction techniques in depth.
Autoren/Hrsg.
Weitere Infos & Material
1;Front Cover;1
2;Reasoning about Plans;4
3;Copyright Page;5
4;Table of Contents;6
5;Preface;10
6;Acknowledgements;14
7;Notation;16
8;Chapter 1. Temporal Reasoning and Planning;18
8.1;1.1 Introduction;19
8.2;1.2 Representing Time;27
8.3;1.3 The Logic of Action;39
8.4;1.4 The Logic for Planning;45
8.5;1.5 The Planning System;53
8.6;1.6 The Door-Latch Problem;70
8.7;1.7 Hierarchical Planning;76
8.8;1.8 Conclusions;84
9;Chapter 2. A Formal Theory of Plan Recognition and its Implementation;86
9.1;2.1 Introduction;87
9.2;2.2 Representing Event Hierarchies;94
9.3;2.3 The Formal Theory of Recognition;100
9.4;2.4 Examples;114
9.5;2.5 Algorithms for Plan Recognition;125
9.6;2.6 Conclusions and Caveats;141
10;Chapter 3. Planning With Simultaneous Actions and External Events;144
10.1;3.1 Introduction;145
10.2;3.2 Representations That Treat Simultaneous Events;148
10.3;3.3 The Semantic Model;157
10.4;3.4 The Language;179
10.5;3.5 Planning;185
10.6;3.6 A Planning Algorithm;199
10.7;3.7 Discussion;213
10.8;3.8 Appendix A. The Semantic Model and Logical Language;219
10.9;3.9 Appendix B. Proof Theory;226
11;Chapter 4. Abstraction in Planning;230
11.1;4.1 Introduction;231
11.2;4.2 Inheritance Abstraction;248
11.3;4.3 Abstraction Using Relaxed Models;266
11.4;4.4 Conclusion;289
11.5;4.5 Proofs;291
12;References;302
13;Index;312
