Constraint satisfaction problems on finite domains are typically solved using a form of ___________.
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) DFS/BFS Search Algorithms
No Answer is Posted For this Question
Be the First to Post Answer
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
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c
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
Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above
What are various types of sensors used in the robotics?
What is a microcontroller? What is the use of the microcontroller in the robotics?
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
What do you understand by the term process studio?
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b
List the name of the areas where the robotics can be applied?
Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b