Académique Documents
Professionnel Documents
Culture Documents
Chapter 1 Introduction
1. What is AI?
2. What is the Turing Test?
a. Natural language processing
b. Knowledge representation
c. Automated reasoning
d. Machine learning
e. Computer vision
f. Robotics
3. Relations between physical stimuli and intelligence?
4. Thinking humanly, thinking rationally, and acting rationally.
5. Acting rationally: agents and rational agents (intelligent agents).
6. Perfect rationality and limited rationality.
7. Algorithms, incompleteness theorem, tractability, and NPcompleteness.
8. What can AI do today?
a. Robotic vehicles
b. Speech recognition
c. Autonomous planning and scheduling
d. Game playing
e. Spam fighting
f. Logistics planning
g. Robotics
h. Language translation
1. Local
a.
b.
c.
2.
3.
4.
5.
6.
7.
search algorithms
They operate in a current node
They use very little memory, usually a constant one.
They find a solution in a reasonable time in infinite or
continuous spaces, compared to the systematic search
algorithms that are unsuitable.
State space landscape
a. Global minimum
b. Global maximum
c. Complete algorithm
d. Optimal algorithm
Hill climbing
a. Hill climbing steepest ascend incomplete goes only uphill.
b. Alias greedy local search
c. When hill climb gets stuck?
i. Local maxima
ii. Ridges
iii. Plateau
d. Stochastic Hill Climbing
e. First choice Hill Climbing
f. Random Restart Hill Climbing at most cases complete
Simulated annealing
a. Combination between random walk (which is complete but
inefficient) and hill climb.
b. Gradient descent ping pong ball crevice example.
Local beam search
a. Generates k states rather than just one. K states are generated
randomly, at each step the successors of all k states are
generated, if one of them is the goal, algorithm halts, otherwise
chooses the best k states form all the states. In a local beam
search, useful information is passed among the parallel search
threads.
Stochastic local beam search
a. It chooses randomly form k states based in probability.
Genetic algorithm
a. A variant of stochastic beam search.
b. Population k states generated at the beginning.
c. Individual part of population.
d. Fitness function returns higher values for better states.
e. Selection made in probability means.
f. Crossover
g. Mutation
Chapter 7 Logical
1. Knowledge based agents.
a.