Package aima.core.search.framework

Examples of aima.core.search.framework.Problem

47
48
49
50
51
52
53
54
55
56
57
        agent.getInstrumentation().getProperty("pathCost"));
  }

  @Test
  public void testUniformCostUnSuccesfulSearch() throws Exception {
    Problem problem = new Problem(new NQueensBoard(3),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new UniformCostSearch();
    SearchAgent agent = new SearchAgent(problem, search);
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
  }

  @Test
  public void testAIMA3eFigure3_15() throws Exception {
    Map romaniaMap = new SimplifiedRoadMapOfPartOfRomania();
    Problem problem = new Problem(SimplifiedRoadMapOfPartOfRomania.SIBIU,
        MapFunctionFactory.getActionsFunction(romaniaMap),
        MapFunctionFactory.getResultFunction(), new DefaultGoalTest(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST),
        new MapStepCostFunction(romaniaMap));
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
    map.addBidirectionalLink("b", "d", 2.0);
    map.addBidirectionalLink("c", "d", 4.0);
    map.addBidirectionalLink("c", "e", 1.0);
    map.addBidirectionalLink("d", "goal", 1.0);
    map.addBidirectionalLink("e", "goal", 5.0);
    Problem problem = new Problem("start",
        MapFunctionFactory.getActionsFunction(map),
        MapFunctionFactory.getResultFunction(), new DefaultGoalTest(
            "goal"), new MapStepCostFunction(map));

    Search search = new UniformCostSearch();
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
          && !CancelableThread.currIsCanceled(); i++) {
        MapNode toRNode = mapData.getNearestWayNode(new Position(locs
            .get(i)), wayFilter);
        HeuristicFunction hf = createHeuristicFunction(toRNode,
            waySelection);
        Problem problem = createProblem(fromRNode, toRNode, mapData,
            wayFilter, ignoreOneways, waySelection);
        Search search = new AStarSearch(new GraphSearch(), hf);
        List<Action> actions = search.search(problem);
        if (actions.isEmpty())
          break;
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
public class SolutionCheckerTest {

  @Test
  public void testMultiGoalProblem() throws Exception {
    Map romaniaMap = new SimplifiedRoadMapOfPartOfRomania();
    Problem problem = new Problem(SimplifiedRoadMapOfPartOfRomania.ARAD,
        MapFunctionFactory.getActionsFunction(romaniaMap),
        MapFunctionFactory.getResultFunction(), new DualMapGoalTest(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST,
            SimplifiedRoadMapOfPartOfRomania.HIRSOVA),
        new MapStepCostFunction(romaniaMap));
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
      switch (state.getValue(MapAgentFrame.AGENT_SEL)) {
      case 0:
        agent = new SDMapAgent(env, search, new String[] { locs[1] });
        break;
      case 1:
        Problem p = new BidirectionalMapProblem(map, null, locs[1]);
        OnlineSearchProblem osp = new OnlineSearchProblem
        (p.getActionsFunction(), p.getGoalTest(), p.getStepCostFunction());
        agent = new LRTAStarAgent
        (osp, MapFunctionFactory.getPerceptToStateFunction(), heuristic);
        break;
      }
      env.addAgent(agent, locs[0]);
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
   
    @Override
    protected Problem formulateProblem(Object goal) {
      BidirectionalMapProblem problem =
        (BidirectionalMapProblem) super.formulateProblem(goal);
      Problem result = new Problem(
          problem.getInitialState(),
          problem.getActionsFunction(),
          problem.getResultFunction(),
          new DefaultGoalTest((String) goal) {
            @Override
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
public class BreadthFirstSearchTest {

  @Test
  public void testBreadthFirstSuccesfulSearch() throws Exception {
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new BreadthFirstSearch(new TreeSearch());
    SearchAgent agent = new SearchAgent(problem, search);
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
        agent.getInstrumentation().getProperty("pathCost"));
  }

  @Test
  public void testBreadthFirstUnSuccesfulSearch() throws Exception {
    Problem problem = new Problem(new NQueensBoard(3),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new BreadthFirstSearch(new TreeSearch());
    SearchAgent agent = new SearchAgent(problem, search);
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
public class DepthFirstSearchTest {

  @Test
  public void testDepthFirstSuccesfulSearch() throws Exception {
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new DepthFirstSearch(new GraphSearch());
    SearchAgent agent = new SearchAgent(problem, search);
View Full Code Here
TOP

Related Classes of aima.core.search.framework.Problem

  • aima.core.environment.map.BidirectionalMapProblem
  • aima.core.search.uninformed.BidirectionalSearch
  • aima.gui.applications.search.games.EightPuzzleApp$EightPuzzleController
  • aima.gui.applications.search.games.NQueensApp$NQueensController
  • aima.gui.demo.search.EightPuzzleDemo
  • aima.gui.demo.search.NQueensDemo
  • aima.test.core.unit.search.framework.SolutionCheckerTest
  • aima.test.core.unit.search.informed.AStarSearchTest
  • aima.test.core.unit.search.informed.GreedyBestFirstSearchTest
  • aima.test.core.unit.search.uninformed.BreadthFirstSearchTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.