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
No Answer is Posted For this Question
Be the First to Post Answer
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 are the laws of the robotics?
Which process makes different logical expression looks identical?
Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
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 do you understand by 'humanoid robot'?
What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned
The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) Environment
What are industrial robots? Explain the various types of industrial robots?
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
_______________ 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
What are components of robotics?