Understanding Planning Tasks Domain Complexity and Heuristic Decomposition /

• Κύριος συγγραφέας: Helmert, Malte (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4929
• Θέματα: Computer science.; Computers.; Algorithms.; Mathematical statistics.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Probability and Statistics in Computer Science.

Action planning has always played a central role in Artificial Intelligence. Given a description of the current situation, a description of possible actions and a description of the goals to be achieved, the task is to identify a sequence of actions, i.e., a plan that transforms the current situatio...

Πίνακας περιεχομένων:

• Planning Benchmarks
• The Role of Benchmarks
• Defining Planning Domains
• The Benchmark Suite
• Transportation and Route Planning
• IPC Domains: Transportation and Route Planning
• IPC Domains: Others
• Conclusions
• Fast Downward
• Solving Planning Tasks Hierarchically
• Translation
• Knowledge Compilation
• Search
• Experiments
• Discussion.