Constructor Detail

• Orienting

  Orienting(RandomGenerator randomGenerator, EnvironmentWithGraph<?, T, P, A, N, DefaultEdge> environment, Node<T> node, Double knowledgeDegree, Double minArea)

• Orienting

  Orienting(RandomGenerator randomGenerator, EnvironmentWithGraph<?, T, P, A, N, DefaultEdge> environment, Node<T> node, Double knowledgeDegree)

Method Detail

• getVolatileMemory

   Map<ConvexShape<P, A>, Integer> getVolatileMemory()

  The volatile memory of the agent: it models the ability to remember areas of the environment already visited since the start of the simulation. Each area is paired with the number of visits. Areas are assumed to be represented as ConvexShapes, as in NavigationGraphs.

• getCognitiveMap

   NavigationGraph<P, A, L, DefaultEdge> getCognitiveMap()

  The cognitive map of the agent. It's a graph composed of landmarks (elements of the environment easy to remember due to their uniqueness) and spatial relations between them. It's modeled as a NavigationGraph.

• getRandomGenerator

   final RandomGenerator getRandomGenerator()

  The simulation RandomGenerator.

• getEnvironment

   EnvironmentWithGraph<?, T, P, A, N, DefaultEdge> getEnvironment()

  The environment in which the node moves.

• getNode

   Node<T> getNode()

• getKnowledgeDegree

   Double getKnowledgeDegree()

  The knowledge degree of the agent concerning the environment. This is a Double value in 0, 1 describing the percentage of environment the agent is familiar with prior to the start of the simulation (thus it does not take into account the knowledge the pedestrian will gain during it, namely the volatileMemory).

• createLandmarkIn

   abstract L createLandmarkIn(N area)

  Creates a landmark entirely contained in the given area. If such area contains one or more destinations, the returned landmark must contain at least one of them.

• toString

   String toString()