CN112084276A - Journey planning method and device, electronic equipment and storage medium - Google Patents
Journey planning method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112084276A CN112084276A CN202010895319.0A CN202010895319A CN112084276A CN 112084276 A CN112084276 A CN 112084276A CN 202010895319 A CN202010895319 A CN 202010895319A CN 112084276 A CN112084276 A CN 112084276A
- Authority
- CN
- China
- Prior art keywords
- route
- point
- travel
- planning
- target
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 69
- 238000012216 screening Methods 0.000 claims description 46
- 230000015654 memory Effects 0.000 claims description 19
- 230000037361 pathway Effects 0.000 claims description 13
- 238000001914 filtration Methods 0.000 claims description 11
- 238000005516 engineering process Methods 0.000 abstract description 5
- 230000006870 function Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 9
- 238000013459 approach Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000006872 improvement Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 235000012054 meals Nutrition 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Databases & Information Systems (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Data Mining & Analysis (AREA)
- Marketing (AREA)
- General Engineering & Computer Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Remote Sensing (AREA)
- Navigation (AREA)
Abstract
The application discloses a travel planning method, a device, an electronic device and a storage medium, which relate to the field of big data, and further relate to intelligent search and intelligent traffic technologies, and comprise the following steps: acquiring the travel planning information of a user and a via point search request input by the user aiming at the travel planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination; determining the path residence time corresponding to at least one path point according to the travel planning information and the path point searching request; and determining a target travel according to the travel planning information and the path residence time corresponding to each passing point. The embodiment of the application can further enrich the travel planning function and improve the efficiency of travel planning.
Description
Technical Field
The application relates to the field of data processing, in particular to big data, intelligent search and intelligent traffic technology.
Background
At present, the intelligence and the efficiency of application programs of navigation products such as electronic maps and the like are continuously improved, and more users select to use the navigation products for route planning. The navigation product can automatically plan a plurality of travel routes for the user according to the navigation requirement input by the user so as to be selected by the user. Meanwhile, the navigation product can also provide travel planning reminding services for the user in the navigation process, such as departure reminding, violation reminding, predicted time reminding, destination arrival reminding and the like. Therefore, the navigation product can provide rich travel planning functions for the user.
Disclosure of Invention
The embodiment of the application provides a travel planning method and device, electronic equipment and a storage medium, so that the travel planning function is further enriched, and the efficiency of travel planning is improved.
In a first aspect, an embodiment of the present application provides a trip planning method, including:
acquiring the travel planning information of a user and a via point search request input by the user aiming at the travel planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination;
determining the path residence time corresponding to at least one path point according to the travel planning information and the path point searching request;
and determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
In a second aspect, an embodiment of the present application provides a trip planning apparatus, including:
the system comprises an information acquisition module, a route planning module and a route point search module, wherein the information acquisition module is used for acquiring route planning information of a user and a route point search request input by the user aiming at the route planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination;
the route residence time determining module is used for determining the route residence time corresponding to at least one route point according to the travel planning information and the route point searching request;
and the target travel determining module is used for determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
In a third aspect, an embodiment of the present application provides an electronic device, including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the trip planning method provided in the embodiment of the first aspect.
In a fourth aspect, the present application further provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the method for planning a trip provided in the first aspect.
According to the method and the device, the route stay time corresponding to at least one route point is determined according to the route planning information of the user and the route point search request input by the user aiming at the route planning information, so that the target route is determined according to the route planning information and the route stay time corresponding to each route point, the problem that the route points cannot be pertinently recommended according to the route of the user and the stay time available for each route point in the conventional route planning method is solved, the route planning function is further enriched, and the route planning efficiency is improved.
It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
fig. 1 is a flowchart of a route planning method according to an embodiment of the present application;
fig. 2 is a flowchart of a method for planning a trip according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram illustrating an effect of a pass point screening range provided in the embodiment of the present application;
fig. 4 is a flowchart of a method for planning a trip according to an embodiment of the present application;
FIG. 5 is a schematic diagram illustrating an effect of a trip planning provided by an embodiment of the present application;
fig. 6 is a structural diagram of a trip planning apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device for implementing the trip planning method according to the embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The current navigation products can only provide simple travel planning functions, such as arranging a single uninterrupted travel from a departure place to a destination according to the travel requirements of users, and cannot meet the requirements of multi-section travel planning. For example, if a user needs to eat, refuel or arrange other events before reaching a destination, a route initially planned by a navigation product may be disturbed, route points cannot be screened for the arranged route and surrounding services, and selecting the route points at will may destroy the existing route arrangement, which may result in that the user needs to plan the route again, and the efficiency of route planning is low, and the intelligent requirements of technologies such as intelligent search and intelligent transportation cannot be met.
In an example, fig. 1 is a flowchart of a method for planning a route according to an embodiment of the present application, where the embodiment is applicable to a case where route points are recommended in a targeted manner according to a user route and a residence time available for each route point, and the method may be executed by a route planning apparatus, which may be implemented by software and/or hardware, and may be generally integrated in an electronic device. The electronic device may be a computer device or the like. Accordingly, as shown in fig. 1, the method comprises the following operations:
s110, acquiring the travel planning information of a user and a via point search request input by the user aiming at the travel planning information; the trip planning information includes a departure place and a destination, and a trip planning time from the departure place to the destination.
The trip planning information is also related information of the user for trip planning. Alternatively, the trip planning information may include, but is not limited to, an origin and a destination, and a trip planning time from the origin to the destination. The travel planning time may be the latest time for reaching the destination, or may also be a travel time period expected from the departure place to the destination, for example, the travel time period is estimated to reach the destination from the departure place within 2 hours. The route point search request may be used to search for route points based on the user's formation planning information.
In the embodiment of the application, the user can input the journey planning information to the navigation product according to the self journey requirement. Illustratively, the trip planning information may be: the starting place: a supermarket; destination: a railway station; the travel planning time is as follows: at 12 pm. The specific meaning of the trip planning information is: the user started in supermarket a and needed to arrive at the railway station before 12 pm. In addition, the user can input a route point search request for the existing trip planning information. Illustratively, the user inputs a route point search request on the basis of the travel plan information: the restaurant means that the user needs to search for restaurants between the departure place and the destination and needs to arrive at the restaurant for dinner before arriving at the destination.
It should be noted that one or more route point search requests input by the user for the trip planning information may be used. That is, the user may set one route point for the trip planning information, or may set a plurality of route points for the trip planning information, which is not limited in the embodiment of the present application. When the user inputs a plurality of route points with respect to the trip planning information, a route order of each route point may also be set. For example, the route point search request is: a restaurant and a gas station, and the user has set the restaurant as a first point of approach and the gas station as a second point of approach, indicating that the user wishes to go to the restaurant first to have a meal before reaching the destination, then go from the restaurant to the gas station to refuel, and finally arrive at the destination from the gas station.
And S120, determining the path residence time corresponding to at least one path point according to the travel planning information and the path point searching request.
Wherein the route point search request is for searching for a route point between the departure point and the destination. Optionally, the number of route point search requests may be one or multiple, and this is not limited in this embodiment of the application. The path residence time is the residence time corresponding to each path point.
Correspondingly, after the travel planning information of the user and the via point request input by the user for the travel planning information are obtained, a plurality of via points matched with the via point search request and the path stay time corresponding to the via points matched with the via point search request can be determined according to the obtained travel planning information and the via point search request.
It should be noted that if the number of route point search requests is one, that is, the user needs to set a route point, for example, the user wants to select a restaurant as the route point. At this time, a plurality of route points matching the route point search request may be determined from the route point search request, and route stay time corresponding to each route point may be calculated. That is, it is possible to search for all restaurants between the departure point and the destination for the user, and calculate the route stay time corresponding to each restaurant. If the number of the route point search requests is plural, that is, the user needs to set plural route points, for example, the user wants to select a restaurant and a supermarket as the route points. At this time, a plurality of route points matching each of the route point search requests may be determined from the plurality of route point search requests, and route stay time corresponding to each of the route points may be calculated. That is, the user may be searched for all restaurants and gas stations between the departure location and the destination location, wherein the number of restaurants may be plural, and the number of gas stations may also be plural, and the route stay time corresponding to each restaurant and each gas station is calculated.
And S130, determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
The target journey is journey information constructed according to information such as a departure place, a destination, journey planning time, various passing points and the like. The number of the target strokes may be one or more, and the embodiment of the present application does not limit this.
Correspondingly, after the path residence time corresponding to each path point is determined, the path points meeting the user travel requirement can be screened according to the path residence time corresponding to each path point, and the target travel is determined according to the travel planning information and the path residence time corresponding to the screened path points. The number of the pass-through points meeting the user travel requirement may be one or more, which is not limited in the embodiment of the present application.
Optionally, the meeting of the user travel requirement may be: and if the path residence time does not exceed the set time threshold value input by the user, and if the path residence time does not exceed 30 minutes set by the user, taking the path point with the path residence time exceeding 30 minutes as the path point meeting the travel requirement of the user. Or, the meeting of the travel requirement may also be: and the total time from the starting point to the passing point and then from the passing point to the destination (the total time needs to include the path residence time of each passing point) meets the condition limit of the travel planning time and the like. For example, if the total time required from the departure point to the destination is expected to be 2 hours, the route point from the departure point to the route point and the total time from the route point to the destination being less than 2 hours may be used as the route point satisfying the user travel demand. When the number of the route point search requests is plural, the total time is a sum of times from the departure point to the route point, from the route point to the route point, stay times of the route points, and from the route point to the destination.
For example, assuming that the number of route point search requests is one, after a plurality of route points satisfying the user's travel demand are determined, the target travel may be determined according to one or more route points selected by the user. When the user selects one route point, the target trip only includes one or more selectable trips corresponding to the route point as the target trip. For example, a plurality of selectable trips from the starting point to the route point a to the destination may be made for the route point a selected by the user. When the user selects a plurality of route points, the target trip may include one or more selectable trips corresponding to the respective route points as the target trip. For example, a plurality of selectable trips of a starting point-a-destination and a plurality of selectable trips of a starting point-a-B-destination may be made for route points a and B selected by the user.
Similarly, assuming that the number of the route point search requests is multiple, after a plurality of route points meeting the user travel demand are respectively determined for different route point search requests, one or more route points can be respectively selected to determine the target travel according to the user search requests for different route points from the route points meeting the user travel demand. For example, when the user passes through points a and B, a plurality of selectable trips of a departure point-trip point a-trip point B-destination may be made as target trips.
Therefore, in the scheme, a plurality of route points meeting the user route requirements are determined for the user according to the user route planning information and the route point search request input by the user aiming at the route planning information, the target route is determined according to the route planning information and the route stay time corresponding to each route point, the route points can be screened aiming at the arranged route and the surrounding services, the existing route of the user does not need to be damaged, the route is re-planned according to the route points, the requirements of multi-section route planning are met, the route planning function can be enriched, and the route planning efficiency is improved.
According to the method and the device, the route stay time corresponding to at least one route point is determined according to the route planning information of the user and the route point search request input by the user aiming at the route planning information, so that the target route is determined according to the route planning information and the route stay time corresponding to each route point, the problem that the route points cannot be pertinently recommended according to the route of the user and the stay time available for each route point in the conventional route planning method is solved, the route planning function is further enriched, and the route planning efficiency is improved.
In an example, fig. 2 is a flowchart of a route planning method provided in an embodiment of the present application, and the embodiment of the present application performs optimization and improvement on the basis of the technical solutions of the foregoing embodiments, and provides a plurality of specific selectable implementation manners for determining a route dwell time corresponding to at least one route point according to the route planning information and the route point search request.
A method of stroking as shown in fig. 2, comprising:
s210, obtaining the travel planning information of a user and a via point search request input by the user aiming at the travel planning information.
S220, determining the path residence time corresponding to at least one path point according to the travel planning information and the path point searching request.
Accordingly, S220 may include the following parallel operations:
and S221a, determining the current map display range according to the departure place and the destination.
The current map display range may be a display range determined according to information such as a departure place, a destination, and a current map zoom scale.
Correspondingly, when determining the route stay time corresponding to at least one route point according to the trip planning information and the route point search request, at least one route point matched with the route point search request can be determined firstly. Alternatively, when determining at least one waypoint matching the waypoint search request, the current map display range may be determined first based on the departure point and the destination in the trip planning information.
It should be noted that the current map display range needs to include a map area where the departure point and the destination are located. The size of the map area where the departure point and the destination are located can be specifically determined by the current map scaling information.
S222a, POI of interest is determined in the current map display range according to the route point search request.
The POI of interest may be a POI matching the route point search request. For example, if the route point search request is "restaurant," the POI of interest may be various types of restaurants, or the like.
Correspondingly, after the current map display range is determined, the Point of Interest (POI) displayed in the current map display range and matched with the via Point search request can be used as a via Point.
For example, assuming that the route point search request is "restaurant", all restaurants may be searched in the current map display range with the departure point and the destination according to the route point search request, and determined as the POI of interest.
And S223a, calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
Further, after the POI of interest matched with the route point search request between the departure point and the destination is determined, the route stay time corresponding to each POI of interest can be calculated and used as the route stay time corresponding to at least one route point. It should be noted that the route residence time corresponding to each POI of interest may be a positive value or a negative value, which is not limited in the embodiment of the present application.
In the above technical solution, the route stay time of all the route points matching the route point search request can be calculated by determining the POI of interest matching the route point search request as a route point using the current map display model and calculating the route stay time corresponding thereto.
S224a, determining a filtering range of the route points according to the POI of interest and the residence time of the route corresponding to the POI of interest.
The route point screening range can be used for screening route points meeting the travel requirements of the user. The filtering range of the passing points may be a regular rectangle, a circle, an irregular polygon, or the like, and the embodiment of the present application does not limit the specific shape of the filtering range of the passing points.
It can be understood that, in the POIs of interest determined directly according to the current map display range, the route stay time of some POIs of interest may not meet the user travel requirement. For example, a negative value for the route dwell time for a portion of the POI of interest indicates that the total travel time of the user from the origin, past the POI of interest, to the destination may exceed the travel planning time. The route dwell time for a portion of the POI of interest is zero or less than a certain threshold (e.g., 5 minutes), indicating that the total travel time of the user from the origin, past the POI of interest, to the destination is exactly equal to, or near, the travel plan time. The POI of interest with the negative path residence time does not meet the travel requirement of the user. POIs of interest with a path dwell time of zero or less than a certain threshold may not meet the user travel requirements. For example, when other factors (vehicle duration, weather conditions, etc.) influence the travel time, it is highly likely that the final actual travel time exceeds the planned travel time.
Therefore, after the route stay time corresponding to each POI of interest is calculated based on the current map display range, the route point screening range can be further determined according to each POI of interest and the route stay time corresponding to each POI of interest. And each POI of interest included in the screening range of the route points is also each route point which meets the travel requirement of the user.
For example, the range in which the POI of interest whose route stay time exceeds the set threshold is determined as the route point filtering range. Optionally, the set threshold may be set according to actual requirements, such as 10 minutes or 15 minutes, and the embodiment of the present application does not limit a specific value of the set threshold. That is, all the POIs of interest included in the filtering range of the route points are the route points meeting the travel requirement of the user.
In the scheme, after the route stay time corresponding to the POI of interest is calculated according to the current map display range, the route point screening range is determined according to the route stay time corresponding to each POI of interest, the POI meeting the user route requirement can be determined to be used as the route point, and then the target route comprising the route point is ensured to meet the user route requirement.
And S221b, determining a travel planning route by taking the departure place and the destination as end points.
The route planning route may be a route determined according to a departure place and a destination. Optionally, the route planned for the journey may be in the form of a straight line segment or a zigzag line, and the embodiment of the present application does not limit the specific route type of the route planned for the journey.
Correspondingly, when determining the path stop time corresponding to at least one passing point according to the travel planning information and the passing point search request, the travel planning route can be determined according to the departure point and the destination. For example, a straight line segment from the departure point to the destination is constructed as a route planned for the trip, taking the departure point and the destination as end points.
S222, determining a screening range of the route points according to the route planning route.
Correspondingly, after the route planning route is determined, the screening range of the passing points can be determined according to the route planning route.
For example, assuming that the route planning route is a straight line segment, the straight line segment may be used as a diameter, and a circular range constructed by using a midpoint of the straight line segment as a center of a circle may be used as a pass point screening range. Or, the straight line segment may be used as a diagonal line, and a square range constructed by taking the midpoint of the straight line segment as the center may be used as the pass point screening range. Assuming that the route planned by the journey is a zigzag line, each line segment of the zigzag line can be used as a diameter, a middle point of each line segment is used as a center of a circle to divide a constructed circular range, and a range obtained by taking a union of the circular ranges is used as a passing point screening range.
And S223b, taking the POI of interest in the filtering range of the route points as the route points.
And S224b, calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
After the route point screening range is determined, interested POI in the route point screening range can be directly used as a route point, and the route stay time corresponding to each interested POI is calculated and used as the route stay time corresponding to at least one route point.
In the scheme, the method and the device have the advantages that the method and the device can reduce the calculation amount of the path residence time and improve the calculation efficiency of the path residence time by determining the screening range of the path points, taking the POI of interest included in the screening range of the path points as the path points, taking the path residence time corresponding to each POI of interest as the path residence time corresponding to the path points, and not sequentially calculating the corresponding path residence time aiming at all POI of interest included in the current map display range.
S225b, adjusting the screening range of the passing points according to the residence time of the passing corresponding to the POI of interest.
It is understood that although the route point filtering range may exclude some POIs that do not meet the user travel requirement as route points to some extent, some POIs that do not meet the user travel requirement may still exist in the route point filtering range as route points. Therefore, after the path residence time corresponding to each POI of interest is obtained, the screening range of the path points can be adjusted according to the path residence time corresponding to each POI of interest. For example, the route point screening range is narrowed or enlarged, or the shape corresponding to the route point screening range is changed, so as to further exclude POIs which do not meet the user travel requirement in the route point screening range, ensure that all interested POIs in the route point screening range are route points which meet the user travel requirement, and further ensure that the target travel including the route points meets the user travel requirement.
Fig. 3 is a schematic diagram illustrating an effect of a pass point screening range provided in the embodiment of the present application. In an exemplary example, as shown in fig. 3, the waypoint filtering range may be set as a circular range having a line segment where the origin a and the destination C are located as a diameter and a center of the line segment as a center. And each POI of interest in the screening range of the route points, namely B1, B2, B3, B4 and B5, is a route point meeting the travel requirement of the user. Accordingly, the POI of interest outside the filtering range of the route points, namely B6, B7, B8, B9, B10 and B11 are the route points which do not meet the requirement of the user journey.
In an optional embodiment of the present application, the calculating a route stay time corresponding to each POI of interest may include: calculating the sequential stage travel time between each travel location; the travel location comprises the departure location, the POI of interest, and the destination; and calculating the path residence time corresponding to each POI of interest according to the travel planning time and the travel time of each sequence stage.
The sequence stage travel time may be a staged travel time from a starting point to a route point, a route point to a route point, and a route point to a starting point.
Optionally, when the route residence time corresponding to each POI of interest is calculated, the travel time of the departure place to the POI of interest, the travel time of the POI of interest to the POI of interest, and the travel time of the POI of interest to the departure place in the sequence stages may be calculated, and then the route residence time may be calculated according to the travel planning time and the travel time of each sequence stage. Optionally, the route stop time calculated according to the trip planning time and the trip time of each sequential stage may be, for example: and taking the difference value between the available total time length corresponding to the travel planning time and the travel time of each sequence stage as the total path stay time length.
It is to be understood that, when the number of waypoint search requests is one, the sequential stage itinerary may include sequential stage itineraries from the departure point to the POI of interest and from the POI of interest to the departure point, etc. In the application scenario, the path residence time corresponding to each POI of interest can be calculated independently and does not affect each other. When the number of the via point search requests is multiple, the sequential stage travel comprises sequential stage travel time from the departure point to the POI of interest, from the POI of interest to the departure point and the like. Wherein, the sequential phase travel time from the POI of interest to the POI of interest may be one or more. For example, when the number of route point search requests is two, the sequential phase travel time from the POI of interest to the POI of interest is one. When the number of route point search requests is three, the sequential stage travel time from the POI of interest to the POI of interest is two. In the application scenario, the path residence time corresponding to each POI of interest can be sequentially calculated according to the path sequence corresponding to the path points. For example, assuming a total length of pathway stay of 1 hour and a total of two POIs of interest, the pathway stay time for the first POI of interest is 20 minutes and the pathway stay time for the second POI of interest is 40 minutes. In an application scenario where the number of route point search requests is multiple, the embodiment of the present application does not limit a specific calculation manner of route residence time corresponding to each POI of interest.
In an optional embodiment of the present application, the calculating a route stay time corresponding to each POI of interest according to the route planning time and the travel time of each sequence stage may include: calculating the travel planning remaining time according to the travel planning time and the travel planning constraint factors; calculating the planning time and value of the travel time and the elastic reserved time of each sequence stage; and calculating the difference value between the travel planning remaining time and the planning time sum value as the path residence time corresponding to each POI of interest.
Where the trip planning constraint factor may be a factor that can affect the trip time. In an alternative embodiment of the present application, the trip planning constraint factors may include, but are not limited to, current time, current vehicle endurance information, and route weather information. The vehicle cruising information at the current time may be the remaining oil amount or the remaining electric quantity of the vehicle, or may also be the remaining travelable distance or the remaining travelable time of the vehicle, and the specific type of the vehicle cruising information at the current time is not limited in the embodiment of the present application. The route weather information may be weather conditions from the origin to the POI of interest, from the POI of interest to the POI of interest, or from the POI of interest to the destination. The trip plan remaining time may be the total length of time available from the origin to the destination. Optionally, the remaining time of the trip planning may be a time period finally obtained by subtracting a time difference limited by other trip planning constraint factors from a time difference between the trip planning time and the current time. For example, assuming that the travel planning time is 12 pm, the current time is 9 am, and the remaining travelable time is 4 hours, the travel planning remaining time is (12-9) ═ 3 hours. Assuming that the travel planning time is 12 am, the current time is 9 am, the remaining travelable time is 2 hours, and the total time required for refueling is 30 minutes, the travel planning remaining time is (12-9-0.5) ═ 2.5 hours. The elastic reserved time can be set according to actual service requirements, and is used for ensuring that the path residence time fluctuates in a proper range so as to meet the user travel requirements. The planning time sum value may be the sum of the travel time and the elastic reservation time of each sequential phase.
Optionally, when the path residence time corresponding to each POI of interest is specifically calculated, the travel planning remaining time may be calculated according to the travel planning time and the travel planning constraint factor, then the planning time and the value of the travel time and the elastic reserved time at each sequence stage are calculated, and finally, the time obtained by subtracting the planning time and the value from the travel planning remaining time is used, that is, the path residence time corresponding to each POI of interest.
For example, assuming that the number of route point search requests is one, the remaining time of the trip plan is 1 hour, and the trip time at each sequence stage is: the travel time of the sequential phases from the departure place to the POI of interest is 10 minutes; if the sequential phase travel time of the POI of interest to the destination is 20 minutes and the elasticity reserve time is 15 minutes, the route stay time of the POI of interest is 15 minutes.
For example, assuming that the number of route point search requests is plural, the remaining time of the route planning is 2 hours, and the travel time at each sequential stage is: the sequential phase travel time from the origin to the POI of interest is 30 minutes; a sequential phase travel time of 20 minutes from the first POI of interest to the second POI of interest; the sequential phase travel time of the second POI of interest to the destination is 20 minutes, and the elasticity reserve time is 15 minutes, then the approach dwell time for the first POI of interest may be 15 minutes, and the approach dwell time for the second POI of interest may be 20 minutes. Alternatively, the pathway residence time for the first POI of interest can be 10 minutes, the pathway residence time for the second POI of interest can be 25 minutes, and so forth.
And S230, determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
According to the technical scheme, the route point screening range is determined in different modes, the corresponding route stay time is calculated for the POI of interest meeting the user travel requirement in the route point screening range, the calculation modes of the route points meeting the user travel requirement are enriched, and the calculation function of the route stay time corresponding to the route points is expanded.
In an example, fig. 4 is a flowchart of a route planning method provided in the embodiment of the present application, and the embodiment of the present application performs optimization and improvement on the basis of the technical solutions of the above embodiments, and provides a plurality of specific selectable implementation manners for determining a target route according to the route planning information and a route dwell time corresponding to each route point.
A method of stroking as shown in fig. 4, comprising:
s310, acquiring the travel planning information of the user and a via point search request input by the user aiming at the travel planning information.
S320, determining the path staying time corresponding to at least one path point according to the travel planning information and the path point searching request.
And S330, determining the journey planning influence data of the passing points according to the journey planning influence factors.
And S340, displaying the travel planning influence data corresponding to each passing point as the travel planning information.
The journey planning influence factor can be determined according to POI attributes of the passing points. The trip planning influence data may correspond to data for each trip planning influence factor. Alternatively, the trip planning impact data may be acquired using big data technology.
Correspondingly, after the route stay time corresponding to at least one route point is determined according to the route planning information and the route point search request, further route planning influence data of each route point can be determined according to the route planning influence factors.
For example, when the route point is a restaurant, the route planning influence factors may include road condition information, main cuisine, goodness of comment, geographical location information, current queuing time, route stay time, or other POI information of each restaurant. When the passing point is a gas station, the journey planning influence factors may include road condition information, geographical location information, estimated arrival time, current queuing time, route stay time or other POI information of each gas station.
Optionally, in this embodiment of the application, the at least one route point determined according to the trip planning information and the route point search request may be a route point meeting a trip requirement of the user. That is, after the route points meeting the user's travel demand are determined, the travel planning influence data corresponding to each route point meeting the user's travel demand is displayed as the travel planning information for the user to make reference selection.
It should be noted that after the trip planning influence data of each route point is acquired, the optimal route points meeting the user trip requirements can be automatically screened out according to the various formed planning influence data and the trip planning information, the number of the optimal route points can be multiple, and the optimal route points can be sorted according to priority, such as according to the length of the route stay time or the heat degree of each route point. Or, the passing points and the like with low conformity with the user journey requirement can be automatically eliminated according to the formed planning influence data and the journey planning information.
In the above scheme, the route planning influence data corresponding to each route point is displayed as the route planning information, so that the user can more intuitively know the specific information of each route point, and the user can quickly screen the route points.
And S350, determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
Wherein, S350 may specifically include the following operations:
s351, screening target passing points in a passing point screening range determined according to the travel planning information and the path residence time corresponding to each passing point.
The target route point may be a route point screened by the user from the route point screening range. Since each route point in the route point screening range can satisfy the user travel requirement, the target route point also inevitably satisfies the user travel requirement. The number of the target passing points may be one or multiple, and the specific number of the target passing points is not limited in the embodiment of the present application.
In an optional embodiment of the present application, the screening target route points may include: and receiving at least one route point selected by a user according to the route dwell time corresponding to each route point and the travel planning influence data corresponding to each route point as the target route point.
And S352, determining the target journey according to the journey planning information, each target route point and the route stay time corresponding to each target route point.
Correspondingly, after the user determines one or more target route points from the route points, one or more target routes can be determined according to the route planning information, the target route points and the route stay time corresponding to the target route points.
It should be noted that the user may also set a restriction condition for the route stay time in the route planning information. For example, the route residence time of each route point cannot exceed 30 minutes, and accordingly, the route residence time corresponding to each route point included in the route point screening range needs to satisfy the user travel requirement and also needs to ensure that the route residence time cannot exceed 30 minutes.
In the technical scheme, the final target travel is determined according to the target passing point selected by the user, so that not only can a travel planning scheme meeting the travel requirement of the user be provided for the user, but also an individualized travel planning scheme can be determined according to the individual requirement of the user.
In an alternative embodiment of the present application, when the number of target pathway points is one; the determining the target route according to the route planning information, each target route point, and the route dwell time corresponding to each target route point may include: determining a first-stage travel from the starting point to the target passing point and a second-stage travel from the target passing point to the destination; and constructing the target journey according to the first-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
For example, assuming that the starting point is a, the destination is C, the target passing point is a passing point B, and the corresponding path residence time is 20 minutes, the target route may specifically be: starting from the starting point A to the passing point B, and staying for 20 minutes at maximum after reaching the passing point B. After the residence time at the passing point B is a certain time (no more than 20 minutes), the process continues to start from the passing point B to the destination C. That is, the first-stage route from the departure point a to the route point B, the route stay time at the route point B, and the second-stage route from the route point B to the destination C together constitute the target route.
In an alternative embodiment of the present application, when the number of the target pathway points is plural; the determining the target route according to the route planning information, each target route point, and the route dwell time corresponding to each target route point may include: determining a first-stage travel from the starting point to the target passing point, an intermediate-stage travel between the target passing points and a second-stage travel from the target passing point to the destination; and constructing the target journey according to the first-stage journey, the intermediate-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
For example, assume that the starting point is a, the destination is D, the target route point includes a route point B and a route point C, the route dwell time corresponding to the route point B is 20 minutes, and the route dwell time corresponding to the route point C is 15 minutes. The target trip may specifically be: starting from the starting point A to the passing point B, and staying for 20 minutes at maximum after reaching the passing point B. After the residence time at the passing point B is a certain time (not more than 20 minutes), the process is continued to the passing point C from the passing point B. The maximum residence time after reaching the passing point C can be 15 minutes. After the transit point C stays for a certain time (no more than 15 minutes), the departure is continued to the destination D from the transit point C. That is, the first stage route from the departure point a to the route point B, the route stay time at the route point B, the intermediate stage route from the route point B to the route point C, the route stay time at the route point C, and the second stage route from the route point C to the departure point D together constitute the target route.
According to the technical scheme, the target travel is constructed according to the first-stage travel, the intermediate-stage travel, the second-stage travel and the corresponding path residence time of the target path point, so that the purpose that the path point is pertinently recommended to determine the target travel matched with the user travel requirement on the basis of the existing travel arrangement is achieved, the travel planning function is enriched, and the travel planning efficiency is improved.
In an example, fig. 5 is a schematic diagram of an effect of a trip planning provided by an embodiment of the present application, and as shown in fig. 5, it is assumed that an application scenario mode is: when the system plans to drive to a certain destination receiver in fixed time, the system needs to drive to a certain place to eat (refuel, charge and the like) and then drive to the destination receiver, and is afraid of the missing of the travel time due to the traffic jam on the road of the receiver, the system recommends a path point recommendation scheme which can not delay the arrival for the user based on data analysis (road conditions, distances, travel, POI and the like), provides a POI range, predicted arrival time, detentable time and the like which can be set as path points for the user as comprehensive judgment, and provides services such as departure reminding, path point recommendation, dwell time prompt, travel detailed information prompt and the like for the user in the whole process.
Accordingly, as shown in fig. 5, in the application scenario mode of the pick-up mode, it is assumed that the user plans 14:30 to drive to a T2 terminal to pick up, and wants to drive to eat lunch first and then drive to the airport, and is afraid of traffic jam on the airport and missing pick-up time. At this time, the user can set a travel destination and a desired arrival time using the navigation product. After the travel is added, surrounding restaurants are searched as route points based on the travel. The navigation product can recommend restaurants that can be set as waypoints based on data such as travel time, future road condition predictions, location, POI information, queuing times, and the like. The user can select a target restaurant based on restaurant categories, estimated arrival times, available stay times, etc., and set the target restaurant as a target waypoint. And after the target passing point is set, initiating navigation. The user can pay attention to the travel information in real time during navigation so as to avoid missing airport pick-up time.
In another example, in the application scenario mode of the customer visit mode, assuming that the user plans to visit the customer at a fixed time point to the site a, it is necessary to refuel to surrounding gas stations before reaching the site a. Accordingly, the user can set a travel destination and a desired arrival time using the navigation product. After adding the journey, searching surrounding gas stations as passing points based on the journey. The navigation product can recommend the gas station which can be set as the approach point based on data such as travel time, future road condition prediction, position and POI information. The user can select a target gas station based on the gas station information, the predicted arrival time, the staying time, the predicted queuing time and other data, set the target gas station as a target route point, and initiate navigation after the target route point is set. The user can pay attention to the travel dynamic information in real time during navigation so as to prevent the user from visiting the travel by mistake.
According to the technical scheme, the route points can be recommended for the user in a targeted manner based on the travel plan. Meanwhile, the route point is recommended, the stopping time prompt and the like are used for preventing the user from missing the route arrangement, and the screening efficiency of the route points can be improved.
In an example, fig. 6 is a structural diagram of a trip planning apparatus provided in an embodiment of the present application, which is applicable to a case where route points are specifically recommended according to a trip of a user and a stop time available at each route point, and the apparatus is implemented by software and/or hardware and is specifically configured in an electronic device. The electronic device may be a computer device or the like.
A trip planning apparatus 400, as shown in fig. 6, comprises: an information acquisition module 410, a pathway dwell time determination module 420, and a target trip determination module 430. Wherein,
an information obtaining module 410, configured to obtain route planning information of a user and a route point search request input by the user for the route planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination;
a route stay time determining module 420, configured to determine a route stay time corresponding to at least one route point according to the trip planning information and the route point search request;
and a target trip determining module 430, configured to determine a target trip according to the trip planning information and the route dwell time corresponding to each of the route points.
According to the method and the device, the route stay time corresponding to at least one route point is determined according to the route planning information of the user and the route point search request input by the user aiming at the route planning information, so that the target route is determined according to the route planning information and the route stay time corresponding to each route point, the problem that the route points cannot be pertinently recommended according to the route of the user and the stay time available for each route point in the conventional route planning method is solved, the route planning function is further enriched, and the route planning efficiency is improved.
Optionally, the route dwell time determination module 420 is configured to: determining a current map display range according to the departure place and the destination; determining POI of interest in the current map display range according to the route point search request; and calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
Optionally, the trip planning apparatus further includes: and the passing point screening range determining module is used for determining a passing point screening range according to the POI of interest and the path residence time corresponding to the POI of interest.
Optionally, the route dwell time determination module 420 is configured to: determining a route for planning a journey by taking the departure place and the destination as end points; determining a screening range of the passing points according to the route planning route; taking the POI of interest in the screening range of the route points as the route points; and calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
Optionally, the trip planning apparatus further includes: and the route point screening range adjusting module is used for adjusting the route point screening range according to the route residence time corresponding to each POI of interest.
Optionally, the route dwell time determination module 420 is configured to: calculating the sequential stage travel time between each travel location; the travel location comprises the departure location, the POI of interest, and the destination; and calculating the path residence time corresponding to each POI of interest according to the travel planning time and the travel time of each sequence stage.
Optionally, the route dwell time determination module 420 is configured to: calculating the travel planning remaining time according to the travel planning time and the travel planning constraint factors; calculating the planning time and value of the travel time and the elastic reserved time of each sequence stage; and calculating the difference value between the travel planning remaining time and the planning time sum value as the path residence time corresponding to each POI of interest.
Optionally, the trip planning constraint factor includes a current time, current vehicle endurance information, and route weather information.
Optionally, the trip planning apparatus further includes: the trip planning influence data determining module is used for determining the trip planning influence data of each passing point according to the trip planning influence factors; and the travel planning influence data display module is used for displaying the travel planning influence data corresponding to each passing point as the travel planning information.
Optionally, the target trip determining module 430 is configured to: screening target route points in a route point screening range determined according to the travel planning information and the route residence time corresponding to each route point; and determining the target journey according to the journey planning information, each target route point and the route residence time corresponding to each target route point.
Optionally, the target trip determining module 430 is configured to: and receiving at least one route point selected by a user according to the route dwell time corresponding to each route point and the travel planning influence data corresponding to each route point as the target route point.
Optionally, the number of the target pathway points is one; the target trip determination module 430 is configured to: determining a first-stage travel from the starting point to the target passing point and a second-stage travel from the target passing point to the destination; and constructing the target journey according to the first-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
Optionally, the number of the target pathway points is multiple; the target trip determination module 430 is configured to: determining a first-stage travel from the starting point to the target passing point, an intermediate-stage travel between the target passing points and a second-stage travel from the target passing point to the destination; and constructing the target journey according to the first-stage journey, the intermediate-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
The travel planning device can execute the travel planning method provided by any embodiment of the application, and has corresponding functional modules and beneficial effects of the execution method. For details of the technology not described in detail in this embodiment, reference may be made to a route planning method provided in any embodiment of the present application.
Since the above-described trip planning device is a device capable of executing the trip planning method in the embodiment of the present application, based on the trip planning method described in the embodiment of the present application, a person skilled in the art can understand a specific implementation manner of the trip planning device in the embodiment of the present application and various variations thereof, and therefore, how to implement the trip planning method in the embodiment of the present application by the trip planning device is not described in detail herein. The device used by those skilled in the art to implement the method for planning a journey in the embodiments of the present application is within the scope of the protection of the present application.
In one example, the present application also provides an electronic device and a readable storage medium.
Fig. 7 is a schematic structural diagram of an electronic device for implementing the trip planning method according to the embodiment of the present application. Fig. 7 is a block diagram of an electronic device according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.
As shown in fig. 7, the electronic apparatus includes: one or more processors 501, memory 502, and interfaces for connecting the various components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). Fig. 7 illustrates an example of a processor 501.
The memory 502, which is a non-transitory computer-readable storage medium, may be used to store non-transitory software programs, non-transitory computer-executable programs, and modules, such as program instructions/modules corresponding to the trip planning methods in embodiments of the present application (e.g., the information acquisition module 410, the route stay time determination module 420, and the target trip determination module 430 shown in fig. 6). The processor 501 executes various functional applications of the server and data processing by running non-transitory software programs, instructions, and modules stored in the memory 502, that is, implements the trip planning method in the above method embodiment.
The memory 502 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by use of an electronic device implementing the trip planning method, and the like. Further, the memory 502 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 502 may optionally include memory located remotely from the processor 501, which may be connected via a network to an electronic device implementing the trip planning method. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device implementing the trip planning method may further include: an input device 503 and an output device 504. The processor 501, the memory 502, the input device 503 and the output device 504 may be connected by a bus or other means, and fig. 7 illustrates the connection by a bus as an example.
The input device 503 may receive input numeric or character information and generate key signal inputs related to user settings and function control of an electronic apparatus implementing the trip planning method, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointing stick, one or more mouse buttons, a track ball, a joystick, or other input devices. The output devices 504 may include a display device, auxiliary lighting devices (e.g., LEDs), and haptic feedback devices (e.g., vibrating motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
The computer system may include clients and servers. The client may be a smart phone, a notebook computer, a desktop computer, a tablet computer, a smart speaker, etc., but is not limited thereto. The server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as cloud computing, cloud service, a cloud database, cloud storage and the like. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
According to the method and the device, the route stay time corresponding to at least one route point is determined according to the route planning information of the user and the route point search request input by the user aiming at the route planning information, so that the target route is determined according to the route planning information and the route stay time corresponding to each route point, the problem that the route points cannot be pertinently recommended according to the route of the user and the stay time available for each route point in the conventional route planning method is solved, the route planning function is further enriched, and the route planning efficiency is improved.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.
The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (16)
1. A trip planning method, comprising:
acquiring the travel planning information of a user and a via point search request input by the user aiming at the travel planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination;
determining the path residence time corresponding to at least one path point according to the travel planning information and the path point searching request;
and determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
2. The method of claim 1, wherein the determining a route dwell time corresponding to at least one route point according to the trip planning information and the route point search request comprises:
determining a current map display range according to the departure place and the destination;
determining interest Points (POI) in the current map display range according to the route point search request;
and calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
3. The method of claim 2, further comprising:
and determining a filtering range of the passing points according to the POI of interest and the residence time of the route corresponding to the POI of interest.
4. The method of claim 1, wherein the determining a route dwell time corresponding to at least one route point according to the trip planning information and the route point search request comprises:
determining a route for planning a journey by taking the departure place and the destination as end points;
determining a screening range of the passing points according to the route planning route;
taking the POI of interest in the screening range of the route points as the route points;
and calculating the path residence time corresponding to each POI of interest as the path residence time corresponding to the at least one path point.
5. The method of claim 4, further comprising:
and adjusting the screening range of the passing points according to the residence time of the passing corresponding to each POI of interest.
6. The method of claim 2 or 4, wherein said calculating a pathway residence time for each POI of interest comprises:
calculating the sequential stage travel time between each travel location; the travel location comprises the departure location, the POI of interest, and the destination;
and calculating the path residence time corresponding to each POI of interest according to the travel planning time and the travel time of each sequence stage.
7. The method of claim 6, wherein said calculating a route dwell time for each POI of interest based on the trip planning time and each of the sequential phase trip times comprises:
calculating the travel planning remaining time according to the travel planning time and the travel planning constraint factors;
calculating the planning time and value of the travel time and the elastic reserved time of each sequence stage;
and calculating the difference value between the travel planning remaining time and the planning time sum value as the path residence time corresponding to each POI of interest.
8. The method of claim 7, wherein the trip planning constraint factors include a current time, current vehicle range information, and route weather information.
9. The method of claim 1, further comprising:
determining journey planning influence data of each passing point according to journey planning influence factors;
and displaying the travel planning influence data corresponding to each passing point as the travel planning information.
10. The method of claim 1, wherein determining a target trip according to the trip planning information and the route dwell time corresponding to each of the via points comprises:
screening target route points in a route point screening range determined according to the travel planning information and the route residence time corresponding to each route point;
and determining the target journey according to the journey planning information, each target route point and the route residence time corresponding to each target route point.
11. The method of claim 10, wherein the screening target waypoints comprises:
and receiving at least one route point selected by a user according to the route dwell time corresponding to each route point and the travel planning influence data corresponding to each route point as the target route point.
12. The method of claim 10, wherein the number of target pathway points is one;
the determining the target route according to the route planning information, the target route points and the route stay time corresponding to the target route points comprises:
determining a first-stage travel from the starting point to the target passing point and a second-stage travel from the target passing point to the destination;
and constructing the target journey according to the first-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
13. The method of claim 10, wherein the number of target pathway points is plural;
the determining the target route according to the route planning information, the target route points and the route stay time corresponding to the target route points comprises:
determining a first-stage travel from the starting point to the target passing point, an intermediate-stage travel between the target passing points and a second-stage travel from the target passing point to the destination;
and constructing the target journey according to the first-stage journey, the intermediate-stage journey, the second-stage journey and the route residence time corresponding to the target route point.
14. A trip planning apparatus comprising:
the system comprises an information acquisition module, a route planning module and a route point search module, wherein the information acquisition module is used for acquiring route planning information of a user and a route point search request input by the user aiming at the route planning information; the journey planning information comprises a departure place, a destination and journey planning time from the departure place to the destination;
the route residence time determining module is used for determining the route residence time corresponding to at least one route point according to the travel planning information and the route point searching request;
and the target travel determining module is used for determining a target travel according to the travel planning information and the path residence time corresponding to each passing point.
15. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the trip planning method of any one of claims 1-13.
16. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the trip planning method of any one of claims 1-13.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010895319.0A CN112084276A (en) | 2020-08-31 | 2020-08-31 | Journey planning method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010895319.0A CN112084276A (en) | 2020-08-31 | 2020-08-31 | Journey planning method and device, electronic equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN112084276A true CN112084276A (en) | 2020-12-15 |
Family
ID=73731268
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010895319.0A Withdrawn CN112084276A (en) | 2020-08-31 | 2020-08-31 | Journey planning method and device, electronic equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112084276A (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113188559A (en) * | 2021-06-02 | 2021-07-30 | 芜湖雄狮汽车科技有限公司 | Vehicle navigation method and device and vehicle |
CN113819922A (en) * | 2021-10-29 | 2021-12-21 | 成都清渟科技有限公司 | Intelligent route planning method |
CN114427865A (en) * | 2021-12-02 | 2022-05-03 | 兰州交通大学 | Navigation method including intermediate address and related product |
CN116757348A (en) * | 2023-07-05 | 2023-09-15 | 黑龙江省辰源投资管理有限公司 | Travel information intelligent planning management system and method based on artificial intelligence |
Citations (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002149763A (en) * | 2000-11-07 | 2002-05-24 | Seiko Epson Corp | Itinerary generating device |
JP2003139553A (en) * | 2001-11-02 | 2003-05-14 | Nippon Telegr & Teleph Corp <Ntt> | Route retrieval method and route retrieval device taking side trips into account, route retrieval program and recording medium of the program |
JP2009036720A (en) * | 2007-08-03 | 2009-02-19 | Navitime Japan Co Ltd | Information delivery system, information delivery server, mobile terminal device, and information delivery method |
US20090240429A1 (en) * | 2008-03-19 | 2009-09-24 | Xanavi Informatics Corporation | Method for route planning on a navigation system including points of interest |
JP2010033169A (en) * | 2008-07-25 | 2010-02-12 | Toshiba Solutions Corp | Car travel plan making program and car travel plan presenting device and program |
US9140570B1 (en) * | 2011-09-08 | 2015-09-22 | Amazon Technologies, Inc. | Time-inclusive route and trip planning |
US20150285652A1 (en) * | 2012-10-25 | 2015-10-08 | Intel Corporation | Route optimization including points of interest |
US20160169697A1 (en) * | 2014-12-11 | 2016-06-16 | Red Hat, Inc. | Time Related Points of Interest For Navigation System |
CN106557474A (en) * | 2015-09-24 | 2017-04-05 | 北京四维图新科技股份有限公司 | Obtain the method and device of POI, database, navigation terminal and automobile on the way |
CN106568451A (en) * | 2015-10-09 | 2017-04-19 | 腾讯科技(深圳)有限公司 | Route planning method and device thereof |
CN107014392A (en) * | 2017-03-31 | 2017-08-04 | 上海雷腾软件股份有限公司 | A kind of route planning method and equipment |
JP2017142191A (en) * | 2016-02-12 | 2017-08-17 | 三菱電機株式会社 | Guide route presentation device and method of setting guide route |
KR20190096315A (en) * | 2019-08-07 | 2019-08-19 | 에스케이텔레콤 주식회사 | Method for searching plural point of interest and apparatus thereof |
JP2019148468A (en) * | 2018-02-26 | 2019-09-05 | 株式会社Jvcケンウッド | Navigation device, navigation method and program |
CN110849381A (en) * | 2018-08-20 | 2020-02-28 | 环达电脑(上海)有限公司 | Multi-route point navigation method |
CN110866657A (en) * | 2019-11-28 | 2020-03-06 | 北京三快在线科技有限公司 | Path planning method and device |
CN111159580A (en) * | 2018-11-08 | 2020-05-15 | 丰田自动车株式会社 | Itinerary recommendation device, itinerary recommendation method, and non-volatile storage medium storing program |
CN111435470A (en) * | 2019-01-11 | 2020-07-21 | 上海博泰悦臻网络技术服务有限公司 | Travel route planning method, storage medium and server |
-
2020
- 2020-08-31 CN CN202010895319.0A patent/CN112084276A/en not_active Withdrawn
Patent Citations (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002149763A (en) * | 2000-11-07 | 2002-05-24 | Seiko Epson Corp | Itinerary generating device |
JP2003139553A (en) * | 2001-11-02 | 2003-05-14 | Nippon Telegr & Teleph Corp <Ntt> | Route retrieval method and route retrieval device taking side trips into account, route retrieval program and recording medium of the program |
JP2009036720A (en) * | 2007-08-03 | 2009-02-19 | Navitime Japan Co Ltd | Information delivery system, information delivery server, mobile terminal device, and information delivery method |
US20090240429A1 (en) * | 2008-03-19 | 2009-09-24 | Xanavi Informatics Corporation | Method for route planning on a navigation system including points of interest |
JP2010033169A (en) * | 2008-07-25 | 2010-02-12 | Toshiba Solutions Corp | Car travel plan making program and car travel plan presenting device and program |
US9140570B1 (en) * | 2011-09-08 | 2015-09-22 | Amazon Technologies, Inc. | Time-inclusive route and trip planning |
US20150285652A1 (en) * | 2012-10-25 | 2015-10-08 | Intel Corporation | Route optimization including points of interest |
US20160169697A1 (en) * | 2014-12-11 | 2016-06-16 | Red Hat, Inc. | Time Related Points of Interest For Navigation System |
CN106557474A (en) * | 2015-09-24 | 2017-04-05 | 北京四维图新科技股份有限公司 | Obtain the method and device of POI, database, navigation terminal and automobile on the way |
CN106568451A (en) * | 2015-10-09 | 2017-04-19 | 腾讯科技(深圳)有限公司 | Route planning method and device thereof |
JP2017142191A (en) * | 2016-02-12 | 2017-08-17 | 三菱電機株式会社 | Guide route presentation device and method of setting guide route |
CN107014392A (en) * | 2017-03-31 | 2017-08-04 | 上海雷腾软件股份有限公司 | A kind of route planning method and equipment |
JP2019148468A (en) * | 2018-02-26 | 2019-09-05 | 株式会社Jvcケンウッド | Navigation device, navigation method and program |
CN110849381A (en) * | 2018-08-20 | 2020-02-28 | 环达电脑(上海)有限公司 | Multi-route point navigation method |
CN111159580A (en) * | 2018-11-08 | 2020-05-15 | 丰田自动车株式会社 | Itinerary recommendation device, itinerary recommendation method, and non-volatile storage medium storing program |
CN111435470A (en) * | 2019-01-11 | 2020-07-21 | 上海博泰悦臻网络技术服务有限公司 | Travel route planning method, storage medium and server |
KR20190096315A (en) * | 2019-08-07 | 2019-08-19 | 에스케이텔레콤 주식회사 | Method for searching plural point of interest and apparatus thereof |
CN110866657A (en) * | 2019-11-28 | 2020-03-06 | 北京三快在线科技有限公司 | Path planning method and device |
Non-Patent Citations (1)
Title |
---|
吴清霞;周娅;文缔尧;贺正红;: "基于用户兴趣和兴趣点流行度的个性化旅游路线推荐", 计算机应用, no. 06, 10 June 2016 (2016-06-10), pages 294 - 298 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113188559A (en) * | 2021-06-02 | 2021-07-30 | 芜湖雄狮汽车科技有限公司 | Vehicle navigation method and device and vehicle |
CN113819922A (en) * | 2021-10-29 | 2021-12-21 | 成都清渟科技有限公司 | Intelligent route planning method |
CN113819922B (en) * | 2021-10-29 | 2024-05-03 | 成都清渟科技有限公司 | Intelligent route planning method |
CN114427865A (en) * | 2021-12-02 | 2022-05-03 | 兰州交通大学 | Navigation method including intermediate address and related product |
CN116757348A (en) * | 2023-07-05 | 2023-09-15 | 黑龙江省辰源投资管理有限公司 | Travel information intelligent planning management system and method based on artificial intelligence |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112084276A (en) | Journey planning method and device, electronic equipment and storage medium | |
US10685416B2 (en) | Suggested pickup location for ride services | |
EP3098567B1 (en) | Ride sharing navigation | |
CN111486861B (en) | Path planning method, device, equipment and medium | |
US10331727B2 (en) | Graphical user interface to display commonly categorized entities | |
US20180374032A1 (en) | Match-based route navigation system | |
CN110689229B (en) | Information processing method, device, equipment and computer storage medium | |
US20140149157A1 (en) | Travel planning | |
KR101886966B1 (en) | Method for providing customized travel plan and server implementing the same | |
US9857186B2 (en) | System and method for long-haul trip planning for commercial vehicles transportation | |
US20160117618A1 (en) | Determining alternative travel itineraries using current location | |
US8600659B1 (en) | Method and system for geographic search for public transportation commuters | |
US11561105B2 (en) | Optimized route planning for multiple travelers with the same destination | |
US20240256579A1 (en) | Visual search system for finding trip destination | |
US10830597B2 (en) | Smart city crosswalk and traffic navigation system | |
CN108921666A (en) | Travel information recommended method, device, equipment and storage medium | |
CN113139118A (en) | Parking lot recommendation method and device, electronic equipment and medium | |
CN113706857B (en) | Method, device and equipment for determining road trafficability and storage medium | |
CN113139139A (en) | Method, apparatus, electronic device, and medium for determining boarding point | |
JP5615777B2 (en) | Route guidance device and route guidance method | |
KR20150117209A (en) | Travel planning system | |
CN112419728B (en) | Method, device, equipment and storage medium for determining road condition information | |
KR20150116385A (en) | Media input reservation system | |
KR102224587B1 (en) | Method for providing service of generation and management trip plan and system for providing service of generation and management trip plan | |
US20240037459A1 (en) | Database operations and analysis for virtual interlining of travel routes |
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: 20211025 Address after: 100176 101, floor 1, building 1, yard 7, Ruihe West 2nd Road, Beijing Economic and Technological Development Zone, Daxing District, Beijing Applicant after: Apollo Intelligent Connectivity (Beijing) Technology Co., Ltd. Address before: 2 / F, baidu building, 10 Shangdi 10th Street, Haidian District, Beijing 100085 Applicant before: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY Co.,Ltd. |
|
WW01 | Invention patent application withdrawn after publication | ||
WW01 | Invention patent application withdrawn after publication |
Application publication date: 20201215 |