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

0 Answers  

---

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

1 Answers  

---

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

0 Answers  

---

Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS d) None of the mentioned

0 Answers  

---

What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned

0 Answers  

---

 Which method is effective for escaping from local minima? a) Updating heuristic estimate b) Reducing heuristic estimate c) Eliminating heuristic estimate d) None of the mentioned

2 Answers  

---

How to send information from the robot sensors to the robot controllers?

0 Answers  

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

0 Answers  

---

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

0 Answers  

---

What are the laws of the robotics?

0 Answers  

---

What is travelling salesman problem?

0 Answers  

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---