new mlp benchmark

[IRC.git] / Robust / src / Benchmarks / mlp / directto / mlp-java / TrialFlight.java

diff --git a/Robust/src/Benchmarks/mlp/directto/mlp-java/TrialFlight.java b/Robust/src/Benchmarks/mlp/directto/mlp-java/TrialFlight.java
new file mode 100755 (executable)
index 0000000..f420b71
--- /dev/null
+++ b/Robust/src/Benchmarks/mlp/directto/mlp-java/TrialFlight.java
@@ -0,0 +1,127 @@
+// trial flight class with trial planning-related methods
+
+public class TrialFlight {
+  D2 d2;
+
+  Flight oldFlight, trialFlight;
+  Route trialRoute;
+  Trajectory trialTrajectory;
+  double time;
+  Fix fix1, fix2;
+  int fixIndex;
+  // differences between the old flight and the trial flight follow:
+  double timeDiff, distDiff; // time and distance difference
+  ConflictList oldConflicts, newConflicts; // the lists of conflicts
+  int noNew, noRemoved; // the number of new and removed conflicts, respectively
+  
+  // constructor of a trial flight using a shortcut between two fixes.    
+  public TrialFlight(D2 d2, Flight flight, Fix fix1, Fix fix2) {
+    this.d2=d2;
+    int aux, fixIndex1, fixIndex2;
+    oldFlight=flight;
+    fixIndex1=oldFlight.fPlan.r.getIndexOf(fix1);
+    fixIndex2=oldFlight.fPlan.r.getIndexOf(fix2);
+    if (fixIndex1>fixIndex2) {
+      aux=fixIndex1;
+      fixIndex1=fixIndex2;
+      fixIndex2=aux;
+    }
+    trialFlight=Flight.copyOf(d2, oldFlight);
+    trialFlight.trialStatus=Flight.trialFlightStatus();
+    this.changeToTrialRoute(fixIndex1, fixIndex2);
+  }
+
+  // constructor for a trial flight using the current position of a plane
+  public TrialFlight(D2 d2, Flight flight, String fixName) {
+    this.d2=d2;
+    oldFlight=flight;    
+  }
+
+  // constructor that uses an estimated position and a fix
+  public TrialFlight(D2 d2, Flight flight, Point4d position, Fix fix) {
+    this.d2=d2;
+    int aux;
+    oldFlight=flight;
+    fixIndex=oldFlight.fPlan.r.getIndexOf(fix);
+    trialFlight=Flight.copyOf(d2, oldFlight);
+    trialFlight.trialStatus=Flight.trialFlightStatus();
+    oldFlight.updateTrajectory(position.time);
+    // assuming that the position given as parameter is the same as the first point in the trajectory
+    trialFlight.track=new Track(new Point4d(position), new Velocity(oldFlight.track.vel)); 
+    trialFlight.fPlan=new FlightPlan(oldFlight.fPlan); 
+    changeToTrialRoute(position, fixIndex);
+    trajectoryDiff(position.time);
+    conflictsDiff(position.time);
+    System.out.println("old route:"+oldFlight.fPlan.r);
+    System.out.println("new route:"+trialFlight.fPlan.r);
+    trialFlight.trialStatus=-1;        
+  }
+
+  public void trajectoryDiff (double time) {
+    trialFlight.updateTrajectory(time);
+    oldFlight.updateTrajectory(time);        
+    System.out.println("Flight "+trialFlight.flightID+":");
+    distDiff=oldFlight.traject.distanceToDestination()-
+      trialFlight.traject.distanceToDestination();
+    timeDiff=oldFlight.traject.timeToDestination(time)-
+      trialFlight.traject.timeToDestination(time);
+    if (timeDiff<0) { timeDiff=0; }
+    System.out.println("Time difference: "+timeDiff);
+    System.out.println("Distance difference: "+distDiff);
+  }
+    
+  public void conflictsDiff(double time) {
+    int i, j;
+    oldConflicts=d2.getAlgorithm().getConflictsWith(time,oldFlight);
+    newConflicts=d2.getAlgorithm().getConflictsWith(time,trialFlight);
+    System.out.println("Flight "+trialFlight.flightID+":");
+    System.out.println("Conflicts for the old flight:");
+    System.out.println(oldConflicts);
+    System.out.println("Conflicts for the trial flight:");
+    System.out.println(newConflicts);
+    noNew=0;
+    for (i=0 ; i<newConflicts.noConflicts ; i++) {
+      Conflict conflict=newConflicts.conflictAt(i);
+      if (oldConflicts.findConflict(conflict.flight1, conflict.flight2)==null) {
+       noNew++;
+      }
+    }
+    noRemoved=oldConflicts.noConflicts-(newConflicts.noConflicts-noNew);
+  }
+  
+  public void changeToTrialRoute (Point4d pos, int index) {
+    int i,count, index1=0;
+    if (index>-1) {
+      trialRoute=new Route(d2, oldFlight.fPlan.r.noFixes-index);
+      trialRoute.current=0;
+      for (i=index; i<oldFlight.fPlan.r.noFixes ; i++) {
+       trialRoute.addFix(i-index, oldFlight.fPlan.r.getFixAt(i));
+      }
+      trialFlight.fPlan.r=trialRoute;
+    }
+  }
+
+  public void changeToTrialRoute (int index1, int index2) {
+    int i,count;
+    if ((index1>-1) && (index2>-1) && (index2-index1>1)) {
+      trialRoute=new Route(d2, oldFlight.fPlan.r.noFixes-
+                          (index2-index1-1));
+      trialRoute.current=index1+1;
+      for (i=0 ; i<=index1 ; i++) {
+       trialRoute.addFix(i, oldFlight.fPlan.r.getFixAt(i));
+       if (oldFlight.fPlan.r.current==i) {
+         trialRoute.current=i;
+       }
+      }
+      
+      for (i=index2; i<oldFlight.fPlan.r.noFixes ; i++) {
+       trialRoute.addFix(i-index2+index1+1,
+                         oldFlight.fPlan.r.getFixAt(i));
+       if (oldFlight.fPlan.r.current==i) {
+         trialRoute.current=i-index2+index1+1;
+       }
+      }
+      trialFlight.fPlan.r=trialRoute;
+    }
+  }
+}