To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals
No Answer is Posted For this Question
Be the First to Post Answer
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data
An agent is composed of, a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program
What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent
Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both a & b d) None of the mentioned
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False
In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b
What is a robot?
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals
The game of Poker is a single agent. a) True b) False
Explain the various types of industrial robots?