Changes between Version 11 and Version 12 of doc/app/agent_parameters
- Timestamp:
- Aug 15, 2018 12:49:48 PM (6 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
doc/app/agent_parameters
v11 v12 2 2 [[TracNav(doc/app/partoc|nocollapse)]] 3 3 \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ 4 '''NAMELIST group name: {{{agent s_par}}}'''4 '''NAMELIST group name: {{{agent_parameters}}}''' 5 5 6 6 ||='''Parameter Name''' =||='''[../fortrantypes FORTRAN Type]''' =||='''Default Value''' =||='''Explanation''' =|| … … 72 72 {{{#!td 73 73 Flag to determine number of unlimited dimensions in NetCDF output file.\\\\ 74 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 * [/wiki/doc/app/d3par#end_time end_time] / [#dt_write_agent_data 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. 74 In the agent NetCDF output file only the number of agents is an unlimited dimension by default. This is due to the fact that the maximum number of agents in the model domain during a simulation is not trivially estimated. Contrarily, the time dimension can be well estimated as having a maximum size of \\ 75 1.1 * INT( MIN( [#multi_agent_system_end multi_agent_system_end], [/wiki/doc/app/d3par#end_time end_time] ) - [#multi_agent_system_start multi_agent_system_start] ) / [#dt_write_agent_data dt_write_agent_data] \\ 76 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. 75 77 }}} 76 78 |---------------- … … 100 102 {{{#!td 101 103 Left border of agent source(s) (in m).\\\\ 102 Check [#adx adx] for information o fagent sources.104 Check [#adx adx] for information on agent sources. 103 105 }}} 104 106 |---------------- … … 114 116 {{{#!td 115 117 North border of agent source(s) (in m).\\\\ 116 Check [#adx adx] for information o fagent sources.118 Check [#adx adx] for information on agent sources. 117 119 }}} 118 120 |---------------- … … 128 130 {{{#!td 129 131 Right border of agent source(s) (in m).\\\\ 130 Check [#adx adx] for information o fagent sources.132 Check [#adx adx] for information on agent sources. 131 133 }}} 132 134 |---------------- … … 142 144 {{{#!td 143 145 South border of agent source(s) (in m).\\\\ 144 Check [#adx adx] for information o fagent sources.146 Check [#adx adx] for information on agent sources. 145 147 }}} 146 148 |---------------- … … 272 274 Distance (in m) at which an intermittent target counts as reached.\\\\ 273 275 Each agent in an agent group navigates toward that groups target ([#at_x at_x]/[#at_y 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.\\\\ 274 NOTE: This parameter should be chosen in a way that insures that the next intermittent target is visible to the agent once the current one is reached. If not, agents could get stuck at obstacle corners.276 '''NOTE''': This parameter should be chosen in a way that insures that the next intermittent target is visible to the agent once the current one is reached. If not, agents could get stuck at obstacle corners. 275 277 }}} 276 278 |---------------- … … 360 362 |---------------- 361 363 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 364 [=#multi_agent_system_end '''multi_agent_system_end'''] 365 }}} 366 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 367 R 368 }}} 369 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 370 9999999.9 371 }}} 372 {{{#!td 373 Simulation time at which the multi agent system will stop excuting (in s).\\\\ 374 '''NOTE:''' This does not consider spin-up time. 375 }}} 376 |---------------- 377 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 362 378 [=#multi_agent_system_start '''multi_agent_system_start'''] 363 379 }}} … … 369 385 }}} 370 386 {{{#!td 371 Simulation time at which the multi agent system will start excuting (in s). 387 Simulation time at which the multi agent system will start excuting (in s).\\\\ 388 '''NOTE:''' This does not consider spin-up time. 372 389 }}} 373 390 |---------------- … … 398 415 {{{#!td 399 416 Quasi-solid core of agents.\\\\ 400 If agents collide, (distance of their centers smaller than 2*'''radius_agent''') the standard social force model according to [https://doi.org/10.1103/PhysRevE.51.4282 Helbing ] (1995) is used to calculate their repulsive forces on each other.417 If agents collide, (distance of their centers smaller than 2*'''radius_agent''') the standard social force model according to [https://doi.org/10.1103/PhysRevE.51.4282 Helbing (1995)] is used to calculate their repulsive forces on each other instead of the default [http://motion.cs.umn.edu/PowerLaw/ collision avoidance scheme]. 401 418 }}} 402 419 |---------------- … … 441 458 }}} 442 459 {{{#!td 443 Magnitude of the repulsive force agents exert on each other (in m2 s-2).\\\\ 460 Magnitude of the repulsive force agents exert on each other (in m^2^ s^-2^).\\\\ 461 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. 444 462 }}} 445 463 |---------------- … … 454 472 }}} 455 473 {{{#!td 456 Magnitude of the repulsive force obstacles exert on agents (in m2 s-2).\\\\ 474 Magnitude of the repulsive force obstacles exert on agents (in m^2^ s^-2^).\\\\ 475 The repulsive force obstacles exert on agents 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. 457 476 }}} 458 477 |---------------- … … 468 487 {{{#!td 469 488 Radius around the agent in which it scans for obstacles (in m).\\\\ 470 Based on '''scan_radius_agent''', each agent at each subtimestep determines a number of gridboxes around it and scans them for obstacles (topography and other agents). It will interact only with obstacles in that radius. The limiting factor is the grid spacing, because at subdomain boundaries only a maximum of three grid boxes can be scanned. 471 }}} 472 |---------------- 473 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 474 [=#PARAMETER '''PARAMETER'''] 475 }}} 476 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 477 DATA TYPE 478 }}} 479 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 480 DEFAULT VALUE 481 }}} 482 {{{#!td 483 EXPLANATION 484 }}} 485 489 Based on '''scan_radius_agent''', each agent at each subtimestep determines a number of gridboxes around it and scans them for obstacles (topography and other agents). It will interact only with obstacles in that radius. The limiting factor is the grid spacing, since a maximum of three grid boxes can be scanned at subdomain boundaries. 490 }}} 491 |---------------- 492 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 493 [=#sigma_rep_agent '''sigma_rep_agent'''] 494 }}} 495 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 496 R 497 }}} 498 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 499 0.3 500 }}} 501 {{{#!td 502 Width of agent repulsive field (in m).\\\\ 503 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 width of that potential field. 504 }}} 505 |---------------- 506 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 507 [=#sigma_rep_wall '''sigma_rep_wall'''] 508 }}} 509 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 510 R 511 }}} 512 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 513 0.1 514 }}} 515 {{{#!td 516 Width of obstacle repulsive field (in m).\\\\ 517 The repulsive force obstacles exert on agents 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 width of that potential field. 518 }}} 519 |---------------- 520 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 521 [=#step_dealloc_mas '''step_dealloc_mas'''] 522 }}} 523 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 524 I 525 }}} 526 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 527 100 528 }}} 529 {{{#!td 530 Interval for memory reallocation.\\\\ 531 See [#deallocate_memory_mas deallocate_memory_mas]. 532 }}} 533 |---------------- 534 {{{#!td style="vertical-align:top; text-align:left;width: 150px" 535 [=#tau_accel_agent '''tau_accel_agent'''] 536 }}} 537 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px" 538 R 539 }}} 540 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px" 541 0.5 542 }}} 543 {{{#!td 544 Relaxation time in social force model (in s).\\\\ 545 '''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. 546 }}}
