Planning and Acting in the Real World: Task of Finding a Procedural Course of Action for a Declaratively Described System

This is a computer science engineering quiz on Artificial intelligence, which includes questions on planning and acting in the real world i.e, to reach the goals while optimizing overall performance measures.

images.jpg
Start Quiz

The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________

Planning problem Partial order planning Total order planning Both Planning problem & Partial order planning

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.

True False

Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole.

True False

Following is/are the components of the partial order planning.

Bindings Goal Causal Links All of the mentioned

A constructive approach in which no commitment is made unless it is necessary to do so, is ____________

Least commitment approach Most commitment approach Nonlinear planning Opportunistic planning

A plan that describe how to take actions in levels of increasing refinement and specificity is ____________

Problem solving Planning Non-hierarchical plan Hierarchical plan

What are you predicating by the logic: ۷x: €y: loyalto(x, y).

Everyone is loyal to someone Everyone is loyal to all Everyone is not loyal to someone Everyone is loyal

One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.

True False

Sussman Anomaly illustrates a weakness of interleaved planning algorithm.

True False

Sussman Anomaly can be easily and efficiently solved by partial order planning.

True False

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.

Stacks Queue BST (Binary Search Tree) Planning Graphs

Planning graphs works only for prepositional planning problems.

True False

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.

BFS/DFS A* Graph-Plan Greedy

What are the two major aspects which combines AI Planning problem?

Search & Logic Logic & Knowledge Based Systems FOL & Logic Knowledge Based Systems

Planning graphs consists of ____________

A sequence of levels

A sequence of levels which corresponds to time steps in the plan

A sequence of actions which corresponds to the state of the system

None of the mentioned

Quiz/Test Summary
Title: Planning and Acting in the Real World: Task of Finding a Procedural Course of Action for a Declaratively Described System
Questions: 15
Contributed by:
james