![]() Murphy's law dictates that the lead car in that lane is going straight, forcing everyone behind him to stand still until the "all green" signal – those who wanted to turn must now fight with oncoming traffic, and even those wanting to go straight must now wait for the guy in front of him to cross the oncoming traffic! ![]() In order to collect any meaningful data which would be useful in routing, you must first be able to completely define every signaling device, for every lane – not just turning lanes and thru lanes, but also those poorly-designed junctions without turning lanes, which nevertheless provide a few seconds of "green arrow" (to cross oncoming lanes) before switching to "all green". Therefore, the solution (the data to be captured) seems far too simple to provide a real-world solution. Interesting idea, but this model, in its current form, presents an extreme oversimplification, by making "degenerate case" assumptions about the problem (i.e. Type= traffic_lights a= number of seconds b= number of secondsįor each a,b, etc time slice watch the lights and do an ordered list of time slices Map the lentgh of time slices and each traffic light to the relation as member: Yellow light timing is fixed so mapping that is not needed. You will give a letter for each time slice and denote which section gives the green light, and which does the red light. In traffic-lights-controlled junctions, some traffic lights give the green longer, some give shorter.īy tagging red and green light tmes and case reprecancy, we can create faster routes according to waiting times.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |