Method and system for optimizing driving route based on expressway free policy

Abstract

The invention relates to the technical field of vehicles, and discloses an expressway free policy-based driving route optimization method and system, an electronic device, a storage medium and a vehicle, and the method comprises the steps: responding to a driving route set by a user, identifying whether the driving route comprises an expressway section, responding to the obtained current time, and determining whether the driving route comprises the expressway section; judging whether the current time is in a high-speed free policy period or not, namely comparing the current time with a policy database; on the basis of the driving route and in combination with the expressway section information, predicting a route end point and predicted time for arriving at each toll station; and based on the prediction result, optimizing the driving route and reminding the user, including judging whether the user may miss the expressway free policy or not, and dynamically planning the driving route according to the judgment result and generating corresponding reminding information. According to the invention, free policies of the expressway can be enjoyed to the greatest extent, the expressway congestion is effectively reduced, and the occurrence of traffic accidents is reduced.

Description

Technical Field

[0001] The present invention relates to the field of vehicle technology, and in particular to a method, system, electronic equipment, storage medium and vehicle for optimizing a driving route based on a free highway policy. Background Art

[0002] At present, during the implementation period of the free highway policy, people usually pass through the highway toll stations before the free passage deadline, which leads to a large number of vehicles waiting to pass at the highway toll stations, causing traffic congestion and making traffic accidents more likely to occur.

[0003] The patent document CN118129776A discloses a path recommendation method, including responding to a vehicle start signal, based on the acquired vehicle location information, obtaining all free-passing high-speed toll station information within a preset area; verifying the free-passing high-speed toll station information, and establishing a free site database based on the verified free-passing high-speed toll station information based on the defined database structure; responding to a navigation start signal, based on the acquired navigation path, judging whether the preset fee reduction conditions are met; when the preset fee reduction conditions are met, based on the preset path planning algorithm, according to the free site database, planning and generating the corresponding fee reduction path, based on the fee reduction path, generating the corresponding path recommendation strategy for the user to recommend the path. According to the current city's free-highway toll policy, the corresponding free interval path can be recommended to the user, reducing the user's travel expenses and improving the user experience.

[0004] In the above patent documents and prior art, a free station database is established by obtaining toll station information, and then when the user travels, the corresponding free route is recommended according to the database. Although this can save the user's travel expenses, the user will inevitably encounter various emergencies during the travel process, which will result in the user not being able to obtain the corresponding fee reduction according to the recommended route, and lacks certain real-time performance. Therefore, this application is a further innovation of the above patent application and prior art, and provides a method for optimizing driving routes based on the free highway policy.

[0005] Therefore, the present application provides a method for optimizing driving routes based on the free highway policy to solve the above technical problems. Summary of the invention

[0006] The purpose of the present invention is to provide a method, system, electronic device, storage medium and vehicle for optimizing driving routes based on a free highway policy, so as to solve the technical problem in the prior art that people have low utilization rate of the free highway policy and easily cause traffic congestion.

[0007] In order to solve the above technical problems, the present invention provides a method for optimizing driving routes based on a free highway policy, comprising:

[0008] In response to a driving route set by a user, identifying whether the driving route includes a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining information about the highway section;

[0009] In response to the acquired current time, determining whether the current time is within a high-speed free policy period, including comparing the current time with a policy database;

[0010] Based on the driving route and in combination with the highway section information, predict the estimated time to reach the route end and each toll station, wherein the time prediction is made for each section in the driving route, and the time prediction is made for the section required to travel to the toll station;

[0011] Based on the prediction result, the driving route is optimized and the user is reminded, which includes judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result.

[0012] In some specific embodiments, in response to a driving route set by a user, identifying whether the driving route includes a highway section, wherein the method includes identifying the type of each section in the driving route, marking the highway section, and obtaining the highway section information, further includes:

[0013] In response to the driving route set by the user, generating a preliminary route plan, including major roads and an estimated driving distance;

[0014] Analyze the route in the preliminary route planning section by section, identify all expressway sections, mark the starting point and end point of each expressway section, and calculate the length of each expressway section and the estimated travel time;

[0015] Obtain information about each expressway section, including the name of the toll station, location coordinates, and whether it is an ETC channel.

[0016] In some specific embodiments, in response to the acquired current time, determining whether the current time is within the high-speed free policy period includes comparing the current time with a policy database, and further includes:

[0017] Obtaining the current time, including obtaining the exact value of the current time;

