CN108985506A - Planning driving path recommended method, prediction technique, acquisition methods and its device - Google Patents

Planning driving path recommended method, prediction technique, acquisition methods and its device Download PDF

Info

Publication number
CN108985506A
CN108985506A CN201810719455.7A CN201810719455A CN108985506A CN 108985506 A CN108985506 A CN 108985506A CN 201810719455 A CN201810719455 A CN 201810719455A CN 108985506 A CN108985506 A CN 108985506A
Authority
CN
China
Prior art keywords
time
subpath
path
recommendation results
planning driving
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810719455.7A
Other languages
Chinese (zh)
Inventor
唐怀东
罗涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NIO Holding Co Ltd
Original Assignee
NIO Nextev Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NIO Nextev Ltd filed Critical NIO Nextev Ltd
Priority to CN201810719455.7A priority Critical patent/CN108985506A/en
Publication of CN108985506A publication Critical patent/CN108985506A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Navigation (AREA)

Abstract

The present invention provides a kind of planning driving path recommended method, prediction technique, acquisition methods and its devices, the recommended method includes: client according to the instruction of input generation solicited message, and solicited message is sent to server, wherein, solicited message includes the information of starting point, the information of terminal and specified time;Server receives solicited message, and according to solicited message, recommendation results are calculated using the standard time of alternative path and each subpath including multiple subpaths, recommendation results include minimum running time and destination path under specified time, and destination path is alternative path corresponding to minimum running time;Recommendation results are sent to client by server;Client receives recommendation results, and is selectively shown to recommendation results.The present invention can be improved the accuracy of prediction running time, facilitates user that can reach home in the shortest possible time, and be avoided as much as traffic congestion problem, is conducive to people and preferably carries out trip arrangement.

Description

