# US 11,908,320 B2 · Method, apparatus and computer program product for defining a strand upstream of a direction-based traffic link > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,908,320 B2 - Document ID: US11908320B2 - Status: Granted - Kind: B2 - Application number: 17/961,332 - Filed: 2022-10-06 - Published: 2023-02-02 - Granted: 2024-02-20 - Earliest claimed: 2019-11-26 - Assignees: HERE Global B.V. - Applicants: Here Global B.V. - Inventors: James Fowe; Aditya Jadhav; Earl Hammond - Web page: https://patentgrep.com/patent/US11908320B2 ## CPC - G08G 1/052: with provision for determining speed or overspeed {(speed measuring in general G01P)} - G08G 1/0116: {from roadside infrastructure, e.g. beacons} - G08G 1/0133: {for classifying traffic situation} - G08G 1/0145: {for active traffic flow control} - G08G 1/08: according to detected number or speed of vehicles - H04L 45/3065: {for real time traffic} - H04W 4/44: for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H] - H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network - H04W 72/54: based on quality criteria - G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93}) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract A method, apparatus and computer program product are provided to define a strand upstream of a direction based traffic (DBT) link. In a method, a strand is defined upstream of a DBT link. The method includes extending the strand so as to include one or more links upstream of the DBT link. The strand is extended by determining whether a link is to be added to the strand based upon evaluation of a termination criteria. The termination criteria is at least partially based upon a relationship of a function class of the link to the function class of one or more other links. In an instance in which the termination criteria is satisfied, the method ceases further extension of the strand. ## Claims ### Claim 1 A method for selecting one or more direction based traffic (DBT) intersections for DBT topology stranding, the method comprising: for each of a plurality of time epochs, determining, by a processor, a representation of a turning speed in a downstream direction for traffic in each of a plurality of lanes of a link immediately upstream of a DBT intersection; for each of the plurality of time epochs, determining, by the processor, a ratio of a first representation of the turning speed for traffic in a first lane of the link to a second representation of the turning speed for traffic in a second lane of the link; determining, by the processor, a speed ratio for the DBT intersection based upon the ratios that are determined for each of the plurality of time epochs; prioritizing, by the processor, one or more DBT intersections for DBT topology stranding based upon the speed ratio for the one or more DBT intersections; obtaining, by the processor, traffic information for the prioritized one or more DBT intersections; defining, by the processor, based on the prioritized one or more DBT intersections, a route that provides lane level guidance to a driver or a vehicle indicating a lane of a link of a DBT intersection of which the vehicle should travel, the route indicating the traffic information; providing to the driver or the vehicle via a user interface, the route; and providing, by the processor, the traffic information on the user interface. ### Claim 2 (depends on 1) A method according to claim 1, wherein determining the representation of the turning speed comprises determining an average turning speed in the downstream direction for traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 3 (depends on 2) A method according to claim 2, wherein the first and second representations of the turning speed comprise the highest and lowest average turning speeds, respectively, of the average turning speeds determined for the plurality of lanes of the link immediately upstream of the DBT intersection, and wherein determining the ratio comprises determining the ratio of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 4 (depends on 3) A method according to claim 3, wherein determining the speed ratio comprises determining an average of the ratios of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection for each of the plurality of time epochs. ### Claim 5 (depends on 1) A method according to claim 1, wherein determining the representation of the turning speed is based upon historical data regarding traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection for each of a plurality of time epochs. ### Claim 6 (depends on 1) A method according to claim 1 further comprising ranking, by the processor, the one or more DBT intersections based upon the speed ratio for the one or more DBT intersections prior to prioritizing the one or more DBT intersections. ### Claim 7 A non-transitory computer-readable storage medium having computer program code instructions stored therein, the computer program code instructions, when executed by at least one processor, cause the at least one processor to: for each of a plurality of time epochs, determine a representation of a turning speed in a downstream direction for traffic in each of a plurality of lanes of a link immediately upstream of a direction based traffic (DBT) intersection; for each of the plurality of time epochs, determine a ratio of a first representation of the turning speed for traffic in a first lane of the link to a second representation of the turning speed for traffic in a second lane of the link; determine a speed ratio for the DBT intersection based upon the ratios that are determined for each of the plurality of time epochs; prioritize one or more DBT intersections for DBT topology stranding based upon the speed ratio for the one or more DBT intersections; obtain traffic information for the one or more DBT intersection; define, based on the prioritized one or more DBT intersections, a route that provides lane level guidance to a driver or a vehicle indicating a lane of a link of a DBT intersection of which the vehicle should travel, the route indicating the traffic information; provide to the driver or the vehicle via a user interface, the route; and provide the traffic information on a user interface. ### Claim 8 (depends on 7) A non-transitory computer-readable storage medium according to claim 7, wherein, to determine the representation of the turning speed, the computer program code instructions, when executed by the at least one processor, cause the at least one processor to determine an average turning speed in the downstream direction for traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 9 (depends on 8) A non-transitory computer-readable storage medium according to claim 8, wherein the first and second representations of the turning speed comprise the highest and lowest average turning speeds, respectively, of the average turning speeds determined for the plurality of lanes of the link immediately upstream of the DBT intersection, and wherein, to the determine the ratio, the computer program code instructions, when executed by the at least one processor, cause the at least one processor to determine the ratio of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 10 (depends on 9) A non-transitory computer-readable storage medium according to claim 9, wherein to determine the speed ratio, the computer program code instructions, when executed by the at least one processor, cause the at least one processor to determine an average of the ratios of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection for each of the plurality of time epochs. ### Claim 11 (depends on 7) A non-transitory computer-readable storage medium according to claim 7, wherein the computer program code instructions, when executed by the at least one processor, cause the at least one processor to determine the representation of the turning speed based upon historical data regarding traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection for each of a plurality of time epochs. ### Claim 12 (depends on 7) A non-transitory computer-readable storage medium according to claim 7, wherein the computer program code instructions, when executed by the at least one processor, cause the at least one processor to rank the one or more DBT intersections based upon the speed ratio for the one or more DBT intersections prior to prioritizing the one or more DBT intersections. ### Claim 13 An apparatus comprising at least one processor and at least one non-transitory memory including computer program code instructions, the computer program code instructions configured to, when executed, cause the apparatus to: for each of a plurality of time epochs, determine a representation of a turning speed in a downstream direction for traffic in each of a plurality of lanes of a link immediately upstream of a direction based traffic (DBT) intersection; for each of the plurality of time epochs, determine a ratio of a first representation of the turning speed for traffic in a first lane of the link to a second representation of the turning speed for traffic in a second lane of the link; determine a speed ratio for the DBT intersection based upon the ratios that are determined for each of the plurality of time epochs; select one or more DBT intersections for DBT topology stranding based upon the speed ratio for the one or more DBT intersections; obtain traffic information for the one or more DBT intersection; define, based on the prioritized one or more DBT intersections, a route that provides lane level guidance to a driver or a vehicle indicating a lane of a link of a DBT intersection of which the vehicle should travel, the route indicating the traffic information; provide to the driver or the vehicle via a user interface, the route; and provide the traffic information on a user interface. ### Claim 14 (depends on 13) An apparatus according to claim 13, wherein, to determine the representation of the turning speed, the computer program code instructions are configured to, when executed, cause the apparatus to determine an average turning speed in the downstream direction for traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 15 (depends on 14) An apparatus according to claim 14, wherein the first and second representations of the turning speed comprise the highest and lowest average turning speeds, respectively, of the average turning speeds determined for the plurality of lanes of the link immediately upstream of the DBT intersection, and wherein, to the determine the ratio, the computer program code instructions are configured to, when executed, cause the apparatus to determine the ratio of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection. ### Claim 16 (depends on 15) An apparatus according to claim 15, wherein, to determine the speed ratio, the computer program code instructions are configured to, when executed, cause the apparatus to determine an average of the ratios of the highest average turning speed to the lowest average turning speed for the plurality of lanes of the link immediately upstream of the DBT intersection for each of the plurality of time epochs. ### Claim 17 (depends on 13) An apparatus according to claim 13, wherein the computer program code instructions are configured to, when executed, cause the apparatus to determine the representation of the turning speed based upon historical data regarding traffic in each of the plurality of lanes of the link immediately upstream of the DBT intersection for each of a plurality of time epochs. ### Claim 18 (depends on 13) An apparatus according to claim 13, wherein the computer program code instructions are configured to, when executed, cause the apparatus to rank the one or more DBT intersections based upon the speed ratio for the one or more DBT intersections prior to prioritizing the one or more DBT intersections. ### Claim 19 (depends on 18) An apparatus according to claim 18, wherein the one or more DBT intersections is prioritized from a plurality of DBT intersections, wherein the one or more DBT intersections is ranked higher than one or more remaining DBT intersections among the plurality of DBT intersections, and wherein the speed ratio for the one or more DBT intersections is greater than the speed ratio for the one or more remaining DBT intersections among the plurality of DBT intersection. ### Claim 20 (depends on 13) An apparatus according to claim 13, wherein the representation of the turning speed is a left turn, right turn, U-turn, or a proceeding in a straight direction without a turn.