[0018] Based on the policy database, query the free highway policy, wherein the policy database includes current free highway policy time period information;

[0019] The current time is compared with the free highway policy time period information to determine whether the current time is within the free time period. When there are multiple free time periods, the free time period to which the current time belongs is determined by comparing them one by one.

[0020] In some specific embodiments, based on the driving route and in combination with the highway section information, predicting the estimated time to reach the end of the route and each toll station further includes:

[0021] Get real-time traffic information, including congestion and construction information;

[0022] Based on the road condition information, combined with vehicle speed and traffic rules, predict the travel time to reach the end of the route, and simultaneously perform time prediction for each section of the travel route;

[0023] Based on each toll station in the driving route, a time prediction is performed according to the location of the toll station, the road condition and the road section required to travel to the toll station, and the estimated time to arrive at each toll station is calculated;

[0024] The estimated arrival time at the last toll station among the toll stations is compared with the end time of the free highway policy period to determine whether the user has enough time to pass through the toll station.

[0025] In some specific embodiments, based on the prediction result, the driving route is optimized and the user is reminded, which includes determining whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the determination result, further including:

[0026] When the estimated time of arrival at the toll station is later than the cut-off time, obtaining a list of toll stations on the driving route;

[0027] Based on the toll station list, selecting the second to last toll station, and determining whether the estimated time of arrival at the second to last toll station is earlier than the cut-off time;

[0028] When there is a toll station earlier than the cut-off time, the reminder information is generated to suggest the user to exit the toll station earlier than the cut-off time in advance and re-enter the highway;

[0029] Add the toll station selected by the user as a waypoint and re-plan the route.

[0030] In some specific embodiments, generating the reminder information further includes:

[0031] Generates the name of the toll booth you recommend exiting, estimated time of arrival, suggestions for re-entering the highway, and toll savings;

[0032] In response to whether the user confirms to accept the reminder information;

[0033] If the user does not confirm immediately, the user is reminded again through sound or vibration;

[0034] When the user accepts the reminder information and agrees to change the route, the route is re-planned, the toll station that was exited in advance is included in the route, the optimal driving path is recalculated, and the user is guided to drive along the driving path.

[0035] Based on the same concept, the present invention also provides a system for optimizing driving routes based on a free highway policy, comprising:

[0036] A highway section information identification module is configured to identify, in response to a driving route set by a user, whether the driving route contains a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining the highway section information;

[0037] A policy time comparison module is configured to respond to the acquired current time and determine whether the current time is within the high-speed free policy period, including comparing the current time with a policy database;

[0038] A driving time prediction module is configured to predict the estimated time to reach the end of the route and each toll station based on the driving route and the highway section information, wherein the time prediction is performed for each section of the driving route and the time prediction is performed for the section required to travel to the toll station;

[0039] The driving route optimization module is configured to optimize the driving route and remind the user based on the prediction result, including judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result.

[0040] Based on the same concept, the present invention also provides an electronic device, comprising: a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other through the communication bus; a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of a method for optimizing a driving route based on a free highway policy.

[0041] Based on the same concept, the present invention also provides a computer-readable storage medium, which stores a computer program that can be executed by an electronic device. When the computer program runs on the electronic device, the electronic device executes the steps of a method for optimizing a driving route based on a free highway policy.

[0042] Based on the same concept, the present invention also provides a vehicle, which is provided with the optimized driving route system based on the free highway policy as described above.

[0043] Compared with the prior art, the beneficial effects are:

[0044] The present invention discloses a method, system, electronic device, storage medium and vehicle for optimizing driving routes based on a free highway policy. By obtaining the free highway policy for travel in the current area, the driver is reminded in advance to find a nearby toll station before the free highway time expires, and drive out of the highway, thereby reducing highway fee expenditure, enjoying the free highway policy to the greatest extent, improving people's sense of happiness, effectively reducing highway congestion, and reducing the occurrence of traffic accidents. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 It is a flowchart of a method for optimizing driving routes based on a free highway policy in some specific embodiments of the present invention;

[0046] Figure 2 It is a flow chart of some applications of a method for optimizing driving routes based on a free highway policy according to the present invention;

[0047] Figure 3 It is a schematic diagram of the structure of a system for optimizing driving routes based on a free highway policy in some specific embodiments of the present invention;

[0048] Figure 4 It is a schematic diagram of the structure of an electronic device in some specific embodiments of the present invention. DETAILED DESCRIPTION

