Automated Planning: Theory and Practice
Automated planning technology now plays a significant role in a variety of demanding applications, ranging from controlling space vehicles and robots to playing the game of bridge. These real-world applications create new opportunities for synergy between theory and practice: observing what works well in practice leads to better theories of planning, and better theories lead to better performance of practical applications.
Automated Planning mirrors this dialogue by offering a comprehensive, up-to-date resource on both the theory and practice of automated planning. The book goes well beyond classical planning, to include temporal planning, resource scheduling, planning under uncertainty, and modern techniques for plan generation, such as task decomposition, propositional satisfiability, constraint satisfaction, and model checking.
The authors combine over 30 years experience in planning research and development to offer an invaluable text to researchers, professionals, and graduate students.
*Comprehensively explains paradigms for automated planning.
*Provides a thorough understanding of theory and planning practice, and how they relate to each other.
*Presents case studies of applications in space, robotics, CAD/CAM, process control, emergency operations, and games.
*Provides a thorough understanding of AI planning theory and practice, and how they relate to each other.
*Covers all the contemporary topics of planning, as well as important practical applications of planning, such as model checking and game playing.
*Presents case studies and applications in planning engineering, space, robotics, CAD/CAM, process control, emergency operations, and games.
*Provides lecture notes, examples of programming assignments, pointers to downloadable planning systems and related information online.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
applicable approach atoms automated planning backtracking Chapter chronicle classical planning problem complete computed condition conﬁguration conﬂict consistent container corresponding crane deﬁned Deﬁnition described DWR domain dynamic logic effects efﬁcient encoding Example execution expspace extended goals ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed ﬂaws game tree Graphplan heuristics HTN planning inﬁnite initial instance intervals iteration load loc1 loc2 location l1 logic modality model checking move mutex nexptime node nondeterministic pair partial plan path path-consistency algorithm plan-space planning planner planning algorithm planning domain planning graph planning operators planning-graph possible precond preconditions procedure pspace reachability recursively reﬁned reﬁnement represent representation requires resolvers resource robot satisﬁes scheduling search space Section sequence set-theoretic situation calculus sm function solution plan speciﬁc state-transition system state-variable subtasks Sussman anomaly symbols task network techniques temporal database temporal planning totally ordered tuple unload variables
Page 578 - V. Boor, MH Overmars, and AF van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc.
Page 573 - R. Alami, R. Chatila, S. Fleury, M. Ghallab, and F. Ingrand. An architecture for autonomy.
Page 585 - H. Fargier, J. Lang, and T. Schiex. Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In AAAI'96: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 175-180.
Page 573 - R. Alami, S. Fleury, M. Herrb. F. Ingrand, and F. Robert. Multi-robot cooperation in the MARTHA project.
Page 575 - H. Katsuno and AO Mendelzon. On the difference between updating a knowledge database and revising it. In Proceedings of the International Conference on Knowledge Representation and Reasoning (KR), pages 387-394, Boston, Mass., April 1991.
All Book Search results »