<p>Not all search is planning (is A connected to B), but all planning is search (<strong>how</strong> do I get from this to that). </p>

<p><a href="https://swish.swi-prolog.org/p/A*%20Planning.swinb" rel="nofollow noreferrer">Here's an example in Prolog</a> with a domain described in terms of actions, when they are possible, and what the result of the actions are. The description is of an uncomputed graph of un-calculated size where each node is a situation and each edge is an action. Then we have A* search algorithm that searches this graph, calculating it as it goes, to find a plan to reach the goal state. Running the final query will produce a plan via search.</p>

CC BY-SA 4.0
2019-07-30T15:51:14.750Z
2019-07-30T15:51:14.750Z
Paul Brown
<p>I have a question about search and planning:
I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with: </p>

<blockquote>
  <p>"Having formulated a PDDL problem, transform it into research,
  emphasizing what the differences are."</p>
</blockquote>

<p>Someone can do an example? </p>

<p>I attached an example of simple PDDL from my book (I'm using  Russell &amp; Norvig)
<a href="https://i.sstatic.net/c8wG1.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/c8wG1.png" alt="enter image description here"></a></p>

CC BY-SA 4.0
2021-02-06T13:50:22.217Z
This is an old question, but could you please clarify where you took that slide from? Which section/page of the mentioned book were you reading at the time?
nbro
<comparison><search><planning><pddl>
How to transform a PDDL to search?
theantomc
# How to transform a PDDL to search?

(Asked by: username_0 on 2019-06-21)

I have a question about search and planning:
I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with:

> "Having formulated a PDDL problem, transform it into research,
> emphasizing what the differences are."

Someone can do an example?

I attached an example of simple PDDL from my book (I'm using Russell & Norvig)
[![enter image description here](https://i.sstatic.net/c8wG1.png)](https://i.sstatic.net/c8wG1.png)

**Tags:** comparison, search, planning, pddl

> **Comments:**
> **username_1**: This is an old question, but could you please clarify where you took that slide from? Which section/page of the mentioned book were you reading at the time?  

---

## 1 answers

### Answer by username_2 on 2019-07-30. Score: 2

Not all search is planning (is A connected to B), but all planning is search (**how** do I get from this to that).

[Here's an example in Prolog](https://swish.swi-prolog.org/p/A*%20Planning.swinb) with a domain described in terms of actions, when they are possible, and what the result of the actions are. The description is of an uncomputed graph of un-calculated size where each node is a situation and each edge is an action. Then we have A\* search algorithm that searches this graph, calculating it as it goes, to find a plan to reach the goal state. Running the final query will produce a plan via search.


---