[0049] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0050] The terms used in the embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to limit the present application. The singular forms "a", "said" and "the" used in the embodiments of the present application and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings, and "multiple" generally includes at least two.

[0051] It should be understood that the term "and / or" used in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0052] It should be understood that although the terms first, second, third, etc. may be used to describe in the embodiments of the present application, these descriptions should not be limited to these terms. These terms are only used to distinguish the descriptions. For example, without departing from the scope of the embodiments of the present application, the first may also be referred to as the second, and similarly, the second may also be referred to as the first.

[0053] As used herein, the words "if" and "if" may be interpreted as "at the time of" or "when" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrases "if it is determined" or "if (stated condition or event) is detected" may be interpreted as "when it is determined" or "in response to determining" or "when detecting (stated condition or event)" or "in response to detecting (stated condition or event)", depending on the context.

[0054] It should also be noted that the term "includes", "comprising" or any other variation thereof is intended to cover non-exclusive inclusion, so that a commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprising a ..." do not exclude the existence of other identical elements in the commodity or device including the elements.

[0055] It should be particularly noted that any symbols and / or numbers in the specification that are not marked in the accompanying drawings are not drawing marks.

[0056] Reference Figure 1 , a method for optimizing driving routes based on a free highway policy, comprising:

[0057] S101, in response to a driving route set by a user, identifying whether the driving route includes a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining information about the highway section;

[0058] It is understandable that the user inputs the starting point and end point information through the user interface of the navigation application. For example, the user sets a driving route from "city A city center" to "city B airport". Based on the starting point and end point input by the user, a preliminary driving route plan is generated. The preliminary planned driving route is analyzed section by section to identify the type of each road section. The road section types include but are not limited to urban roads, national roads, provincial roads, expressways, etc.

[0059] For example, there is a section in the driving route from the "City A East Ring Expressway Entrance" to the "City A and B Junction Toll Station". By matching information such as the section name, speed limit, and road characteristics, this section is identified as a highway type.

[0060] After all highway sections are identified, they are marked. The marking method can be to highlight the highway sections with different colors or icons on the route map, or to specifically note them in the navigation list. For each marked highway section, further detailed information is obtained. Including but not limited to:

[0061] Toll station location: including the name, location coordinates, etc. of the entrance toll station and exit toll station.

[0062] Highway numbers: such as GXX (national highway), SXX (provincial highway), etc.

[0063] Service area location: Provides information on service areas along the way to facilitate users to rest and resupply.

[0064] Real-time traffic conditions: By calling the real-time traffic data interface, you can obtain traffic information for the current and future period, including congestion, construction information, etc.

[0065] In some of the applications, in response to a driving route set by a user, an identification is made as to whether the driving route contains a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining highway section information; in response to the driving route set by the user, a preliminary route plan is generated, including the main roads passed through and the estimated driving distance; the route in the preliminary route plan is analyzed section by section, all highway sections are identified, and the starting point and end point of each highway section are marked, and the length of each highway section and the estimated driving time are calculated; information on each highway section is obtained, including the name of the toll station, the location coordinates, and whether it is an ETC channel.

[0066] It is understood that the initially planned driving route is analyzed section by section, and all highway sections are identified by comparing the road type information in the map data. For each identified highway section, its starting point and end point are marked, and its length and estimated driving time are calculated. For each marked highway section, its detailed information is further obtained, including the name of the toll station, location coordinates, and whether it is an ETC channel.

[0067] S102, in response to the acquired current time, determining whether the current time is within the high-speed free policy period, which includes comparing the current time with a policy database;

[0068] It is understandable that the current accurate time is obtained through the internal clock or network time service. For example, the current time is 9:00 a.m. on October 1, 2023. Maintain or regularly update the database containing free highway policy information. The database records the details of the free highway policy during various holidays and specific time periods, including the free start time, end time, and applicable highway sections. Compare the obtained current time with the free time period in the policy database. Traverse each policy record in the database and check whether the current time falls between the start time and end time of any free time period.

[0069] For example, there is a record in the policy database showing that the free high-speed policy period during the National Day in 2023 is from 00:00 on October 1, 2023 to 24:00 on October 7, 2023. Comparing the current time (9:00 a.m. on October 1, 2023) with this period, it can be seen that the current time is within the free period.

