⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 randomtripgenerator.java

📁 linux下用于移动节点的移动活动生成工具
💻 JAVA
字号:
package de.uni_stuttgart.informatik.canu.tripmodel.generators;

/**
 * <p>Title: Trip Model</p>
 * <p>Description: </p>
 * <p>Copyright: Copyright (c) 2002-2003</p>
 * <p>Company: University of Stuttgart</p>
 * @author Illya Stepanov
 * @version 1.1
 */

import de.uni_stuttgart.informatik.canu.mobisim.core.*;
import de.uni_stuttgart.informatik.canu.mobisim.notifications.*;
import de.uni_stuttgart.informatik.canu.mobisim.extensions.Graph;
import de.uni_stuttgart.informatik.canu.senv.core.*;
import de.uni_stuttgart.informatik.canu.spatialmodel.core.*;
import de.uni_stuttgart.informatik.canu.spatialmodel.geometry.*;
import de.uni_stuttgart.informatik.canu.tripmodel.core.*;
import de.uni_stuttgart.informatik.canu.tripmodel.pathalgorithms.*;


/**
 * This class generates random trips for a node
 * @author Illya Stepanov 
 */
public class RandomTripGenerator extends ExtensionModule
                                       implements TripGenerator
{
  /**
   * Minimal stay duration at destination (ms)
   */
  protected int minStay = 0;        // in ms
  /**
   * Maximal stay duration at destination (ms)
   */
  protected int maxStay = 0;        // in ms

  /**
   * Set of points to be used as destinations during node movements
   */
  protected java.util.ArrayList points = new java.util.ArrayList();
  
  /**
   * Path searching algorithm
   */
  protected PathSearchingAlgorithm algo = new Dijkstra();
  
  /**
   * Flag to reflect or ignore the road directions during the path calculation
   */
  protected int reflect_directions = PathSearchingAlgorithm.FLAG_IGNORE_DIRECTIONS;

  /**
   * Constructor
   */
  public RandomTripGenerator()
  {
  }

  /**
   * Returns the module's description. <br>
   * <br>
   * @return extension module's description
   */
  public String getDescription()
  {
    return "Random Trip Generation module";
  }

  /**
   * Performs the module initialization. <br>
   * <br>
   * The method is called after finishing the scenario file processing.
   */
  public void initialize()
  {
    SpatialModel spatialModel = (SpatialModel)u.getExtension("SpatialModel");
    Graph graph = spatialModel.getGraph();

    // check the points
    java.util.Iterator iter = points.iterator();
    while (iter.hasNext())
    {
      Point p = (Point)iter.next();

      if (graph==null)
      { 
        if((p.getX()<0.0)||(p.getY()<0.0)||
           (p.getX()>u.getDimensionX())||(p.getY()>u.getDimensionY()))
        {
          System.err.println("Fatal error: Position is outside Universe dimensions: Position3D("+p.getX()+","+p.getY()+")");
          System.exit(1);
        }
      }
      else
      {
        if((p.getX()<graph.getLeftmostCoordinate())||(p.getY()<graph.getLowermostCoordinate())||
           (p.getX()>graph.getRightmostCoordinate())||(p.getY()>graph.getUppermostCoordinate()))
        {
          System.err.println("Fatal error: Position is outside movement area graph: Position3D("+p.getX()+","+p.getY()+")");
          System.exit(1);
        }
      }
    }
  }

  /**
   * Executes the extension. <br>
   * <br>
   * The method is called on every simulation timestep. 
   * @return 0 - the module should be executed on next timesteps,
   *        -1 - the module should not be executed on further timesteps and should be removed from the extensions' list
   */
  public int act()
  {
    return 0;
  }

  /**
   * Generates a new trip for the node. <br>
   * <br>
   * @param node node
   * @return new trip for node
   */
  public Trip genTrip(Node node)
  {
    java.util.Random rand = u.getRandom();

    SpatialModel spatialModel = (SpatialModel)u.getExtension("SpatialModel");
    Graph graph = spatialModel.getGraph();

    // check if the set of points is defined
    if (points.size()>0)
    {
      Point p = (Point)points.get(rand.nextInt(points.size()));

      if (graph==null)
      {
        Trip trip = new Trip();

        java.util.ArrayList path = trip.getPath();
        path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
        path.add(new Point(p.getX(), p.getY()));

        return trip;
      }
      else
      {
        // get a path from the current location to the destination
        Trip trip = algo.getPath(spatialModel, node,
          new Point(node.getPosition().getX(), node.getPosition().getY()),
          new Point(p.getX(), p.getY()), reflect_directions);
        if (trip==null)
        {
          // add an empty trip
          trip = new Trip();

          java.util.ArrayList path = trip.getPath();
          path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
          path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
        }
        
        return trip;
      }
    }
    else
    {
      if (graph==null)
      {
        // generate a path to a randomly chosen point
        double x = rand.nextDouble()*u.getDimensionX();
        double y = rand.nextDouble()*u.getDimensionY();

        Trip trip = new Trip();

        java.util.ArrayList path = trip.getPath();
        path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
        path.add(new Point(x, y));
      
        return trip;
      }
      else
      {
        java.util.ArrayList vertices = spatialModel.getGraph().getVertices();

        // choose a random destination
        Vertex vd = (Vertex)vertices.get(rand.nextInt(vertices.size()));

        // get a path from the current location to the destination
        Trip trip = algo.getPath(spatialModel, node,
          new Point(node.getPosition().getX(), node.getPosition().getY()),
          new Point(vd.getX(), vd.getY()), reflect_directions);
        if (trip==null)
        {
          // add an empty trip
          trip = new Trip();

          java.util.ArrayList path = trip.getPath();
          path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
          path.add(new Point(node.getPosition().getX(), node.getPosition().getY()));
        }
        
        return trip;
      }
    }
  }
  
  /**
   * Chooses a time of staying at the current position. <br>
   * <br>
   * @param node node
   * @return stay duration (in ms)
   */
  public int chooseStayDuration(Node node)
  {
    return (int)(minStay+(maxStay-minStay)*u.getRandom().nextFloat());
  }
  
  /**
   * Initializes the object from XML tag. <br>
   * <br>
   * @param element source tag
   * @throws Exception Exception if parameters are invalid
   */
  public void load(org.w3c.dom.Element element) throws Exception
  {
    u.sendNotification(new LoaderNotification(this, u,
      "Loading RandomTripGenerator extension"));

    super.load(element);

    org.w3c.dom.Node n;

    String classTag = element.getAttribute("path_algorithm").trim();
    if (classTag.length()!=0)
    {
      algo = (PathSearchingAlgorithm)Class.forName(classTag).newInstance();
      
      // handle path selection parameters
      if (algo instanceof PedestrianStochPathSelection)
      {
        String param = element.getAttribute("theta").trim();
        if(param.length()==0)
          throw new Exception("\"theta\" attribute of path selection is missing!");
        float theta = Float.parseFloat(param);
        
        ((PedestrianStochPathSelection)algo).setTheta(theta);
      }
    }

    n = element.getElementsByTagName("reflect_directions").item(0);
    if((n!=null)&&(Boolean.valueOf(n.getFirstChild().getNodeValue()).booleanValue()))
    {
      reflect_directions = PathSearchingAlgorithm.FLAG_REFLECT_DIRECTIONS;
    }

    n = element.getElementsByTagName("points").item(0);
    if(n!=null)
    {
      String fileSource = n.getFirstChild().getNodeValue();

      java.io.BufferedReader source = new java.io.BufferedReader(new java.io.FileReader(fileSource));

      String s;
      // read next record
      while ((s = source.readLine())!=null)
      {
        String ss[] = s.split(" ");

        double x = Double.parseDouble(ss[0]);
        double y = Double.parseDouble(ss[1]);
        
        points.add(new Point(x, y));
      }
    }

    n = element.getElementsByTagName("minstay").item(0);
    if(n==null)
      throw new Exception("<minstay> is missing!");
    minStay = (int)(Float.parseFloat(n.getFirstChild().getNodeValue())*1000);

    n = element.getElementsByTagName("maxstay").item(0);
    if(n==null)
      throw new Exception("<maxstay> is missing!");
    maxStay = (int)(Float.parseFloat(n.getFirstChild().getNodeValue())*1000);

    // checkout
    if ( (minStay<0)||(maxStay<minStay) )
      throw new Exception("Trip generation parameters are invalid:\n"
        +"minStay="+(float)minStay/1000+"(s), maxStay="+(float)maxStay/1000+"(s)");

    u.sendNotification(new LoaderNotification(this, u,
      "Finished loading RandomTripGenerator extension"));
  }//proc
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -