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  

---

Differentiate between the iqbot, metabot and a taskbot?

0 Answers  

---

Mention the difference between statistical ai and classical ai ?

0 Answers  

---

 A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

0 Answers  

---

What is continuous-path control in the robotics?

0 Answers  

---

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

1 Answers  

---

Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS d) None of the mentioned

0 Answers  

---

Which are necessary for an agent to solve an online search problem? a) Actions b) Step-cost function c) Goal-test d) All of the mentioned

0 Answers  

---

How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

0 Answers  

---

What is the use of the microcontroller in the robotics?

0 Answers  

---

Constraint satisfaction problems on finite domains are typically solved using a form of ___________. a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) DFS/BFS Search Algorithms

0 Answers  

---

Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both a & b d) None of the mentioned

1 Answers  

---