Scribd
Upload
12 views1 page

Ai Search Optimzation Lecture 2 From Stanford University

AI search and optimization techniques can be divided into state space search and local search. State space search involves searching through possible states to find a goal state, while local search uses mathematical optimization to incrementally refine solutions. Popular algorithms include adversarial search, gradient descent, evolutionary computation, and swarm intelligence approaches.

Uploaded by

perolofsson5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
12 views1 page

Ai Search Optimzation Lecture 2 From Stanford University

AI search and optimization techniques can be divided into state space search and local search. State space search involves searching through possible states to find a goal state, while local search uses mathematical optimization to incrementally refine solutions. Popular algorithms include adversarial search, gradient descent, evolutionary computation, and swarm intelligence approaches.

Uploaded by

perolofsson5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

AI Search and optimazation

AI can solve many problems by intelligently searching through many possible


solutions.[70] There are two very different kinds of search used in AI: state space
search and local search.
State space search
State space search searches through a tree of possible states to try to find a goal
state.[71] For example, planning algorithms search through trees of goals and
subgoals, attempting to find a path to a target goal, a process called means-ends
analysis.[72]
Simple exhaustive searches[73] are rarely sufficient for most real-world problems:
the search space (the number of places to search) quickly grows to astronomical
numbers. The result is a search that is too slow or never completes.[18]
"Heuristics" or "rules of thumb" can help to prioritize choices that are more
likely to reach a goal.[74]
Adversarial search is used for game-playing programs, such as chess or Go. It
searches through a tree of possible moves and counter-moves, looking for a winning
position.[75]
Local search
gradient descent for 3 different starting points. Two parameters (represented by
the plan coordinates) are adjusted in order to minimize the loss function (the
height).
Local search uses mathematical optimization to find a solution to a problem. It
begins with some form of guess and refines it incrementally.[76]
Gradient descent is a type of local search that optimizes a set of numerical
parameters by incrementally adjusting them to minimize a loss function. Variants of
gradient descent are commonly used to train neural networks.[77]
Another type of local search is evolutionary computation, which aims to iteratively
improve a set of candidate solutions by "mutating" and "recombining" them,
selecting only the fittest to survive each generation.[78]
Distributed search processes can coordinate via swarm intelligence algorithms. Two
popular swarm algorithms used in search are particle swarm optimization (inspired
by bird flocking) and ant colony optimization (inspired by ant trails).[79]

You might also like