Package aima.core.search.framework

Examples of aima.core.search.framework.SearchAgent

93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
        new MapStepCostFunction(romaniaMap));

    Search search = new AStarSearch(new TreeSearch(),
        new StraightLineDistanceHeuristicFunction(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST, romaniaMap));
    SearchAgent agent = new SearchAgent(problem, search);
    Assert.assertEquals(
        "[Action[name==moveTo, location==Sibiu], Action[name==moveTo, location==RimnicuVilcea], Action[name==moveTo, location==Pitesti], Action[name==moveTo, location==Bucharest]]",
        agent.getActions().toString());
    Assert.assertEquals(4, agent.getActions().size());
    Assert.assertEquals("5",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("10",
        agent.getInstrumentation().getProperty("queueSize"));
    Assert.assertEquals("11",
        agent.getInstrumentation().getProperty("maxQueueSize"));
  }
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
        new MapStepCostFunction(romaniaMap));

    Search search = new AStarSearch(new GraphSearch(),
        new StraightLineDistanceHeuristicFunction(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST, romaniaMap));
    SearchAgent agent = new SearchAgent(problem, search);
    Assert.assertEquals(
        "[Action[name==moveTo, location==Sibiu], Action[name==moveTo, location==RimnicuVilcea], Action[name==moveTo, location==Pitesti], Action[name==moveTo, location==Bucharest]]",
        agent.getActions().toString());
    Assert.assertEquals(4, agent.getActions().size());
    Assert.assertEquals("5",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("4",
        agent.getInstrumentation().getProperty("queueSize"));
    Assert.assertEquals("6",
        agent.getInstrumentation().getProperty("maxQueueSize"));
  }
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
      public double h(Object state) {
        return 0; // Don't have one for this test
      }
    };
    Search search = new AStarSearch(new GraphSearch(), hf);
    SearchAgent agent = new SearchAgent(problem, search);

    List<Action> actions = agent.getActions();

    Assert.assertEquals(
        "[Action[name==moveTo, location==b], Action[name==moveTo, location==d], Action[name==moveTo, location==goal]]",
        actions.toString());
    Assert.assertEquals("5.5",
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
          EightPuzzleFunctionFactory.getActionsFunction(),
          EightPuzzleFunctionFactory.getResultFunction(),
          new EightPuzzleGoalTest());
      Search search = new GreedyBestFirstSearch(new GraphSearch(),
          new ManhattanHeuristicFunction());
      SearchAgent agent = new SearchAgent(problem, search);
      Assert.assertEquals(49, agent.getActions().size());
      Assert.assertEquals("197",
          agent.getInstrumentation().getProperty("nodesExpanded"));
      Assert.assertEquals("140",
          agent.getInstrumentation().getProperty("queueSize"));
      Assert.assertEquals("141",
          agent.getInstrumentation().getProperty("maxQueueSize"));
    } catch (Exception e) {
      e.printStackTrace();
      Assert.fail("Exception thrown.");
    }
  }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
        new MapStepCostFunction(romaniaMap));

    Search search = new GreedyBestFirstSearch(new TreeSearch(),
        new StraightLineDistanceHeuristicFunction(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST, romaniaMap));
    SearchAgent agent = new SearchAgent(problem, search);
    Assert.assertEquals(
        "[Action[name==moveTo, location==Sibiu], Action[name==moveTo, location==Fagaras], Action[name==moveTo, location==Bucharest]]",
        agent.getActions().toString());
    Assert.assertEquals(3, agent.getActions().size());
    Assert.assertEquals("3",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("6",
        agent.getInstrumentation().getProperty("queueSize"));
    Assert.assertEquals("7",
        agent.getInstrumentation().getProperty("maxQueueSize"));
  }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
        new MapStepCostFunction(romaniaMap));

    Search search = new GreedyBestFirstSearch(new GraphSearch(),
        new StraightLineDistanceHeuristicFunction(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST, romaniaMap));
    SearchAgent agent = new SearchAgent(problem, search);
    Assert.assertEquals(
        "[Action[name==moveTo, location==Sibiu], Action[name==moveTo, location==Fagaras], Action[name==moveTo, location==Bucharest]]",
        agent.getActions().toString());
    Assert.assertEquals(3, agent.getActions().size());
    Assert.assertEquals("3",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("4",
        agent.getInstrumentation().getProperty("queueSize"));
    Assert.assertEquals("5",
        agent.getInstrumentation().getProperty("maxQueueSize"));
  }
View Full Code Here
TOP

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

  • 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
  • aima.test.core.unit.search.uninformed.DepthFirstSearchTest
  • aima.test.core.unit.search.uninformed.DepthLimitedSearchTest
    • 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.