One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution

0 Answers  

---

How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4

0 Answers  

---

What is called as exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) Both b & c

1 Answers  

---

Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above

0 Answers  

---

What is the degree of freedom in the robotics? How can it be determined?

0 Answers  

---

---

List some of the various tools used in robotics?

0 Answers  

---

What is a robot?

0 Answers  

---

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

0 Answers  

---

What are the laws of the robotics?

0 Answers  

---

What are difficulties in nlu?

0 Answers  

---

for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?

0 Answers  

---

What is prolog used in artificial intelligence?

0 Answers  

---