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  

---

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

0 Answers  

---

In inductive logic programming what needed to be satisfied?

0 Answers  

---

In which of the following agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

1 Answers  

---

What is a difference in robot system and ai programs?

0 Answers  

---

---

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

0 Answers  

---

What is servo controlled robot?

0 Answers  

---

Which is not the commonly used programming language for AI? a) PROLOG b) Java c) LISP d) Perl e) Java script

1 Answers  

---

What do you understand by numerical control?

0 Answers  

---

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

1 Answers  

---

What are the basic aspects of the robotics?

0 Answers  

---

The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

0 Answers  

---