Question: Assessment due date is 2 0 2 4 - 0 9 - 2 5 , 2 3 : 5 9 IST Last recorded submission :
Assessment due date is : IST
Last recorded submission : : IST
point
Assertion A : In realworld domains, agents have to deal with both incomplete and incorrect information.
Reason R : Incompleteness arises because the world does not necessarily match the agent's model of it
A Both A and R are true and R is the correct explanation for A
B Both A and R are true but R is not the correct explanation for A
C A is True but R is False
D A is false but R is True
point
provides ways and means of weighing up the desirability of goals and the likelihood of achieving them.
A Decision Theory
B Utility Theory
C Probability Theory
D Bayesian Networks
point
provides a general, concise representation for large POMDP, so they can be used as inputs for any POMDP algorithm including value and policy iteration methods.
A Bayesian Networks
B Decision Networks
C Dynamic Decision Networks
D Dynamic Belief Networks
point
STRIPS is an alternative representation to the pure situation calculus for planning.
I. Hierarchical Plans cannot be expressed in STRIPS.
II STRIPS operators are essentially propositional.
III. Real world projects need a better model of time than that in STRIPS.
Which of the above statements are correct?
A Only Statements I and II
B Statements I, II and III
C Only Statements II and III
D None.
point
A Markov Decision Process is a four tuple where S is the finite set of states, A is the finite set of actions and R is the cost or reward being in state s T is the transition model which specifies.
A Probability of executing action a in state s at time
B Probability of at time t given action a in state s at time t
C Probability of s at time t given actions in states upto time t
D Probability of executing action a in state at time t
point
Sequential decision problems, which include utilities, uncertainty, and sensing generalize the search and planning problems. Transition model refers to the following:
A Set of probabilities associated with the possible transitions between states after any given action.
B A complete mapping from states to actions.
C Function be specified for the agent in order to determine the value of an action.
D Specification of the outcome probabilities for each action in each possible state.
point
Value Iteration is an algorithm for computing an optimal policy. The basic idea includes
A Computing the utility of each state.
B Use state utilities to select an optimal action in each state.
C Calculate a new Maximum Expected Utility policy based on computed utilities.
D Start with a random policy and calculate utilities based on if that policy were executed.
point
Assertion A: In complex realworld projects, it is common to use scheduling tools from Operations Research.
Reason R : Scheduling tools essentially take a hand constructed complete partialorder plan and generate an optimal schedule for it
A Both A and R are true and R is the correct explanation for A
B Both A and R are true but R is not the correct explanation for A
C A is True but R is False
D A is false but R is True
point
Policy Iteration is an alternate algorithm for computing an optimal policy. The basic idea includes
A Computing the utility of each state.
B Use state utilities to select an optimal action in each state.
C Calculate a new Maximum Expected Utility policy based on computed utilities.
D Start with a random policy and calculate utilities based on if that policy were executed.
point
Assertion A : The sensor model in a belief network is the Conditional Probability Table CPT associated with the percept node.
Reason R : If the sensor gives a perfect report of the state, then the sensor model the CPT will be purely deterministic.
A Both A and R are true and R is the correct explanation for A
B Both A and R are true but R is not the correct explanation for A
C A is True but R is False
D A is false but R is True
Submit
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
