Examples of aima.core.search.informed.AStarEvaluationFunction

aima.core.search.informed.AStarEvaluationFunction
Artificial Intelligence A Modern Approach (3rd Edition): page 93.

The most widely known form of best-first search is called A* search (pronounced "A-star Search"). It evaluates nodes by combining g(n), the cost to reach the node, and h(n), the cost to get from the node to the goal:
```
 f(n) = g(n) + h(n). 
```
@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

        return pt1.distance(pt2);
      }
    };


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

View Full Code Here

TOP

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

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.