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
- 1 Answers
- 2013 Views
- I also Faced
- E-Mail Answers
Answer Posted / neer
a) Forward Searching
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
How to send information from the robot sensors to the robot controllers?
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What are industrial robots?
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b
What is the degree of freedom in the robotics? How can it be determined?
What is meant by simulated annealing in artifical intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
What are roles in ai career?
In artificial intelligence, what do semantic analyses used for?
What is the function of the third component of the planning system?
Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem 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
What are some of the benefits of using a blue prism for robotics?
