46 + Interview Questions in Planning And Acting In The Real World in Artificial Intelligence Page 1 InterviewSolution

1.	A re-planning agent uses execution monitoring and splices in repairs as needed.(a) True(b) FalseI had been asked this question in final exam.I would like to ask this question from Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT ANSWER is (a) True To EXPLAIN: NONE.

Discussion

2.	Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.(a) True(b) FalseThe question was posed to me by my school principal while I was bunking the class.My question is based upon Planning and Acting in the Real World topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT answer is (a) True The best I can explain: Conditional plans do exists in real world planning problems. Incomplete INFORMATION can be dealt by planning to use SENSING ACTIONS to obtain the information NEEDED.

Discussion

3.	____________ 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 mentionedThis question was posed to me in a job interview.My question is taken from Planning and Acting in the Real World topic in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct choice is (b) HIERARCHICAL task network (HTN) To EXPLAIN I would say: None.

Discussion

4.	Standard planning algorithms assumes environment to be ___________(a) Deterministic(b) Fully observable(c) Single agent(d) StochasticI had been asked this question in an interview for job.I want to ask this question from Planning and Acting in the Real World in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct choice is (a) DETERMINISTIC Easiest explanation: It ASSUMES COMPLETE and correct INFORMATION, deterministic and fully-observable ENVIRONMENT, which many domains violates.

Discussion

5.	__________ algorithm translates a planning problem in to prepositional axioms.(a) GraphPlan(b) SatPlan(c) Greedy(d) None of the mentionedThe question was posed to me during a job interview.This intriguing question originated from Planning and Acting in the Real World in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Right choice is (B) SatPlan Best explanation: The SATPLAN algorithm translates a planning problem into propositional AXIOMS and APPLIES a SATISFIABILITY algorithm to find a model that corresponds a VALID plan.

Discussion

6.	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 SystemsThis question was addressed to me during an online exam.The question is from Planning and Acting in the Real World in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT CHOICE is (a) Search & Logic The best I can explain: NONE.

Discussion

7.	What is the other name of each plan resulted in partial order planning?(a) Polarization(b) Linearization(c) Solarization(d) None of the mentionedThe question was asked in class test.This interesting question is from Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct OPTION is (B) Linearization To ELABORATE: Each and every total order plan is ALSO called as linearization of the partial-order plan.

Discussion

8.	_____________ 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) GreedyThis question was addressed to me in examination.Origin of the question is Planning and Acting in the Real World topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT CHOICE is (C) Graph-Plan Easy EXPLANATION: NONE.

Discussion

9.	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 GraphsThe question was asked by my school teacher while I was bunking the class.This intriguing question originated from Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Right option is (d) PLANNING Graphs For explanation I WOULD say: A planning GRAPH can be USED to give better HEURISTIC estimates.

Discussion

10.	Planning problem can be described as a propositional logic.(a) True(b) FalseThe question was asked in an online interview.My question is based upon Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct choice is (a) True Best explanation: YES, The approach we take is BASED on testing the satisfiability of a logical sentence rather than on proving a theorem. We will be finding models of propositional sentences that look like this: Initial STATE /\ all possible action DESCRIPTIONS /\ goal.

Discussion

11.	Planning graphs consists of ____________(a) a sequence of levels(b) a sequence of levels which corresponds to time steps in the plan(c) a sequence of actions which corresponds to the state of the system(d) none of the mentionedI have been asked this question in exam.This is a very interesting question from Planning and Acting in the Real World in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct choice is (b) a sequence of levels which corresponds to TIME steps in the plan Best explanation: Planning GRAPHS is a sequence of levels, which corresponds to time steps in the plan where level 0 is the INITIAL state at START.

Discussion

12.	Planning graphs works only for prepositional planning problems.(a) True(b) FalseThe question was posed to me during an online exam.The origin of the question is Planning and Acting in the Real World topic in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Right option is (a) True Best explanation: Planning graphs work only for PROPOSITIONAL planning problems-ones with no variables. Both STRIPS and ADL representations can be propositionalized. For problems with large numbers and objects, this could result in a very substantial BLOWUP in the NUMBER of action schemata.

Discussion

13.	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 mentionedThis question was addressed to me in homework.The origin of the question is Planning and Acting in the Real World in section Planning and Acting in the Real World of Artificial Intelligence
Answer» CORRECT CHOICE is (a) PLANNING problem Easiest EXPLANATION: NONE.

Discussion

14.	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 planningThis question was addressed to me by my school teacher while I was bunking the class.This is a very interesting question from Planning and Acting in the Real World topic in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct option is (d) Both PLANNING problem & PARTIAL ORDER planning For explanation I WOULD say: None.

Discussion

