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  

---

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  

---

What do you understand by the term process studio?

0 Answers  

---

In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned

0 Answers  

---

The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b)

0 Answers  

---

---

Explain the various types of industrial robots?

0 Answers  

---

What is travelling salesman problem?

0 Answers  

---

What is continuous-path control in the robotics?

0 Answers  

---

What brute-force search strategies?

0 Answers  

---

What are difficulties in nlu?

0 Answers  

---

_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

1 Answers  

---

What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent

0 Answers  

---