CN112146670A - Driving path planning method, system, computer equipment and storage medium - Google Patents
Driving path planning method, system, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112146670A CN112146670A CN201910567575.4A CN201910567575A CN112146670A CN 112146670 A CN112146670 A CN 112146670A CN 201910567575 A CN201910567575 A CN 201910567575A CN 112146670 A CN112146670 A CN 112146670A
- Authority
- CN
- China
- Prior art keywords
- alternative
- destination
- parking place
- user
- driving path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The application provides a driving path planning method, a system, a computer device and a storage medium, wherein the method comprises the following steps: searching for alternative parking places according to the destination, planning alternative driving paths according to the alternative parking places, acquiring the total time required by the user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place, planning a target driving path through the target parking place, the method considers the driving time of the vehicle and the traveling time of the user in the process that the user travels from the current position to the destination, to obtain the total length of time required for the user to reach the destination from the current location through each of the alternative parking spots, and determining a target parking place according to the priorities of all the total time lengths so as to plan a target driving path, thereby improving the convenience of the driving path recommended by the navigation equipment.
Description
Technical Field
The present application relates to the field of navigation technologies, and in particular, to a method, a system, a computer device, and a storage medium for planning a driving route.
Background
With the rapid development of global positioning systems, geographic information systems, electronic technologies, and computer technologies, navigation devices provide more discreet services for users in the aspect of travel. The user searches for the destination to go to in the navigation equipment, and the navigation equipment can plan the driving path according to the destination and the current position of the user, so that the user can go out conveniently.
In the prior art, after a driving path is planned by a navigation device, a user can select a parking place near a destination according to the planned driving path. However, in the driving path planned by the conventional technology, the time cost caused by traffic jam during driving and the problem of the road condition on foot after the user gets off the vehicle is not considered, so that the convenience of the driving path recommended by the navigation device is reduced.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a driving path planning method, system, computer device and storage medium.
The embodiment of the application provides a driving path planning method, which comprises the following steps:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
In one embodiment, the searching for the alternative parking place according to the destination and planning the alternative driving path according to the alternative parking place includes:
searching the alternative parking places in a preset distance range around the destination according to the destination;
according to each alternative parking place, planning the alternative driving path from the current position to each alternative parking place of the vehicle;
and optionally, the destinations include a first destination and a second destination; the searching for the alternative parking place according to the destination and planning the alternative driving path according to the alternative parking place comprises:
searching a first alternative parking place according to the first destination, and planning a first alternative driving path from the current position to the first alternative parking place according to the first alternative parking place;
and searching a second alternative parking place according to the second destination, and planning a second alternative driving path from the current position to the second alternative parking place according to the second alternative parking place.
In one embodiment, the obtaining of the driving time length of the vehicle reaching each parking candidate comprises:
acquiring road condition information of the vehicle from the current position to each alternative parking place;
and acquiring a first time length required by the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information.
In one embodiment, the obtaining a first time length required for the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information includes:
receiving the road condition information of a congested road section and a normal road section in the alternative driving path;
acquiring the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section according to the road condition information;
and obtaining the first time length according to the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section.
In one embodiment, obtaining the travel time required for the user to reach the destination from the alternative parking place comprises:
acquiring a traveling mode and a traveling path of the user from each alternative parking place to the destination;
acquiring the travel duration required by the user to reach the destination from each alternative parking place according to the travel mode and the travel path corresponding to the travel mode;
and optionally, the user's travel patterns from each alternative parking location to the destination include any one or more of walking, riding in public transportation, and riding.
In one embodiment, the obtaining, according to the travel mode and the travel path corresponding to the travel mode, a travel time length required for the user to reach the destination from each candidate parking place includes:
receiving information of road sections without street facilities and road sections with street facilities in the process of reaching the destination along the travel path;
acquiring the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility according to the travelling mode;
obtaining the travel time length according to the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility;
and optionally, the section with street facilities comprises any one or more of a pedestrian tunnel, a zebra crossing and a street overpass.
In one embodiment, the obtaining, according to each alternative parking place and the corresponding alternative driving path, a total time length required for the user to reach the destination from the current position through each alternative parking place includes:
acquiring a first destination time length required by the user to reach the first destination from the current position through each first alternative driving path;
acquiring a second destination time length required by the user to reach the second destination from the first destination through each second alternative driving path;
and acquiring the sum of the first target duration and the second target duration to obtain the total duration.
In one embodiment, the determining a target parking place according to the priority of the total time length corresponding to the user passing through each alternative parking place to reach the destination includes:
sequencing the size of each total time length corresponding to the user arriving at the destination through each alternative parking place;
and determining the alternative parking place corresponding to the total time length smaller than the preset threshold value in all the total time lengths as the target parking place.
In one embodiment, the planning of the target driving path through the target parking place includes: and planning the target driving path according to the current position of the vehicle and the target parking place.
The embodiment of the application provides a driving path planning system, the driving path planning system includes:
the search module is used for searching alternative parking places according to the destination and planning alternative driving paths according to the alternative parking places;
the acquisition module is used for acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length for the vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
the determining module is used for determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and the path planning module is used for planning a target driving path through the target parking place.
The embodiment of the application provides a computer device, which comprises a memory and a processor, wherein a computer program capable of running on the processor is stored in the memory, and the processor executes the computer program to realize the following steps:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
An embodiment of the present application provides a storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program implements the following steps:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
According to the driving path planning method, the driving path planning system, the computer equipment and the storage medium, the driving path planning system comprehensively considers the driving time length of the vehicle and the traveling time length of the user in the process that the user arrives at the destination from the current position through the alternative parking places, obtains the total time length required by the user to arrive at the destination from the current position through each alternative parking place according to the driving time length of the vehicle and the traveling time length of the user, determines the target parking place according to the priority of all the total time lengths, and plans the optimal target driving path through the target parking place, so that the convenience of the driving path recommended by the navigation equipment is improved.
Drawings
FIG. 1 is a schematic view of an application scenario of a driving path planning system;
fig. 2 is a schematic flow chart of a driving path planning method according to an embodiment;
fig. 3 is a schematic flow chart of a driving path planning method according to another embodiment;
fig. 4 is a schematic structural diagram of a driving path planning system according to an embodiment;
fig. 5 is a schematic structural diagram of a driving path planning system according to another embodiment;
FIG. 6 is an internal block diagram of a computer device, provided in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The driving path planning method provided by the embodiment can be applied to the driving path planning system shown in fig. 1, and the driving path planning system is used for planning an optimal driving path for a user. As shown in fig. 1, the driving path planning system may include a driving path planning system server and a vehicle. The driving path planning system server CAN receive the current position information of the vehicle and the position information of each alternative parking place, which are acquired by a global navigation satellite positioning system, through a Controller Area Network (CAN) bus, and send the position information to the vehicle. In addition, the driving path planning system server can also acquire the current position information of the vehicle and the position information of each alternative parking place through the computer equipment and send the position information to the vehicle to be driven. The driving path planning system server and the vehicle can communicate through wireless connection. Optionally, the wireless connection mode may be Wi-Fi, mobile network or bluetooth connection. Alternatively, the vehicle may include a fuel automobile, a hybrid automobile, and the like. The driving path planning system provided in the vehicle executes the driving path planning method provided in this embodiment, and a processing procedure of the driving path planning system will be specifically described in the following embodiments.
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application are further described in detail by the following embodiments in combination with the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the invention.
Fig. 2 is a schematic flow chart of a driving path planning method provided in an embodiment, which relates to a process of how to plan an optimal target driving path. As shown in fig. 2, the method includes:
s101, searching for an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place.
Specifically, the driving path planning system may receive a destination input by the user, search for an alternative parking place around the destination, and plan an alternative driving path according to the alternative parking place. Alternatively, the destination may be represented by a name of the destination, or may be represented by an identification number corresponding to the destination. Optionally, the destination may be input to the driving path planning system in a form of voice input or a form of text input. The driving path planning system can display 2-4 alternative parking places selected by a user in a navigation map, the names of the alternative parking places can be displayed in the navigation map, and identification numbers corresponding to the alternative parking places can also be displayed.
The parking place may be a parking lot, a parking building, a roadside parking space, or the like. Wherein the alternative parking places around the destination may include a parking place opposite to the destination road. Alternatively, the destination may be any location to which the user is going, such as a hospital, a restaurant, a library, a tourist attraction, the user's home and company, etc.
Optionally, the destinations include a first destination and a second destination.
In this embodiment, the destination to which the user is going to go may be one location or may be two locations. If the destination to which the user is going is a position, the driving path planning system can acquire a destination input by the user; if the destination to which the user is going to go is two positions, the driving path planning system can acquire two destinations input by the user, wherein the user needs to input the two destinations according to the sequence of going to the two destinations. If the user goes to the first destination and then goes to the second destination, the user can input the first destination to the driving path planning system first and then input the second destination to the driving path planning system, wherein the first destination can be a restaurant, a library, a tourist attraction and the like, and the second destination can be a home, a company and the like of the user.
Optionally, the searching for the alternative parking place according to the destination and planning the alternative driving path according to the alternative parking place includes: searching a first alternative parking place according to the first destination, and planning a first alternative driving path from the current position to the first alternative parking place according to the first alternative parking place; and searching a second alternative parking place according to the second destination, and planning a second alternative driving path from the current position to the second alternative parking place according to the second alternative parking place.
Optionally, the step of searching for an alternative parking place according to the destination and planning an alternative driving path according to the alternative parking place in S101 includes:
s1011, searching the alternative parking place in the preset distance range around the destination according to the destination.
Further, the driving path planning system can search for alternative parking places in a preset distance range around the destination in the navigation map according to the obtained destination. If the user needs to go to a destination, the driving path planning system can search for alternative parking places in a preset distance range around the destination in the navigation map; if the user needs to go to two destinations, the destinations can be represented as a first destination and a second destination according to the sequence of going to the destinations, and the driving path planning system can search a first alternative parking place in a preset distance range around the first destination in the navigation map and then search a second alternative parking place in a preset distance range around the second destination. Optionally, the preset distance may be equal to 1 kilometer, that is, the driving path planning system may search for a candidate parking place within a circumferential range with the destination as a center and a radius of 1 kilometer. The driving path planning system can search a plurality of alternative parking places within a preset distance range around the destination.
S1012, according to each alternative parking place, planning the alternative driving path from the current position to each alternative parking place.
It can be understood that the driving path planning system may respectively search the first parking candidate and the second parking candidate according to two destinations input by the user, and plan a first candidate driving path corresponding to the vehicle driving from the current position to each first parking candidate and a second candidate driving path corresponding to the vehicle driving from the current position to each second parking candidate according to each first parking candidate and each second parking candidate.
S102, acquiring the total time length required by the user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length for the vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place.
Specifically, the driving path planning system may calculate the sum of the driving time required for the vehicle of the user to reach each of the parking candidates from the current position and the traveling time required for the user to reach the destination from each of the parking candidates, that is, the total time T required for the user to reach the destination from the current position via each of the parking candidatessum. In this embodiment, if the user needs to go to a destination, the total duration TsumCan be equal to the driving time T required by the vehicle to respectively drive to each searched alternative parking place from the current positiondriCorresponding to the travel time period T required for the user to reach the destination from the corresponding parking place candidatestpSum, wherein the total duration T obtained by the driving path planning systemsumThe number of the candidate parking spots may be equal to the number of the searched candidate parking spots.
In addition, if the user is going to go to two destinations, which may be expressed as a first destination and a second destination in the order of going to the destinations, the total duration TsumMay be equal to a first driving time period T required for the vehicle to travel from the current position to the searched first candidate parking spot, respectivelydri1The second driving time length T required for the vehicle to respectively drive from the first alternative parking place to the searched second alternative parking placedri2The user arrives at the first destination from the corresponding first parking candidate for a first travel time period Tstp1The user arrives from the first destination to the second travel time period T corresponding to the first alternative parking placestp2A third travel time period T corresponding to the user arriving at the second destination from the corresponding second parking candidatestp3And (4) summing. For example, if the number of the first candidate parking places searched by the driving path planning system is N and the number of the second candidate parking places searched by the driving path planning system is M, the driving path is determinedPlanning the total duration T acquired by the systemsumThe number of (d) may be equal to N x M.
In the present embodiment, the driving time period T required for the vehicle to travel from the current position to the different parking spaces in the different parking candidate placesdriMay be different and the travel time T required for the user to reach the destination from different parking spaces in different alternative parking placesstpOr different from each other, so that the corresponding total duration T obtained by the driving path planning system is based on different parking spaces in different alternative parking placessumOr may be different.
S103, determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place.
Specifically, the total time length T required for the user to reach the destination from the current position through each of the alternative parking placessumThe driving path planning system can be used for planning the total time length T corresponding to all the alternative parking placessumThe target parking place is determined according to the size relation of the parking lot.
Further, the total time length T required for the user to pass through different parking spaces in each alternative parking place from the current position and then reach the destinationsumThe sizes of the time intervals can be different, and the driving path planning system can also be used for planning the driving paths according to all the total time lengths TsumThe target parking space in the target parking place is determined.
Optionally, the step of obtaining the total time required for the user to reach the destination from the current position through each candidate parking place according to each candidate parking place and the corresponding candidate driving path in S102 includes: acquiring a first destination time length required by the user to reach the first destination from the current position through each first alternative driving path; acquiring a second destination time length required by the user to reach the second destination from the first destination through each second alternative driving path; and acquiring the sum of the first target duration and the second target duration to obtain the total duration.
Specifically, the driving path planning system may obtain, according to each first candidate parking place and the corresponding first candidate driving path, and each second candidate parking place and the corresponding second candidate driving path, a first destination time length required for the user to reach the first destination from the current position through each first candidate parking place, and a second destination time length required for the user to reach the second destination from the first destination through each second candidate parking place, and calculate a sum of the first destination time length and the second destination time length, so as to obtain a total time length required for the user to reach the second destination from the current position through each candidate parking place.
If the user is going to go to two destinations, namely a first destination and a second destination, the driving path planning system can search a first candidate parking place around the first destination and a second candidate parking place around the second destination, and the total time length of the user from the current position to the second destination after passing through each first candidate parking place and each second candidate parking place can be equal to the sum of the first destination time length required by the user from the current position to the first destination after passing through each first candidate parking place and the second destination time length required by the user from the first destination to the second destination after returning to each second candidate parking place.
And S104, planning a target driving path through the target parking place.
In this embodiment, the driving path planning system may also plan the target driving path through the target parking space in the target parking place.
According to the driving path planning method provided by the embodiment, the driving path planning system can comprehensively consider the driving time of the vehicle and the traveling time of the user in the process that the user travels from the current position to the destination through each alternative parking place, obtain the total time required by the user to reach the destination through each alternative parking place from the current position, determine the target parking place according to the priority of all the total time, plan the optimal target driving path through the target parking place, further improve the convenience of the driving path recommended by the navigation equipment, and improve the use experience of the driving path planning system for the user; in addition, the user can drive to the destination according to the optimal target driving path, and the traveling efficiency of the user can be improved.
In the method for planning a driving route according to another embodiment, the obtaining the driving time length of the vehicle reaching each of the candidate parking spots in S102 includes:
and S1021, acquiring road condition information of the vehicle from the current position to each alternative parking place.
It should be noted that, if the destination to which the user is going is a location, the driving path planning system may obtain the traffic information of the vehicle from the current location to each of the alternative parking places; if the destination to which the user is going to is two positions, the destination can be represented as a first destination and a second destination according to the sequence of the destination, the driving path planning system can search a first alternative parking place around the first destination in the navigation map and can also search a second alternative parking place around the second destination, and the driving path planning system can acquire the road condition information of the vehicle reaching each first alternative parking place from the current position and the road condition information of the vehicle reaching the second alternative parking place from the first alternative parking place. The road condition information may include a waiting time required by a user due to a road congestion condition, a specific congestion position, a waiting time required by a user on a congestion-free road section, and the like when the vehicle is about to run. Optionally, the vehicle arrives at different alternative parking places from the current position, and the corresponding road condition information may be different.
And S1022, acquiring a first time length required for the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information.
Specifically, the traffic information corresponding to different alternative driving paths may be different. Optionally, the driving path planning system may obtain a driving time required for the vehicle to pass through each alternative driving path, and obtain a first time required for the vehicle to reach each alternative parking place from the current position according to the driving time required for the vehicle to pass through each alternative driving path and the road condition information.
Optionally, the step of obtaining the first time length required for the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information in the step S1022 may be implemented by the following steps:
and S1022a, receiving the road condition information of the congested road segment and the normal road segment in the alternative driving path.
It should be noted that the driving path planning system may receive the road condition information of the congested road segment and the normal road segment in each alternative driving path fed back by the network. Wherein normal road segments may be characterized as congestion free road segments.
S1022b, acquiring the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section according to the road condition information.
It can also be understood that the driving path planning system may extract the time length required for the vehicle to pass through the congested road section and the time length required for the vehicle to pass through the normal road section from the road condition information of the congested road section and the normal road section corresponding to each alternative path fed back by the network.
S1022c, obtaining the first time length according to the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section.
Specifically, the driving path planning system may obtain the first time length according to a sum of a time length required for the vehicle to pass through a congested road segment in each alternative path and a time length required for the vehicle to pass through a normal road segment in each alternative path.
According to the driving path planning method provided by the embodiment, the driving path planning system also considers the road condition information in each alternative path in the process of acquiring the driving time of the vehicle, the method can more accurately acquire the time required by the vehicle to reach the alternative parking place from the current position, further determines the optimal target parking place according to the driving time of the vehicle, plans the optimal target driving path through the optimal target parking place, improves the convenience of the driving path recommended by the navigation equipment, and simultaneously improves the use experience of a user on the driving path planning system; in addition, the user can pass through the target parking place to reach the destination according to the optimal target driving path, so that the traveling efficiency of the user is improved.
In the method for planning a driving route according to another embodiment, the step of obtaining the travel time required for the user to reach the destination from the alternative parking place in S102 includes:
and S1023, acquiring the travel mode and the travel path of the user from each alternative parking place to the destination. Wherein the travel patterns of the user from each of the alternative parking spots to the destination include any one or more of walking, riding in public transportation, and riding.
Specifically, the travel mode of the user from each alternative parking place to the destination may be a single travel mode, or may be a mixed travel mode. Alternatively, the travel path may characterize a travel route for the user to reach the destination from the alternate parking location.
It should be noted that, if the destination to which the user is going to go is a location, the driving path planning system may obtain the traveling mode and the traveling path of the user from each alternative parking place to the destination; if the destination to which the user is going to is two positions, the destination can be represented as a first destination and a second destination according to the sequence of the destination, the driving path planning system can search a first candidate parking place around the first destination in the navigation map and can also search a second candidate parking place around the second destination, and then the driving path planning system user can acquire the traveling mode and the traveling path of the user from each first candidate parking place to the first destination, the traveling mode and the traveling path from the first destination to each second candidate parking place, and the traveling mode and the traveling path from each second candidate parking place to the second destination.
In this embodiment, the user may travel from the parking candidate to the destination by walking.
And S1024, acquiring the travel time required by the user to reach the destination from each alternative parking place according to the travel mode and the travel path corresponding to the travel mode.
Specifically, based on different traveling modes and traveling paths corresponding to the different traveling modes, the traveling time length required for the user to reach the destination from each alternative parking place may be different.
Optionally, in the step S1024, according to the travel manner and the travel path corresponding to the travel manner, the step of obtaining the travel time required by the user to reach the destination from each alternative parking place may be specifically implemented by the following steps:
and S1024a, receiving information of the road sections without street facilities and the road sections with street facilities in the process of reaching the destination along the travel path. The road section with the street crossing facility comprises one or more of a pedestrian tunnel, a zebra crossing and a street crossing overpass.
Specifically, the driving path planning system may receive information of a road section without street facilities and a road section with street facilities in the traveling paths corresponding to different traveling modes fed back by the network. Optionally, the user may include one or more road sections with street crossing facilities in the process of arriving at the destination along the travel path.
In this embodiment, the travel mode may be a walking mode.
S1024b, acquiring the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility according to the travelling mode.
It can also be understood that the driving path planning system may calculate a time length required by the user to pass through the road section without the street facility and a time length required by the user to pass through the road section with the street facility in each traveling path according to information such as the length of the road section without the street facility and the road section with the street facility in different traveling paths, the traveling speed of the traveling mode corresponding to each traveling path, and the like.
S1024c, obtaining the travel time length according to the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility.
Specifically, the driving path planning system may obtain the first time length according to a sum of a time length required by the user to pass through a road section without street facilities in each traveling path and a time length required by the user to pass through a road section with street facilities in each traveling path.
According to the driving path planning method provided by the embodiment, in the process of acquiring the total time required by the user to reach the destination from the current position through the alternative parking place, the time required by the user to pass through the road section with the street crossing facility is considered, the method can more accurately acquire the traveling time of the user, further determine the optimal target parking place according to the traveling time of the user, plan the optimal target driving path through the optimal target parking place, improve the convenience of the driving path recommended by the navigation equipment, and simultaneously improve the use experience of the driving path planning system by the user; in addition, the user can drive the vehicle to reach the destination through the target parking place according to the optimal target driving path, and the traveling efficiency of the user can be improved.
Fig. 3 is a driving path planning method provided in another embodiment, based on the driving path planning method shown in fig. 2, as shown in fig. 3, the step of determining the target parking place in S103 according to the priority of the total time length corresponding to the user passing through each parking place to reach the destination may specifically be implemented by the following steps:
and S1031, sorting the total duration corresponding to the arrival of the user at the destination through each alternative parking place.
In this embodiment, if the destination to which the user is going is a location, the driving path planning system may sort each total duration corresponding to the user arriving at the destination from the current location through each of the candidate parking places in order from small to large.
S1032, determining the alternative parking place corresponding to the total time length smaller than the preset threshold value in all the total time lengths as the target parking place.
In this embodiment, the preset threshold may be a preset total time required for the user to reach the destination from the current position through the alternative parking place, and the preset threshold may be determined according to the actual driving path of the vehicle, the road condition information, and the traveling time of the user. If a plurality of total durations in all the total durations are smaller than a preset threshold value, the driving path planning system can determine the alternative parking place corresponding to the minimum total duration as the target parking place.
According to the driving path planning method provided by the embodiment, the driving path planning system determines the alternative parking places corresponding to the total time length which is less than the preset threshold value in all the total time lengths as the target parking places according to the sequencing of the total time length corresponding to the fact that the user reaches the destination from the current position through each alternative parking place, and then plans the optimal target driving path through the target parking places, so that the convenience of the driving path recommended by the navigation equipment is improved, and the use experience of the driving path planning system by the user is improved; in addition, the user can pass through the target parking place to reach the destination according to the optimal target driving path, and the traveling efficiency of the user can be improved.
In a driving path planning method provided by another embodiment, the step of planning the target driving path through the target parking place in the step S104 may specifically include: and planning the target driving path according to the current position of the vehicle and the target parking place.
It should be noted that the driving path planning system may plan a target driving path from the current position to the destination through the target parking place according to the current position of the vehicle and the target parking place.
In this embodiment, if the destinations to which the user is going to go are two locations, that is, a first destination and a second destination, and a first candidate parking place around the first destination that can be searched by the driving path planning system in the navigation map, and a second candidate parking place around the second destination that can also be searched by the driving path planning system, the driving path planning system may plan a driving path for the vehicle to reach the first candidate parking place from the current location, and a driving path for the vehicle to reach the second candidate parking place from the first candidate parking place.
According to the driving path planning method provided by the embodiment, the driving path planning system plans the optimal target driving path according to the target parking place, so that the convenience of the driving path recommended by the navigation equipment is improved, and the use experience of a user on the driving path planning system is improved; in addition, the user can pass through the target parking place to reach the destination according to the optimal target driving path, and the traveling efficiency of the user can be improved.
It should be understood that although the various steps in the flowcharts of fig. 2-3 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-3 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternating with other steps or at least some of the sub-steps or stages of other steps.
For the specific definition of the driving path planning system, reference may be made to the above definition of the driving path planning method, which is not described herein again. All modules in the driving path planning system of the computer equipment can be completely or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
Fig. 4 is a schematic structural diagram of a driving path planning system according to an embodiment. As shown in fig. 4, the driving path planning system may include: a search module 11, an acquisition module 12, a determination module 13 and a path planning module 14.
Specifically, the search module 11 is configured to search an alternative parking place according to a destination, and plan an alternative driving path according to the alternative parking place;
the obtaining module 12 is configured to obtain, according to each alternative parking place and a corresponding alternative driving path, a total duration required by the user to reach the destination from the current position through each alternative parking place, where the total duration is equal to a sum of a driving duration for the vehicle to reach each alternative parking place and a traveling duration required by the user to reach the destination from the alternative parking place;
the determining module 13 is configured to determine a target parking place according to a priority of a total duration corresponding to the arrival of the user at the destination through each of the candidate parking places;
the path planning module 14 is configured to plan a target driving path through the target parking place.
Optionally, the driving time period for the vehicle to reach each parking candidate includes: acquiring road condition information of the vehicle from the current position to each alternative parking place; and acquiring a first time length required by the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information.
The obtaining of the first time length required for the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information includes:
receiving the road condition information of a congested road section and a normal road section in the alternative driving path; acquiring the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section according to the road condition information; and obtaining the first time length according to the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section.
Optionally, the obtaining of the travel time required by the user to reach the destination from the alternative parking place includes:
acquiring a traveling mode and a traveling path of the user from each alternative parking place to the destination; acquiring the travel duration required by the user to reach the destination from each alternative parking place according to the travel mode and the travel path corresponding to the travel mode; wherein the travel patterns of the user from each of the alternative parking spots to the destination include any one or more of walking, riding in public transportation, and riding.
Wherein, the obtaining the travel time required for the user to reach the destination from each alternative parking place according to the travel mode and the travel path corresponding to the travel mode includes:
receiving information of road sections without street facilities and road sections with street facilities in the process of reaching the destination along the travel path; acquiring the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility according to the travelling mode; obtaining the travel time length according to the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility; the road section with the street-crossing facility comprises one or more of a pedestrian tunnel, a zebra crossing and a street-crossing overpass.
The driving path planning system provided in this embodiment may implement the above method embodiments, and the implementation principle and technical effect are similar, which are not described herein again.
Fig. 5 is a schematic structural diagram of a driving path planning system according to another embodiment. The search module 11 in the driving path planning system includes: a search unit 111 and a planning unit 112.
Specifically, the search unit 111 is configured to search, according to the destination, the candidate parking spots within a preset distance range around the destination;
the planning unit 112 is configured to plan the alternative driving path from the current position to each alternative parking place according to each alternative parking place;
optionally, the destinations include a first destination and a second destination; the search module 11 is specifically configured to search a first candidate parking place according to the first destination, and plan a first candidate driving path through which the vehicle reaches the first candidate parking place from a current position according to the first candidate parking place; and searching a second alternative parking place according to the second destination, and planning a second alternative driving path from the current position to the second alternative parking place according to the second alternative parking place.
The driving path planning system provided in this embodiment may implement the above method embodiments, and the implementation principle and technical effect are similar, which are not described herein again.
In one embodiment, the obtaining module 12 is specifically configured to obtain a first destination time length required by the user to reach the first destination through each first alternative driving path from the current location, obtain a second destination time length required by the user to reach the second destination through each second alternative driving path from the first destination, and obtain a sum of the first destination time length and the second destination time length to obtain the total time length.
The driving path planning system provided in this embodiment may implement the above method embodiments, and the implementation principle and technical effect are similar, which are not described herein again.
In one embodiment, with continued reference to fig. 5, the determining module 13 in the driving path planning system includes: a sorting unit 131 and a determining unit 132.
Specifically, the sorting unit 131 is configured to sort the total duration of each time that the user passes through each alternative parking place to reach the destination;
the determining unit 132 is configured to determine, as the target parking place, an alternative parking place corresponding to a total duration smaller than a preset threshold among all the total durations.
The driving path planning system provided in this embodiment may implement the above method embodiments, and the implementation principle and technical effect are similar, which are not described herein again.
In one embodiment, the path planning module 14 is specifically configured to plan the target driving path according to the current position of the vehicle and the target parking place.
In one embodiment, a computer device is provided, the internal structure of which may be as shown in FIG. 6. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of driving path planning. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 6 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
In one embodiment, a storage medium is provided having a computer program stored thereon, the computer program when executed by a processor implementing the steps of:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile storage medium and can include the processes of the embodiments of the methods described above when executed. Any reference to memory, storage, database, or other medium used in various embodiments that can be tolerated by the present application may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (12)
1. A method for planning a driving path, the method comprising:
searching an alternative parking place according to the destination, and planning an alternative driving path according to the alternative parking place;
acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length of a vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and planning a target driving path through the target parking place.
2. The method of claim 1, wherein the searching for alternative parking places according to destinations and planning alternative driving paths according to the alternative parking places comprises:
searching the alternative parking places in a preset distance range around the destination according to the destination;
according to each alternative parking place, planning the alternative driving path from the current position to each alternative parking place of the vehicle;
and preferably, the destinations include a first destination and a second destination; the searching for the alternative parking place according to the destination and planning the alternative driving path according to the alternative parking place comprises:
searching a first alternative parking place according to the first destination, and planning a first alternative driving path from the current position to the first alternative parking place according to the first alternative parking place;
and searching a second alternative parking place according to the second destination, and planning a second alternative driving path from the current position to the second alternative parking place according to the second alternative parking place.
3. The method of claim 1, wherein obtaining a driving length of time for the vehicle to reach each of the alternate parking spots comprises:
acquiring road condition information of the vehicle from the current position to each alternative parking place;
and acquiring a first time length required by the vehicle to reach each alternative parking place from the current position according to each alternative driving path and the road condition information.
4. The method according to claim 3, wherein the obtaining a first time period required for the vehicle to reach each of the alternative parking places from the current position according to each of the alternative driving paths and the road condition information comprises:
receiving the road condition information of a congested road section and a normal road section in the alternative driving path;
acquiring the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section according to the road condition information;
and obtaining the first time length according to the time length required by the vehicle to pass through the congested road section and the time length required by the vehicle to pass through the normal road section.
5. The method of claim 1, wherein obtaining a length of travel required for the user to reach the destination from the alternate parking location comprises:
acquiring a traveling mode and a traveling path of the user from each alternative parking place to the destination;
acquiring the travel duration required by the user to reach the destination from each alternative parking place according to the travel mode and the travel path corresponding to the travel mode;
and preferably, the travel pattern of the user from each alternative parking place to the destination includes any one or more of walking, riding a public transportation means, and riding.
6. The method according to claim 5, wherein the obtaining of the travel time required for the user to reach the destination from each parking candidate location according to the travel mode and the travel path corresponding to the travel mode comprises:
receiving information of road sections without street facilities and road sections with street facilities in the process of reaching the destination along the travel path;
acquiring the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility according to the travelling mode;
obtaining the travel time length according to the time length required by the user to pass through the road section without the street facility and the time length required by the user to pass through the road section with the street facility;
and preferably, the section with street facilities comprises any one or more of a pedestrian tunnel, a zebra crossing and a street overpass.
7. The method according to claim 2, wherein the obtaining of the total time required for the user to reach the destination from the current position through each of the alternative parking places according to each of the alternative parking places and the corresponding alternative driving path comprises:
acquiring a first destination time length required by the user to reach the first destination from the current position through each first alternative driving path;
acquiring a second destination time length required by the user to reach the second destination from the first destination through each second alternative driving path;
and acquiring the sum of the first target duration and the second target duration to obtain the total duration.
8. The method of claim 1, wherein determining a target parking location based on a priority of a total length of time for the user to reach the destination via each of the alternative parking locations comprises:
sequencing the size of each total time length corresponding to the user arriving at the destination through each alternative parking place;
and determining the alternative parking place corresponding to the total time length smaller than the preset threshold value in all the total time lengths as the target parking place.
9. The method of claim 1, wherein the planning a target driving path through the target parking location comprises: and planning the target driving path according to the current position of the vehicle and the target parking place.
10. A driving path planning system, characterized in that the driving path planning system comprises:
the search module is used for searching alternative parking places according to the destination and planning alternative driving paths according to the alternative parking places;
the acquisition module is used for acquiring the total time length required by a user to reach the destination from the current position through each alternative parking place according to each alternative parking place and the corresponding alternative driving path, wherein the total time length is equal to the sum of the driving time length for the vehicle to reach each alternative parking place and the traveling time length required by the user to reach the destination from the alternative parking place;
the determining module is used for determining a target parking place according to the priority of the total time length corresponding to the arrival of the user at the destination through each alternative parking place;
and the path planning module is used for planning a target driving path through the target parking place.
11. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the method of any one of claims 1 to 9 when executing the computer program.
12. A storage medium having a computer program stored thereon, the computer program, when being executed by a processor, realizing the steps of the method according to any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910567575.4A CN112146670A (en) | 2019-06-27 | 2019-06-27 | Driving path planning method, system, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910567575.4A CN112146670A (en) | 2019-06-27 | 2019-06-27 | Driving path planning method, system, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112146670A true CN112146670A (en) | 2020-12-29 |
Family
ID=73868697
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910567575.4A Pending CN112146670A (en) | 2019-06-27 | 2019-06-27 | Driving path planning method, system, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112146670A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114279455A (en) * | 2021-11-16 | 2022-04-05 | 北京百度网讯科技有限公司 | Path planning method and device, electronic equipment and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007263581A (en) * | 2006-03-27 | 2007-10-11 | Pioneer Electronic Corp | Route search device, route search method, route search program, and recording medium |
| EP2075546A2 (en) * | 2007-12-28 | 2009-07-01 | Aisin AW Co., Ltd. | Navigation device and computer program |
| JP2009250891A (en) * | 2008-04-09 | 2009-10-29 | Denso Corp | Parking lot guide device |
| CN103727948A (en) * | 2012-10-16 | 2014-04-16 | 北京掌行通信息技术有限公司 | Real-time guidance method for bus taking navigation |
| CN108592933A (en) * | 2018-05-29 | 2018-09-28 | 深圳市元征科技股份有限公司 | A kind of guidance path recommends method and server |
-
2019
- 2019-06-27 CN CN201910567575.4A patent/CN112146670A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007263581A (en) * | 2006-03-27 | 2007-10-11 | Pioneer Electronic Corp | Route search device, route search method, route search program, and recording medium |
| EP2075546A2 (en) * | 2007-12-28 | 2009-07-01 | Aisin AW Co., Ltd. | Navigation device and computer program |
| JP2009250891A (en) * | 2008-04-09 | 2009-10-29 | Denso Corp | Parking lot guide device |
| CN103727948A (en) * | 2012-10-16 | 2014-04-16 | 北京掌行通信息技术有限公司 | Real-time guidance method for bus taking navigation |
| CN108592933A (en) * | 2018-05-29 | 2018-09-28 | 深圳市元征科技股份有限公司 | A kind of guidance path recommends method and server |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114279455A (en) * | 2021-11-16 | 2022-04-05 | 北京百度网讯科技有限公司 | Path planning method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11551325B2 (en) | Travel coordination system implementing pick-up location optimization | |
| AU2020203551B2 (en) | Dynamically determining origin and destination locations for a network system | |
| US9659492B2 (en) | Real-time vehicle spacing control | |
| US8483950B2 (en) | Route guidance server, navigation apparatus, route guidance system, and route guidance method | |
| US9594772B2 (en) | Multi-modal journey planner | |
| CN112602128B (en) | road traffic navigation system | |
| US20140222950A1 (en) | Predictive Mobile Map Download | |
| CN111397628B (en) | Navigation method, navigation device, computer equipment and storage medium | |
| US20140012611A1 (en) | Method and system for generating viable pattern-transfers for an itinerary -planning system | |
| US20080033640A1 (en) | Guide Report Device, System Thereof, Method Thereof, Program For Executing The Method, And Recording Medium Containing The Program | |
| EP2726818A2 (en) | Providing routes through information collection and retrieval | |
| CN105683712A (en) | Methods and systems for obtaining a multi-modal route | |
| CN102506861A (en) | Travel information processing method and device | |
| Liu et al. | Balanced traffic routing: Design, implementation, and evaluation | |
| JP2009216500A (en) | Navigation system, route searching server, and route searching method | |
| CN109855641B (en) | Method, device, storage medium and terminal equipment for predicting motion trail | |
| US20190017832A1 (en) | Method and apparatus for providing recorded, anonymized routes | |
| CN112309136A (en) | Method, device and equipment for determining traffic flow | |
| CN112146670A (en) | Driving path planning method, system, computer equipment and storage medium | |
| Peng et al. | Searching parking spaces in urban environments based on non-stationary Poisson process analysis | |
| JP2017102001A (en) | Route search device and route search method | |
| CN112304326A (en) | Travel route planning method, equipment and storage medium | |
| US20200182632A1 (en) | Navigation system and route search method thereof | |
| Miao | Making Smart Parking Decisions: A Driver's Perspective | |
| CN112197785B (en) | Travel route generation method, travel route generation device, mobile carrier, and storage medium |
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 |