[0070] According to the comparison result, the judgment result of whether the current time is within the free highway policy period is output. If the current time is within the free period, the user can be further prompted to enjoy the free highway policy; if not, the driving route and fee information are displayed normally.

[0071] In some of the applications, in response to the current time obtained, it is determined whether the current time is within the free highway policy period, including comparing the current time with the policy database to obtain the current time, including obtaining the exact value of the current time; querying the free highway policy based on the policy database, the policy database includes the current free highway policy time period information; comparing the current time with the free highway policy time period information to determine whether the current time is within the free period, and when there are multiple free periods, comparing them one by one to determine the free period to which the current time belongs.

[0072] It is understandable that the precise value of the current time, including all time information such as year, month, day, hour, minute, and second, is obtained through a reliable time source such as an internal high-precision clock or a network time protocol (NTP) server. For example, the precise value of the current time is 14:30:05 on October 5, 2023. Access and query the policy database maintained on a local or remote server. The database contains information on the high-speed free policy time period in the current and future period, and each record includes at least the free policy name, start time, end time and other fields.

[0073] For example, the database contains the following records:

[0074] Policy name: Free expressways during National Day;

[0075] Start time: 00:00:00, October 1, 2023;

[0076] End time: October 7, 2023 23:59:59;

[0077] Compare the current time with the free high-speed policy time period information. If the current time falls between the start time and end time of a certain policy, it is determined that the current time is within the free period of the policy and the corresponding prompt information is output. If the current time does not fall within the free period of any policy, the prompt information of the non-free period is output. When there are multiple free periods in the policy database, each period is compared one by one. If the current time falls within multiple free periods at the same time, the final free period information can be further determined and output based on user preferences or policy settings (such as giving priority to the longest free period, the free period closest to the current time, etc.).

[0078] S103, based on the driving route and in combination with the highway section information, predicting the estimated time to reach the route end and each toll station, wherein the time prediction is performed for each section in the driving route, and the time prediction is performed for the section required to travel to the toll station;

[0079] It is understandable that, based on the starting point and end point set by the user, a preliminary driving route plan is generated, and the expressway sections in the route are identified. For each expressway section, detailed information is obtained, including length, expected driving speed (which can be adjusted according to historical data or real-time traffic conditions), toll station location, and whether it is an ETC channel.

[0080] For example, the driving route: from "City A Railway Station" to "City B Scenic Area", via "City A Ring Expressway".

[0081] Expressway section information: The length of the "City A Ring Expressway" is 50 kilometers, with an estimated driving speed of 100 kilometers per hour. There are two toll stations, namely the "entrance toll station" and the "exit toll station".

[0082] The estimated travel time for each freeway segment is calculated based on the length of the freeway segment and the estimated travel speed. For non-freeway segments, the average speed of urban roads or a user-defined speed can be used for estimation.

[0083] For example, the estimated travel time of "City A Ring Expressway" = 50 km / 100 km / hour = 0.5 hour (ie 30 minutes).

[0084] For each toll station on the expressway, the estimated travel time is fine-tuned based on whether it is an ETC channel and the average passing time of a non-ETC channel (such as queuing time, payment time, etc.).

[0085] For example, if both the "entrance toll station" and the "exit toll station" are ETC channels, the passing time can be ignored; if they are non-ETC channels, an additional 2 minutes of passing time will be required for each toll station.

[0086] The estimated travel time for each section is accumulated to get the total estimated time to reach the end of the route. At the same time, the specific estimated time to pass is also calculated for each toll station passed on the route.

[0087] For example, if there is only one expressway section, "City A Ring Expressway", in the driving route, and both toll stations are ETC channels, then the total estimated time to reach "City B Scenic Area" = the estimated driving time of "City A Ring Expressway" = 30 minutes.

[0088] If non-ETC channels are taken into account and each toll station adds 2 minutes to the passing time, the total estimated time needs to be increased accordingly.

[0089] The total estimated time to reach the end of the route and the estimated time to pass through each toll station are displayed to the user in an intuitive manner (such as graphical interface display, voice broadcast, etc.).

[0090] In some of these applications, based on the driving route and in combination with the highway section information, the estimated time to reach the end of the route and each toll station is predicted, and real-time traffic information, including congestion and construction information, is obtained; based on the traffic information, in combination with the vehicle speed and traffic rules, the driving time to the end of the route is predicted, and a time prediction is made for each section of the driving route; based on each toll station in the driving route, a time prediction is made based on the location of the toll station, the road conditions, and the sections required to reach the toll station, and the estimated time to arrive at each toll station is calculated; the estimated time of arrival at the last toll station in each toll station is compared with the end time of the highway free policy period to determine whether the user has enough time to pass through the toll station.

