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

  • $\begingroup$ Can you clarify this sentence "Someone can be an example using a simple planning problem from my book?"? Is your question about the difference between planning and search, or are you asking something more? I would suggest asking different questions in different posts, anyway. $\endgroup$ – nbro Jun 21 '19 at 21:36
  • $\begingroup$ My question is "how to transform the PDDL problem in search problem with an example" @nbro by the way I edit the question because can be tricky $\endgroup$ – theantomc Jun 22 '19 at 13:27

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.

| improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.