Examples of aima.core.search.informed.RecursiveBestFirstSearch

aima.core.search.informed.RecursiveBestFirstSearch
te f with value from previous search, if any s.f <- max(s.g + s.h, node.f) repeat best <- the lowest f-value node in successors if best.f > f_limit then return failure, best.f alternative <- the second-lowest f-value among successors result, best.f <- RBFS(problem, best, min(f_limit, alternative)) if result != failure then return result Figure 3.26 The algorithm for recursive best-first search. @author Ciaran O'Reilly @author Mike Stampone

      break;
    case ASTAR_SEARCH:
      result = new AStarSearch(qs, hf);
      break;
    case RBF_SEARCH:
      result = new RecursiveBestFirstSearch(new AStarEvaluationFunction(
          hf));
      break;
    case HILL_SEARCH:
      result = new HillClimbingSearch(hf);
      break;

View Full Code Here

            .getPosition(SimplifiedRoadMapOfPartOfRomania.BUCHAREST);
        return pt1.distance(pt2);
      }
    };


    recursiveBestFirstSearch = new RecursiveBestFirstSearch(
        new AStarEvaluationFunction(heuristicFunction));
  }

View Full Code Here

TOP

Related Classes of aima.core.search.informed.RecursiveBestFirstSearch

aima.core.search.framework.Node

aima.gui.applications.search.map.SearchFactory

aima.test.core.unit.search.informed.RecursiveBestFirstSearchTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.