... | ... | @@ -18,7 +18,7 @@ Different router are implemented. However: |
|
|
## Floorfield Router
|
|
|
|
|
|
The floorfield-router is our latest router, which uses floorfields
|
|
|
to calculate the distances among the doors of the same `subroom`.
|
|
|
to calculate the distances among the doors of each `subroom`.
|
|
|
The major difference to any other router is, that it does __not__
|
|
|
need convex subrooms/rooms any longer. There is no need for adding
|
|
|
helplines.
|
... | ... | @@ -26,6 +26,8 @@ helplines. |
|
|
It fills an adjacency matrix and calculates global-shortest paths via the
|
|
|
Floyd-Warshall algorithm.
|
|
|
|
|
|
In the router's parameters section, you can control the outputfiles (.vtk) as shown in the snippet below.
|
|
|
|
|
|
The floorfield-router will give intermediate targets within the`subroom`
|
|
|
of each agent. It works in combination with exit strategies 8 and 9.[^str_8_9]
|
|
|
|
... | ... | @@ -43,9 +45,9 @@ If there are two points with the same ($`x, y`$)-coordinates, which differ |
|
|
only in the $`z`$-coordinate, the router will face problems, thus we defined
|
|
|
the restriction above. That should avoid any such cases.
|
|
|
|
|
|
The floorfield router provides one mode: ```ff_global_shortest```
|
|
|
The floorfield router provides one mode: ```ff_global_shortest``` and ```ff_quickest```
|
|
|
|
|
|
```ff_local_shortest``` and ```ff_quickest``` will follow shortly.
|
|
|
```ff_local_shortest``` will follow shortly.
|
|
|
|
|
|
<div class="alert alert-info">
|
|
|
<strong>Important! </strong>If you use a router, which allows non-convex subrooms/rooms, you should use an exit-strategy,
|
... | ... | @@ -59,6 +61,9 @@ Following snippet is a definition example of the routing information: |
|
|
```xml
|
|
|
<route_choice_models>
|
|
|
<router router_id="1" description="ff_global_shortest">
|
|
|
<parameters>
|
|
|
<write_VTK_files>true</write_VTK_files>
|
|
|
</parameters>
|
|
|
</router>
|
|
|
|
|
|
<!-- Not yet implemented -->
|
... | ... | |