# 人工智能导论 经典规划

## Planning

Posted by R1NG on November 6, 2021 Viewed Times

# 经典规划

## 2. 前向和后向搜索算法

### 2.2 后向 (后退) 状态空间搜索

$g' = (g - \text{ADD}(a)) \cup \text{Precond}(a)$

## 3. 规划图

1. 实现目标列表 $G$ 中某个子目标 $g$ 所需要花的 最小 步数 (Under-estimate).
2. 实现目标列表中所有子目标所需要花的 最小步数 (也就是 $G$ 中所有子问题 $g$ 所需步数的最大值).

## 4. 补充: Planning with Logic

frame problem: the challenge of representing the effects of action in logic without having to represent explicitly a large number of intuitively obvious non-effects.

qualification problem: the qualification problem is concerned with the impossibility of listing all the preconditions required for a real-world action to have its intended effect.