In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b
2351Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution
1806A 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
1625_______________ 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 2166Hill-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
3683One 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
1652Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
1484Hill 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 2894Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above
3408___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
3291_________________ 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)
1655Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku
2662What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state
1766The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search
1 3149To 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
1797Post New AI Robotics Questions
Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned
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
The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b)
What are difficulties in nlu?
What are the capabilities of expert systems?
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
What are industrial robots? Explain the various types of industrial robots?
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
What is a robot locomotion?
Which is the best way to go for game playing problem?
What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)
What is lisp?
Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution
What are the laws of the robotics?
Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search