[0091] It is understandable that road condition data including congestion and construction information can be obtained in real time.

[0092] For example, real-time traffic information shows that "Section K of the expressway from City A to City B" is currently in a congested state, and the congestion is expected to last for 1 hour. At the same time, "Section M of the expressway near City C" is undergoing road construction, and the construction is expected to continue until the early morning of the next day.

[0093] Based on real-time traffic information, combined with the speed and traffic rules set by the user (such as speed limit, waiting time for traffic lights, etc.), a dynamic path planning algorithm is used to predict the total driving time to the end of the route. At the same time, time prediction is performed for each section of the route to provide more detailed time distribution information. Identify each toll station in the route, and calculate the estimated time to reach each toll station based on the location of the toll station, the current road conditions, and the information of the section required to reach the toll station. Compare the arrival time of the last toll station with the deadline of the free highway policy. If the estimated arrival time is earlier than or equal to the deadline of the policy, the user is prompted that there is enough time to pass the toll station and enjoy the free policy. If the estimated arrival time is later than the deadline of the policy, a warning is issued to remind the user that the free policy may not be enjoyed, and it is recommended to adjust the travel plan or choose another route.

[0094] S104, based on the prediction result, optimizing the driving route and reminding the user, including judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result.

[0095] It is understandable that the prediction results are analyzed, including the total driving time to the end of the route, the estimated passing time of each road section and toll station, etc. At the same time, the currently valid free highway policy information is queried. According to the prediction results and policy information, based on the comparison of the estimated passing time of the last toll station and the policy deadline, it is judged whether the user is likely to miss the free highway policy period when driving along the currently planned route. If the estimated passing time is earlier than or equal to the policy deadline, it is judged that the user will not miss the policy. If the estimated passing time is later than the policy deadline, it is judged that the user may miss the policy.

[0096] For users who may miss the free expressway policy, route optimization is initiated, taking into account factors such as road conditions, distance, time, etc., to ensure that users can pass the last toll station within the validity period of the policy. Based on the optimization results or judgment results, corresponding reminder information is generated, including:

[0097] A clear reminder of whether the user may miss the free highway policy on their current route.

[0098] If a route optimization has been performed, provide details of the new route and the estimated time to pass through each toll booth.

[0099] If you cannot ensure that you can enjoy the free policy, give suggestions on adjusting travel time or choosing other travel methods.

[0100] For example, if the free highway policy ends at 8 p.m., it is predicted that the user will reach the last toll station at 8:15 p.m. if they follow the current route. At this point, it is determined that the user may miss the policy, and route optimization is initiated to plan a new route for the user, which is expected to arrive at the last toll station at 7:50 p.m. A reminder message is then generated: "The driving route has been optimized for you, and it is expected to arrive at the last toll station at 7:50 p.m. to ensure that you can enjoy the free highway policy."

[0101] In some of the applications, the driving route is optimized and the user is reminded based on the prediction results, including determining whether the user is likely to miss the free highway policy, and dynamically planning the driving route based on the determination results and generating corresponding reminder information. When the estimated time of arrival at the toll station is later than the cut-off time, a list of toll stations on the driving route is obtained; based on the toll station list, the second-to-last toll station is selected, and it is determined whether the estimated time of arrival at the second-to-last toll station is earlier than the cut-off time. When there is a toll station earlier than the cut-off time, a reminder message is generated, suggesting that the user exit in advance at the toll station earlier than the cut-off time and re-enter the highway; the toll station selected by the user is added as a waypoint, and the route is replanned.

[0102] It is understandable that the list of toll stations on the current driving route is obtained and sorted according to the distance from the end point. Then, the second to last toll station in the list is selected as the alternative point. Based on the current road conditions, vehicle speed and other information, the estimated time for the user to arrive at the second to last toll station is predicted. If the estimated time is earlier than the deadline of the highway toll-free policy, it indicates that there is room for optimization.