15.	What is called inconsistent support?(a) If two literals are not negation of other(b) If two literals are negation of other(c) Mutually exclusive(d) None of the mentionedThis question was addressed to me in examination.The query is from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT answer is (b) If two LITERALS are negation of other The best I can EXPLAIN: If two literals are at the same LEVEL if one is the negation of another is called inconsistent support.

Discussion

16.	How many conditions are available between two actions in mutex relation?(a) 1(b) 2(c) 3(d) 4I got this question during an internship interview.Question is from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Right choice is (c) 3 Easy EXPLANATION: The three CONDITIONS AVAILABLE on mute relationship are inconsistent effects, INTERFERENCE and competing NEEDS.

Discussion

17.	When will further expansion is unnecessary for planning graph?(a) Identical(b) Replicate(c) Not identical(d) None of the mentionedI have been asked this question in an online quiz.I want to ask this question from Graph Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT answer is (a) Identical The best I can explain: Every SUBSEQUENT LEVELS will be identical, So further EXPANSION is UNNECESSARY.

Discussion

18.	What is meant by persistence actions?(a) Allow a literal to remain false(b) Allow a literal to remain true(c) Allow a literal to remain false & true(d) None of the mentionedI had been asked this question during an internship interview.Query is from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct choice is (b) Allow a literal to remain true For explanation: Calculus allows a literal to remain true from one situation to the next if no ACTION alters it. It is CALLED as persistence action.

Discussion

19.	What is the starting level of planning graph?(a) Level 3(b) Level 2(c) Level 1(d) Level 0I got this question in an internship interview.This intriguing question originated from Graph Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT option is (d) LEVEL 0 To explain I would say: None.

Discussion

20.	What are present in each level of planning graph?(a) Literals(b) Actions(c) Variables(d) Both Literals & ActionsI got this question by my school teacher while I was bunking the class.I'm obligated to ask this question of Graph Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct CHOICE is (d) Both LITERALS & Actions To EXPLAIN: Each and every level in the PLANNING graph contains a set of literals and a set of actions.

Discussion

21.	Which kind of problem are suitable for planning graph?(a) Propositional planning problem(b) Planning problem(c) Action problem(d) None of the mentionedThis question was addressed to me by my school teacher while I was bunking the class.The query is from Graph Planning in section Planning and Acting in the Real World of Artificial Intelligence
Answer» Right answer is (a) PROPOSITIONAL PLANNING problem To explain: Planning GRAPH work only for propositional planning problem with no variables.

Discussion

22.	What are present in the planning graph?(a) Sequence of levels(b) Literals(c) Variables(d) Heuristic estimatesThe question was posed to me in an interview for job.Question is taken from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct option is (a) SEQUENCE of levels The best I can explain: A PLANNING graph CONSISTS of sequence of levels CORRESPOND to time steps.

Discussion

23.	Which is used to extract solution directly from the planning graph?(a) Planning algorithm(b) Graphplan(c) Hill-climbing search(d) All of the mentionedI got this question in homework.I need to ask this question from Graph Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct answer is (b) Graphplan For explanation: We can EXTRACT the SOLUTION directly from the planning graph, USING a specialized ALGORITHM called Graphplan.

Discussion

24.	What are not present in start actions?(a) Preconditions(b) Effect(c) Finish(d) None of the mentionedThis question was addressed to me in my homework.This is a very interesting question from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct ANSWER is (a) Preconditions The BEST explanation: Start has no precondition and has as its effects all the LITERALS in the INITIAL state of the planning problem.

Discussion

25.	What are not present in finish actions?(a) Preconditions(b) Effect(c) Finish(d) None of the mentionedThe question was posed to me during an interview for a job.The query is from Partial Order Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct option is (b) Effect Easy EXPLANATION: Finish has no EFFECTS and has as its preconditions the goal LITERALS of the planning ALGORITHM.

Discussion

26.	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 mentionedI had been asked this question in an internship interview.The question is from Graph Planning topic in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT choice is (c) PLANNING GRAPH algorithm For explanation I would say: A SPECIAL data structure called planning graph is used to give BETTER heuristic estimates.

Discussion

27.	Which can be adapted for planning algorithms?(a) Most-constrained variable(b) Most-constrained literal(c) Constrained(d) None of the mentionedThe question was asked during an internship interview.Question is from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct OPTION is (a) Most-constrained variable Easiest explanation: The most-constrained variable heuristic from CSPs can be adapted for PLANNING algorithm and seems to WORK WELL.

Discussion

28.	Which strategy is used for delaying a choice during search?(a) First commitment(b) Least commitment(c) Both First & Least commitment(d) None of the mentionedThis question was posed to me in exam.The doubt is from Partial Order Planning in section Planning and Acting in the Real World of Artificial Intelligence
Answer» Right option is (B) LEAST COMMITMENT Best explanation: The general STRATEGY of delaying a choice during search is called the least commitment strategy.

