Changes between Version 4 and Version 5 of doc/tec/mas

Timestamp:

Aug 16, 2018 8:58:01 AM (6 years ago)

Author:

sward

Comment:

--

doc/tec/mas

@@ -17 +17 @@
 1) the PALM building topographhy is '''converted to polygons''' (one per obstacle) containing all convex and cocave corners as vertices.\\
 2) The polygon data is '''simplified''' using the Douglas-Peucker algorithm ([#hershberger1994 Hershberger and Snoeyink, 1994]). To adjust the rate of simplification, see [#tolerance_dp tolerance_dp]. \\
-3) All remaining convex polygon vertices are added to the graph as nodes.\\
-4) Connections are established between each pair of nodes that are visible by each other. The associated cost is set to the direct distance.\\
-5) The polygon and graph data is output to a Fortran binary file that can be read by PALM.\\
+3) All remaining convex polygon vertices are '''added to the graph''' as nodes.\\
+4) '''Connections''' are established between each pair of nodes that are visible by each other. The associated cost is set to the direct distance.\\
+5) The polygon and graph data is '''output''' to a Fortran binary file that can be read by PALM.\\
 
 
@@ -42 +42 @@
 == Pathfinding ==
 
-During the simulation each agent receives target coordinates (see [wiki:/doc/app/agtpar#at_x at_x] and [wiki:/doc/app/agtpar#at_y at_y]). Each agent must then find a path from its current position to its target using the visibility graph. This is accomplished using the '''A^*^(A-star)-algorithm''' which is a well-known fast pathfinding algorithm (click [#http://theory.stanford.edu/~amitp/GameProgramming/ here] for a thorough explanation).
+During the simulation each agent receives target coordinates (see [wiki:/doc/app/agtpar#at_x at_x] and [wiki:/doc/app/agtpar#at_y at_y]). Each agent must then find a path from its current position to its target using the visibility graph. This is accomplished using the '''A^*^(A-star)-algorithm''' which is a well-known fast pathfinding algorithm (click [#http://theory.stanford.edu/~amitp/GameProgramming/ here] for a thorough explanation). For this, \\
+* the agent's current position and its target are added to the visibility graph, \\
+* the shortest path between these two points is calculated, \\
+* the navigation points are shifted outward from the obstacle corner to a random position along a "gate" (see [wiki:/doc/app/agtpar#corner_gate_start corner_gate_start] and [wiki:/doc/app/agtpar#corner_gate_width corner_gate_width]) to avoid collisions with obstacles or other agents,\\
+* pathfinding is run again with each successive pair of navigation points along the path to avoid intersection of path sections with obstacles resulting from the outward shift,\\
+* finally, the resulting path is stored in the agent object as a series of intermittent targets.\\
+Each agent calculates the direction toward its next intermittet target during each agent time step. It will accelerate toward those coordinates. Once the agent has come close enough ([wiki:/doc/app/agtpar#dist_to_int_target dist_to_int_target]) to them, the next intermittent target is chosen. When the final target is reached, the agent is deleted.\\\\
+'''Recalculation''' of an agent's path occurs when\\
+* the agent has deviated too far ([wiki:/doc/app/agtpar#max_dist_from_path max_dist_from_path]) from its current path or
+* the path counter has reached its maximum and the target is not yet reached. This can occur because for the purpose of conservation of memory each agent can store a maximum of 15 intermittent targets.
+
+While pathfinding is run on the visibility graph, 
 
 
@@ -72 +83 @@
 
 
-== NAMELIST group name: {{{agents_par}}}==
+== NAMELIST group name: {{{prepro_par}}}==
 
 ||='''Parameter Name'''  =||='''[wiki:/doc/app/fortrantypes FORTRAN Type]'''  =||='''Default Value'''  =||='''Explanation'''  =||
@@ -111 +122 @@
 }}}
 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px"
-1.41, 0.7, 0.35
+1.41, \\0.7, \\0.35
 }}}
 {{{#!td
@@ -123 +134 @@
 
 == References ==
-* [=#hershberger1994] '''Hershberger J, Snoeyink J''' 1994. An O(''n''log''n'') implementation of the Douglas-Peucker algorithm for line simplification. SCG '94 Proceedings of the tenth annual symposium on Computational geometry. 383-384. [https://doi.org/10.1145/177424.178097 doi]
-* [=#detering1985] '''Detering HW, Etling D.''' 1985. Application of the ''E''-''ε'' turbulence model to the atmospheric boundary layer. Bound.-Lay. Meteorol. 33: 113–133.
+* [=#helbig1995] '''Helbing, D., Molnar, P.''' (1995). Social force model for pedestrian dynamics. Physical review E, 51(5), 4282. [https://doi.org/10.1103/PhysRevE.51.4282 doi]
+* [=#hershberger1994] '''Hershberger, J., Snoeyink, J.''' 1994. An O(''n''log''n'') implementation of the Douglas-Peucker algorithm for line simplification. SCG '94 Proceedings of the tenth annual symposium on Computational geometry. 383-384. [https://doi.org/10.1145/177424.178097 doi]