What is lisp?

0 Answers  

---

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

1 Answers  

---

One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution

0 Answers  

---

What is hidden markov model (hmms) is used?

0 Answers  

---

 What is the expansion if PEAS in task environment? a) Peer, Environment, Actuators, Sense b) Perceiving, Enivornment, Actuators, Sensors c) Performance, Environment, Actuators, Sensors, d) None of the mentioned

1 Answers  

---

What is called as exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) Both b & c

1 Answers  

---

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

0 Answers  

---

In hmm’s, what are the possible values of the variable?

0 Answers  

---

What is 'human-robot interaction'?

0 Answers  

---

Describe the various phases of a robotics life cycle?

0 Answers  

---

Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both a & b d) None of the mentioned

1 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  

---