Discussion

29.	How many possible plans are available in partial-order solution?(a) 3(b) 4(c) 5(d) 6This question was posed to me during an online interview.The question is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct ANSWER is (d) 6 To EXPLAIN: The partial-order SOLUTION corresponds to six possible total-order plans.

Discussion

30.	Which algorithm places two actions into a plan without specifying which should come first?(a) Full-order planner(b) Total-order planner(c) Semi-order planner(d) Partial-order plannerThis question was addressed to me in an interview.I would like to ask this question from Partial Order Planning in chapter Planning and Acting in the Real World of Artificial Intelligence
Answer» The CORRECT CHOICE is (d) Partial-order planner The best I can explain: Any planning algorithm that can place TWO actions into a plan without SPECIFYING which should come first is CALLED partial-order planner.

Discussion

31.	What are present in the empty plan?(a) Start(b) Finish(c) Modest(d) Both Start & FinishThis question was addressed to me during an online exam.This interesting question is from Partial Order Planning in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» CORRECT answer is (d) Both Start & Finish Explanation: The ’empty’ PLAN contains just the start and finish actions.

Discussion

32.	What is the other name of each and every total-order plans?(a) Polarization(b) Linearization(c) Solarization(d) None of the mentionedThe question was asked during an interview.Question is taken from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct CHOICE is (b) Linearization Easiest EXPLANATION: Each and every TOTAL order plan is also CALLED as linearization of the partial-order plan.

Discussion

33.	Which cannot be taken as advantage for totally ordered plan search?(a) Composition(b) State search(c) Problem decomposition(d) None of the mentionedI had been asked this question during an interview.My query is from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT choice is (C) Problem decomposition Explanation: As the SEARCH explore only LINEAR sequences of actions, So they cannot take advantage of problem decomposition.

Discussion

34.	What is the advantage of totally ordered plan in constructing the plan?(a) Reliability(b) Flexibility(c) Easy to use(d) All of the mentionedI have been asked this question by my college director while I was bunking the class.My question is from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» CORRECT answer is (b) FLEXIBILITY Best explanation: TOTALLY ordered plan has the advantage of flexibility in the ORDER in which it constructs the plan.

Discussion

35.	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 planningThis question was addressed to me during an interview.I'm obligated to ask this question of Partial Order Planning in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct option is (a) LEAST commitment approach The best I can explain: Because we are not SURE about the outcome.

Discussion

36.	Which of the following search belongs to totally ordered plan search?(a) Forward state-space search(b) Hill-climbing search(c) Depth-first search(d) Breadth-first searchI got this question during an online interview.This key question is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT ANSWER is (a) Forward state-space search To elaborate: Forward and backward state-space search are particular forms of totally ordered PLAN search.

Discussion

37.	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 planI had been asked this question in exam.My query is from Partial Order Planning topic in portion Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct choice is (d) Hierarchical plan Explanation: A plan that DESCRIBES how to take actions in levels of INCREASING refinement and specificity is Hierarchical (e.g., “Do SOMETHING” becomes the more specific “Go to work,” “Do work,” “Go home.”) Most plans are hierarchical in nature.

Discussion

38.	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) FalseThe question was asked during an interview.The doubt is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT ANSWER is (a) True Easy EXPLANATION: NONE.

Discussion

39.	What are you predicating by the logic: ۷x: €y: loyalto(x, y).(a) Everyone is loyal to someone(b) Everyone is loyal to all(c) Everyone is not loyal to someone(d) Everyone is loyalThis question was posed to me in an online interview.This interesting question is from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct OPTION is (a) Everyone is loyal to someone Best explanation: ۷x denotes Everyone or all, and €y someone and loyal to is the PROPOSITION logic making MAP X to y.

Discussion

40.	Sussman Anomaly can be easily and efficiently solved by partial order planning.(a) True(b) FalseThe question was asked during an online exam.This question is from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct option is (a) True To explain I WOULD SAY: HTTP://en.wikipedia.org/wiki/Sussman_Anomaly.

Discussion

41.	Sussman Anomaly illustrates a weakness of interleaved planning algorithm.(a) True(b) FalseThe question was posed to me in exam.This intriguing question originated from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» The correct option is (b) False For explanation I would say: SUSSMAN ANOMALY illustrates a weakness of NON interleaved PLANNING algorithm.

Discussion

42.	Partial-order planning is the opposite of total-order planning.(a) True(b) FalseI had been asked this question during an online exam.The origin of the question is Partial Order Planning in section Planning and Acting in the Real World of Artificial Intelligence
Answer» Right OPTION is (a) True The BEST explanation: Partial-order planning is the opposite of total-order planning, in which actions are SEQUENCED all at once and for the ENTIRETY of the task at hand.

