-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Loops in calculating receiver distances #52
Comments
As the current script searches for the least cost-distance, this is not supported yet. As a side note, the current matrix is containing a single defined distance in between each receiver (NxN matrix). How would you propose to represent these alternative routes? |
Maybe an additional code can be written in case loops are present. The presence of loops can be indicated in the external network csv file (e.g. column 'loop' with '1' next to the stations that are part of a loop). |
![afbeelding1](https://cloud.githubusercontent.com/assets/9251008/22821812/09ccb736-ef7d-11e6-8bf1-a437819ee08b.png)
In fact this means that in future projects (receiver networks) containing
loops, we should install recivers "in the loop", ensuring that the distance
between these "extra" receivers and the receivers near the "cross-roads of
the different loops" is smaller than the distance between these
cross-road-receivers ... Illustrated below: red circles= "cross-road
receivers" (which are in fact the receivers between which two different
routes are possible), blue stars:the extra receivers in the loop. The
discrepancy between route D versus route ABC to go from the one circled
receiver to the other, is than made by the receivers in between (bleu stars
and green receivers in the Albert channel).
So perhaps, if we could insert "virtual receivers" (the blue stars on the
map below) in the detection file based on the sub-sequence of the receivers
for which we have detections, we could automate the calculation of the
distances for the case of the Kempense Kanalen?
Not sure whether this idea is clear and feasible?
|
@IPauwels could you upload your figure as well (on gitub: edit comment, just drag your picture into the edit field) |
I close this issue as it is further discussed in a very similar way in #68. |
Automatically calculating receiver distances in longitudinal networks works excellent. A new challenge is calculating distances when loops are present, due to parallel canals. For example, fish migrating through the Albert Canal have different options to get into the Schelde in Antwerpen:
How could this be implemented in the script?
The text was updated successfully, but these errors were encountered: