Reasoning About Plans (eBook)

James Allen, Henry Kautz, Richard Pelavin, Josh Tenenberg (Autoren)

eBook Download: PDF

2014 | 1. Auflage
300 Seiten
Elsevier Science (Verlag)
978-1-4832-9596-1 (ISBN)

Infos

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.

Inhalt

Front Cover 1
Reasoning about Plans 4
Copyright Page 5
Table of Contents 6
Preface 10
Acknowledgements 14
Notation 16
Chapter 1. Temporal Reasoning and Planning 18
1.1 Introduction 19
1.2 Representing Time 27
1.3 The Logic of Action 39
1.4 The Logic for Planning 45
1.5 The Planning System 53
1.6 The Door-Latch Problem 70
1.7 Hierarchical Planning 76
1.8 Conclusions 84
Chapter 2. A Formal Theory of Plan Recognition and its Implementation 86
2.1 Introduction 87
2.2 Representing Event Hierarchies 94
2.3 The Formal Theory of Recognition 100
2.4 Examples 114
2.5 Algorithms for Plan Recognition 125
2.6 Conclusions and Caveats 141
Chapter 3. Planning With Simultaneous Actions and External Events 144
3.1 Introduction 145
3.2 Representations That Treat Simultaneous Events 148
3.3 The Semantic Model 157
3.4 The Language 179
3.5 Planning 185
3.6 A Planning Algorithm 199
3.7 Discussion 213
3.8 Appendix A. The Semantic Model and Logical Language 219
3.9 Appendix B. Proof Theory 226
Chapter 4. Abstraction in Planning 230
4.1 Introduction 231
4.2 Inheritance Abstraction 248
4.3 Abstraction Using Relaxed Models 266
4.4 Conclusion 289
4.5 Proofs 291
References 302
Index 312

Produkt-Details

• Erscheint lt. Verlag: 28.6.2014
• Sprache: englisch
• Themenwelt: Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
• ISBN-10: 1-4832-9596-6 / 1483295966
• ISBN-13: 978-1-4832-9596-1 / 9781483295961