____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the above

1 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  

---

In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned

0 Answers  

---

What do you understand by 'humanoid robot'?

0 Answers  

---

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  

---

What is autonomous robot?

0 Answers  

---

What are actuators in the robotics?

0 Answers  

---

_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

1 Answers  

---

Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b

0 Answers  

---

What are benefits of expert systems?

0 Answers  

---

Name some expert system technology?

0 Answers  

---

Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

0 Answers  

---