Answer Posted / rasha

True

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False

2250

---

What are components of robotics?

944

---

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 does the language of fopl consists of?

886

---

Name some expert system technology?

912

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

4111

---

Name of the industry which highly used the robots?

987

---

What is a robot locomotion?

935

---

What are the capabilities of expert systems?

901

---

What is hidden markov model (hmms) is used?

969

---

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

2192

---

What is 'human-robot interaction'?

893

---

Why do we need technology intelligence?

1020

---

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

2307

---

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

2003

---