Interested to Buy Any Domain ? << Click Here >> for more details...
When do we call the states are safely explorable?
a) A goal state is unreachable from any state
b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned
- 3 Answers
- 7111 Views
- I also Faced
- E-Mail Answers
Post New Answer View All Answers
___________ 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
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 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 is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned
What is a robot locomotion?
What are components of robotics?
Why do we need technology intelligence?
Mention the difference between statistical ai and classical ai ?
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit
What are industrial robots?
What is meant by simulated annealing in artifical intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary
A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
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
