The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False

0 Answers  

---

What is servo controlled robot?

0 Answers  

---

Why do we need technology intelligence?

0 Answers  

---

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

0 Answers  

---

What are components of robotics?

0 Answers  

---

What is the degree of freedom in the robotics?

0 Answers  

---

What are the basic aspects of the robotics?

0 Answers  

---

The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

0 Answers  

---

 Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b

0 Answers  

---

For building a bayes model how many terms are required?

0 Answers  

---

What is user interface?

0 Answers  

---

Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c

0 Answers  

---