题目
DD2380 HT24 (AIHT24_2) Q9: Planning
多项选择题
Which of the following action schemes in PDDL yield an applicable action in the initial state 𝐼 𝑛 𝑖 𝑡 ( 𝑇 𝑖 𝑟 𝑒 ( 𝐴 ) ∧ 𝐹 𝑙 𝑎 𝑡 ( 𝐴 ) ∧ 𝑃 𝑢 𝑛 𝑐 𝑡 𝑢 𝑟 𝑒 ( 𝐴 ) ∧ 𝑇 𝑖 𝑟 𝑒 ( 𝐵 ) ) ?
选项
A.𝐴
𝑐
𝑡
𝑖
𝑜
𝑛
(
𝐶
ℎ
𝑎
𝑛
𝑔
𝑒
(
𝑥
,
𝑦
)
𝑃
𝑅
𝐸
𝐶
𝑂
𝑁
𝐷
:
𝑇
𝑖
𝑟
𝑒
(
𝑥
)
∧
𝑃
𝑢
𝑛
𝑐
𝑡
𝑢
𝑟
𝑒
(
𝑦
)
𝐸
𝐹
𝐹
𝐸
𝐶
𝑇
:
𝐹
𝑖
𝑥
𝑒
𝑑
(
𝑦
)
)
B.𝐴
𝑐
𝑡
𝑖
𝑜
𝑛
(
𝐶
ℎ
𝑎
𝑛
𝑔
𝑒
(
𝑥
,
𝑦
)
𝑃
𝑅
𝐸
𝐶
𝑂
𝑁
𝐷
:
𝑇
𝑖
𝑟
𝑒
(
𝑥
)
∧
𝑇
𝑖
𝑟
𝑒
(
𝑦
)
∧
𝐹
𝑖
𝑥
𝑒
𝑑
(
𝑦
)
𝐸
𝐹
𝐹
𝐸
𝐶
𝑇
:
𝐹
𝑖
𝑥
𝑒
𝑑
(
𝑦
)
)
C.𝐴
𝑐
𝑡
𝑖
𝑜
𝑛
(
𝐶
ℎ
𝑎
𝑛
𝑔
𝑒
(
𝑥
,
𝑦
)
𝑃
𝑅
𝐸
𝐶
𝑂
𝑁
𝐷
:
𝑇
𝑖
𝑟
𝑒
(
𝑥
)
∧
𝑇
𝑖
𝑟
𝑒
(
𝑦
)
∧
¬
𝐹
𝑙
𝑎
𝑡
(
𝑥
)
∧
𝑃
𝑢
𝑛
𝑐
𝑡
𝑢
𝑟
𝑒
(
𝑦
)
𝐸
𝐹
𝐹
𝐸
𝐶
𝑇
:
𝐹
𝑖
𝑥
𝑒
𝑑
(
𝑦
)
)
D.𝐴
𝑐
𝑡
𝑖
𝑜
𝑛
(
𝐶
ℎ
𝑎
𝑛
𝑔
𝑒
(
𝑥
,
𝑦
)
𝑃
𝑅
𝐸
𝐶
𝑂
𝑁
𝐷
:
𝐹
𝑙
𝑎
𝑡
(
𝑥
)
∧
¬
𝐹
𝑙
𝑎
𝑡
(
𝑦
)
𝐸
𝐹
𝐹
𝐸
𝐶
𝑇
:
𝐹
𝑖
𝑥
𝑒
𝑑
(
𝑦
)
)
查看解析
标准答案
Please login to view
思路分析
We start from the given initial state literals to reason about applicability of each action schema. The initial state explicitly contains Tire(A), Tire(B), Flat(A), and Puncture(A). Any other literals not stated are not assumed true unless the problem explicitly provides them, so we treat only what is clearly given as true.
Option 1: Action(Change(x,y)) with PRECOND: Tire(x) ∧ Puncture(y)
- Because Tire(A) and Puncture(A) are both true in the initial state, we can instantiate x := A and y := A. Then the precondition Tire(A) ∧ Puncture(A) is satisfied, so this action is applicable in the initial state. The reasoning here hinges on using the explicitly true literals we have: a tire exists for some x (A) and there is a puncture for some y (A).
Option 2: Action(Change(x,y)) with PRECOND: Flat(x) ∧ ¬Flat(y)
- We do have Flat(A) true, so Flat(x) can be satisfied by x := A. For ¬Flat(y) to hold, y must be a value for which Flat(y) is not true. In the initial state we ......Login to view full explanation登录即可查看完整答案
我们收录了全球超50000道考试原题与详细解析,现在登录,立即获得答案。
类似问题
假设有一个 blocksworld 域,其中包含一些积木和一张桌子。一块积木可以位于桌上或另一块积木上。On 关系指定哪块积木位于什么东西之上。Move 动作将一块积木从一个位置移到另一个位置。In_Gripper 关系指定积木位于抓手中。 考虑以下状态: 当前状态:block(b1), block(b2), block(b3), block(b4), On(b1,b2), On(b2,table), On(b3,table), On(b4,b3) Suppose there is a blocksworld domain that contains some blocks and a table. A block can be on top of the table or on another block. On relation specifies which block is on top of what. Move action moves a block from one location to another. In_Gripper relationship specifies that the block is in the gripper. Consider these states: Current state: block(b1), block(b2), block(b3), block(b4), On(b1,b2), On(b2,table), On(b3,table), On(b4,b3) Goal state: On(b4,table), On(b3,b1) In order for a state to be a landmark, which proposition must be contained in the state?
In STRIPS Planning the "threatening operator" must come ________________________.
Which statement is FALSE when ignoring delete lists in Sokoban
Consider the following simplified Hanoi towers planning problem in PDDL. Init(Disk(B)∧Disk(M)∧Disk(S)∧CanPutOn(S,M)∧CanPutOn(S,B)∧CanPutOn(M,B)∧???)Goal(On(B,One),On(M,B),On(S,M)) Action(Move(d,x,y) PRECOND:On(d,x)∧Disk(d)∧Clear(d)∧Clear(y)∧CanPutOn(d,y) EFFECT:On(d,y)∧¬Clear(y)∧¬On(d,x)∧Clear(x)) What should be completed in place of ??? so that the action sequence Move(M,Two,B),Move(S,Three,M)becomes a solution to the problem?
更多留学生实用工具
希望你的学习变得更简单
加入我们,立即解锁 海量真题 与 独家解析,让复习快人一步!