Planning driving path recommended method, prediction technique, acquisition methods and its device
Technical field
The invention belongs to traffic route electric powder predictions, specifically provide a kind of planning driving path recommended method, prediction technique, Acquisition methods and its device.
Background technique
Trip is one of daily routines of people, and before trip, people can be carried out by inquiry trip service system Inquiry, in order to make planning to travel time and activity.E.T.A (Estimated Time of Arrival, ETA) vital for some trip service systems, this is because accurately ETA prediction can effectively be supported to appoint Business, the scheduling of resource, personnel, enable the system to more optimized execution.Currently, the service about ETA is essentially divided into two classes: The first, real-time ETA service, based on current traffic condition, the information such as weather, provide that specified driving path needs to spend when Between;The second, prediction ETA service, the service are based on history traffic route, identical week is several, identical period and identical opens Beginning position and end position under the conditions of, using the ETA in history wheelpath as prediction result.
For real-time ETA service, since the dispatch service of the following a certain period is all based on the prediction to the period It is performed, therefore, real-time ETA service is difficult to carry out above-mentioned dispatch service;And for prediction ETA service, at identical Point, same endpoint and under conditions of the identical period, the data of historical track be often it is very sparse, therefore, can not be fine Ground provides an accurate result.
Correspondingly, this field needs a kind of method for capableing of ETA under Accurate Prediction rated condition to solve the above problems.
Summary of the invention
In order to solve the above problem in the prior art, in order to solve to predict the following running time precision in the prior art Lower problem, the present invention provides a kind of planning driving path recommended methods, comprising: client is generated according to the instruction of input and requested Information, and the solicited message is sent to server, wherein the solicited message includes origin information, endpoint information and refers to It fixes time;The server receives the solicited message, and according to the solicited message, using including at least two subpaths The standard time of alternative path and each subpath calculates recommendation results, and the recommendation results include the specified time Under minimum running time and destination path, the destination path be the minimum running time corresponding to alternative path;Institute It states server and the recommendation results is sent to the client;The client receives the recommendation results, and selectively The recommendation results are shown.
In the optimal technical scheme of above-mentioned recommended method, " alternative path and each institute for including multiple subpaths are utilized State subpath standard time calculate recommendation results " the step of include: that road network image is transferred from pre-established Traffic network database, The road network image includes multiple nodes and the subpath for connecting adjacent node;Select the section nearest apart from the starting point Point is used as first node, selects the node nearest apart from the terminal as second node, and generate at least one alternative path, The alternative path is sequentially connected with using the first node and the second node as endpoint and by least two subpaths It constitutes;Target data is transferred from pre-established historical data base, the target data includes having together with the specified time The standard time of each of the one time attribute subpath, the time attribute refer to that the time is locating a certain in one week The a certain period in it;The standard time of each of each alternative path subpath is summed, with The running time of every alternative path is calculated, and each running time is compared to obtain the most short row The vehicle time, using alternative path corresponding to the minimum running time as the destination path;Generate the recommendation results, institute Stating recommendation results includes the minimum running time and the destination path.
In the optimal technical scheme of above-mentioned recommended method, using Dijkstra's algorithm, two-way Dijkstra's algorithm Or Astar algorithm generates the alternative path.
In the optimal technical scheme of above-mentioned recommended method, the recommendation results further include non-targeted path, the non-mesh The running time in mark path is arranged according to ascending order.
In the optimal technical scheme of above-mentioned recommended method, the operation of the Traffic network database is established specifically: obtain former Beginning image, the original image include a plurality of history planning driving path;Using the node by each in the original image History planning driving path is divided at least two subpaths;The node and the subpath are extracted to form the road network figure Picture, and the road network image is stored to establish the Traffic network database.
In the optimal technical scheme of above-mentioned recommended method, the operation of the historical data base is established specifically: acquisition is gone through History travelling data, the history travelling data include history running time, and the history running time is to pass through the subpath Real time;Calculating is weighted and averaged to the history running time of the same subpath under same time attribute, with The sub- time is obtained, and acquires the standard time using the sub- time;By the standard time according to the time attribute into Row is classified and is stored, to establish the historical data base.
In the optimal technical scheme of above-mentioned recommended method, the planning driving path recommended method further include: the server Weather forecast information is obtained, the weather forecast information includes the Weather property of the specified time;The target data and institute State specified time Weather property having the same.
In the optimal technical scheme of above-mentioned recommended method, the operation of " establishing the historical data base " further include: obtaining After the standard time and before being stored to the standard time, by the standard time according to the Weather property into Row classification.
In the optimal technical scheme of above-mentioned recommended method, the historical data base is the number stored based on distributed document According to library.
In the optimal technical scheme of above-mentioned recommended method, the subpath includes the first subpath, the first sub- road Diameter is the subpath being only included in an alternative path under a time attribute, " utilizes the sub- time Acquire the standard time " the step of include: standard using the sub- time of first subpath as first subpath Time.
In the optimal technical scheme of above-mentioned recommended method, the subpath includes the second subpath, the second sub- road Diameter is the subpath being included at least two alternative paths under a time attribute, " utilizes the period of the day from 11 p.m. to 1 a.m Between acquire the standard time " the step of include: sub- time to second subpath in every alternative path into Row weighted average, to calculate the standard time of second subpath.
In the optimal technical scheme of above-mentioned recommended method, at least two subpath includes the sub- road of at least one third Diameter, the third subpath do not have the history running time under at least one described time attribute, " utilize the sub- time Acquire the standard time " the step of include: using infinity as the third subpath at least one described described time The standard time under attribute;Or calculate the standard of the third subpath under other each described time attributes When average value, and using the average value as the standard time of the third subpath.
In the optimal technical scheme of above-mentioned recommended method, the step of " client generates solicited message according to the instruction of input " It suddenly include: the instruction for obtaining input, described instruction includes start position, final position and the specified time;The client The GPS information for obtaining the start position using global positioning system obtains the GPS letter of the terminal as the origin information Breath is used as the endpoint information;The client is generated using the origin information, the endpoint information and the specified time The solicited message.
In the optimal technical scheme of above-mentioned recommended method, the client is mobile terminal or car-mounted terminal.
On the other hand, the present invention provides a kind of planning driving path prediction technique, comprising: solicited message is received, it is described to ask Seeking information includes origin information, endpoint information and specified time;According to the solicited message, using including at least two subpaths Alternative path and each subpath standard time, calculate recommendation results, wherein the recommendation results include the finger Minimum running time and destination path under fixing time, the destination path are alternative road corresponding to the minimum running time Diameter;The recommendation results are sent to client.
In the optimal technical scheme of above-mentioned prediction technique, " using the alternative path for including at least two subpaths and often The step of standard time calculating recommendation results of a subpath " includes: to transfer road network from pre-established Traffic network database Image, the road network image include the subpath of multiple nodes and the connection node;It selects nearest apart from the starting point Node selects the node nearest apart from the terminal as second node as first node, and generates multiple alternative paths, institute It states alternative path and is sequentially connected with structure using the first node and the second node as endpoint and by least two subpaths At;Target data is transferred from pre-established historical data base, the target data includes with the specified time with same The standard time of each of time attribute subpath, the time attribute refer to some day locating in the one week time In a certain period;The standard time of each of each alternative path subpath is summed, to calculate The running time of every alternative path, and when being compared each running time to obtain the most short driving Between, using alternative path corresponding to the minimum running time as the destination path;The recommendation results are generated, it is described to push away Recommending result includes the minimum running time and the destination path.
In the optimal technical scheme of above-mentioned prediction technique, using Dijkstra's algorithm, two-way Dijkstra's algorithm Or Astar algorithm generates the alternative path.
In the optimal technical scheme of above-mentioned prediction technique, the recommendation results further include non-targeted path, the non-mesh The running time in mark path is arranged according to ascending order.
In the optimal technical scheme of above-mentioned prediction technique, the operation of the Traffic network database is established specifically: obtain former Beginning image, the original image include a plurality of history planning driving path;Using the node by each in the original image History planning driving path is divided at least two subpaths;The node and the subpath are extracted to form the road network figure Picture, and the road network image is stored to establish the Traffic network database.
In the optimal technical scheme of above-mentioned prediction technique, the operation of the historical data base is established specifically: acquisition is gone through History travelling data, the history travelling data include history running time, and the history running time is to pass through the subpath Real time;The history running time of the same subpath under the same time attribute is weighted and averaged It calculates, to obtain the sub- time, and acquires the standard time using the sub- time;By the standard time according to the time Attribute is classified and is stored, to establish the historical data base.
In the optimal technical scheme of above-mentioned prediction technique, the planning driving path prediction technique further include: it is pre- to obtain weather It notifies breath, the weather forecast information includes the Weather property of the specified time, wherein the target data and described specified Time Weather property having the same.
In the optimal technical scheme of above-mentioned prediction technique, the operation of " establishing the historical data base " further include: obtaining The standard time must be divided according to Weather property after the standard time and before being stored to the standard time Class.
In the optimal technical scheme of above-mentioned prediction technique, the historical data base is distributed document storing data library.
In the optimal technical scheme of above-mentioned prediction technique, the subpath includes the first subpath, the first sub- road Diameter is the subpath being only included in an alternative path under a time attribute, " utilizes the sub- time Acquire the standard time " the step of include: standard using the sub- time of first subpath as first subpath Time.
In the optimal technical scheme of above-mentioned prediction technique, the subpath includes the second subpath, the second sub- road Diameter is the subpath being included at least two alternative paths under a time attribute, " utilizes the period of the day from 11 p.m. to 1 a.m Between acquire the standard time " the step of include: sub- time to second subpath in every alternative path into Row weighted average, to calculate the standard time of second subpath.
In the optimal technical scheme of above-mentioned prediction technique, at least two subpath includes the sub- road of at least one third Diameter, the third subpath do not have the history running time under at least one described time attribute, " utilize the sub- time Acquire the standard time " specifically: using infinity as the third subpath at least one described described time attribute Under the standard time;Alternatively, when calculating the standard of the third subpath under other each described time attributes Average value, and using the average value as the standard time of the third subpath.
In yet another aspect, the present invention provides a kind of planning driving path acquisition methods, comprising: is generated according to the instruction of input Solicited message, wherein the solicited message includes origin information, endpoint information and specified time;The solicited message is sent To server;Recommendation results are received, and selectively the recommendation results are shown.
In the optimal technical scheme of above-mentioned acquisition methods, and " according to the instruction of input generate solicited message " the step of wrap It includes: obtaining the instruction of input, described instruction includes start position, final position and the specified time;Utilize global positioning system System obtains information of the GPS information of the start position as the starting point, obtains the GPS information of the terminal as the end Point information;The solicited message is generated using the origin information, the endpoint information and the specified time.
In another aspect, the present invention provides a kind of server, the server includes processor and memory, described A plurality of instruction is stored in memory, the processor is suitable for loading described instruction to execute any of the above-described planning driving path Prediction technique.
In another another aspect, the present invention provides a kind of client, the client includes processor and memory, institute It states and is stored with a plurality of instruction in memory, the processor is suitable for loading described instruction to execute any of the above-described roadway Diameter acquisition methods.
In the optimal technical scheme of above-mentioned client, the client is mobile terminal or car-mounted terminal.
It will be appreciated to those of skill in the art that in the inventive solutions, using including multiple subpaths The standard time of alternative path and each subpath calculates the running time of each alternative path, can effectively improve prediction row The accuracy of vehicle time allows users to be gone on a journey according to the path of recommendation, reach home in the shortest possible time, can be as much as possible Traffic congestion problem is avoided, is conducive to people and preferably carries out trip arrangement;Meanwhile technical solution of the present invention can be used for mention Predictive information is provided for the mechanism of Precision service, preferably driving demand can be carried out in order to provide the mechanism of Precision service Scheduling.
Scheme 1, a kind of planning driving path recommended method, characterized by comprising:
Client generates solicited message according to the instruction of input, and the solicited message is sent to server, wherein described to ask Seeking information includes origin information, endpoint information and specified time;
The server receives the solicited message, and according to the solicited message, using including the standby of at least two subpaths The standard time of routing diameter and each subpath calculates recommendation results, and the recommendation results include under the specified time Minimum running time and destination path, the destination path are alternative path corresponding to the minimum running time;
The recommendation results are sent to the client by the server;
The client receives the recommendation results, and is selectively shown to the recommendation results.
Scheme 2, planning driving path recommended method according to scheme 1, which is characterized in that " utilizing includes the standby of multiple subpaths The standard time of routing diameter and each subpath calculate recommendation results " the step of include:
Road network image is transferred from pre-established Traffic network database, the road network image includes multiple nodes and connection adjacent segments The subpath of point;
It selects the node nearest apart from the starting point as first node, selects the node nearest apart from the terminal as second Node, and generate at least one alternative path, the alternative path using the first node and the second node as endpoint and It is sequentially connected with and is constituted by least two subpaths;
Target data is transferred from pre-established historical data base, the target data is to have with the specified time with for the moment Between each of the attribute subpath standard time, the time attribute refers in some day locating in one week time The a certain period;
The standard time of each of each alternative path subpath is summed, it is described standby to calculate every The running time of routing diameter, and each running time is compared to obtain the minimum running time, by described in most Alternative path corresponding to short running time is as the destination path;
The recommendation results are generated, the recommendation results include the minimum running time and the destination path.
Scheme 3, the planning driving path recommended method according to scheme 2, which is characterized in that using Dijkstra's algorithm, two-way Dijkstra's algorithm or Astar algorithm generate the alternative path.
Scheme 4, planning driving path recommended method according to scheme 3, which is characterized in that the recommendation results further include non-targeted The running time in path, the non-targeted path is arranged according to ascending order.
Scheme 5, the planning driving path recommended method according to scheme 2, which is characterized in that establish the operation of the Traffic network database Specifically:
Original image is obtained, the original image includes a plurality of history planning driving path;
Each history planning driving path in the original image is divided at least two subpaths using the node;
The node and the subpath are extracted to form the road network image, and stored the road network image to establish The Traffic network database.
Scheme 6, the planning driving path recommended method according to scheme 5, which is characterized in that establish the operation of the historical data base Specifically:
History travelling data is obtained, the history travelling data includes history running time, and the history running time is to pass through The real time of the subpath;
Calculating is weighted and averaged to the history running time of the same subpath under same time attribute, to obtain the period of the day from 11 p.m. to 1 a.m Between, and the standard time is acquired using the sub- time;
The standard time is classified and stored according to the time attribute, to establish the historical data base.
Scheme 7, planning driving path recommended method according to scheme 6, which is characterized in that the planning driving path recommended method is also wrapped Include: the server obtains weather forecast information, and the weather forecast information includes the Weather property of the specified time, In, the target data and specified time Weather property having the same.
Scheme 8, planning driving path recommended method according to scheme 7, which is characterized in that the behaviour of " establishing the historical data base " Make further include: before storing after obtaining standard time and to the standard time, by the standard time according to The Weather property is classified.
Scheme 9, the planning driving path recommended method according to any one of scheme 6-8, which is characterized in that the historical data base For the database stored based on distributed document.
Scheme 10, the planning driving path recommended method according to any one of scheme 6-8, which is characterized in that described at least two Subpath includes the first subpath, and first subpath is described standby to be only included in one under a time attribute The step of subpath in routing diameter, " acquiring the standard time using the sub- time " includes: with first subpath Standard time of the sub- time as first subpath.
Scheme 11, the planning driving path recommended method according to any one of scheme 6-8, which is characterized in that described at least two Subpath includes the second subpath, and second subpath is to be included under a time attribute at least described in two The step of subpath in alternative path, " acquiring the standard time using the sub- time " includes: to the described second sub- road Sub- time of the diameter in every alternative path is weighted and averaged, to calculate the standard time of second subpath.
Scheme 12, the planning driving path recommended method according to any one of scheme 6-8, which is characterized in that described two sub- roads Diameter includes third subpath, and the third subpath does not have the history running time under at least one described time attribute, The step of " acquiring the standard time using the sub- time " include: using it is infinitely great as the third subpath it is described extremely The standard time under a few time attribute;Alternatively, calculating the third under other each described time attributes The average value when standard of subpath, and using the average value as the standard time of the third subpath.
Scheme 13, planning driving path recommended method according to scheme 1, which is characterized in that " client is raw according to the instruction of input At solicited message " the step of include:
The instruction of input is obtained, described instruction includes start position, final position and the specified time;
The GPS information that the client obtains the start position using global positioning system is obtained as the origin information The GPS information of the terminal is as the endpoint information;
The client generates the solicited message using the origin information, the endpoint information and the specified time.
Scheme 14, planning driving path recommended method according to scheme 1, which is characterized in that the client be mobile terminal or Person's car-mounted terminal.
Scheme 15, a kind of planning driving path prediction technique, characterized by comprising:
Solicited message is received, the solicited message includes origin information, endpoint information and specified time;
According to the solicited message, using the alternative path and each subpath that include at least two subpaths standard when Between calculate recommendation results, wherein the recommendation results include minimum running time and destination path under the specified time, institute Stating destination path is alternative path corresponding to the minimum running time;
The recommendation results are sent to client.
Scheme 16, planning driving path prediction technique according to scheme 15, which is characterized in that " using including at least two sub- roads The standard time of the alternative path of diameter and each subpath calculate recommendation results " the step of include:
Road network image is transferred from pre-established Traffic network database, the road network image includes multiple nodes and connection adjacent segments The subpath of point;
It selects the node nearest apart from the starting point as first node, selects the node nearest apart from the terminal as second Node, and multiple alternative paths are generated, the alternative path is using the first node and the second node as endpoint and by extremely Few two subpaths are sequentially connected with composition;
Target data is transferred from pre-established historical data base, the target data refers to the specified time with same The standard time of each of time attribute subpath, the time attribute refer to some day locating in the one week time In a certain period;
The standard time of each of each alternative path subpath is summed, it is described standby to calculate every The running time of routing diameter, and each running time is compared to obtain the minimum running time, by described in most Alternative path corresponding to short running time is as the destination path;
The recommendation results are generated, the recommendation results include the minimum running time and the destination path.
Scheme 17, planning driving path prediction technique according to scheme 16, which is characterized in that using Dijkstra's algorithm, double The alternative path is generated to Dijkstra's algorithm or Astar algorithm.
Scheme 18, planning driving path prediction technique according to scheme 16, which is characterized in that the recommendation results further include non-mesh Path is marked, the running time in the non-targeted path is arranged according to ascending order.
Scheme 19, planning driving path prediction technique according to scheme 16, which is characterized in that establish the behaviour of the Traffic network database Make specifically:
Original image is obtained, the original image includes a plurality of history planning driving path;
Each history planning driving path in the original image is divided at least two subpaths using the node;
The node and the subpath are extracted to form the road network image, and stored the road network image to establish The Traffic network database.
Scheme 20, the planning driving path prediction technique according to scheme 19, which is characterized in that establish the behaviour of the historical data base Make specifically:
History travelling data is obtained, the history travelling data includes history running time, and the history running time is to pass through The real time of the subpath;
Calculating is weighted and averaged to the history running time of the same subpath under same time attribute, to obtain the period of the day from 11 p.m. to 1 a.m Between, and the standard time is acquired using the sub- time;
The standard time is classified and stored according to the time attribute, to establish the historical data base.
Scheme 21, the planning driving path prediction technique according to scheme 20, which is characterized in that the planning driving path prediction technique is also It include: acquisition weather forecast information, the weather forecast information includes the Weather property of the specified time, wherein the mesh Mark data and specified time Weather property having the same.
Scheme 22, the planning driving path prediction technique according to scheme 21, which is characterized in that " establishing the historical data base " Operation further include: before storing after obtaining the standard time and to the standard time, the standard time is pressed Classify according to Weather property.
Scheme 23, the planning driving path prediction technique according to any one of claim 20-22, which is characterized in that described to go through History database is distributed document storing data library.
Scheme 24, the planning driving path prediction technique according to any one of scheme 20-22, which is characterized in that the subpath Including the first subpath, first subpath is that the alternative path is only included under a time attribute In subpath, the step of " acquiring the standard time using the sub- time " includes: with the period of the day from 11 p.m. to 1 a.m of first subpath Between standard time as first subpath.
Scheme 25, the planning driving path prediction technique according to any one of scheme 20-22, which is characterized in that the subpath Including the second subpath, second subpath is that at least two alternative roads are included under a time attribute The step of subpath in diameter, " acquiring the standard time using the sub- time " includes: to second subpath every The sub- time in alternative path described in item is weighted and averaged, to calculate the standard time of second subpath.
Scheme 26, the planning driving path prediction technique according to any one of scheme 20-22, which is characterized in that described at least two A subpath includes that at least third subpath, the third subpath does not have the history under at least one described time attribute Running time, " acquiring the standard time using the sub- time " specifically: exist using infinity as the third subpath The standard time under at least one described described time attribute;Alternatively, calculating the institute under other each described time attributes The average value when standard of third subpath is stated, and using the average value as when the standard of the third subpath Between.
Scheme 27, a kind of planning driving path acquisition methods, characterized by comprising:
According to the instruction of input generate solicited message, wherein the solicited message include origin information, endpoint information and it is specified when Between;
The solicited message is sent to server;
Recommendation results are received, and selectively the recommendation results are shown.
Scheme 28, the planning driving path acquisition methods according to scheme 27, which is characterized in that " asked according to the instruction of input generation Seek information " the step of include:
The instruction of input is obtained, described instruction includes start position, final position and the specified time;
The GPS information for obtaining the start position using global positioning system obtains the terminal as the origin information GPS information is as the endpoint information;
The solicited message is generated using the origin information, the endpoint information and the specified time.
Scheme 29, a kind of server, including processor and memory are stored with a plurality of instruction in the memory, and feature exists In the processor is suitable for load described instruction to execute the planning driving path prediction technique as described in any one of scheme 15-26.
Scheme 30, a kind of client, including processor and memory are stored with a plurality of instruction in the memory, and feature exists In the processor is suitable for load described instruction to execute the planning driving path acquisition methods as described in any one of scheme 27-29.
Scheme 31, the client according to scheme 30, which is characterized in that the client is mobile terminal or vehicle-mounted end End.
Detailed description of the invention
Fig. 1 is the flow diagram of one of embodiment of the present invention planning driving path recommended method.
Fig. 2 is the flow chart that instructs generation solicited message of the client in the embodiment of the present invention according to input.
Fig. 3 is to calculate recommendation results using the standard time of alternative path and each subpath in the embodiment of the present invention Flow diagram.
Fig. 4 is the flow chart that Traffic network database is established in the embodiment of the present invention.
Fig. 5 is the part map in Huangpu River, Shanghai region.
Fig. 6 is road network image corresponding to partial region in Fig. 5.
Fig. 7 is the flow chart that historical data base is established in the embodiment of the present invention.
Fig. 8 is the flow diagram of one of embodiment of the present invention planning driving path prediction technique.
Fig. 9 is the flow chart of one of embodiment of the present invention planning driving path acquisition methods.
Figure 10 is the connection knot of one of the embodiment of the present invention planning driving path prediction meanss and planning driving path acquisition device Structure schematic diagram.
Figure 11 is the connection of another the planning driving path prediction meanss and planning driving path acquisition device in the embodiment of the present invention Structural schematic diagram.
Specific embodiment
The preferred embodiment of the present invention described with reference to the accompanying drawings.It will be apparent to a skilled person that this A little embodiments are used only for explaining technical principle of the invention, it is not intended that limit the scope of the invention.This field skill Art personnel, which can according to need, makes adjustment to it, to adapt to specific application.
People would generally carry out trip planning, ETA of the current trip service system to the following travel time before travel Precision of prediction it is not high.For prediction ETA service, under conditions of identical starting point, same endpoint and identical period, history The data of track are often very sparse, therefore, can not provide one well accurately and pacify as a result, influencing people and going on a journey Row.
In order to solve the above-mentioned technical problem, the embodiment of the invention provides a kind of planning driving path recommended methods.It below will knot The attached drawing in the embodiment of the present invention is closed, technical scheme in the embodiment of the invention is clearly and completely described.
Fig. 1 is the flow diagram of one of embodiment of the present invention planning driving path recommended method.Referring to Figure 1, the row The recommended method of bus or train route diameter includes the following steps:
Step S11: client generates solicited message according to the instruction of input, and solicited message is sent to server, In, solicited message includes origin information, endpoint information and specified time.In the present embodiment, the first instruction is that user inputs Information, for example, user is specified using Shanghai City library as starting point, using HuaDou Building as terminal, in current time, then rising Point information is the location information of Shanghai library municipal, and endpoint information is the location information of HuaDou Building, and specified time can be to work as Information at the time of preceding, specified time may be a certain moment in future of user's input.
Step S12: server receives solicited message, and according to solicited message, using including the standby of at least two subpaths The standard time of routing diameter and each subpath calculates recommendation results, when recommendation results include the most short driving under specified time Between and destination path, destination path be minimum running time corresponding to alternative path.
Step S13: recommendation results are sent to client by server.
Step S14: client receives recommendation results, and is selectively shown to recommendation results.It is described in the present invention " selectively " refer to that client can be shown recommendation results, recommendation results can not also be shown and will be pushed away It recommends result and is directly used in navigation.
In the present embodiment, using include at least two subpaths alternative path and each subpath standard time, The running time of each alternative path is calculated, the accuracy of prediction running time can be effectively improved, basis is allowed users to and pushes away Recommend path trip, reach home in the shortest possible time, traffic congestion problem can be avoided as much as, be conducive to people preferably into Row trip arranges;Meanwhile the present embodiment can be used for provide the mechanism of Precision service and providing predictive information, in order to provide The mechanism of Precision service can preferably be scheduled driving demand.
It should be noted that the step in planning driving path recommended method provided by the invention can be split, combine and Sequence adjusts, such as: step S12 can be split as " server reception solicited message " and " server is utilized according to solicited message The standard time of alternative path and each subpath including at least two subpaths, calculate recommendation results " the two steps, S14 pages of step can be split as " client reception recommendation results " and " client is selectively shown recommendation results " this Two steps;Certainly, step S12 and step S13 also can be merged into a step.
Fig. 2 is the flow chart that instructs generation solicited message of the client in the embodiment of the present invention according to input.It refers to The step of Fig. 2, " client according to the instruction of input generate solicited message " includes:
Step S111: obtaining the instruction of input, which includes start position, final position and specified time.
Step S112: the GPS information that client obtains start position using global positioning system is obtained as origin information The GPS information of terminal is as endpoint information.
Step S113: client generates solicited message using origin information, endpoint information and specified time.
In the present embodiment, using client installation global positioning system generate GPS information as origin information with And endpoint information, the method for generating solicited message is simple, and accurate positioning.
Fig. 3 is to calculate recommendation results using the standard time of alternative path and each subpath in the embodiment of the present invention Flow diagram.Fig. 3 is referred to, " is calculated using the standard time of the alternative path and each subpath that include multiple subpaths The step of recommendation results " includes:
Step S121: road network image is transferred from pre-established Traffic network database.Road network image include multiple nodes and Connect the subpath of adjacent node.
Step S122: it selects the node nearest apart from starting point as first node, the node nearest apart from terminal is selected to make For second node, and multiple alternative paths are generated, alternative path is using first node and second node as endpoint, and by least two Subpath is sequentially connected with composition.For example, reaching and saving from node A using node B as second node using node A as first node Point B has a variety of traveling modes, and each traveling mode all can serve as an alternative path, be in each alternative path to Few two subpaths are sequentially connected with composition.
Step S123: transferring target data from pre-established historical data base, and target data and specified time have same The standard time of each subpath of one time attribute, time attribute refer to certain in some day locating in one week time One period.Number of days i.e. weekly is 7 days, if specified time is Tuesday, then the time attribute of target data is also Tuesday;And There is the different periods again daily, for example, morning peak period, evening peak period and night go on a journey period etc. less.Optionally, may be used To be divided into 24 periods for one day according to hour, at this point, shared 7*24 (seven days a week, daily 24 hours) a time attribute.
Step S124: the standard time of each subpath in each alternative path is summed, to calculate every The running time of alternative path, and each running time is compared to obtain minimum running time, by minimum running time Corresponding alternative path is as destination path.
Step S125: recommendation results are generated, recommendation results include minimum running time and destination path.
The method that recommendation results are calculated in the present embodiment, by transferring road network image simultaneously from pre-established Traffic network database Alternative path is generated, target data is transferred from pre-established historical data base, by subpath each in alternative path Standard time sums to calculate the running time of each alternative path, and calculated result is more accurate;By network image with go through History data are retained separately, and are transferred corresponding network image and data when calculating recommendation results, be can reduce the load of system, together When be conducive to improve calculate recommendation results speed.
Fig. 4 is the flow chart that Traffic network database is established in the embodiment of the present invention.Fig. 4 is referred to, Traffic network database is established Concrete operations are as follows:
Step S1211: original image is obtained, original image includes a plurality of history planning driving path.Original image can be certain One city, area, province map.For example, Fig. 5 is the part map in Huangpu River, Shanghai region, in Huangpu River two sides, have upper , also there are the famous sites such as Yuyuan Garden in the famous commercial circles such as extra large Global Finance center, are the regions that traffic is relatively easy to get congestion.
Step S1212: each history planning driving path in original image is divided at least two sub- roads using node Diameter extracts node and subpath to form road network image.It is possible to further select intersection in physical pathway, terrestrial reference Architectural Services Department, the ramp location of expressway, road whole kilometer at etc. positions, subpath be one section of road between two nodes.For example, Fig. 6 is road network image corresponding to partial region in Fig. 5, refers to Fig. 6, and the dot in Fig. 6 is node, and the line segment in Fig. 6 is Subpath, as seen from Figure 6, node are more intensive in commercial circle, sight spot etc..
Step S1213: the net image that satisfies the need is stored to establish Traffic network database.
In the present embodiment, by the way that physical pathway is divided at least two subpaths, since the distance of subpath is shorter, because The historical data obtained on this each subpath is more abundant;Meanwhile physical pathway is divided at least two subpaths can be just It is counted in the standard time to each subpath;And above-mentioned advantage is all conducive to improve the accuracy of prediction ETA.
Fig. 7 is the flow chart that historical data base is established in the embodiment of the present invention.Fig. 7 is referred to, historical data base is established Concrete operations are as follows:
Step S1231: history travelling data is obtained, history travelling data includes history running time, history running time To pass through the real time of subpath.History running time can be obtained by statistics.
Step S1232: being weighted and averaged calculating to the history running time of the same subpath under same time attribute, To obtain the sub- time, and the standard time is acquired using the sub- time.For example, a certain subpath, on Monday the morning peak period, counts altogether To 100 history running time, then the average value for acquiring this 100 history running time recycles son as the sub- time Time acquires the standard time of the subpath.
Step S1233: the standard time is classified and is stored according to time attribute, to establish historical data base.
In the present embodiment, by counting to history running time, and the standard time of each subpath is calculated, and Standard time is stored according to time attribute, in order to be extracted according to time attribute to the standard time.
Optionally, using Dijkstra's algorithm, two-way Dijkstra's algorithm or Astar algorithm, alternative path is generated. Applicant is tested with the network image in Shanghai City (quantity of node and subpath is million rank), and the above method can be with The calculating of minimum running time and destination path are completed within 30 seconds.
Optionally, recommendation results further include non-targeted path, and the running time in non-targeted path is arranged according to ascending order. In this way, user can know a plurality of recommendation paths, selected according to the trip arrangement of oneself, such as: if it is desired to most fast Speed arrival then can choose recommendation paths, if it is desired to then can choose some node in path and certain by market on the way The recommendation paths being closer in a market.
Optionally, in the present invention, historical data base can be the database stored based on distributed document.Using being based on The database of distributed document storage, can be convenient for the storage and inquiry to data.
In the present invention, due to subpath the case where, is different, and " calculated using the sub- time and acquire the standard time " has difference Calculation method, be described in detail below.
In some alternative embodiments, at least two subpaths include the first subpath, and the first subpath is one The step of subpath being only included in an alternative path under a time attribute, " acquiring the standard time using the sub- time ", wraps It includes: using the sub- time of the first subpath as the standard time of the first subpath.
In some alternative embodiments, at least two subpaths include the second subpath, and the second subpath is one The step of subpath being included under a time attribute at least two alternative paths, " acquiring the standard time using the sub- time " It include: to be weighted and averaged sub- time to the second subpath in every alternative path, to calculate the standard of the second subpath Time.Namely the second subpath is included at least two alternative paths, at this time when calculating the standard time, needs to wrap The corresponding sub- time for including all alternative paths of second subpath is weighted and averaged, in the hope of the standard time.For example, The sub- time of second subpath is a, the period of the day from 11 p.m. to 1 a.m of second subpath in Article 2 alternative path in first alternative path Between be b, wherein utilization rate of first alternative path in history be 60%, use of the Article 2 alternative path in history Rate is 40%, then, standard time 60%a+40%b.
In some alternative embodiments, at least two subpaths include third subpath, and third subpath is at least There is no history running time under one time attribute, the step of " acquiring the standard time using the sub- time " includes: with infinite your writing For standard time of the third subpath under at least one time attribute;Alternatively, calculating the third under other each time attributes The average value of the standard time of subpath, and using average value as the standard time of third subpath.For certain time attributes Under subpath there is no the case where history running time, can use using infinity as the standard time, that is, not recommend to pass through Cross the alternative path of this subpath;Also it can choose putting down the standard time of the third subpath under other each time attributes Standard time of the mean value as third subpath under the time attribute.
Since the standard time that different weather conditions may cause certain subpaths is different, in order to which prediction is turned up Accuracy, optionally, server also receives weather forecast information, and weather forecast information includes the Weather property of specified time; Target data and specified time Weather property having the same.Weather property includes fine, negative, cloudy, rain, snow, wind and haze etc..
Influence based on weather conditions to trip optionally, establishes historical data for the ease of the extraction of target data Library, stored after obtaining the standard time and to the standard time between, further includes: the standard time is carried out according to Weather property Classification.Specifically, can establish with time attribute name file, and in the file named with time attribute be arranged with The sub-folder of Weather property name, respectively with standard time for store in the sub-folder of Weather property name, when the standard Between Weather property it is identical as the title for the sub-folder that it is located at, the file that the time attribute of the standard time is located at it Title it is identical.Specifically, it also can establish the file named with Weather property, and in the file named with Weather property Standard time that is interior that the sub-folder named with time attribute is set, store in the sub-folder respectively named with time attribute, The time attribute of the standard time is identical as the title for the sub-folder that it is located at, and the Weather property of the standard time is located at it File title it is identical.
Optionally, client described in the present invention can be mobile terminal or car-mounted terminal, wherein mobile terminal can Think that smart phone, tablet computer etc., car-mounted terminal are primarily referred to as the vehicle device of intelligent automobile.
In order to solve the above-mentioned technical problem, the embodiment of the invention also provides a kind of planning driving path prediction techniques.Below will In conjunction with the attached drawing in the embodiment of the present invention, technical scheme in the embodiment of the invention is clearly and completely described.
Fig. 8 is the flow diagram of one of embodiment of the present invention planning driving path prediction technique.Fig. 8 is referred to, the row The prediction technique of bus or train route diameter is executed and is included the following steps: by server
Step S21: solicited message is received, solicited message includes origin information, endpoint information and specified time.In this implementation In example, the first instruction is the information of user's input, for example, origin information can be Shanghai library municipal, endpoint information be can be HuaDou Building, specified time can be current time, and specified time may be a certain moment in future of user's input.
Step S22: according to solicited message, the mark of the alternative path and each subpath that include at least two subpaths is utilized Recommendation results are calculated between punctual, wherein recommendation results include minimum running time and destination path under specified time, target road Diameter is alternative path corresponding to minimum running time.
Step S23: recommendation results are sent to client.
In the present embodiment, using include at least two subpaths alternative path and each subpath standard time, The running time of each alternative path is calculated, the accuracy of prediction running time can be effectively improved, basis is allowed users to and pushes away Recommend path trip, reach home in the shortest possible time, traffic congestion problem can be avoided as much as, be conducive to people preferably into Row trip arranges.
Fig. 3 is to calculate recommendation results using the standard time of alternative path and each subpath in the embodiment of the present invention Flow diagram.Fig. 3 is referred to, the method for the calculating recommendation results is executed by server, is included the following steps:
Step S121: road network image is transferred from pre-established Traffic network database.Road network image include multiple nodes and Connect the subpath of adjacent node.
Step S122: it selects the node nearest apart from starting point as first node, the node nearest apart from terminal is selected to make For second node, and multiple alternative paths are generated, alternative path is using first node and second node as endpoint, and by least two Subpath is sequentially connected with composition.For example, reaching and saving from node A using node B as second node using node A as first node Point B has a variety of traveling modes, and it is more in each alternative path that each traveling mode, which all can serve as an alternative path, A subpath is sequentially connected with composition.
Step S123: transferring target data from pre-established historical data base, and target data and specified time have same The standard time of each subpath of one time attribute, time attribute refer to certain in some day locating in one week time One period.Number of days i.e. weekly is 7 days, if specified time is Tuesday, then the time attribute of target data is also Tuesday;And There is the different periods again daily, for example, morning peak period, evening peak period and night go on a journey period etc. less.Optionally, may be used To be divided into 24 periods for one day according to hour, at this point, shared 7*24 (seven days a week, daily 24 hours) a time attribute.
Step S124: the standard time of each subpath in each alternative path is summed, to calculate every The running time of alternative path, and each running time is compared to obtain minimum running time, by minimum running time Corresponding alternative path is as destination path.
Step S125: recommendation results are generated, recommendation results include minimum running time and destination path.
The method that recommendation results are calculated in the present embodiment, by transferring road network image simultaneously from pre-established Traffic network database Alternative path is generated, target data is transferred from pre-established historical data base, by subpath each in alternative path Standard time sums to calculate the running time of each alternative path, and calculated result is more accurate;By network image with go through History data are retained separately, and are transferred corresponding network image and data when calculating recommendation results, be can reduce the load of system, together When be conducive to improve calculate recommendation results speed.
Fig. 4 is the flow chart that Traffic network database is established in the embodiment of the present invention.Fig. 4 is referred to, Traffic network database is established Operation specifically:
Step S1211: original image is obtained, original image includes a plurality of history planning driving path.Original image can be certain One city, area, province map.For example, Fig. 5 is the part map near Huangpu River, Shanghai, in Huangpu River two sides, have upper , also there are the famous sites such as Yuyuan Garden in the famous commercial circles such as extra large Global Finance center, are the regions that traffic is relatively easy to get congestion.
Step S1212: each history planning driving path in original image is divided at least two sub- roads using node Diameter extracts node and subpath to form road network image.It is possible to further select intersection in physical pathway, terrestrial reference Architectural Services Department, the ramp location of expressway, road whole kilometer at etc. positions, subpath be one section of road between two nodes.For example, Fig. 6 is road network image corresponding to partial region in Fig. 5, refers to Fig. 6, and the dot in Fig. 6 is node, and the line segment in Fig. 6 is Subpath, as seen from Figure 6, node are more intensive in commercial circle, sight spot etc..
Step S1213: the net image that satisfies the need is stored to establish Traffic network database.
In the present embodiment, by the way that physical pathway is divided at least two subpaths, in order to each subpath Standard time is counted, to improve the accuracy of prediction ETA.
Fig. 7 is the flow chart that historical data base is established in the embodiment of the present invention.Fig. 7 is referred to, historical data base is established Operation specifically:
Step S1231: history travelling data is obtained, history travelling data includes history running time, history running time To pass through the real time of subpath.History running time can be obtained by statistics.
Step S1232: being weighted and averaged calculating to the history running time of the same subpath under same time attribute, To obtain the sub- time, and the standard time is acquired using the sub- time.For example, a certain subpath, on Monday the morning peak period, counts altogether To 100 history running time, then the average value for acquiring this 100 history running time recycles son as the sub- time Time acquires the standard time of the subpath.
Step S1233: the standard time is classified and is stored according to time attribute, to establish historical data base.
In the present embodiment, by counting to history running time, and the standard time of each subpath is calculated, and Standard time is stored according to time attribute, in order to be extracted according to time attribute to the standard time.
Optionally, using Dijkstra's algorithm, two-way Dijkstra's algorithm or Astar algorithm, alternative path is generated. It is tested, the above method through applicant with the network image (quantity of node and subpath is million rank) in Shanghai City To complete the calculating of minimum running time and destination path within 30 seconds.
Optionally, recommendation results further include non-targeted path, and the running time in non-targeted path is arranged according to ascending order. In this way, user can know a plurality of recommendation paths, selected according to the trip arrangement of oneself, for example, if it is desired to most fast Speed arrival then can choose recommendation paths, if it is desired to then can choose some node in path and certain by market on the way The recommendation paths being closer in a market.
Optionally, in the present invention, historical data base can be the database stored based on distributed document.Using being based on The database of distributed document storage, can be convenient for the storage and inquiry to data.
In the present invention, due to subpath the case where, is different, and " calculated using the sub- time and acquire the standard time " has difference Calculation method, be described in detail below.
In some alternative embodiments, at least two subpaths include the first subpath, and the first subpath is one The step of subpath being only included in an alternative path under a time attribute, " acquiring the standard time using the sub- time ", wraps It includes: using the sub- time of the first subpath as the standard time of the first subpath.
In some alternative embodiments, at least two subpaths include the second subpath, and the second subpath is one The step of subpath being included under a time attribute at least two alternative paths, " acquiring the standard time using the sub- time " It include: to be weighted and averaged sub- time to the second subpath in every alternative path, to calculate the standard of the second subpath Time.Namely the second subpath is included at least two alternative paths, at this time when calculating the standard time, needs to wrap The corresponding sub- time for including all alternative paths of second subpath is weighted and averaged, in the hope of the standard time.For example, The sub- time of second subpath is a, the period of the day from 11 p.m. to 1 a.m of second subpath in Article 2 alternative path in first alternative path Between be b, wherein utilization rate of first alternative path in history be 60%, use of the Article 2 alternative path in history Rate is 40%, then, standard time 60%a+40%b.
In some alternative embodiments, at least two subpaths include third subpath, and third subpath is at least There is no history running time under one time attribute, the step of " acquiring the standard time using the sub- time " includes: with infinite your writing For standard time of the third subpath under at least one time attribute;Alternatively, calculating the third under other each time attributes The average value of the standard time of subpath, and using average value as the standard time of third subpath.For certain time attributes Under subpath there is no the case where history running time, can use using infinity as the standard time, that is, not recommend to pass through Cross the alternative path of this subpath;Also it can choose putting down the standard time of the third subpath under other each time attributes Standard time of the mean value as third subpath under the time attribute.
Since the standard time that different weather conditions may cause certain subpaths is different, in order to which prediction is turned up Accuracy, optionally, server also receives weather forecast information, and weather forecast information includes the Weather property of specified time; Target data and specified time Weather property having the same.Weather property includes fine, negative, cloudy, rain, snow, wind and haze etc..
Influence based on weather conditions to trip optionally, establishes historical data for the ease of the extraction of target data Library, stored after obtaining the standard time and to the standard time between, further includes: the standard time is carried out according to Weather property Classification.Specifically, can establish with time attribute name file, and in the file named with time attribute be arranged with The sub-folder of Weather property name, respectively with standard time for store in the sub-folder of Weather property name, when the standard Between Weather property it is identical as the title for the sub-folder that it is located at, the file that the time attribute of the standard time is located at it Title it is identical.Specifically, it also can establish the file named with Weather property, and in the file named with Weather property Standard time that is interior that the sub-folder named with time attribute is set, store in the sub-folder respectively named with time attribute, The time attribute of the standard time is identical as the title for the sub-folder that it is located at, and the Weather property of the standard time is located at it File title it is identical.
In order to solve the above-mentioned technical problem, the embodiment of the invention provides a kind of planning driving path acquisition methods.It below will knot The attached drawing in the embodiment of the present invention is closed, technical scheme in the embodiment of the invention is clearly and completely described.
Fig. 9 is the flow chart of one of embodiment of the present invention planning driving path acquisition methods.Refer to Fig. 9, the present embodiment The acquisition methods of the planning driving path of offer are by client executing and include the following steps:
Step S31: solicited message is generated according to the instruction of input, wherein solicited message includes origin information, endpoint information And specified time.
Step S32: solicited message is sent to server.
Step S33: recommendation results are received, and selectively recommendation results are shown.Described " selection in the present invention Property " refer to that client can be shown recommendation results, recommendation results can not also be shown but will recommend to tie Fruit is directly used in navigation.
Planning driving path acquisition methods provided in this embodiment, can obtain high accuracy running time prediction letter as a result, And selectively prediction result is shown, it allows users to be gone on a journey according to the path of recommendation, reach in the shortest possible time eventually Point can be avoided as much as traffic congestion problem, be conducive to people and preferably carry out trip arrangement.
Fig. 2 is the flow chart that instructs generation solicited message of the client in the embodiment of the present invention according to input.It refers to Fig. 2, and " according to the instruction of input generate solicited message " the step of include:
Step S111: obtaining the instruction of input, which includes start position, final position and specified time.
Step S112: client is equipped with global positioning system, is believed using the GPS that global positioning system obtains start position The information as starting point is ceased, information of the GPS information as terminal of terminal is obtained.
Step S113: client generates solicited message using origin information, endpoint information and specified time.
In the present embodiment, using client installation global positioning system generate GPS information as the heart of starting point with With the information of terminal, the method for generating solicited message is simple, and accurate positioning.
In order to solve the above-mentioned technical problem, a kind of server is present embodiments provided, which includes processor and deposit Reservoir, a plurality of instruction is stored in memory, and processor is suitable for loading roadway of the described instruction to execute any one of the above Diameter prediction technique can be realized the beneficial effect of any one of the above planning driving path prediction technique, and details are not described herein.
In order to solve the above-mentioned technical problem, a kind of client is present embodiments provided, which includes processor and deposit Reservoir, is stored with a plurality of instruction in memory, processor be suitable for loading instruction with execute in above-described embodiment any one Planning driving path acquisition methods can be realized the beneficial effect of any one of the above planning driving path acquisition methods, and details are not described herein.
Figure 10 is the attachment structure schematic diagram of one of the embodiment of the present invention server and client.Referring to Figure 10, Server 2 and client 1 interact the recommendation that can be realized planning driving path, wherein client 1 and server 2 are including depositing Reservoir and processor.In the present invention, client can be mobile terminal or car-mounted terminal, wherein mobile terminal can be Smart phone, tablet computer etc., car-mounted terminal are primarily referred to as the vehicle device of intelligent automobile.
Continuing with referring to Figure 10, in the present invention, client 1 executes following steps: being generated and is requested according to the instruction of input Information, and solicited message is sent to server 2, wherein solicited message includes origin information, endpoint information and specified time; Recommendation results are received, and selectively recommendation results are shown.
Continuing with referring to Figure 10, in the present invention, server 2 executes following steps: server 2 receives solicited message, and Recommendation knot is calculated using the standard time of the alternative path and each subpath that include multiple subpaths according to solicited message Fruit, recommendation results include minimum running time and destination path under specified time, and destination path is right for minimum running time The alternative path answered;Recommendation results are sent to client 1 by server 2.
Continuing with referring to Figure 10, further, the memory of server 2 includes prediction module 201, Traffic network database 202 With historical data base 203, wherein Traffic network database 202 is for storing road network image, and historical data base is for storing every road Ge Zi The standard time of diameter, to facilitate prediction module 201 when predicting running time respectively from Traffic network database 202 and historical data base Road network image and standard time are transferred in 203.It should be noted that Traffic network database 202 and historical data base 203 can be base In the database of distributed document storage, at this point, Traffic network database 202 and historical data base 203 can not be the one of server 2 Part, as long as and guaranteeing Traffic network database 202 and historical data base 203 and being connect with server 2.
Figure 11 is the attachment structure schematic diagram of another server and client in the embodiment of the present invention.Refer to figure 11, further, the memory of server 2 further includes off-line data processing module 204, and off-line data processing module 204 utilizes Original image establishes Traffic network database, establishes historical data base using history travelling data, establishes Traffic network database and foundation is gone through The process of history database refers to above-described embodiment, and details are not described herein again.It should be noted that, although server in the present embodiment 2 include off-line data processing module 204, but in fact, off-line data processing module 204 can also be not arranged in server 2, But connect with server 2, this has no effect on the implementation of the present embodiment.
So far, it has been combined preferred embodiment shown in the drawings and describes technical solution of the present invention, still, this field Technical staff is it is easily understood that protection scope of the present invention is expressly not limited to these specific embodiments.Without departing from this Under the premise of the principle of invention, those skilled in the art can make equivalent change or replacement to the relevant technologies feature, these Technical solution after change or replacement will fall within the scope of protection of the present invention.

