COMPSCI 171 Lecture Notes - Lecture 2: Search Algorithm, Problem Solving, Solution Set
10 Dec 2018
School
Department
Course
Professor
Document Summary
Cs 171 - lecture 2 - state space representations and search algorithms. Formulate what to do as a search problem. If no solution in the current search space: Use search to find a space that does contain a solution. Solve original problem in new search space. Sometimes want to search in unknown spaces. Want to search based on agent"s actions with unknown connections. D"s algorithm won"t work in infinite spaces. Many actions spaces are infinite or effectively infinite. Graphs - have vertices (nodes), edges (arcs), directed arcs, and paths. A path from the state state to any goal state. May desire an optimal path (lowest cost or highest value) Generate a part of the search space that contains a solution. 1: actions , transition model , goal test , path cost state. Set of actions available in state s. Sum of distances, number of actions executed, etc. State that results from action a in state s.
