What brute-force search strategies?

0 Answers  

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

0 Answers  

---

Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators

1 Answers  

---

 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 roles in ai career?

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 ai? Why do we implement ai in the robots?

0 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  

---

What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary

0 Answers  

---

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

0 Answers  

---

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

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  

---