A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False

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  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

0 Answers  

---

What is servo controlled robot?

0 Answers  

---

What are applications of expert system?

0 Answers  

---

How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

1 Answers  

---

 In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

0 Answers  

---

 Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

0 Answers  

---

What is the pneumatic system in the robotics?

0 Answers  

---

Name the basic unit of a robot which can be programmed to give instructions to the robot?

0 Answers  

---

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

0 Answers  

---

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

0 Answers  

---