1
$\begingroup$

Which is the most straight forward approach for planning algorithm?can we use random algorithm like BFS,DFS,RBFS etc?

$\endgroup$
  • $\begingroup$ All these algorithm have in common that they are graph oriented. A connect list of nodes is traversed to find a plan from start to goal. Speeding up the search procedure is only possible with heuristics. The question to evaluate “recursive best first search” (RBFS) and similar approaches is how they implement heuristics. In most cases, no concrete answer is given by the algorithm itself. Often, only the evaluation function contains of a “rule of thumb” to search faster in the graph. $\endgroup$ – Manuel Rodriguez Dec 2 '18 at 8:39

Your Answer

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

Browse other questions tagged or ask your own question.