[0103] Generate a reminder message, suggesting that the user exit the highway in advance at a toll station earlier than the cut-off time (i.e., the second-to-last toll station), and re-enter the highway nearby to ensure that the subsequent trip can enjoy the free highway policy. Provide a user interaction interface to allow the user to confirm whether to accept the above suggestion. If the user chooses to accept, the toll station selected by the user (i.e., the second-to-last toll station) is added as a waypoint, and the driving route is replanned based on the new waypoint.

[0104] In some of these applications, reminder information is generated, including the name of the toll station recommended to exit, the estimated arrival time, suggestions for re-entering the highway, and the toll savings; the reminder information is responded to whether the user confirms to accept the reminder information; when the user does not confirm immediately, the reminder is given again through sound or vibration; when the user accepts the reminder information and agrees to change the route, the route is re-planned to include the toll station exited in advance, and the optimal driving route is recalculated to guide the user to follow the driving route.

[0105] It is understandable that when it is predicted that a user may miss the deadline for the free high-speed policy, a reminder message containing the following content is generated:

[0106] Recommended exit toll station name: Clearly inform users which toll station they should exit in advance.

[0107] Estimated time of arrival: Predict the specific time when the user will arrive at the toll booth.

[0108] Advice on Re-entering the Highway: Provides brief instructions on how to re-enter the highway, such as the nearest entrance location, directions, etc.

[0109] Cost savings: Estimate the cost that can be saved by exiting and re-entering the highway earlier to increase the user's motivation to accept the suggestion.

[0110] Wait for user confirmation. If the user does not confirm immediately, remind them again in the following ways:

[0111] Sound reminder: Play a preset reminder tone or voice broadcast reminder information.

[0112] Vibration reminder: The navigation device vibrates slightly to attract the user's attention.

[0113] User accepts and agrees to the route change: The user confirms acceptance of the reminder information and agrees to the route change through the touch screen of the navigation device or voice command.

[0114] Re-route: Based on the user's choice, the toll stations that were exited in advance will be included in the new driving route, and the optimal driving path will be recalculated.

[0115] Guide users: Use voice navigation and map information on the display to guide users to follow a new route. During driving, road conditions are updated in real time to ensure that users can understand the situation ahead and make corresponding adjustments.

[0116] Combine the following Figure 2 The following describes some examples of the method for optimizing driving routes based on the free highway policy of the present invention in some applications:

[0117] like Figure 2 As shown, in this embodiment,

[0118] Step 1: Check whether the current vehicle navigation planning route will pass through the expressway. If so, proceed to the next step, otherwise do not process;

[0119] Step 2: Check whether the current time is within the holiday free highway policy period. If yes, proceed to the next step, otherwise no processing;

[0120] Step 3: Check whether the estimated arrival time of the current navigation route to the destination (under the premise of constant vehicle speed and no speeding) is before the deadline of the free highway policy. If yes, do not process it, otherwise proceed to the next step;

[0121] Step 4: Determine whether the estimated time for the current vehicle to exit the last expressway toll station on the planned route is before the expiration date of the toll-free policy. If yes, do not process it, otherwise proceed to the next step.

[0122] Step 5: Get the list of toll booths passed on the current route;

[0123] Step 6: Check whether the time to reach the second to last toll station is before the deadline. If yes, proceed to the next step, otherwise, loop through step 6;

[0124] Step 7: Remind users to exit the highway in advance at the toll station and then re-enter the highway at the same toll station to avoid users speeding towards the toll station; improve driving safety and reduce people's extra highway toll expenses;

[0125] Step 8: If the driver accepts and agrees to the reminder, the toll station will be added as a waypoint and the route will be replanned.

[0126] If the vehicle is in motion and a route is planned, if the current route passes through a highway section and is within the free highway policy period; determine whether the estimated time of arrival at the destination is before the free highway deadline; then determine whether the time of passing the last toll station is before the deadline; otherwise, remind the driver to exit the highway at the previous toll station and then re-enter the highway.

[0127] Furthermore, in this embodiment, the time period related to the free highway policy is obtained and the data is sorted.

[0128] Get the current system time System.currentTimeM illis() to determine whether the current time is within the free high-speed time period.

[0129] Get the time for the current route to arrive at the end point RouteETAUt i l.getScheduledTime((nav i Info.vi aRema i n.get(0).time)) to check whether it is before the deadline of the free highway policy.

[0130] Get whether the time of the last expressway toll station on the current route is before the cut-off time;

[0131] Get the list of highway service areas on the route, areaInfoList?.serviceAreaList, and loop to get the time to reach the Nth toll station from the end (N starts from 1). If the arrival time is before the deadline, remind the user to exit the highway at the toll station and add it as a waypoint to recalculate the route.

