Package javaff.data.strips

Examples of javaff.data.strips.InstantAction

112
113
114
115
116
117
118
119
120
121
122
          ne.followsStart.addAll(e.followsStart);

          Iterator fit = e.followsStart.iterator();
          while (fit.hasNext())
          {
            InstantAction ia = (InstantAction)fit.next();
            if (checkOrder(ia,ne.end)) ne.addPreceder(ia,s);
          }

          ne.constraints.add(TemporalConstraint.getConstraint(sa, e.end));
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
    Set fs = new HashSet();
    Iterator fit = e.followsStart.iterator();
    while (fit.hasNext())
    {
      InstantAction f = (InstantAction) fit.next();
      if (checkOrder(f,a)) fs.add(f);
    }
    fit = fs.iterator();
    while (fit.hasNext())
    {
      InstantAction f = (InstantAction) fit.next();
      e.addFollowerOrder(f,a, s);
    }

    /*
    Set ps = new HashSet();
View Full Code Here
54
55
56
57
58
59
60
61
62
63
    {
    boolean consistency = true;
    Iterator sit = nodes.iterator();
    while (sit.hasNext() && consistency)
    {
      InstantAction source = (InstantAction) sit.next();
      consistency = consistentSource(source);
    }
    return consistency;
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    //Implementation of Bellman-Ford Algorithm for Single Source Shortest Path with negative edges
    public boolean consistentSource(InstantAction source)
    {
    List nodeIndex = new ArrayList(nodes);
    InstantAction p[] = new InstantAction[nodeIndex.size()];
    BigDecimal d[] = new BigDecimal[nodeIndex.size()];
    for (int count = 0; count < nodeIndex.size(); ++count)
    {
      p[count] = (InstantAction) nodeIndex.get(count);
      d[count] = javaff.JavaFF.MAX_DURATION;
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
    {
    TimeStampedPlan plan = new TimeStampedPlan();
        Iterator ait = Timepoints.iterator();
        while (ait.hasNext())
        {
            InstantAction a = (InstantAction) ait.next();;
            if (a instanceof StartInstantAction)
            {
                DurativeAction da = ((StartInstantAction)a).parent;
                BigDecimal time = TheArray[Timepoints.indexOf(a)][0].negate().setScale(SCALE,ROUND);
        BigDecimal dur = TheArray[Timepoints.indexOf(da.endAction)][0].negate().subtract(time).setScale(SCALE,ROUND);
View Full Code Here
239
240
241
242
243
244
245
246
247
248
249
  public void minimizeTime()
  {
    Iterator ait = Timepoints.iterator();
        while (ait.hasNext())
        {
            InstantAction a = (InstantAction) ait.next();;
            if (a instanceof EndInstantAction)
            {
        int i = Timepoints.indexOf(a);
                if (TheArray[i][0].compareTo(TheArray[0][i].negate()) != 0)
        {
View Full Code Here
260
261
262
263
264
265
266
267
268
269
270
  public void minimizeDuration()
  {
    Iterator ait = Timepoints.iterator();
        while (ait.hasNext())
        {
            InstantAction a = (InstantAction) ait.next();;
            if (a instanceof StartInstantAction)
            {
                DurativeAction da = ((StartInstantAction)a).parent;
                minimize(da);
            }
View Full Code Here
TOP

Related Classes of javaff.data.strips.InstantAction

  • javaff.scheduling.GraphSTN
  • javaff.scheduling.MatrixSTN
  • javaff.scheduling.VelosoSchedulabilityChecker
    • 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.