Discussion

43.	Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole.(a) True(b) FalseI got this question in final exam.I'm obligated to ask this question of Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» CORRECT CHOICE is (a) True Explanation: NONE.

Discussion

44.	Following is/are the components of the partial order planning.(a) Bindings(b) Goal(c) Causal Links(d) All of the mentionedThe question was posed to me in an interview for job.My doubt is from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence
Answer» RIGHT answer is (d) All of the mentioned For explanation I would say: Bindings: The bindings of the algorithm are the connections between specific variables in the action. Bindings, as ordering, only occur when it is absolutely necessary. Causal Links: Causal links in the algorithm are those that categorically order actions. They are not the specific order (1,2,3) of the actions, rather the general order as in Action 2 must come somewhere after Action 1, but before Action 2. Plan Space: The plan space of the algorithm is constrained between its start and finish. The algorithm starts, producing the INITIAL STATE and finishes when all PARTS of the goal is been ACHIEVED.

Discussion

45.	To complete any task, the brain needs to plan out the sequence by which to execute the behavior. One way the brain does this is with a partial-order plan.(a) True(b) FalseI had been asked this question by my college director while I was bunking the class.My query is from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence
Answer» CORRECT ANSWER is (a) True Best EXPLANATION: NONE.

Discussion

46.	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 planningThe question was asked in an online interview.My doubt is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence
Answer» Correct answer is (B) PARTIAL order PLANNING Best explanation: Definition of partial order planning.

Discussion

Explore topic-wise InterviewSolutions in .

A re-planning agent uses execution monitoring and splices in repairs as needed.(a) True(b) FalseI had been asked this question in final exam.I would like to ask this question from Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence

Planning problem can be described as a propositional logic.(a) True(b) FalseThe question was asked in an online interview.My question is based upon Planning and Acting in the Real World topic in portion Planning and Acting in the Real World of Artificial Intelligence

Planning graphs works only for prepositional planning problems.(a) True(b) FalseThe question was posed to me during an online exam.The origin of the question is Planning and Acting in the Real World topic in chapter Planning and Acting in the Real World of Artificial Intelligence

How many conditions are available between two actions in mutex relation?(a) 1(b) 2(c) 3(d) 4I got this question during an internship interview.Question is from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence

What is the starting level of planning graph?(a) Level 3(b) Level 2(c) Level 1(d) Level 0I got this question in an internship interview.This intriguing question originated from Graph Planning topic in section Planning and Acting in the Real World of Artificial Intelligence

What are present in the planning graph?(a) Sequence of levels(b) Literals(c) Variables(d) Heuristic estimatesThe question was posed to me in an interview for job.Question is taken from Graph Planning in chapter Planning and Acting in the Real World of Artificial Intelligence

What are not present in start actions?(a) Preconditions(b) Effect(c) Finish(d) None of the mentionedThis question was addressed to me in my homework.This is a very interesting question from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence

What are not present in finish actions?(a) Preconditions(b) Effect(c) Finish(d) None of the mentionedThe question was posed to me during an interview for a job.The query is from Partial Order Planning in chapter Planning and Acting in the Real World of Artificial Intelligence

How many possible plans are available in partial-order solution?(a) 3(b) 4(c) 5(d) 6This question was posed to me during an online interview.The question is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence

What are present in the empty plan?(a) Start(b) Finish(c) Modest(d) Both Start & FinishThis question was addressed to me during an online exam.This interesting question is from Partial Order Planning in portion Planning and Acting in the Real World of Artificial Intelligence

What is the other name of each and every total-order plans?(a) Polarization(b) Linearization(c) Solarization(d) None of the mentionedThe question was asked during an interview.Question is taken from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence

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) FalseThe question was asked during an interview.The doubt is from Partial Order Planning topic in section Planning and Acting in the Real World of Artificial Intelligence

Sussman Anomaly can be easily and efficiently solved by partial order planning.(a) True(b) FalseThe question was asked during an online exam.This question is from Partial Order Planning in division Planning and Acting in the Real World of Artificial Intelligence

Sussman Anomaly illustrates a weakness of interleaved planning algorithm.(a) True(b) FalseThe question was posed to me in exam.This intriguing question originated from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence

Partial-order planning is the opposite of total-order planning.(a) True(b) FalseI had been asked this question during an online exam.The origin of the question is Partial Order Planning in section Planning and Acting in the Real World of Artificial Intelligence

Following is/are the components of the partial order planning.(a) Bindings(b) Goal(c) Causal Links(d) All of the mentionedThe question was posed to me in an interview for job.My doubt is from Partial Order Planning topic in division Planning and Acting in the Real World of Artificial Intelligence