[0132] This embodiment is based on the time of the free highway policy, is time-effective, has no spatial and administrative area restrictions, and can be used in all highway scenarios; it can effectively reduce the occurrence of highway exit congestion during holidays.

[0133] For the method steps disclosed in the above embodiments, the method steps are described as a series of action combinations for the purpose of simple description, but those skilled in the art should know that the embodiments of the present invention are not limited by the order of the actions described, because according to the embodiments of the present invention, some steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present invention.

[0134] like Figure 3 As shown, the present invention also provides a system for optimizing driving routes based on a free highway policy, comprising:

[0135] The highway section information identification module 201 is configured to identify whether the driving route includes a highway section in response to a driving route set by a user, including identifying the type of each section in the driving route, marking the highway section, and obtaining the highway section information;

[0136] The policy time comparison module 202 is configured to respond to the acquired current time and determine whether the current time is within the high-speed free policy period, including comparing the current time with the policy database;

[0137] The driving time prediction module 203 is configured to predict the estimated time to reach the end of the route and each toll station based on the driving route and the highway section information, wherein the time prediction is performed for each section of the driving route and the time prediction is performed for the section required to travel to the toll station;

[0138] The driving route optimization module 204 is configured to optimize the driving route and remind the user based on the prediction result, including determining whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information based on the determination result.

[0139] It is worth noting that although only some basic functional modules are disclosed in the embodiments of the present invention, it does not mean that the composition of the present system is limited to the above basic functional modules. On the contrary, what the present embodiment wants to express is that on the basis of the above basic functional modules, those skilled in the art can arbitrarily add one or more functional modules in combination with the prior art to form an infinite number of embodiments or technical solutions. In other words, the present system is open rather than closed. Just because the present embodiment only discloses individual basic functional modules, it cannot be considered that the protection scope of the claims of the present invention is limited to the disclosed basic functional modules. At the same time, for the convenience of description, the above devices are described in terms of functions and are described separately in various units and modules. Of course, when implementing the present invention, the functions of each unit and module can be implemented in the same or one or more software and / or hardware.

[0140] like Figure 4 As shown, the present invention also provides an electronic device, including: a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other through the communication bus; a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of a method for optimizing a driving route based on a free highway policy.

[0141] Figure 4 Schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. Figure 4 The electronic device provided in the embodiment of the present invention includes: one or more processors 710 and a storage device 720; the processor 710 in the electronic device may be one or more, Figure 4 A processor 710 is taken as an example; the storage device 720 is used to store one or more programs; the one or more programs are executed by the one or more processors 710, so that the one or more processors 710 implement the method for optimizing driving routes based on the free highway policy as described in any one of the embodiments of the present invention.

[0142] The electronic device may further include: an input device 730 and an output device 740 .

[0143] The processor 710, storage device 720, input device 730 and output device 740 in the electronic device can be connected via a bus or other means. Figure 4 The example of connecting through bus is taken in the following.

[0144] The storage device 720 in the electronic device is a computer-readable storage medium that can be used to store one or more programs, which can be software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the method for optimizing driving routes based on the free highway policy provided in the embodiment of the present invention. The processor 710 executes various functional applications and data processing of the electronic device by running the software programs, instructions, and modules stored in the storage device 720, that is, the method for optimizing driving routes based on the free highway policy in the above method embodiment is implemented.

[0145] The storage device 720 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the electronic device, etc. In addition, the storage device 720 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 720 may further include a memory remotely arranged relative to the processor 710, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0146] The input device 730 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the electronic device. The output device 740 may include a display device such as a display screen.

[0147] The present invention also provides a computer-readable storage medium storing a computer program executable by an electronic device. When the computer program runs on the electronic device, the electronic device executes the steps of a method for optimizing a driving route based on a free highway policy.

[0148] Specifically, the computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present embodiment, the computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0149] The present invention also provides a vehicle provided with the above-mentioned optimized driving route system based on the free highway policy.

[0150] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for optimizing driving routes based on a free highway policy, characterized in that: include: In response to a driving route set by a user, identifying whether the driving route includes a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining information about the highway section; In response to the acquired current time, determining whether the current time is within a high-speed free policy period, including comparing the current time with a policy database; Based on the driving route and in combination with the highway section information, predict the estimated time to reach the route end and each toll station, wherein the time prediction is made for each section in the driving route, and the time prediction is made for the section required to travel to the toll station; Based on the prediction result, the driving route is optimized and the user is reminded, which includes judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result.

