Mention the difference between statistical ai and classical ai ?

0 Answers  

---

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False

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  

---

Name of the industry which highly used the robots?

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  

---

List the name of the areas where the robotics can be applied?

0 Answers  

---

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent

0 Answers  

---

What is autonomous robot?

0 Answers  

---

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

0 Answers  

---

Performance Measures are fixed for all agents. State true or false a) True b) False

1 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  

---