docs/models/routing.md

+# Routing
+Different router are implemented. However: 
+
+```
+Actually the router-class is undergoing a a major refactoring...
+```
+
+
+## Global shortest path
+
+At the beginning of the simulation, the Dijkstra algorithm is used to
+build a network which is then cached and used through the simulation
+life time.
+
+## Quickest path
+
+In the quickest path, the peds are rerouted based on actual traffic
+conditions. This defaults to the global shortest path when the patience
+time of the agents are very large.
+
+Detailed information about the aforementioned models
+are presented in: [KemlohWagoum2012a][#KemlohWagoum2012a]
+
+Following snippet is a definition example of the routing information:
+
+```xml
+<route_choice_models>
+  <router router_id="1" description="quickest">
+    <parameters>
+      <navigation_mesh method="triangulation" use_for_local_planning="true" />
+    </parameters>
+  </router>
+
+  <router router_id="2" description="global_shortest">
+    <parameters>
+      <navigation_lines file="routing.xml" />
+    </parameters>
+  </router>
+</route_choice_models>
+```
+
+## The cognitive map
+See this [talk](http://www.citg.tudelft.nl/fileadmin/Faculteit/CiTG/Over_de_faculteit/Afdelingen/Afdeling_Transport_en_Planning/conference/tgf15/presentations/wednesday/session_a/Andresen_tgf2015.pdf) to get the idea
+
+```xml
+<router router_id="7" description="cognitive_map">
+  <sensors>
+      <sensor sensor_id="1" description="Room2Corridor"/>
+      <sensor sensor_id="2" description="Smoke" p_field_path="D:\JuPedSim\jpscore\inputfiles\cognitive_map\pFields\" update_time="30" final_time="300"/>
+  </sensors>
+  <cognitive_map status="complete" />
+</router>
+```
+
+[#KemlohWagoum2012a]: dx.doi.org/10.1142%2FS0219525912500294 "Kemloh et al "Modeling the dynamic route choice of pedestrians to assess the criticality of building evacuation. Advances in Complex Systems. 2012"