2. The method for optimizing driving routes based on the free highway policy according to claim 1 is characterized in that: In response to a driving route set by a user, identifying whether the driving route includes a highway section, wherein the method includes identifying the type of each section in the driving route, marking the highway section, and obtaining the highway section information, further comprising: In response to the driving route set by the user, generating a preliminary route plan, including major roads and an estimated driving distance; Analyze the route in the preliminary route planning section by section, identify all expressway sections, mark the starting point and end point of each expressway section, and calculate the length of each expressway section and the estimated travel time; Obtain information about each expressway section, including the name of the toll station, location coordinates, and whether it is an ETC channel.

3. The method for optimizing driving routes based on the free highway policy according to claim 1 is characterized in that: In response to the acquired current time, determining whether the current time is within the high-speed free policy period, wherein the current time is compared with a policy database, further comprising: Obtaining the current time, including obtaining the exact value of the current time; Based on the policy database, query the free highway policy, wherein the policy database includes current free highway policy time period information; The current time is compared with the free highway policy time period information to determine whether the current time is within the free time period. When there are multiple free time periods, the free time period to which the current time belongs is determined by comparing them one by one.

4. The method for optimizing driving routes based on the free highway policy according to claim 1 is characterized in that: Based on the driving route and in combination with the highway section information, predicting the estimated time to reach the end of the route and each toll station further includes: Get real-time traffic information, including congestion and construction information; Based on the road condition information, combined with vehicle speed and traffic rules, predict the travel time to reach the end of the route, and simultaneously perform time prediction for each section of the travel route; Based on each toll station in the driving route, a time prediction is performed according to the location of the toll station, the road condition and the road section required to travel to the toll station, and the estimated time to arrive at each toll station is calculated; The estimated arrival time at the last toll station among the toll stations is compared with the end time of the free highway policy period to determine whether the user has enough time to pass through the toll station.

5. The method for optimizing driving routes based on the free highway policy according to claim 4 is characterized in that: Based on the prediction result, the driving route is optimized and the user is reminded, which includes judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result, further including: When the estimated time of arrival at the toll station is later than the cut-off time, obtaining a list of toll stations on the driving route; Based on the toll station list, selecting the second to last toll station, and determining whether the estimated time of arriving at the second to last toll station is earlier than the cut-off time; When there is a toll station earlier than the cut-off time, the reminder information is generated to suggest the user to exit the toll station earlier than the cut-off time in advance and re-enter the highway; Add the toll station selected by the user as a waypoint and re-plan the route.

6. The method for optimizing driving routes based on the free highway policy according to claim 5 is characterized in that: Generating the reminder information further includes: Generates the name of the toll booth you recommend exiting, estimated time of arrival, suggestions for re-entering the highway, and toll savings; In response to whether the user confirms to accept the reminder information; If the user does not confirm immediately, the user is reminded again through sound or vibration; When the user accepts the reminder information and agrees to change the route, the route is re-planned, the toll station that was exited in advance is included in the route, the optimal driving path is recalculated, and the user is guided to drive along the driving path.

7. A system for optimizing driving routes based on a free highway policy, characterized in that: include: A highway section information identification module is configured to identify, in response to a driving route set by a user, whether the driving route contains a highway section, including identifying the type of each section in the driving route, marking the highway section, and obtaining the highway section information; A policy time comparison module is configured to respond to the acquired current time and determine whether the current time is within the high-speed free policy period, including comparing the current time with a policy database; A driving time prediction module is configured to predict the estimated time to reach the end of the route and each toll station based on the driving route and the highway section information, wherein the time prediction is performed for each section of the driving route and the time prediction is performed for the section required to travel to the toll station; The driving route optimization module is configured to optimize the driving route and remind the user based on the prediction result, including judging whether the user is likely to miss the free highway policy, and dynamically planning the driving route and generating corresponding reminder information according to the judgment result.

8. An electronic device, characterized in that: include: A processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the method described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: It stores a computer program executable by an electronic device, and when the computer program runs on the electronic device, the electronic device executes the steps of the method described in any one of claims 1 to 6.

10. A vehicle, characterized in that: The vehicle is provided with an optimized driving route system based on a free highway policy as described in claim 7.

Images