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  

---

What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)

1 Answers  

---

What is computer vision?

0 Answers  

---

What is the pneumatic system in the robotics?

0 Answers  

---

Explain the various types of industrial robots?

0 Answers  

---

 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

0 Answers  

---

What are various types of sensors used in the robotics?

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  

---

_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)

0 Answers  

---

 ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the above

1 Answers  

---

What is travelling salesman problem?

0 Answers  

---

Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

0 Answers  

---