Package javaff.data.strips

Examples of javaff.data.strips.Proposition

191
192
193
194
195
196
197
198
199
200
201
    }

    Iterator iit = initial.iterator();
    while (iit.hasNext())
    {
      Proposition p = (Proposition) iit.next();
      if (p.name.isStatic())
      {
        Set pset = (Set) staticPropositionMap.get(p.name);
        pset.add(p);
      }
View Full Code Here
223
224
225
226
227
228
229
230
231
232
    //remove static Propositions
    Iterator init = initial.iterator();
    Set staticProps = new HashSet();
    while (init.hasNext())
    {
      Proposition p = (Proposition) init.next();
      if (p.isStatic()) staticProps.add(p);
    }
    initial.removeAll(staticProps);
  }
View Full Code Here
62
63
64
65
66
67
68
69
70
    {
    Iterator dait = S.openActions.iterator();
    while (dait.hasNext())
    {
      DurativeAction da = (DurativeAction) dait.next();
      Proposition p = da.dummyGoal;
      goal.add(getProposition(p));
    }
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
  public static void getAOrderings(Action a, TotalOrderPlan top, PartialOrderPlan pop)
    {
    Iterator cit = a.getConditionalPropositions().iterator();
    while (cit.hasNext())
    {
      Proposition c = (Proposition) cit.next();
      ListIterator bit = top.listIterator(a);
      while (bit.hasPrevious())
      {
        Action b = (Action) bit.previous();
        Set achieves = b.getAddPropositions();
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
  public static void getBOrderings(Action a, TotalOrderPlan top, PartialOrderPlan pop)
    {
    Iterator dit = a.getDeletePropositions().iterator();
    while (dit.hasNext())
    {
      Proposition d = (Proposition) dit.next();
      ListIterator bit = top.listIterator(a);
      while (bit.hasPrevious())
      {
        Action b = (Action) bit.previous();
        Set conds = b.getConditionalPropositions();
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
    Set as = a.getAddPropositions();
    as.retainAll(goals);
    Iterator adit = as.iterator();
    while (adit.hasNext())
    {
      Proposition ad = (Proposition) adit.next();
      ListIterator bit = top.listIterator(a);
      while (bit.hasPrevious())
      {
        Action b = (Action) bit.previous();
        Set dels = b.getDeletePropositions();
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
      PGAction pga = (PGAction) ait.next();

      Iterator csit = pga.action.getConditionalPropositions().iterator();
      while (csit.hasNext())
      {
        Proposition p = (Proposition) csit.next();
        PGProposition pgp = getProposition(p);
        pga.conditions.add(pgp);
        pgp.achieves.add(pga);
      }

      Iterator alit = pga.action.getAddPropositions().iterator();
      while (alit.hasNext())
      {
        Proposition p = (Proposition) alit.next();
        PGProposition pgp = getProposition(p);
        pga.achieves.add(pgp);
        pgp.achievedBy.add(pga);
      }

      Iterator dlit = pga.action.getDeletePropositions().iterator();
      while (dlit.hasNext())
      {
        Proposition p = (Proposition) dlit.next();
        PGProposition pgp = getProposition(p);
        pga.deletes.add(pgp);
        pgp.deletedBy.add(pga);
      }
    }
View Full Code Here
225
226
227
228
229
230
231
232
233
234
  {
    goal = new HashSet();
    Iterator csit = g.getConditionalPropositions().iterator();
    while (csit.hasNext())
    {
      Proposition p = (Proposition) csit.next();
      PGProposition pgp = getProposition(p);
      goal.add(pgp);
    }
  }
View Full Code Here
238
239
240
241
242
243
244
245
246
247
    Set i = ((STRIPSState) S).facts;
    initial = new HashSet();
    Iterator csit = i.iterator();
    while (csit.hasNext())
    {
      Proposition p = (Proposition) csit.next();
      PGProposition pgp = getProposition(p);
      initial.add(pgp);
    }
  }
View Full Code Here
TOP

Related Classes of javaff.data.strips.Proposition

  • javaff.data.UngroundProblem
  • javaff.planning.PlanningGraph
  • javaff.planning.RelaxedTemporalMetricPlanningGraph
  • javaff.planning.STRIPSState
  • javaff.scheduling.GreedyPartialOrderLifter
  • java.util.Set
  • 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.