1 / 12

CS482/682 Artificial Intelligence

Computer Science & Engineering, University of Nevada, Reno. CS482/682 Artificial Intelligence. Lecture 8: Constraint Satisfaction Problems and Logic-based Inference. 17 September 2009 Instructor: Kostas Bekris. Search-based Problems. Search Problems

Télécharger la présentation

CS482/682 Artificial Intelligence

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. Computer Science & Engineering, University of Nevada, Reno CS482/682Artificial Intelligence • Lecture 8: • Constraint Satisfaction Problems • and Logic-based Inference 17 September 2009 Instructor: Kostas Bekris

  2. Search-based Problems Search Problems Given the state-space, a start state and a successor function Find a goal state Constraint Satisfaction Problems Local Search Classical Search • Uninformed • BFS • Uniform-First • DFS • Iterat.-Deep. DFS • Bidirectional • Informed • Best-First Search • Greedy BestFS • A* • Hill-climbing • Hill-climbing with random restarts • Simulated Annealing • Local Beam Search • Genetic Algorithms

  3. Constraint-Satisfaction Problems • Discrete and Finite Domains • Map-Coloring • 8-queens puzzle • Boolean CSPs • Satisfiability problems (prototypical NP-Complete problem) • Discrete and Infinite Domains • Scheduling over the set of integers (e.g., all the days after today) • Continuous Domains • Scheduling over continuous time • Linear Programming problems • Constraints are linear inequalities over the variables • Additional examples: • crossword puzzles, cryptography problems, Sudoku • and many classical NP-Complete problems: • clique problems, vertex-cover, traveling salesman, subset-sum, hamiltonian-cycle

  4. Constraint Satisfaction Problem Example

  5. 1. Backtracking Search

  6. 2. Local Search

  7. 1. Backtracking: Forward Checking

  8. 1. Backtracking: Intelligent Backjumping Assume WA=red and NSW =red, then assign T, NT, Q, SA • SA will cause a conflict, whatever we do... • Where should the algorithm backjump?

  9. Wumpus World

  10. Wumpus World

  11. Wumpus World

  12. Wumpus World

More Related