Navigation device and method

A server comprising:

• a receiving section for receiving, over a network, a request for a search route from a remote device;
• a sending section for sending, over the network to the remote device, the determined search route;
• one or more processors;
• a memory, wherein the memory stores
• map information, the map information including information identifying a plurality of potential positions, each potential position corresponding to a position at which a likelihood of a location of a predetermined type is found, the map information further including time dependent probability information for each potential position, the probability information corresponding to the likelihood of finding a location of the predetermined type at the respective potential position at a plurality of different time intervals;
• an updating section arranged to use received temporary probability information for at least one potential position of the plurality of potential positions in place of the probability information in the map information for a predetermined time before subsequently reverting to the probability information in the map information;
• and
• a search route module,
• wherein the one or more processors are arranged to determine the search route from a start position at a current or future departure time using the search route module, the search route visiting at least one of the potential positions, the determination of the search route using a predetermined cost function based at least on the probability information for the estimated time of arrival at each potential position to determine a route having a highest probability of potential positions of the predetermined type being found in a shortest time or with a least distance travelled.

A computer-implemented method of providing a search route comprising:

• receiving a request to provide a search route for a location of a predetermined type;
• accessing, by a processor, stored map information, the map information including information identifying a plurality of potential positions, each potential position corresponding to a position at which a likelihood of a location of a predetermined type is found, the map information further including time dependent probability information for each potential position, the probability information corresponding to a likelihood of finding a location of the predetermined type at the respective potential position at a plurality of different time intervals;
• receiving temporary probability information for at least one potential position of the plurality of potential positions from a server, the temporary probability information to be used in place of the probability information associated with the map information for a predetermined time before reverting to the probability information in the map information;
• determining, by the processor, a route visiting at least one of the potential positions, the determination of the route using a predetermined cost function based at least on the probability information for the estimated time of arrival at each potential position to determine
• a route having a highest probability of potential positions of the predetermined type being found in a shortest time or with a least distance travelled;
• and
• outputting, by the processor, the determined route as the search route.

A non-transitory computer readable medium which stores a set of instructions which when executed performs a method for providing a search route, the method executed by the set of instructions comprising:

• receiving a request to provide a search route for a location of a predetermined type;
• accessing, by a processor, stored map information, the map information including information identifying a plurality of potential positions, each potential position corresponding to a position at which a likelihood of a location of a predetermined type is found, the map information further including time dependent probability information for each potential position, the probability information corresponding to a likelihood of finding a location of the predetermined type at the respective potential position at a plurality of different time intervals;
• receiving temporary probability information for at least one potential position of the plurality of potential positions from a server, the temporary probability information to be used in place of the probability information associated with the map information for a predetermined time before reverting to the probability information in the map information;
• determining, by the processor, a route visiting at least one of the potential positions, the determination of the route using a predetermined cost function based at least on the probability information for the estimated time of arrival at each potential position to determine a route having a highest probability of potential positions of the predetermined type being found in a shortest time or with a least distance travelled;
• and
• outputting, by the processor, the determined route as the search route.