How to transform a PDDL to search? 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 &amp; Norvig)
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 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.