What are the ways in which incomplete and incorrect information’s can be handled in planning?

1 Answer

Answer :

They can be handled with the help of two planning agents namely,

i. Conditional planning agent.

ii. Replanning agent.

Related questions

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 : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Last Answer : b) Lack in expressing some of the properties

Description : The public information officers liable to be impose a monitory penalty for  a) Without any reason refused to receive an application for information or has not  been furnished the information within the time ... information which was the  subject of the request. c) Both A&B d) None of these

Last Answer : c) Both A&B

Description : In Antirrhinum (Snapdragon), a red flower was crossed with a white flower and in F1 generation all pink flowers were obtained. When pink flowers were selfed, the F2 generation showed white, red and pink flowers. Choose the incorrect ... F2 is 1 4 2 4 1 4 ( ) red p : ( ink w ) : ( ) hite .

Last Answer : (a) Law of segregation does not apply in this experiment.

Description : Subject orientation A . The science of collecting, organizing, and applying numerical facts B. Measure of the probability that a certain hypothesis is incorrect given certain observations. C. ... specially built around all the existing applications of the operational data D . None of these

Last Answer : C. One of the defining aspects of a data warehouse, which is specially built around all the existing applications of the operational data

Description : Can e-mail addresses & other personal informations be traced through your IP address?

Last Answer : In most cases, no. You are likely to be using a dynamic IP address that is changing. You could be traced to the owner of the IP block from which it was allocated (almost certainly your ISP ... d have to be doing something seriously bad before anyone would allocate the time and resources to find you.

Description : How do you know what to do/decide, among many informations & opinions?

Last Answer : Ok

Description : Can information be plural? (i.e. "informations")

Last Answer : To my understanding, information is a mass noun , like air or water . You don't pluralize those. Instead, when you use a mass noun, you're referring by default to the entity as a whole; ... . In other words: it looks odd because it's incorrect usage, and your instincts are telling you so. :)

Description : The technique of reducing the size of replication over a number of blocks at the cost of loosing some informations on same effect

Last Answer : Ans. Confounding Design

Description : What are the informations obtained from blocked rotor test in a 3-phase I M?

Last Answer : (i)Blocked rotor input current per phase at normal voltage (ii) Blocked rotor power factor and hence phase angle (iii) Total resistance and leakage reactance per phase of the motor as refered to the stator

Description : What are the informations obtained from no-load test in a 3-phase I M?

Last Answer : (i) No – load input current per phase, Io (ii) No load power factor and hence no load phase angle (iii) Iron and mechanical losses together (iv) elements of equivalent circuit shunt branch

Description : The information’s to be collected in survey method are related to Options: A) Present position B) Aims of the research C) The attainment of the aim of the research D) All the above

Last Answer : D) All the above 

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 : 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

Last Answer : a) True

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 : Planning graphs works only for prepositional planning problems. a) True b) False

Last Answer : a) True

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 : 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 : 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 : What is the starting level of planning graph? a) Level 3 b) Level 2 c) Level 1 d) Level 0

Last Answer : d) Level 0

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 : 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

Last Answer : a) True

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

Last Answer : a) True

Description : Partial-order planning is the opposite of total-order planning. a) True b) False

Last Answer : a) True

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

Last Answer : a) True

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

Last Answer : 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