Claims (10)

1. a kind of planning driving path recommended method, characterized by comprising:
Client generates solicited message according to the instruction of input, and the solicited message is sent to server, wherein described to ask Seeking information includes origin information, endpoint information and specified time;
The server receives the solicited message, and according to the solicited message, using including the standby of at least two subpaths The standard time of routing diameter and each subpath calculates recommendation results, and the recommendation results include under the specified time Minimum running time and destination path, the destination path are alternative path corresponding to the minimum running time;
The recommendation results are sent to the client by the server;
The client receives the recommendation results, and is selectively shown to the recommendation results.
2. planning driving path recommended method according to claim 1, which is characterized in that " utilizing includes the standby of multiple subpaths The standard time of routing diameter and each subpath calculate recommendation results " the step of include:
Road network image is transferred from pre-established Traffic network database, the road network image includes multiple nodes and connection adjacent segments The subpath of point;
It selects the node nearest apart from the starting point as first node, selects the node nearest apart from the terminal as second Node, and generate at least one alternative path, the alternative path using the first node and the second node as endpoint and It is sequentially connected with and is constituted by least two subpaths;
Target data is transferred from pre-established historical data base, the target data is to have with the specified time with for the moment Between each of the attribute subpath standard time, the time attribute refers in some day locating in one week time The a certain period;
The standard time of each of each alternative path subpath is summed, it is described standby to calculate every The running time of routing diameter, and each running time is compared to obtain the minimum running time, by described in most Alternative path corresponding to short running time is as the destination path;
The recommendation results are generated, the recommendation results include the minimum running time and the destination path.
3. planning driving path recommended method according to claim 2, which is characterized in that
The alternative path is generated using Dijkstra's algorithm, two-way Dijkstra's algorithm or Astar algorithm.
4. planning driving path recommended method according to claim 3, which is characterized in that
The recommendation results further include non-targeted path, and the running time in the non-targeted path is arranged according to ascending order.
5. planning driving path recommended method according to claim 2, which is characterized in that establish the operation of the Traffic network database Specifically:
Original image is obtained, the original image includes a plurality of history planning driving path;
Each history planning driving path in the original image is divided at least two subpaths using the node;
The node and the subpath are extracted to form the road network image, and stored the road network image to establish The Traffic network database.
6. planning driving path recommended method according to claim 5, which is characterized in that establish the operation of the historical data base Specifically:
History travelling data is obtained, the history travelling data includes history running time, and the history running time is to pass through The real time of the subpath;
Calculating is weighted and averaged to the history running time of the same subpath under same time attribute, to obtain the period of the day from 11 p.m. to 1 a.m Between, and the standard time is acquired using the sub- time;
The standard time is classified and stored according to the time attribute, to establish the historical data base.
7. planning driving path recommended method according to claim 6, which is characterized in that the planning driving path recommended method is also wrapped It includes:
The server obtains weather forecast information, and the weather forecast information includes the Weather property of the specified time, In, the target data and specified time Weather property having the same.
8. planning driving path recommended method according to claim 7, which is characterized in that the behaviour of " establishing the historical data base " Make further include:
Before storing after obtaining the standard time and to the standard time, by the standard time according to the day Gas attribute is classified.
9. planning driving path recommended method a method according to any one of claims 6-8, which is characterized in that the historical data base For the database stored based on distributed document.
10. planning driving path recommended method a method according to any one of claims 6-8, which is characterized in that described at least two Subpath includes the first subpath, and first subpath is described standby to be only included in one under a time attribute The step of subpath in routing diameter, " acquiring the standard time using the sub- time " includes:
Using the sub- time of first subpath as the standard time of first subpath.
CN201810719455.7A 2018-07-03 2018-07-03 Planning driving path recommended method, prediction technique, acquisition methods and its device Pending CN108985506A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810719455.7A CN108985506A (en) 2018-07-03 2018-07-03 Planning driving path recommended method, prediction technique, acquisition methods and its device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810719455.7A CN108985506A (en) 2018-07-03 2018-07-03 Planning driving path recommended method, prediction technique, acquisition methods and its device

