Answer Posted / fatin

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

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

1910

---

 What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b

2327

---

What are roles in ai career?

925

---

What is the degree of freedom in the robotics?

898

---

 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

4936

---

Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

1776

---

What are difficulties in nlu?

1025

---

What does the language of fopl consists of?

886

---

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

1110

---

What are aspects of robotics?

918

---

What are benefits of expert systems?

897

---

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

2169

---

Which was the first industrial robot?

872

---

Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

1607

---

What are application domains of computer vision?

920

---