Hi Jakob,
Thank you very much for helping! I appreciate it.
Have a good day and stay safe!
Sincerely, Dayuan
Generally, you will have to perform a recursive search in the road network since there may be multiple edges between adjacent tls even if they are in close proximity (due to changes in lane number of speed). You can use sumolib to traverse the network graph: https://sumo.dlr.de/docs/Tools/Sumolib.html
regards, Ja
BTW: My stupid solution:
Let's call this TL as TL1. Assume it's crossroads. It has four nearby TLs which are TL_E, TL_N, TL_W, TL_S.
1, get TL1’s edges E1, E2, E3, E4, 2, then get that edge E1's connected TLs. Usually an edge has two TLs. So one will be TL1 and another one is that nearby TL we want. 3, repeat for E2, E3, E4.
But this is just so redundant. Any other better idea? Thank you very much!
Dear all,
Hope everything goes well!
Could you help to tell me how to get a TL's nearby TLs? Usually a Traffic Light has 4 nearby TLs in most city road net, but how to get the IDs of those 4 TLs? Any idea or suggestion?
Thank you very much in advance! Any reply will be appreciated!
Have a good day and stay safe!
Sincerely, Dayuan
_______________________________________________
sumo-user mailing list
sumo-user@xxxxxxxxxxx
To unsubscribe from this list, visit https://www.eclipse.org/mailman/listinfo/sumo-user
_______________________________________________ sumo-user mailing list sumo-user@xxxxxxxxxxxTo unsubscribe from this list, visit https://www.eclipse.org/mailman/listinfo/sumo-user
|