Publications (1)

Publication Number Publication Date
CN108985506A true CN108985506A (en) 2018-12-11

Family

ID=64536838

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810719455.7A Pending CN108985506A (en) 2018-07-03 2018-07-03 Planning driving path recommended method, prediction technique, acquisition methods and its device

Country Status (1)

Country Link
CN (1) CN108985506A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109670010A (en) * 2018-12-29 2019-04-23 北斗天地股份有限公司 Track data compensation process and device
CN109855637A (en) * 2018-12-24 2019-06-07 北京新能源汽车股份有限公司 Automatic driving path planning method, device and equipment for vehicle
CN110516888A (en) * 2019-09-02 2019-11-29 重庆紫光华山智安科技有限公司 Trajectory predictions method, apparatus, electronic equipment and computer readable storage medium
CN110750603A (en) * 2019-09-06 2020-02-04 日立楼宇技术(广州)有限公司 Building service prediction method, building service prediction device, building service prediction system, computer equipment and storage medium
CN111489549A (en) * 2020-03-11 2020-08-04 北京交通大学 Travel vehicle path selection method based on historical behavior portrait
CN111582527A (en) * 2019-02-15 2020-08-25 拉扎斯网络科技(上海)有限公司 Travel time estimation method and device, electronic equipment and storage medium
CN112396233A (en) * 2020-11-20 2021-02-23 杭州贝嘟科技有限公司 Intelligent flat cable recommendation method and device, computer equipment and storage medium
CN113537548A (en) * 2020-04-21 2021-10-22 杭州海康威视数字技术股份有限公司 Method, device and equipment for recommending driving route

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120283948A1 (en) * 2011-05-03 2012-11-08 University Of Southern California Hierarchical and Exact Fastest Path Computation in Time-dependent Spatial Networks
CN104215254A (en) * 2013-05-31 2014-12-17 国际商业机器公司 Path navigation method and apparatus thereof
CN104517155A (en) * 2013-09-26 2015-04-15 Sap欧洲公司 System used for dynamic path optimization and method thereof
CN105067001A (en) * 2015-07-27 2015-11-18 福建工程学院 Route setting method based on taxi experience data and system thereof
US20160044571A1 (en) * 2013-04-11 2016-02-11 Lg Electronics Inc. Method for delivering optimum path including plurality of passage places and apparatus therefor
CN105716622A (en) * 2016-04-12 2016-06-29 玉环看知信息科技有限公司 Navigation method and navigation server
CN107643085A (en) * 2017-09-18 2018-01-30 苏州大学 Recommend method and apparatus in a kind of path

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120283948A1 (en) * 2011-05-03 2012-11-08 University Of Southern California Hierarchical and Exact Fastest Path Computation in Time-dependent Spatial Networks
US20160044571A1 (en) * 2013-04-11 2016-02-11 Lg Electronics Inc. Method for delivering optimum path including plurality of passage places and apparatus therefor
CN104215254A (en) * 2013-05-31 2014-12-17 国际商业机器公司 Path navigation method and apparatus thereof
CN104517155A (en) * 2013-09-26 2015-04-15 Sap欧洲公司 System used for dynamic path optimization and method thereof
CN105067001A (en) * 2015-07-27 2015-11-18 福建工程学院 Route setting method based on taxi experience data and system thereof
CN105716622A (en) * 2016-04-12 2016-06-29 玉环看知信息科技有限公司 Navigation method and navigation server
CN107643085A (en) * 2017-09-18 2018-01-30 苏州大学 Recommend method and apparatus in a kind of path

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109855637A (en) * 2018-12-24 2019-06-07 北京新能源汽车股份有限公司 Automatic driving path planning method, device and equipment for vehicle
CN109670010A (en) * 2018-12-29 2019-04-23 北斗天地股份有限公司 Track data compensation process and device
CN111582527A (en) * 2019-02-15 2020-08-25 拉扎斯网络科技(上海)有限公司 Travel time estimation method and device, electronic equipment and storage medium
CN110516888A (en) * 2019-09-02 2019-11-29 重庆紫光华山智安科技有限公司 Trajectory predictions method, apparatus, electronic equipment and computer readable storage medium
CN110750603A (en) * 2019-09-06 2020-02-04 日立楼宇技术(广州)有限公司 Building service prediction method, building service prediction device, building service prediction system, computer equipment and storage medium
CN110750603B (en) * 2019-09-06 2022-08-12 日立楼宇技术(广州)有限公司 Building service prediction method, building service prediction device, building service prediction system, computer equipment and storage medium
CN111489549A (en) * 2020-03-11 2020-08-04 北京交通大学 Travel vehicle path selection method based on historical behavior portrait
CN111489549B (en) * 2020-03-11 2021-08-27 北京交通大学 Travel vehicle path selection method based on historical behavior portrait
CN113537548A (en) * 2020-04-21 2021-10-22 杭州海康威视数字技术股份有限公司 Method, device and equipment for recommending driving route
CN113537548B (en) * 2020-04-21 2024-04-23 杭州海康威视数字技术股份有限公司 Recommendation method, device and equipment for driving route
CN112396233A (en) * 2020-11-20 2021-02-23 杭州贝嘟科技有限公司 Intelligent flat cable recommendation method and device, computer equipment and storage medium

