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
What is autonomous robot?
Hill-Climbing algorithm terminates when, a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) Local Min/Max is achieved
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)
Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
What are actuators in the robotics?
Name of the industry which highly used the robots?
What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
What is continuous-path control in the robotics?
Categorize Crossword puzzle in Fully Observable / Partially Observable. a) Fully Observable b) partially Observable
A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False
. What is state space? a) The whole problem b) Your Definition to a problem c) Problem you design d) Representing your problem with variable and parameter
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