Closed mjcortejo closed 1 year ago
Have to consider the nature of no-left turns of BGC.
But we can start with just allowing left turns
There's an issue detected when an agent is going through an intersection connected from an entry node, e.g.:
E3 -> 19
Key error of neighboring node to E3 is not detected.
The reason for this is 19 is an intersection, but I have a mechanism where it counts the indegrees if > 2. However a function called get_intersection_light_state
returns a Key error to E3, but it doesn't register as a neighbor
Need to create a special mechanism to allow neighbors from an entry point.
Either we have to create a directed edge going to entry node or a special case where if an out-degree is an "E" node.
That's all for now!
Initial layout design
There's an issue detected when an agent is going through an intersection connected from an entry node, e.g.:
E3 -> 19
Key error of neighboring node to E3 is not detected.
The reason for this is 19 is an intersection, but I have a mechanism where it counts the indegrees if > 2. However a function called
get_intersection_light_state
returns a Key error to E3, but it doesn't register as a neighborNeed to create a special mechanism to allow neighbors from an entry point.
Either we have to create a directed edge going to entry node or a special case where if an out-degree is an "E" node.
That's all for now!
Added this line, when it detects an 'E' in the node and creates an inverse edge for all outgoing 'E' nodes
Just a rough node layout of BGC.
Map below:
Original link:
https://www.backpackingphilippines.com/2013/03/how-to-get-to-fort-bonifacio-global.html