Similar Documents

Publication Publication Date Title
CN108985506A (en) Planning driving path recommended method, prediction technique, acquisition methods and its device
US7236881B2 (en) Method and apparatus for end-to-end travel time estimation using dynamic traffic data
US7920960B2 (en) Method and apparatus for predicting future travel times over a transportation network
US8024112B2 (en) Methods for predicting destinations from partial trajectories employing open-and closed-world modeling methods
US20150253144A1 (en) Methods and route planning systems for dynamic trip modifications and quick and easy alternative routes
US7894980B2 (en) Method and apparatus for estimating real-time travel times over a transportation network based on limited real-time data
CN112629533B (en) Fine path planning method based on road network rasterization road traffic prediction
CN112562309B (en) Network taxi appointment scheduling method based on improved Dijkstra algorithm
CN110491158A (en) A kind of bus arrival time prediction technique and system based on multivariate data fusion
CN112991743B (en) Real-time traffic risk AI prediction method based on driving path and system thereof
CN101944095A (en) Path planning method and system
CN109642800A (en) Route searching method and route searching device
Zhou et al. Predicting the passenger demand on bus services for mobile users
Fagan et al. Intelligent time of arrival estimation
CN111060119B (en) City slow-travel navigation method and system based on street view visual element scoring
WO2023276420A1 (en) Distributed multi-task machine learning for traffic prediction
Pan et al. A self-learning algorithm for predicting bus arrival time based on historical data model
Tomaras et al. Crowd-based ecofriendly trip planning
Xiao et al. Road pricing design based on game theory and multi-agent consensus
Borokhov et al. An adaptive routing system for location-aware mobile devices on the road network
CN108534791A (en) Holography tourism path dynamic programming method, device, electronic equipment and system
Saber et al. Rothar: Real-time on-line traffic assignment with load estimation
Hendawi et al. Dynamic and personalized routing in prego
CN113903171B (en) Vehicle crowd sensing node optimization method based on spatial-temporal characteristics of highway network
EP3926302A1 (en) Method and apparatus for planning a return trip between a given starting point and a given destination

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200915

Address after: Susong Road West and Shenzhen Road North, Hefei Economic and Technological Development Zone, Anhui Province

Applicant after: Weilai (Anhui) Holding Co.,Ltd.

Address before: 30 Floor of Yihe Building, No. 1 Kangle Plaza, Central, Hong Kong, China

Applicant before: NIO NEXTEV Ltd.

RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20181211