Granted Patent B2

US 12,560,441 · App. 17/739,890 · Granted Feb 24, 2026

Inventors: Jerome Beaurepaire (Berlin, DE); Remco Timmer (Amsterdam, NL)

Assignee: HERE Global B.V.

G01C21/343G01C21/3605G01C21/3694

Abstract

Claims (54)

1 . A method comprising:

receiving, via a communication interface, a request to generate a navigation route for a requesting entity to visit a plurality of entities via a multi-stop tour with respective meeting locations, wherein one or more mobile entities of the plurality of entities are associated with a maximum travel distance, a maximum travel time, or a combination thereof that the one or more mobile entities are to move from a current location of each of the one or more mobile entities to the respective meeting locations during the navigation route;

computing, by at least one processor, respective isolines around each mobile entity based on the maximum travel distance, the maximum travel time, or a combination thereof;

connecting, by at least one processor, at least the respective isolines around each mobile entity to determine the navigation route;

providing the navigation route as an output in a navigation user interface;

receiving, via the communication interface, real-time trajectory data from one or more location sensors of one or more devices associated with the requesting entity, the one or more mobile entities, or a combination thereof; and

in response to receiving the real-time trajectory data, automatically re-computing, by the at least one processor, the navigation route and adjusting the navigation user interface based on the re-computed navigation route.

2 . The method of claim 1 , wherein the connecting of the respective isolines comprises generating a polygon that connects the respective isolines with a starting point of the navigation route.

3 . The method of claim 2 , wherein the polygon is a convex hull.

4 . The method of claim 2 , wherein the navigation route comprises a sequence of the respective meeting locations for each entity to meet the requesting entity along the navigation route.

5 . The method of claim 4 , wherein the navigation route further comprises respective meeting times for each entity based on an estimated time of arrival at each of the respective meeting locations by the requesting entity.

6 . The method of claim 5 , further comprising:

monitoring a progress of the requesting entity moving along the navigation route;

recomputing the navigation route, the respective meeting locations, the respective meeting times, or a combination thereof based on determining that the progress indicates a delay above a threshold value; and

transmitting the recomputed route, the recomputed meeting locations, the recomputed meeting times, or a combination thereof to the requesting entity, one or more of the plurality of entities, or a combination thereof.

7 . The method of claim 5 , further comprising:

determining a context associated with visiting each entity; and

determining the respective meeting locations, the respective meeting times, or a combination thereof based on the context.

8 . The method of claim 5 , further comprising:

determining a meeting resource to be used at the respective meeting locations; and

initiating at least one of:

a reservation of the meeting resource based on the respective meeting locations, the respective meeting times, or a combination thereof;

a delivery of the meeting resource based on the respective meeting locations, the respective meeting times, or a combination thereof; and

a creation of a list of the meeting resource.

9 . The method of claim 4 , further comprising:

selecting the respective meeting locations within one or more areas located between the navigation route, the isolines, or a convex hull connecting the current location of each mobile entity.

10 . The method of claim 1 , wherein the navigation route is a walking route, and wherein the plurality of entities includes a plurality of people that a requesting entity of the navigation route wants to meet.

11 . The method of claim 1 , further comprising:

optimizing the navigation route based on at least one of scenery, time, privacy, weather, noise, traffic, or a combination thereof.

12 . An apparatus comprising:

at least one processor; and

at least one memory including computer program code for one or more programs,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,

retrieve, via a communication interface, a request to generate a navigation route for a requesting entity to visit a plurality of entities via a multi-stop tour with one or more flexible meeting locations, wherein one or more mobile entities of the plurality of entities are associated with a maximum travel distance, a maximum travel time, or a combination thereof that the one or more mobile entities are to move from a current location of each of the one or more mobile entities to the one or more flexible meeting locations during the navigation route;

compute, by the at least one processor, respective isolines around each mobile entity based on the maximum travel distance, the maximum travel time, or a combination thereof;

connect, by at least one processor, at least the respective isolines around each mobile entity to determine the navigation route;

provide the navigation route as an output in a navigation user interface;

receive, via the communication interface, real-time trajectory data from one or more location sensors of one or more devices associated with the requesting entity, the one or more mobile entities, or a combination thereof; and

in response to receiving the real-time trajectory data, automatically re-compute, by the at least one processor, the navigation route and adjusting the navigation user interface based on the re-computed navigation route.

13 . The apparatus of claim 12 , wherein the connecting of the respective isolines comprises generating a polygon that connects the respective isolines with a starting point of the navigation route.

14 . The apparatus of claim 13 , wherein the polygon is a convex hull.

15 . The apparatus of claim 13 , wherein the navigation route comprises a sequence of the respective meeting locations for each entity to meet the requesting entity along the navigation route.

16 . The apparatus of claim 15 , wherein the navigation route further comprises respective meeting times for each entity based on an estimated time of arrival at each of the respective meeting locations by the requesting entity.

17 . The apparatus of claim 15 , wherein the apparatus is further caused to:

select the respective meeting locations within one or more areas located between the navigation route, the isolines, or a convex hull connecting the current location of each mobile entity.

18 . A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform:

receiving a request to generate a navigation route for a requesting entity to visit a plurality of entities via a multi-stop tour with one or more flexible meeting locations, wherein one or more mobile entities of the plurality of entities are associated with a maximum travel distance, a maximum travel time, or a combination thereof that the one or more mobile entities are to move from a current location of each of the one or more mobile entities to the one or more flexible meeting locations during the navigation route;

computing respective isolines around each mobile entity based on the maximum travel distance, the maximum travel time, or a combination thereof;

connecting at least the respective isolines around each mobile entity to determine the navigation route; and

providing the navigation route as an output in a navigation user interface;

receiving, via the communication interface, real-time trajectory data from one or more location sensors of one or more devices associated with the requesting entity, the one or more mobile entities, or a combination thereof; and

in response to receiving the real-time trajectory data, automatically re-computing, by the at least one processor, the navigation route and adjusting the navigation user interface based on the re-computed navigation route.

19 . The non-transitory computer-readable storage medium of claim 18 , wherein the connecting of the respective isolines comprises generating a polygon that connects the respective isolines with a starting point of the navigation route.

20 . The non-transitory computer-readable storage medium of claim 19 , wherein the polygon is a convex hull.

Assignments (1)

Continuity (1)

References Cited (13)