Answer / ahsan habib

Abstraction

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

0 Answers  

---

How logical inference can be solved in propositional logic?

0 Answers  

---

What is continuous-path control in the robotics?

0 Answers  

---

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

0 Answers  

---

What is artificial intelligence robotics?

0 Answers  

---

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

0 Answers  

---

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  

---

What is single agent pathfinding problems?

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  

---

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  

---

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  

---

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

1 Answers  

---