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
Answer Posted / neer
a) Forward Searching
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
What do you understand by the term, the robotics?
Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
Which is the best way to go for game playing problem?
How to send information from the robot sensors to the robot controllers?
Suppose I have gmail account, I want to delete all the mails in my inbox having the same name(for eg., Orkut). I have thousands of mails like that. So, how can I delete all the mails having single name. Is there any option provided in gmail?
What are aspects of robotics?
What are industrial robots? Explain the various types of industrial robots?
Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators
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
What is servo controlled robot?
In artificial intelligence, what do semantic analyses used for?
What is augmented human intelligence?
What are some of the benefits of using a blue prism for robotics?
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4