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
No Answer is Posted For this Question
Be the First to Post Answer
how we install a artificial intelligence software to our computer ?
A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
What is a robot locomotion?
How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
What is autonomous robot?
Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above
What are the laws of the robotics?
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
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
What is the future of the robotics?
In artificial intelligence, what do semantic analyses used for?
AI Algorithms (74)
AI Natural Language Processing (96)
AI Knowledge Representation Reasoning (12)
AI Robotics (183)
AI Computer Vision (13)
AI Neural Networks (66)
AI Fuzzy Logic (31)
AI Games (8)
AI Languages (141)
AI Tools (11)
AI Machine Learning (659)
Data Science (671)
Data Mining (120)
AI Deep Learning (111)
Generative AI (153)
AI Frameworks Libraries (197)
AI Ethics Safety (100)
AI Applications (427)
AI General (197)
AI AllOther (6)