Changes between Version 21 and Version 22 of doc/app/agent_parameters
- Timestamp:
- Nov 6, 2018 7:44:39 AM (6 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
doc/app/agent_parameters
v21 v22 1 = = Agent Parameters ==1 = Agent Parameters = 2 2 3 3 [[TracNav(doc/app/partoc|nocollapse)]] … … 7 7 [[NoteBox(note,This page is part of the **Multi Agent System** (MAS) documentation. \\ It contains a listing of all PALM input parameters used to steer the MAS. \\ For an overview of all MAS-related pages\, see the **[wiki:doc/tec/mas MAS main page]**.)]] 8 8 9 \\ 10 == Parameter list == 9 11 '''NAMELIST group name: {{{agent_parameters}}}''' 10 12 … … 36 38 {{{#!td 37 39 Distance along x between agents within an agent source (in m).\\\\ 38 Each agent source is defined as an area from x = [#asl asl] to [#asr asr] and y = [#ass ass] to [#asn 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.\\\\40 Each agent source is defined as an area from x = [#asl asl] to [#asr asr] and y = [#ass ass] to [#asn asn]. The first agent is released at x = [#asl asl]; y = [#ass ass]. More agents are released at x = [#asl asl] + N * '''adx''' (x <= [#asr asr]) and y = [#ass ass] + N * [#ady ady] (y <= [#asn asn]), forming a raster.\\\\ 39 41 To add a random element to these release points, see [#random_start_position_agents random_start_position_agents]. 40 42 }}} … … 147 149 {{{#!td 148 150 x-coordinate of agent group target (in m).\\\\ 149 Each agent in a group will navigate through building topography toward the corresponding target with x = '''at_x''' and y = at_y151 Each agent in a group will navigate through building topography toward the corresponding target with x = '''at_x''' and y = [#at_y at_y] 150 152 }}} 151 153 |---------------- … … 161 163 {{{#!td 162 164 y-coordinate of agent group target (in m).\\\\ 163 Each agent in a group will navigate through building topography toward the corresponding target with x = at_xand y = '''at_y'''165 Each agent in a group will navigate through building topography toward the corresponding target with x = [#at_x at_x] and y = '''at_y''' 164 166 }}} 165 167 |---------------- … … 176 178 Boundary condition for agents at the left and right model boundary.\\\\ 177 179 By default, agents are deleted when they leave the model domain ('''bc_mas_lr''' = '' 'absorb' '').\\ 178 Cyclic lateral boundary conditions can be introduced by setting bc_mas_lr= '' 'cyclic' ''.180 Cyclic lateral boundary conditions can be introduced by setting '''bc_mas_lr''' = '' 'cyclic' ''. 179 181 }}} 180 182 |---------------- … … 191 193 Boundary condition for agents at the north and south model boundary.\\\\ 192 194 By default, agents are deleted when they leave the model domain ('''bc_mas_ns''' = '' 'absorb' '').\\ 193 Cyclic lateral boundary conditions can be introduced by setting bc_mas_ns= '' 'cyclic' ''.195 Cyclic lateral boundary conditions can be introduced by setting '''bc_mas_ns''' = '' 'cyclic' ''. 194 196 }}} 195 197 |---------------- … … 220 222 {{{#!td 221 223 Distance of navigation gate starting point to obstacle corner (in m).\\\\ 222 Convex obstacle corners are used for agents to navigate towards their target (see [#at_x at_x]/[#at_y 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 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.224 Convex obstacle corners are used for agents to navigate towards their target (see [#at_x at_x]/[#at_y 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 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. 223 225 }}} 224 226 |---------------- … … 248 250 {{{#!td 249 251 Parameter to enable deallocation of unused memory.\\\\ 250 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 step_dealloc_mas]'th timestep.252 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_mas''' = .T., the allocated memory used for agents will be dynamically adjusted with respect to the current number of agents every [#step_dealloc_mas step_dealloc_mas]'th timestep. 251 253 }}} 252 254 |---------------- … … 323 325 {{{#!td 324 326 Interval in which agents are released at their respective sources (in s).\\\\ 325 Every dt_arelseconds, agents are released at their sources as defined by [#asl asl], [#asr asr], [#adx adx], [#ass ass], [#asn asn] and [#ady ady].327 Every '''dt_arel''' seconds, agents are released at their sources as defined by [#asl asl], [#asr asr], [#adx adx], [#ass ass], [#asn asn] and [#ady ady]. 326 328 }}} 327 329 |---------------- … … 481 483 {{{#!td 482 484 Magnitude of the repulsive force agents exert on each other (in m^2^ s^-2^).\\\\ 483 The repulsive force agents exert on each other according to the original social force model ( https://doi.org/10.1103/PhysRevE.51.4282 Helbing, 1995]) is calculated from a potential field and drops exponentially with distance. This is the magnitude of that potential field.485 The repulsive force agents exert on each other according to the original social force model (Helbing and Molnár, 1995) is calculated from a potential field and drops exponentially with distance. This is the magnitude of that potential field. 484 486 }}} 485 487 |---------------- … … 567 569 '''tau_accel_agent''' determines how quickly an agent will aproach its desired velocity and direction. A smaller value leads to a more aggresive walking style. 568 570 }}} 571 572 \\ 573 == References == 574 575 576 Helbing, D. and Molnár, P. (1995): Social force model for pedestrian dynamics. Physical Review Journals, 51(5), 4282-4286, https://doi.org/10.1103/PhysRevE.51.4282 .
