Exam 4: State Space Planning and Ao Graph in AI
Exam 1: Problem Solving, Planning, and Expert Systems25 Questions
Exam 2: Knowledge Representation and Inference Mechanisms in Artificial Intelligence23 Questions
Exam 3: Artificial Intelligence and Search Algorithms24 Questions
Exam 4: State Space Planning and Ao Graph in AI21 Questions
Select questions type
What is true aboout Iterative Deepening DFS?
Free
(Multiple Choice)
4.9/5
(37)
Correct Answer:
C
In Forward State Space Planning , Progress ( A, S) function returns ___________________
Free
(Multiple Choice)
4.9/5
(43)
Correct Answer:
A
Tabu search is designed __________________________
Free
(Multiple Choice)
4.9/5
(39)
Correct Answer:
B
effects? (a) in Forward State Space Planning denotes ___________________
(Multiple Choice)
4.9/5
(30)
Plan representation in Plan Space Planning is done with__ -----------links
(Multiple Choice)
4.9/5
(36)
How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?
(Multiple Choice)
4.8/5
(37)
In Backward State Space Planning ,regress(A,G) that returns ______________________________
(Multiple Choice)
4.8/5
(46)
What cost is assumed for arc while solving AO* progress example?
(Multiple Choice)
4.7/5
(41)
Arc consistency in AO graph is concernd with ____________________________________
(Multiple Choice)
4.9/5
(39)
Backward State Space Planning (BSSP)_______________________________
(Multiple Choice)
4.7/5
(38)
Showing 1 - 20 of 21
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)