Fully observable environment
Agent's sensors give it access to the complete state of the environment at each
point in time
Partially observable environment
An environment might be partially observable because of noisy and inaccurate
sensors or because parts of the state are simply missing from the sensor data
Deterministic
If the next state of environments is completely determined by the current state and
the action executed by the agent
Stochastic
If the next state of environments is NOT completely determined by the current
state and the action executed by the agent
Discrete environment
An environment is said to be discrete if its state-space is finite and, for each state,
there is only finitely many precepts to be perceived and only finitely many actions
to choose from. The game of chess is an example of a discrete environment
Continuous environment
A continuous environment has infinitely many distinct sates, infinitely many
precepts and infinitely many actions to choose from at any state. Taxi driving is an
example of a continuous environment
Agent function
The agent function maps precept sequence to action
Agent program
The agent program implements the agent
function
State-space
complete set of possible states that an agent or system can be in at any given time.
, Rational agent
is one that acts so as to achieve the best outcome or, when there is uncertainty, the
best expected outcome
Dynamic environment
If the environment can change while an agent is deliberating
Static environment
The environment cannot change while an agent is deliberating
Semi-dynamic environment
If the environment does not change but the agent’s performance score does
Model-based reflex agent
keeps track of the current state of the world, using an internal model. It then
chooses an action in the same way as the reflex agent
Explain the difference between a single and multi-agent environment
In a single-agent environment, an agent solves a problem independently. In a multi-
agent environment, the behavior of one agent is influenced by the behavior of
another agent
Explain why we call this agent a problem-solving agent
We call this agent a problem-solving agent because it is specifically designed to
analyze and solve the problem. It exhibits problem-solving capabilities by
generating a plan and executing actions to achieve the desired outcome
Explain what an admissible heuristic is
An admissible heuristic is one that never overestimates the true cost of reaching the
nearest goal
Explain what is meant by consistence with respect to heuristic searches
If the heuristic function of a graph-search strategy is consistent, then the algorithm
is guaranteed to be optimal (and complete when the branching factor is finite)
For every node in the search tree, the following inequality must hold
h(n) <= c(n, a, n`) + h(n`)