Answer / memo

1

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

0 Answers  

---

Differentiate between the iqbot, metabot and a taskbot?

0 Answers  

---

What is continuous-path control in the robotics?

0 Answers  

---

In top-down inductive learning methods how many literals are available? What are they?

0 Answers  

---

What are application domains of computer vision?

0 Answers  

---

What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  

---

 What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators 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  

---

What is the function of the third component of the planning system?

0 Answers  

---

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  

---

How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

0 Answers  

---

What are various types of sensors used in the robotics?

0 Answers  

---