Package it.
Generic actions implementations.
Types
It's an AbstractConfigurableMoveNode in the Euclidean world, which provides a default interpolatePositions that is accurate with respect to the target given and the current maximum walking distance.
An abstract GroupSteeringAction.
Abstract implementation of an action influenced by the concentration of a given molecule in the environment.
An abstract NavigationAction, taking care of properly moving the pedestrian in the environment while delegating the decision on where to move it to a NavigationStrategy.
A SteeringAction in a vector space. The implementation of nextPosition is left to subclasses.
A SteeringActionWithTarget in a vector space.
Given a list of VisibleNode associated to visionMolecule, it finds the closest to a point located at distance from node in the direction of node's heading, and injects its position in targetMolecule.
Checks nodes in the environment and writes in outputMolecule the list of it.unibo.alchemist.model.interfaces.VisibleNode, containing filterByMolecule. distance and angle define the field of view.
Move the agent towards a target position. It is similar to CognitiveAgentSeek but attempts to arrive at the target position with a zero velocity.
Move the pedestrian towards positions of the environment with a low concentration of the target molecule.
Move the agent towards the other members of his group.
Combination of multiple steering actions.
A NavigationAction using Exploring navigation strategy.
Move the agent away from a target position. It's the opposite of CognitiveAgentSeek.
Move the pedestrian towards positions of the environment with a high concentration of the target molecule.
A NavigationAction using RouteFollowing navigation strategy.
Moves the pedestrian where the given scalar field is higher.
A NavigationAction using GoalOrientedExploring navigation strategy.
Implementation of a NavigationAction2D. This action accepts an Euclidean2DEnvironmentWithGraph whose graph contains ConvexPolygonal nodes and Euclidean2DPassages as edges.
Move the agent avoiding potential obstacles in its path.
A NavigationAction using Pursuing navigation strategy.
A NavigationAction using DestinationReaching navigation strategy. Accepts an array of coordinates representing the destinations and uses inferIsKnown to partition them into known and unknown ones.
A NavigationAction using KnownDestinationReaching navigation strategy.
Move the pedestrian towards the target position as fast as possible.
CognitiveAgentSeek behavior in a bidimensional environment, delegated to CognitiveAgentFollowScalarField (this means the pedestrian tries to overtake others on its path, in general its movements are more sophisticated than CognitiveAgentSeek).
Move the agent away from the pedestrians near to him.
Give the impression of a random walk through the environment targeting an ever changing pseudo-randomly point of a circumference at a given distance and with a given radius from the current pedestrian position.
Moves for distance toward a uniformly random chosen direction at a constant speed, then changes direction and walks another distance, and so on.
Chooses random targets in a direction extracted from randomGenerator at a distance extracted from distanceDistribution. Moves the node towards the targets at the given constant speed. Changes target on collision.
Changes the heading of node randomly. The environment must support node heading, hence, be a Physics2DEnvironment.
Reads the target's absolute coordinates from the target molecule contained in node and sets the node's heading accordingly.
Selects a target based on a random direction extracted from rng, and a random distance extracted from a ParetoDistribution of parameters scale and shape. Moves toward the targets at a constant speed and changes targets on collision.
This actions generates random waypoints inside a Polygon. The polygon can be provided either through as a deployment (positionGenerator), or as List<List<Number>> (polygonCoordinates)
Treats molecule as a switch:
Treats molecule as a probabilistic switch:
Functions
Takes the first percentage * size elements of the list.
Converts an array of numbers representing positions to an actual list of positions. E.g. the array 2,3,4,5 in a bidimensional environment would be transformed into a list containing positions (2,3) and (4,5).