A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

0 Answers  

---

What are benefits of expert systems?

0 Answers  

---

What is prolog used in artificial intelligence?

0 Answers  

---

When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

3 Answers  

---

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

0 Answers  

---

---

What is servo controlled robot?

0 Answers  

---

 What is the expansion if PEAS in task environment? a) Peer, Environment, Actuators, Sense b) Perceiving, Enivornment, Actuators, Sensors c) Performance, Environment, Actuators, Sensors, d) None of the mentioned

1 Answers  

---

Hill-Climbing algorithm terminates when, a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) Local Min/Max is achieved

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 among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state

0 Answers  

---

How to send information from the robot sensors to the robot controllers?

0 Answers  

---

In which of the following agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

1 Answers  

---