| CPC G06F 16/387 (2019.01) [G06F 16/245 (2019.01); G06F 16/24578 (2019.01); G06F 16/29 (2019.01); G06F 16/437 (2019.01); G06F 16/4387 (2019.01); G06F 16/444 (2019.01); G06F 16/487 (2019.01); G06F 16/732 (2019.01); G06F 16/738 (2019.01); G06F 16/78 (2019.01); G06F 16/787 (2019.01); G06F 16/9537 (2019.01); G06Q 30/02 (2013.01); G06Q 30/0261 (2013.01); H04W 4/029 (2018.02); H04L 67/52 (2022.05); H04L 2101/69 (2022.05)] | 24 Claims |

|
1. A computer-implemented method, comprising:
determining a route;
predicting a future play window along the determined route, wherein a future play window determines when geo-relevant content is playable;
caching geo-relevant content associated with one or more points within the predicted future play window;
selecting a point, wherein the point is a qualifying point when the point is within a future play window;
determining a first line between the route and the point, wherein the intersection of the line and the route represents a minimum distance between the route and the point;
determining a second line and a third line between the route and the point, wherein the second line represents the start of a future play window, wherein the third line represents the end of the future play window;
determining whether the point is a qualifying point;
dynamically selecting geo-relevant content associated with the qualifying point;
determining the downloadability of the geo-relevant content, wherein when the geo-relevant content is unavailable, the cached geo-relevant content is selected; and
transmitting the geo-relevant content or the cached geo-relevant content when the point is a qualifying point within the future play window.
|