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

Timestamp:

Aug 16, 2018 8:24:03 AM (7 years ago)

Author:

sward

Comment:

--

doc/tec/mas

@@ -2 +2 @@
 
 The embedded Multi Agent System (MAS) allows for the modeling of pedestrian movement in complex (urban) terrain. The following text provides an overview of the model's functionality as well as underlying concepts. This will cover the topics of creating a visibility graph, pathfinding, and Social Forces for collision avoidance.  \\\\
-For a list of input parameters, see [wiki:/doc/app/agtpar agents_par]. 
+For a list of input parameters, see [wiki:/doc/app/agtpar agent_pararmeters]. 
 
 == Navigation ==
@@ -46 +46 @@
 
 
+\\
 
+\\
+
+\\
+
+\\
+
+\\
+
+\\
 
 
@@ -64 +74 @@
 == NAMELIST group name: {{{agents_par}}}==
 
-||='''Parameter Name'''  =||='''[../fortrantypes FORTRAN Type]'''  =||='''Default Value'''  =||='''Explanation'''  =||
+||='''Parameter Name'''  =||='''[wiki:/doc/app/fortrantypes FORTRAN Type]'''  =||='''Default Value'''  =||='''Explanation'''  =||
+|----------------
+{{{#!td style="vertical-align:top; text-align:left;width: 150px"
+[=#flag_2d '''flag_2d'']
+}}}
+{{{#!td style="vertical-align:top; text-align:left;style="width: 50px"
+L
+}}}
+{{{#!td style="vertical-align:top; text-align:left;style="width: 75px"
+.F.
+}}}
+{{{#!td
+Flag to force usage of 2d-buildings.\\\\
+If set to .T., this flag forces the usage of buildings_2d even if buildings_3d is available. See [wiki:doc/app/iofiles/pids#topo here] for information on topography and building input.
+}}}
+|----------------
+{{{#!td style="vertical-align:top; text-align:left;width: 150px"
+[=#internal_buildings '''internal_buildings'']
+}}}
+{{{#!td style="vertical-align:top; text-align:left;style="width: 50px"
+L
+}}}
+{{{#!td style="vertical-align:top; text-align:left;style="width: 75px"
+.F.
+}}}
+{{{#!td
+Flag to control usage of buildings within courtyards.\\\\
+By default, buildings completely surrounded by another building are excluded from the visibility graph as pedestrians can neither reach nor leave enclosed areas such as courtyards. If '''internal_buildings = .T.''', buildings within courtyards are allowed. The resulting navigation nodes can, however, never be connected to nodes outside of the courtyard. In such cases, be sure to set the target of a agent group originating inside a courtyard also within that same courtyard.
+}}}
 |----------------
 {{{#!td style="vertical-align:top; text-align:left;width: 150px"
@@ -70 +108 @@
 }}}
 {{{#!td style="vertical-align:top; text-align:left;style="width: 50px"
-R * 5
+R * 3
 }}}
 {{{#!td style="vertical-align:top; text-align:left;style="width: 75px"
-100 * .F.
+1.41, 0.7, 0.35
 }}}
 {{{#!td
-Array for simplification of building polygons during preprocessing.\\\\
+Tolerance for simplification of building polygons during preprocessing.\\\\
+Each building is stored as a counter-clockwise sorted polygon. Initially each building polygon consists of all inner and outer corners of the PALM topography as vertices. Due to the rastered nature of this grid this may be a very large number of vertices. The Douglas-Peucker-Algorithm ([#hershberger1994 Hershberger and Snoeyink, 1994]) is used to reduce the number of vertices.\\
+This algorithm recursively approximates a polygon section as a straight line connecting the end points of that section. If the greatest distance between this line and any vertex between the end points is smaller than '''tolerance_dp''', the approximation is accepted and all vertices in between are deleted. Otherwise, the segment is split into two segments at the vertex of greatest distance and the process is repeated.\\\\
+'''tolerance_dp''' is internally multiplied with {{{SQRT( dx*dy )}}}. If a building is left with less than 4 vertices after simplification using '''tolerance_dp(0)''', it is reset and the process is repeated with '''tolerance_dp(1)''', then '''tolerance_dp(2)''', if necessary.\\\\
+'''NOTE:''' The NavMesh-tool produces an ASCII output-file {{{topo.txt}}}. The polygon data is stored in this file. After execution of the tool, please check the polygon representation. If you are not satisfied, adjust '''tolerance_dp''' and rerun the tool.
+}}}
 
-}}}
+
 == 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]