Package javaff.planning

Examples of javaff.planning.State

131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
    // ********************************

    // Get the initial state
    TemporalMetricState initialState = ground.getTemporalMetricInitialState();
   
                State goalState = goalState = performFFSearch(initialState);
               
    long afterPlanning = System.currentTimeMillis();

                TotalOrderPlan top = null;
    if (goalState != null) top = (TotalOrderPlan) goalState.getSolution();
    if (top != null) top.print(planOutput);


    /*javaff.planning.PlanningGraph pg = initialState.getRPG();
    Plan plan  = pg.getPlan(initialState);
View Full Code Here
213
214
215
216
217
218
219
220
221
222
223
  EnforcedHillClimbingSearch EHCS = new EnforcedHillClimbingSearch(initialState);
 
  EHCS.setFilter(HelpfulFilter.getInstance()); // and use the helpful actions neighbourhood
 
  // Try and find a plan using EHC
  State goalState = EHCS.search();

  if (goalState == null) // if we can't find one
  {
    infoOutput.println("EHC failed, using best-first search, with all actions");
   
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
    return (State) ((LinkedList) open).removeFirst();
  }
 
  public boolean needToVisit(State s) {
    Integer Shash = new Integer(s.hashCode()); // compute hash for state
    State D = (State) closed.get(Shash); // see if its on the closed list
   
    if (closed.containsKey(Shash) && D.equals(s)) return false;  // if it is return false
   
    closed.put(Shash, s); // otherwise put it on
    return true; // and return true
  }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
    javaff.JavaFF.infoOutput.println(bestHValue);
   
    while (!open.isEmpty()) // whilst still states to consider
    { 
      State s = removeNext(); // get the next one
     
      Set successors = s.getNextStates(filter.getActions(s)); // and find its neighbourhood
     
      Iterator succItr = successors.iterator();     
   
      while (succItr.hasNext()) {
        State succ = (State) succItr.next(); // next successor
     
        if (needToVisit(succ)) {
          if (succ.goalReached()) { // if we've found a goal state - return it as the solution
            return succ;
          } else if (succ.getHValue().compareTo(bestHValue) < 0) {
            // if we've found a state with a better heuristic value than the best seen so far
         
            bestHValue = succ.getHValue(); // note the new best avlue
            javaff.JavaFF.infoOutput.println(bestHValue);
            open = new LinkedList(); // clear the open list
            open.add(succ); // put this on it
            break; // and skip looking at the other successors
          } else {
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
    return (State) ((LinkedList) open).removeFirst();
  }
 
  public boolean needToVisit(State s) {
    Integer Shash = new Integer(s.hashCode());
    State D = (State) closed.get(Shash);
   
    if (closed.containsKey(Shash) && D.equals(s)) return false;
   
    closed.put(Shash, s);
    return true;
  }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
   
    open.add(start);

    while (!open.isEmpty())
    {
      State s = removeNext();
      if (needToVisit(s)) {
        ++nodeCount;
        if (s.goalReached()) {
          return s;
        } else {
          updateOpen(s);
        }
      }
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
  public int compare(Object obj1, Object obj2)
    {
    int r = 0;
    if ((obj1 instanceof State) && (obj2 instanceof State))
    {
      State s1 = (State) obj1;
      State s2 = (State) obj2;
      BigDecimal d1 = s1.getHValue();
      BigDecimal d2 = s2.getHValue();
      r = d1.compareTo(d2);
      if (r == 0)
      {
        d1 = s1.getGValue();
        d2 = s2.getGValue();
        r = d1.compareTo(d2);
        if (r == 0)
        {
          if (s1.hashCode() > s2.hashCode()) r = 1;
          else if (s1.hashCode() == s2.hashCode() && s1.equals(s2)) r=0;
          else r = -1;
        }
      }
    }
    return r;
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    open.addAll(S.getNextStates(filter.getActions(S)));
  }

  public State removeNext()
    {
    State S = (State) ((TreeSet) open).first();
    open.remove(S);
                /*
                System.out.println("================================");
    S.getSolution().print(System.out);
    System.out.println("----Helpful Actions-------------");
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
    return S;
  }

  public boolean needToVisit(State s) {
    Integer Shash = new Integer(s.hashCode());
    State D = (State) closed.get(Shash);
   
    if (closed.containsKey(Shash) && D.equals(s)) return false;
   
    closed.put(Shash, s);
    return true;
  }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
107
108
109
   
    open.add(start);

    while (!open.isEmpty())
    {
      State s = removeNext();
      if (needToVisit(s)) {
        ++nodeCount;
        if (s.goalReached()) {
          return s;
        } else {
          updateOpen(s);
        }
      }
View Full Code Here
TOP

Related Classes of javaff.planning.State

  • javaff.data.Action
  • javaff.JavaFF
  • javaff.search.BestFirstSearch
  • javaff.search.BreadthFirstSearch
  • javaff.search.EnforcedHillClimbingSearch
  • javaff.search.HValueComparator
  • java.util.Set
  • java.util.Iterator
  • java.util.HashSet
    • 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.