1 / 4

Lecture 24 of 42

Lecture 24 of 42. Review of Logic and Search Discussion: Midterm Exam Review. Friday, 19 October 2007 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://snipurl.com/v9v3 Course web site: http://www.kddresearch.org/Courses/Fall-2007/CIS730

kanoa
Download Presentation

Lecture 24 of 42

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 24 of 42 Review of Logic and Search Discussion: Midterm Exam Review Friday, 19 October 2007 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://snipurl.com/v9v3 Course web site: http://www.kddresearch.org/Courses/Fall-2007/CIS730 Instructor home page: http://www.cis.ksu.edu/~bhsu Reading for Next Class: Chapters 1-10, 11.1 – 11.2, Russell & Norvig 2nd edition CIS 530 / 730: Artificial Intelligence

  2. Lecture Outline • Today’s Reading: Sections 11.4 – 11.7, 12.1 – 12.4, R&N 2e • Today and Next Monday: Practical Planning • Conditional Planning • Replanning • Monitoring and Execution • Continual Planning • Next Monday: Hierarchical Planning Revisited • Examples: Korf • Real-World Example • Later Next Week: Reasoning under Uncertainty • Basics of reasoning under uncertainty • Probability review • BNJ interface (http://bnj.sourceforge.net) • Graphical models problems • Algorithms CIS 530 / 730: Artificial Intelligence

  3. Summary Points • Previously: Logical Representations and Theorem Proving • Propositional, predicate, and first-order logical languages • Proof procedures: forward and backward chaining, resolution refutation • Today: Introduction to Classical Planning • Search vs. planning • STRIPS axioms • Operator representation • Components: preconditions, postconditions (ADD, DELETE lists) • Next Week: More Classical Planning • Partial-order planning (NOAH, etc.) • Limitations Adapted from slides by S. Russell, UC Berkeley CIS 530 / 730: Artificial Intelligence

  4. Terminology • Classical Planning • Planning versus search • Problematic approaches to planning • Forward chaining • Situation calculus • Representation • Initial state • Goal state / test • Operators • Efficient Representations • STRIPS axioms • Components: preconditions, postconditions (ADD, DELETE lists) • Clobbering / threatening • Reactive plans and policies • Markov decision processes Adapted from slides by S. Russell, UC Berkeley CIS 530 / 730: Artificial Intelligence

More Related