Agent Parameters
NAMELIST group name: agents_par
Parameter Name | FORTRAN Type | Default Value | Explanation
|
---|
a_rand_target
|
L(100)
|
100 * .F.
|
Flag for agents within a group to have random targets outside of model domain.
One logical value per agent group. If .T., each agent in that group will have a random target just outside the model domain. Otherwise a target (see at_x/at_y) must be set manually for each agent group.
|
adx
|
R(100)
|
100 * 9999999.9
|
Distance along x between agents within an agent source (in m).
Each agent source is defined as an area from x = asl to asr and y = ass to asn. The first agent is released at x = asl; y = ass. More agents are released at x = asl + N * adx (x <= asr) and y = ass + N * ady (y <= asn), forming a raster.
To add a random element to these release points, see random_start_position_agents.
|
ady
|
R(100)
|
100 * 9999999.9
|
Distance along y between agents within an agent source (in m).
|
agent_maximum_age
|
R(100)
|
100 * 9999999.9
|
Maximum time an agent can spend in the simulation before it is deleted.
|
agent_time_unlimited
|
L
|
.F.
|
Flag to determine number of unlimited dimensions in NetCDF output file.
In the agent NetCDF output file only the number of agents is an unlimited dimension by default. Contrarily, the time dimension is estimated as having a size of 1.2 * end_time / dt_write_agent_data by default. If this flag is set to .T., both dimensions are set as unlimited. This requires NetCDF4, HDF5 and results in a much larger output file.
|
alloc_factor_mas
|
R
|
20.0
|
Factor (in percent) describing the memory allocated additionally to the memory needed for initial agents at a given grid cell.
Implementation is the same as alloc_factor.
|
asl
|
R(100)
|
100 * 9999999.9
|
Left border of agent source(s) (in m).
Check adx for information of agent sources.
|
asn
|
R(100)
|
100 * 9999999.9
|
North border of agent source(s) (in m).
Check adx for information of agent sources.
|
asr
|
R(100)
|
100 * 9999999.9
|
Right border of agent source(s) (in m).
Check adx for information of agent sources.
|
ass
|
R(100)
|
100 * 9999999.9
|
South border of agent source(s) (in m).
Check adx for information of agent sources.
|
at_x
|
R(100)
|
100 * 9999999.9
|
x-coordinate of agent group target (in m).
Each agent in a group will navigate through building topography toward the corresponding target with x = at_x and y = at_y
|
at_y
|
R(100)
|
100 * 9999999.9
|
y-coordinate of agent group target (in m).
Each agent in a group will navigate through building topography toward the corresponding target with x = at_x and y = at_y
|
bc_mas_lr
|
C*15
|
'absorb'
|
Boundary condition for agents at the left and right model boundary.
By default, agents are deleted when they leave the model domain (bc_mas_lr = 'absorb' ).
Cyclic lateral boundary conditions can be introduced by setting bc_mas_lr = 'cyclic' .
|
bc_mas_ns
|
C*15
|
'absorb'
|
Boundary condition for agents at the north and south model boundary.
By default, agents are deleted when they leave the model domain (bc_mas_ns = 'absorb' ).
Cyclic lateral boundary conditions can be introduced by setting bc_mas_ns = 'cyclic' .
|
coll_t_0
|
R
|
3.0
|
Range of unscreened interactions for social force model (in s).
Collision avoidance of pedestrians is implemented according to the approach of Karamouzas et al. (2014). This parameter implies a maximum range that pedestrians consider for collision avoidance, i.e., potential collisions that will occur more than coll_t_0 in the future are largely ignored.
NOTE: This parameter should generally not be changed.
|
corner_gate_start
|
R
|
0.7
|
Distance of navigation gate starting point to obstacle corner (in m).
Convex obstacle corners are used for agents to navigate towards their target (see at_x/at_y). In order to avoid collisions with these obstacles, the navigation points do not coincide exactly with the obstacle corners but are shifted outward along the bisector of the corner. The navigation point for each agent at a given corner is chosen randomly along a line following the corner bisector starting at corner_gate_start outward from the corner and ending at corner_gate_start + corner_gate_width outward from the corner, forming a 'gate' at each obstacle corner through which agents can pass. This gate helps to avoid clustering of agents moving in different directions at corner navigation points.
|
corner_gate_width
|
R
|
1.0
|
Width of navigation gate at obstacle corners (in m).
See corner_gate_start for details.
|
deallocate_memory_mas
|
L
|
.T.
|
Parameter to enable deallocation of unused memory.
If the number of agents in a grid box exceeds the allocated memory, new memory is allocated. However, if the number of agents per grid box is only temporarily high, most of the memory will be unused later. If deallocate_memory = .T., the allocated memory used for agents will be dynamically adjusted with respect to the current number of agents every step_dealloc_mas'th timestep.
|
dist_to_int_target
|
R
|
0.75
|
Distance (in m) at which an intermittent target counts as reached.
Each agent in an agent group navigates toward that groups target (at_x/at_y). To do this a preprocessed navigation mesh (visibility graph) is searched via the A*-algorithm for the most efficient path toward the target. The agent successively navigates toward a number of intermittent targets along the calculated path, each such target providing the direction of the driving force until it is reached. Each intermittent target counts as reached as soon as the distance between it and the current agent position is smaller than dist_to_int_target. Then, the next intermittent target along the path is chosen.
|
dt_agent
|
DATA TYPE
|
DEFAULT VALUE
|
EXPLANATION
|
PARAMETER
|
DATA TYPE
|
DEFAULT VALUE
|
EXPLANATION
|
PARAMETER
|
DATA TYPE
|
DEFAULT VALUE
|
EXPLANATION
|
PARAMETER
|
DATA TYPE
|
DEFAULT VALUE
|
EXPLANATION
|