Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions
Last Answer : d) Both Literals & Actions
Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy
Last Answer : c) Graph-Plan
Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned
Last Answer : a) Identical
Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned
Last Answer : a) Propositional planning problem
Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned
Last Answer : b) Graphplan
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs c) Trees d) Neural Networks
Last Answer : a) Decision tree
Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree
Last Answer : d) Decision tree
Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph
Last Answer : b) Directed graph
Description : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges
Last Answer : a) By maintaining a list of visited vertices
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
Description : What is called as multiple connected graph?
Last Answer : A multiple connected graph is one in which two nodes are connected by more than one path.
Description : Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning
Last Answer : a) Hierarchical planning
Description : Which technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned
Last Answer : b) specification by example
Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring
Last Answer : c) Execution monitoring
Description : A re-planning agent uses execution monitoring and splices in repairs as needed. a) True b) False
Last Answer : a) True
Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic
Last Answer : a) Deterministic
Description : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned
Last Answer : b) Hierarchical task network (HTN)
Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned
Last Answer : b) SatPlan
Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems
Last Answer : a) Search & Logic
Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned
Last Answer : b) Linearization
Description : Planning problem can be described as a propositional logic. a) True b) False
Description : Planning graphs works only for prepositional planning problems. a) True b) False
Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs
Last Answer : d) Planning Graphs
Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned
Last Answer : a) Planning problem
Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : d) Both Planning problem & Partial order planning
Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal
Last Answer : a) Most-constrained variable
Description : A constructive approach in which no commitment is made unless it is necessary to do so, is ____________ a) Least commitment approach b) Most commitment approach c) Nonlinear planning d) Opportunistic planning
Last Answer : a) Least commitment approach
Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan
Last Answer : d) Hierarchical plan
Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False
Description : Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False
Last Answer : b) False
Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False
Description : Partial-order planning is the opposite of total-order planning. a) True b) False
Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False
Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : b) Partial order planning
Description : Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned
Last Answer : d) All of the mentioned
Description : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination
Last Answer : d) Termination
Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning
Last Answer : a) Regression planning
Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned
Last Answer : a) Progression planning
Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search
Last Answer : b) State-space search
Description : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
Last Answer : c) CSP
Description : Artificial Intelligence has its expansion in the following application. a) Planning and Scheduling b) Game Playing c) Diagnosis d) All of the mentioned
Description : Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned
Last Answer : a) hierarchical planning
Description : Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist
Last Answer : a) Detect when a solution has been found
Description : Which kind of planning consists of successive representations of different levels of a plan? a. hierarchical planning b. non-hierarchical planning c. All of the above d. project planning
Last Answer : a. hierarchical planning
Description : Artificial Intelligence has its expansion in the following application. a. Planning and Scheduling b. Game Playing c. Robotics d. All of the above
Last Answer : d. All of the above
Description : Define conditional planning.
Last Answer : Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if – then rules.
Description : What are the ways in which incomplete and incorrect information’s can be handled in planning?
Last Answer : They can be handled with the help of two planning agents namely, i. Conditional planning agent. ii. Replanning agent.
Description : What are the different types of planning?
Last Answer : The different types of planning are as follows: i. Situation space planning. ii. Progressive planning. iii. Regressive planning. iv. Partial order planning. v. Fully instantiated planning.