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)
No Answer is Posted For this Question
Be the First to Post Answer
Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
What is continuous-path control in the robotics?
Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b
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
What is travelling salesman problem?
Performance Measures are fixed for all agents. State true or false a) True b) False
What is artificial intelligence robotics?
Why do we implement ai in the robots?
How logical inference can be solved in propositional logic?
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
Agents behavior can be best described by a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing
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)