CN111928870B - Method and device for planning driving route, computing equipment and storage medium - Google Patents
Method and device for planning driving route, computing equipment and storage medium Download PDFInfo
- Publication number
- CN111928870B CN111928870B CN202011114841.7A CN202011114841A CN111928870B CN 111928870 B CN111928870 B CN 111928870B CN 202011114841 A CN202011114841 A CN 202011114841A CN 111928870 B CN111928870 B CN 111928870B
- Authority
- CN
- China
- Prior art keywords
- points
- route
- determining
- distance
- trip
- 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.)
- Active
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/3415—Dynamic re-routing, e.g. recalculating the route when the user deviates from calculated route or after detecting real-time traffic data or accidents
-
- 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/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
- G01C21/32—Structuring or formatting of map data
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 embodiment of the invention provides a method and a device for planning a driving route, a computing device and a storage medium, wherein the method for planning the driving route comprises the following steps: acquiring travel demand information and driver terminal information of at least one passenger terminal; dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information; based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip; planning a driving route according to the basic path and the road information in the map database; the driver terminal and the passenger terminal are monitored, the driving route is re-planned under the condition that the route replacing condition is met, and the driving route is re-planned when the route replacing condition is met, so that the driving route can be automatically planned, and the operation is convenient.
Description
Technical Field
The present invention relates to the field of navigation technologies, and in particular, to a method and an apparatus for planning a driving route, a computing device, and a storage medium.
Background
With the rapid development of computer technology, Global Positioning System (GPS) and Geographic Information System (GIS) are gaining wide attention and application in various industries, and the integration degree of the two is increasingly strengthened, so that the visualization, integration and integration of GPS navigation information on GIS are realized, and the target can be dynamically tracked and the geographic position can be displayed on a map in real time.
The network appointment vehicle co-operation business means that a plurality of travel demands are integrated into one travel, unified travel route planning is carried out, and travel service for each passenger is completed. A relatively reasonable driving receiving route can be planned before the start of a journey by means of electronic map navigation, and a driver can complete receiving and sending pedestrians through the route.
In the prior art, although technologies such as a GPS and a GIS are developed rapidly, the problems of thinness, untimely and inaccurate remote position navigation exist. In actual use, the actual demands of the passengers may change, so that the originally planned route cannot meet the actual demands, and the driver needs to adjust the pick-up sequence according to specific conditions. However, the traditional technology only allows a driver to modify the pick-up sequence manually, and the operation is complicated.
Disclosure of Invention
The embodiment of the invention provides a method and a device for planning a driving route, electronic equipment and a storage medium, which are used for solving the defects of insufficient flexibility, lower performance and poorer compatibility in the prior art.
The embodiment of the invention provides a method for planning a driving route, which comprises the following steps:
acquiring travel demand information and driver terminal information of at least one passenger terminal;
dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip;
planning a driving route according to the basic path and the road information in the map database;
and monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
According to the method for planning the driving route, disclosed by the embodiment of the invention, the travel demand information comprises the following steps: an entering point and a leaving point;
according to the departure time of trip demand information and trip distance division journey, include:
and dividing travel demand information with a departure time interval as a first time threshold, a distance between an upper vehicle point as a first distance threshold and a distance between a lower vehicle point as a second distance threshold into the same trip.
According to the method for planning the driving route, the basic path planning is carried out on the travel demand information of the same trip based on the geographic coordinate system, and the method comprises the following steps:
determining the sequence of the boarding points as a boarding basic path according to the information of the boarding points of the same trip;
determining the sequence of the getting-off points as a getting-off basic path according to the information of the getting-off points in the same trip;
and respectively determining the distances between the starting and stopping end point of the upper vehicle basic path and the starting and stopping end point of the lower vehicle basic path, and taking the middle path between the two end points corresponding to the closest distance as the basic path.
According to the method for planning the driving route, the sequence of the vehicle-entering points is determined as the vehicle-entering basic path according to the information of the vehicle-entering points in the same journey, and the method comprises the following steps:
determining the boarding points corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the boarding points in the same trip;
determining the distance of the vehicle-entering point with the largest longitude difference and the distance of the vehicle-entering point with the largest latitude difference, and determining the sequence of the vehicle-entering points as a vehicle-entering basic path according to the direction of the vehicle-entering points with larger distances;
according to the information of the getting-off points in the same trip, determining the sequence of the getting-off points as a basic path of getting-off, comprising the following steps:
determining a getting-off point corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the getting-off point in the same trip;
and determining the distance of the departure point with the largest longitude difference and the distance of the departure point with the largest latitude difference, and determining the sequence of the departure points as a departure basic path according to the direction of the departure points with larger distance.
According to one embodiment of the invention, the method for planning the driving route, which plans the driving route according to the basic path and the road information in the map database, comprises the following steps:
determining a driving road according to the getting-on basic path, the getting-off basic path, the middle path and the road information in the corresponding map database;
and determining a driving route according to the sequence of the upper vehicle point and the lower vehicle point and the driving road.
According to one embodiment of the invention, the method for planning the driving route, which monitors a driver terminal and a passenger terminal and replans the driving route under the condition that a route replacing condition is met, comprises the following steps:
monitoring the average driving speed of the driver terminal, and if the average driving speed is less than a third threshold value, replanning the driving route;
under the condition that a passenger terminal route adjusting instruction or a quitting instruction is received, a driving route is planned again; or
And in the case of receiving a route replacement instruction of the driver terminal, replanning the driving route.
According to one embodiment of the present invention, a method of planning a driving route, in a case where a route change instruction of a driver's terminal is received, replanning the driving route, includes:
determining the sequence of the changed upper vehicle points and the sequence of the changed lower vehicle points according to a route changing instruction of a driver terminal;
and replanning the driving route based on the changed sequence of the vehicle-entering points, the sequence of the vehicle-leaving points and the road information in the map database.
The embodiment of the present invention further provides a device for planning a driving route, including:
the information acquisition module is used for acquiring travel demand information and driver terminal information of at least one passenger terminal;
the trip dividing module is used for dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
the route planning module is used for carrying out basic route planning on the travel demand information of the same trip based on a geographic coordinate system;
the driving route planning module is used for planning a driving route according to the basic path planning and the road information in the map database;
and the route updating module is used for monitoring the driver terminal and the passenger terminal and replanning the driving route under the condition of meeting the route replacing condition.
An embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement any of the steps of the method for planning a driving route.
Embodiments of the present invention also provide a non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the steps of the method for driving route planning as described in any one of the above.
According to the method and the device for planning the driving route, which are provided by the embodiment of the invention, the travel route is divided by acquiring the travel demand information of the passenger terminal and the driver terminal information, the driving route is planned according to the travel demand information of the same travel and the map database, the driver terminal and the passenger terminal can be monitored, and the driving route is re-planned when the route replacement condition is met, so that the driving route can be automatically planned, and the operation is convenient.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for planning a driving route according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for planning a driving route according to an embodiment of the present invention;
FIG. 3 is a schematic illustration of a pick-up base path of an embodiment of the present invention;
FIG. 4 is a schematic illustration of a drop-off base path according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the overall base path of an embodiment of the present invention;
FIGS. 6a to 6c are schematic diagrams of a method for planning a driving route according to an embodiment of the present invention during operation;
FIG. 7 is a schematic structural diagram of an apparatus for planning a driving route according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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 invention.
The terminology used in the one or more embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of the invention. As used in one or more embodiments of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used in one or more embodiments of the present invention refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that, although the terms first, second, etc. may be used herein to describe various information in one or more embodiments of the present invention, such information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first aspect may be termed a second aspect, and, similarly, a second aspect may be termed a first aspect, without departing from the scope of one or more embodiments of the present invention. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
First, the noun terms to which one or more embodiments of the present invention relate are explained.
Planning a basic path: and path planning is carried out based on the sequence of the getting-on points or the getting-off points, the path comprises a getting-on path and a getting-off path, the getting-on path needs to comprise all the getting-on points, and the getting-off path needs to comprise all the getting-off points.
Planning a driving route: route planning based on maps. Unlike path planning, route planning not only considers all the points of getting on and off, but also plans based on the route in the map.
The embodiment of the invention discloses a method for planning a driving route, which comprises the following steps of 101-105:
101. travel demand information and driver terminal information of at least one passenger terminal are acquired.
In this embodiment, the passenger terminal and the driver terminal are independent application programs, the passenger terminal may be an android application, an ios application, a wechat applet, an H5 application, or the like, and the driver terminal may be an android application, an ios application, or the like. The passenger terminal and the driver terminal are connected through a server.
Wherein, trip demand information includes: the system comprises an getting-on point, a getting-off point, a trip distance and an intermediate point, wherein a passenger terminal transmits trip demand information to a server through an internet. The driver terminal information includes: vehicle GPS data, driver status, etc. The driver terminal information is firstly input into a buffer database and a message queue and is stored into a database of a server in an asynchronous processing mode.
102. And dividing the trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information.
Specifically, the travel demand information includes: an entry point and an exit point, step 102 comprising: and dividing travel demand information with a departure time interval as a first time threshold, a distance between an upper vehicle point as a first distance threshold and a distance between a lower vehicle point as a second distance threshold into the same trip.
Through step 102, travel demands with departure times close to each other and start points and end points close to each other can be classified as a same trip. The first time threshold, the first distance threshold and the second distance threshold can be set according to actual requirements.
For example, the travel demand information includes 5 pieces of (getting-on point 1, getting-off point 1, departure time t 1), (getting-on point 2, getting-off point 2, departure time t 2), (getting-on point 3, getting-off point 3, departure time t 3), (getting-on point 4, getting-off point 4, departure time t 4), (getting-on point 5, getting-off point 5, and departure time t 5), and if the intervals of departure times t1, t2, t3, and t4 are within a first time threshold, and the getting-on points 1, 2, 3, and 5 are within a first distance threshold, and the getting-off points 1, 2, 3, and 4 are within a second distance threshold, the travel demand information 1, 2, and 3 are divided into the same trip.
103. And performing basic path planning on the travel demand information of the same trip based on a geographic coordinate system.
When the basic path planning is performed, an entering path and a leaving path and an intermediate path connecting the entering path and the leaving path need to be respectively planned, so that a complete basic path is formed.
When a boarding path is planned, determining the sequence of boarding points as a boarding basic path according to the information of the boarding points of the same trip;
when a get-off path is planned, determining the sequence of the get-off points as a basic get-off path according to the information of the get-off points in the same trip;
when planning the intermediate path, respectively determining the distances between the starting and stopping end points of the upper vehicle basic path and the starting and stopping end points of the lower vehicle basic path, and taking the intermediate path between the two end points corresponding to the closest distance as the basic path.
It should be explained that the geographic coordinate system needs to determine the longitude and latitude information of each getting-on point and getting-off point. And because the surface of the earth is not a plane, when the distance between two points is calculated, the earth needs to be assumed to be a standard sphere so as to calculate and determine the spherical distance between the two points.
104. And planning a driving route according to the basic path and the road information in the map database.
The map database stores map data including road information. The map data is stored in the server in advance, and can be updated as needed.
After the basic route is obtained, all points in the basic route need to be brought into the map data, and the driving route and the time sequence of all the points are planned according to the actual road information of the map data, so that the driving route of the automobile is determined according to the sequence and the planned route of all the points.
105. And monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
Specifically, there are various route replacement conditions, such as monitoring the average driving speed of the driver's terminal, and if the average driving speed is less than the third threshold, there is a possibility of traffic congestion or the like, and it is necessary to plan the driving route again.
In another case, if the passenger adjusts the getting-on point or the getting-off point, or directly quits the order and does not take any more, the server replans the driving route when receiving the passenger terminal route adjusting instruction or quitting instruction.
In another case, if the driver is required to actively adjust the driving route due to a prohibition or an accident in front, the server replans the driving route when receiving a route replacement command from the driver terminal.
According to the method for planning the driving route, the trip demand information of the passenger terminal and the driver terminal information are obtained to divide the trip, the driving route is planned according to the trip demand information of the same trip and the map database, the driver terminal and the passenger terminal can be monitored, the driving route is re-planned when the route replacement condition is met, and therefore the driving route can be automatically planned, and the method is convenient to operate.
In order to describe the method of the embodiment of the present invention in more detail, the embodiment of the present invention discloses a method for planning a driving route, which, referring to fig. 2 to 5, includes the following steps 201 to 209:
201. travel demand information and driver terminal information of at least one passenger terminal are acquired.
Wherein, trip demand information includes: an upper vehicle point and a lower vehicle point.
202. And dividing travel demand information with a departure time interval as a first time threshold, a distance between an upper vehicle point as a first distance threshold and a distance between a lower vehicle point as a second distance threshold into the same trip.
After the same trip is obtained, the travel demand information in the same trip is divided into an upper trip point set and a lower trip point set, which are respectively [ s1, s2, s3, s4.. ] and [ e1, e2, e3, e4.. ], and then the following steps 203-205 are respectively executed.
203. And determining the sequence of the boarding points as a boarding basic path according to the information of the boarding points of the same trip.
Specifically, the step 203 includes the following steps S231 to S232:
s231, according to the longitude and latitude information of the vehicle-entering point in the same trip, the vehicle-entering point corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value is determined.
Referring to fig. 3, the getting-on points of the maximum value and the minimum value of the longitude and latitude are found respectively: LonMax (longitude max), LonMin (longitude minimum), latMax (latitude maximum), latMax (latitude minimum).
S232, determining the distance of the vehicle-entering point with the largest longitude difference and the distance of the vehicle-entering point with the largest latitude difference, and determining the sequence of the vehicle-entering points as the vehicle-entering basic path according to the direction of the vehicle-entering points with larger distances.
Specifically, assuming that the earth is a standard sphere with radius R, and assuming that east warp is positive, west warp is negative, north weft is positive, and south weft is negative:
the coordinates of the upper vehicle point A (x, y) can be expressed as (R. multidot. cosx, R. multidot. cosy. sinx, R. multidot. siny)
The coordinates of the upper vehicle point B (a, B) can be represented as (R × cosb × cosa, R × cosb × sina, R × sinb)
The cosine of the angle subtended by the points a and B to the center of the sphere is:
cosb*cosy*(cosa*cosx+sina*sinx)+sinb*siny
=cosb*cosy*cos(a-x)+sinb*siny （1）
the spherical distance between the upper vehicle points A and B is as follows:
R*{arccos[cosb*cosy*cos(a-x)+sinb*siny]} （2）
according to the above formulas (1) and (2), the distance of the boarding point with the largest longitude difference and the distance of the boarding point with the largest latitude difference are calculated respectively.
Traversing according to the direction with the large difference, and if the distance of the upper vehicle point with the largest longitude difference is large, traversing the upper vehicle point from left to right to obtain a basic path; and if the distance of the upper vehicle point with the maximum latitude difference is larger, traversing the upper vehicle point according to the direction from bottom to top to obtain a basic path.
As shown in fig. 3, fig. 3 is a schematic diagram of determining the order of the upper vehicle points as the upper vehicle base path from the bottom to the top.
204. And determining the sequence of the getting-off points as the basic path of getting-off according to the information of the getting-off points in the same trip.
Specifically, the step 204 includes the following steps S241-S242:
s241, according to the longitude and latitude information of the getting-off point in the same trip, the getting-off point corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value is determined.
And S242, determining the distance of the descending point with the maximum longitude difference and the distance of the descending point with the maximum latitude difference, and determining the sequence of the descending points as a descending basic path according to the direction of the descending points with larger distances.
Similarly to the determination process of the base route of the vehicle, when determining the sequence of the vehicle-off points, the calculation is also performed based on the above formulas (1) and (2), and then the traversal is performed according to the direction with the large difference. If the distance of the get-off point with the largest longitude difference is larger, traversing the get-off point from left to right to obtain a get-off basic path; and if the distance of the getting-off point with the maximum latitude difference is larger, traversing the getting-off point according to the direction from bottom to top to obtain a getting-off basic path.
As shown in fig. 4, fig. 4 is a schematic diagram illustrating that the get-off base path is acquired in the order from left to right.
205. And respectively determining the distances between the starting and stopping end point of the upper vehicle basic path and the starting and stopping end point of the lower vehicle basic path, and taking the middle path between the two end points corresponding to the closest distance as the basic path.
Specifically, a starting end point s1 and a terminating end point sn of an upper vehicle basic path are determined, a starting end point e1 and a terminating end point en of a lower vehicle basic path are determined, distances among s1-e1, sn-en, s1-en and sn-e1 are determined respectively, and if the distance among sn-e1 is the nearest distance, an intermediate path among sn-e1 is used as the basic path. The resulting complete base path is shown in fig. 5.
206. And determining a driving road according to the getting-on basic route, the getting-off basic route, the middle route and the road information in the corresponding map database.
207. And determining a driving route according to the sequence of the upper vehicle point and the lower vehicle point and the driving road.
Through steps 206-207, the conversion from the basic path to the driving route can be realized.
208. And monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
Specifically, in the traveling process, the driver terminal reports the GPS data at intervals, the average traveling speed of the driver terminal is monitored according to the reported GPS data and the time for reporting the data, and if the average traveling speed is less than a third threshold value, the traveling route is re-planned.
Specifically, the average traveling speed may be obtained according to the following formula (3):
speed=(s1+s2+s3+s4+.....sn)/(tn-t1) （3）
where speed is the speed, s is the distance between two reported GPS points, tn is the time reported by the last travel point of the speed interval to be calculated, and t1 is the time reported by the first travel point of the speed interval to be calculated. The advancing point can be an entering point or a leaving point.
In addition, for the passengers, the travel information can be actively adjusted. For the server, in the case where a passenger terminal route adjustment instruction or a quit instruction is received, the travel route is re-planned.
In addition, it is also possible for the driver to actively adjust the driving route. And in the case of receiving a route replacement instruction of the driver terminal, replanning the driving route.
In the adjusting process, according to a route replacing instruction of a driver terminal, determining the sequence of the replaced upper vehicle points and the sequence of the replaced lower vehicle points; and replanning the driving route based on the changed sequence of the vehicle-entering points, the sequence of the vehicle-leaving points and the road information in the map database. And (4) on a display interface of the driver terminal, through clicking the head portrait, the driver is considered to change the current passenger, and the route planning is changed along with the change (including the top prompt). After sliding the "start pickup" button below the display interface, the map becomes the route plan for the vehicle location and the first trip node. After the vehicle reaches a certain node, the map is automatically changed to the path planning of the vehicle and the next trip node until the trip is finished, as shown in fig. 6a to 6 c.
In addition, in the use process, the driver terminal and the passenger terminal can also realize the following functions:
1) the server returns the planned driving route to the user terminal, and the terminal renders the planned driving route on a map so as to enable a driver and passengers to view the planned driving route in real time.
2) The passenger can zoom and view the map in a mode of touching the passenger terminal.
3) And the server intercepts the last four digits of the mobile phone number of the passenger and feeds the intercepted four digits back to the passenger terminal.
4) The driver terminal requests the server for the travel remaining distance and the travel time at intervals, which vary with the planned route.
5) And the driver terminal provides a positioning button, and the route is re-planned after clicking to adapt to the map scale.
According to the method and the device for planning the driving route, which are provided by the embodiment of the invention, the travel route is divided by acquiring the travel demand information of the passenger terminal and the driver terminal information, the driving route is planned according to the travel demand information of the same travel and the map database, the driver terminal and the passenger terminal can be monitored, and the driving route is re-planned when the route replacement condition is met, so that the driving route can be automatically planned, and the operation is convenient.
In addition, when sudden problems occur, such as traffic jam, change of requirements of passengers, road accidents in front and the like, a driver can actively adjust the driving receiving sequence through a system interface, and the operation is convenient.
The embodiment of the invention discloses a device for planning a driving route, which is shown in figure 7 and comprises the following components:
an information obtaining module 701, configured to obtain travel demand information and driver terminal information of at least one passenger terminal;
a trip dividing module 702, configured to divide trips according to departure time and trip distance of trip demand information, where each trip includes at least one trip demand information;
the route planning module 703 is configured to perform basic route planning on travel demand information of the same trip based on a geographic coordinate system;
a driving route planning module 704 for planning a driving route according to the basic path plan and the road information in the map database;
and a route updating module 705 for monitoring the driver terminal and the passenger terminal and replanning the driving route under the condition that the route replacing condition is met.
Optionally, the trip dividing module 702 is specifically configured to: and dividing travel demand information with a departure time interval as a first time threshold, a distance between an upper vehicle point as a first distance threshold and a distance between a lower vehicle point as a second distance threshold into the same trip.
Optionally, the path planning module 703 is specifically configured to:
the getting-on path planning unit is used for determining the sequence of the getting-on points as a getting-on basic path according to the information of the getting-on points of the same trip;
the get-off path planning unit is used for determining the sequence of the get-off points as a get-off basic path according to the information of the get-off points in the same trip;
and the intermediate path planning unit is used for respectively determining the distances between the starting and stopping end points of the upper vehicle basic path and the starting and stopping end points of the lower vehicle basic path, and taking the intermediate path between the two end points corresponding to the closest distance as the basic path.
Optionally, the boarding path planning unit is specifically configured to: determining the boarding points corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the boarding points in the same trip;
determining the distance of the vehicle-entering point with the largest longitude difference and the distance of the vehicle-entering point with the largest latitude difference, and determining the sequence of the vehicle-entering points as a vehicle-entering basic path according to the direction of the vehicle-entering points with larger distances;
the get-off path planning unit is specifically used for: determining a getting-off point corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the getting-off point in the same trip;
and determining the distance of the departure point with the largest longitude difference and the distance of the departure point with the largest latitude difference, and determining the sequence of the departure points as a departure basic path according to the direction of the departure points with larger distance.
Optionally, the driving route planning module 704 is specifically configured to:
determining a driving road according to the getting-on basic path, the getting-off basic path, the middle path and the road information in the corresponding map database;
and determining a driving route according to the sequence of the upper vehicle point and the lower vehicle point and the driving road.
Optionally, the route updating module 705 is specifically configured to:
monitoring the average driving speed of the driver terminal, and if the average driving speed is less than a third threshold value, replanning the driving route;
under the condition that a passenger terminal route adjusting instruction or a quitting instruction is received, a driving route is planned again; or
And in the case of receiving a route replacement instruction of the driver terminal, replanning the driving route.
Optionally, the route updating module 705 is specifically configured to:
determining the sequence of the changed upper vehicle points and the sequence of the changed lower vehicle points according to a route changing instruction of a driver terminal;
and replanning the driving route based on the changed sequence of the vehicle-entering points, the sequence of the vehicle-leaving points and the road information in the map database.
The device for planning the driving route, provided by the embodiment of the invention, can divide the travel route by acquiring the travel demand information of the passenger terminal and the driver terminal information, plan the driving route according to the travel demand information of the same travel and the map database, monitor the driver terminal and the passenger terminal, and re-plan the driving route when the route replacement condition is met, so that the driving route can be automatically planned, and the operation is convenient.
Fig. 8 illustrates a physical structure diagram of an electronic device, and as shown in fig. 8, the electronic device may include: a processor (processor)810, a communication Interface 820, a memory 830 and a communication bus 840, wherein the processor 810, the communication Interface 820 and the memory 830 communicate with each other via the communication bus 840. The processor 810 may invoke logic instructions in the memory 830 to perform a method of travel route planning, comprising:
acquiring travel demand information and driver terminal information of at least one passenger terminal;
dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip;
planning a driving route according to the basic path and the road information in the map database;
and monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
In addition, the logic instructions in the memory 830 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, an embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program stored on a non-transitory computer-readable storage medium, the computer program includes program instructions, and when the program instructions are executed by a computer, the computer can execute the method for planning a driving route provided by the above-mentioned method embodiments, including:
acquiring travel demand information and driver terminal information of at least one passenger terminal;
dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip;
planning a driving route according to the basic path and the road information in the map database;
and monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
In still another aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program is implemented by a processor to perform the method for planning a driving route provided in the foregoing embodiments, and the method includes:
acquiring travel demand information and driver terminal information of at least one passenger terminal;
dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip;
planning a driving route according to the basic path and the road information in the map database;
and monitoring the driver terminal and the passenger terminal, and replanning the driving route under the condition of meeting the route replacement condition.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (8)
1. A method of travel route planning, comprising:
acquiring travel demand information and driver terminal information of at least one passenger terminal;
dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip;
planning a driving route according to the basic path and the road information in the map database;
monitoring a driver terminal and a passenger terminal, and replanning a driving route under the condition of meeting a route replacement condition;
based on a geographic coordinate system, basic path planning is carried out on travel demand information of the same trip, and the basic path planning method comprises the following steps: determining the sequence of the boarding points as a boarding basic path according to the information of the boarding points of the same trip; determining the sequence of the getting-off points as a getting-off basic path according to the information of the getting-off points in the same trip; respectively determining the distances between the starting and stopping end point of the upper vehicle basic path and the starting and stopping end point of the lower vehicle basic path, and taking a middle path between two end points corresponding to the closest distance as a basic path;
determining the sequence of the boarding points as a boarding base path according to the information of the boarding points of the same trip, wherein the step comprises the following steps:
determining the boarding points corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the boarding points in the same trip;
determining the distance between two upper vehicle points with the maximum longitude difference and the distance between two upper vehicle points with the maximum latitude difference, if the distance between the two upper vehicle points with the maximum longitude difference is larger, determining the sequence of the upper vehicle points as an upper vehicle basic path according to the left-to-right direction, and if the distance between the two upper vehicle points with the maximum latitude difference is larger, determining the sequence of the upper vehicle points as the upper vehicle basic path according to the bottom-to-top direction;
according to the information of the getting-off points in the same trip, determining the sequence of the getting-off points as a basic path of getting-off, comprising the following steps:
determining a getting-off point corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the getting-off point in the same trip;
and determining the distance between two lower vehicle points with the maximum longitude difference and the distance between two lower vehicle points with the maximum latitude difference, if the distance between the two lower vehicle points with the maximum longitude difference is larger, determining the sequence of the lower vehicle points as a lower vehicle basic path according to the left-to-right direction, and if the distance between the two lower vehicle points with the maximum latitude difference is larger, determining the sequence of the lower vehicle points as a lower vehicle basic path according to the bottom-to-top direction.
2. The method of travel route planning according to claim 1, wherein the travel demand information includes: an entering point and a leaving point;
according to the departure time of trip demand information and trip distance division journey, include:
and dividing travel demand information with a departure time interval as a first time threshold, a distance between an upper vehicle point as a first distance threshold and a distance between a lower vehicle point as a second distance threshold into the same trip.
3. The method of travel route planning according to claim 1, wherein planning the travel route based on the base path and road information in the map database comprises:
determining a driving road according to the getting-on basic path, the getting-off basic path, the middle path and the road information in the corresponding map database;
and determining a driving route according to the sequence of the upper vehicle point and the lower vehicle point and the driving road.
4. The method of travel route planning according to claim 2, wherein the driver terminal and the passenger terminal are monitored, and the travel route is re-planned in case a route change condition is satisfied, comprising:
monitoring the average driving speed of the driver terminal, and if the average driving speed is less than a third threshold value, replanning the driving route;
under the condition that a passenger terminal route adjusting instruction or a quitting instruction is received, a driving route is planned again; or
And in the case of receiving a route replacement instruction of the driver terminal, replanning the driving route.
5. The method of travel route planning according to claim 4, wherein in case of receiving a route change instruction of a driver's terminal, replanning the travel route comprises:
determining the sequence of the changed upper vehicle points and the sequence of the changed lower vehicle points according to a route changing instruction of a driver terminal;
and replanning the driving route based on the changed sequence of the vehicle-entering points, the sequence of the vehicle-leaving points and the road information in the map database.
6. An apparatus for travel route planning, comprising:
the information acquisition module is used for acquiring travel demand information and driver terminal information of at least one passenger terminal;
the trip dividing module is used for dividing trips according to the departure time and the trip distance of the trip demand information, wherein each trip comprises at least one trip demand information;
the route planning module is used for carrying out basic route planning on the travel demand information of the same trip based on a geographic coordinate system;
the driving route planning module is used for planning a driving route according to the basic path and the road information in the map database;
the route updating module is used for monitoring the driver terminal and the passenger terminal and replanning the driving route under the condition of meeting the route replacing condition;
wherein, the route planning module includes:
the getting-on path planning unit is used for determining the sequence of the getting-on points as a getting-on basic path according to the information of the getting-on points of the same trip;
the get-off path planning unit is used for determining the sequence of the get-off points as a get-off basic path according to the information of the get-off points in the same trip;
the intermediate path planning unit is used for respectively determining the distances between the starting and stopping end points of the upper vehicle basic path and the starting and stopping end points of the lower vehicle basic path, and taking the intermediate path between the two end points corresponding to the closest distance as the basic path;
the boarding path planning unit is specifically used for determining boarding points corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the boarding points of the same trip;
determining the distance between two upper vehicle points with the maximum longitude difference and the distance between two upper vehicle points with the maximum latitude difference, if the distance between the two upper vehicle points with the maximum longitude difference is larger, determining the sequence of the upper vehicle points as an upper vehicle basic path according to the left-to-right direction, and if the distance between the two upper vehicle points with the maximum latitude difference is larger, determining the sequence of the upper vehicle points as the upper vehicle basic path according to the bottom-to-top direction;
the get-off route planning unit is specifically used for determining get-off points corresponding to the longitude maximum value, the longitude minimum value, the latitude maximum value and the latitude minimum value according to the longitude and latitude information of the get-off points of the same trip;
and determining the distance between two lower vehicle points with the maximum longitude difference and the distance between two lower vehicle points with the maximum latitude difference, if the distance between the two lower vehicle points with the maximum longitude difference is larger, determining the sequence of the lower vehicle points as a lower vehicle basic path according to the left-to-right direction, and if the distance between the two lower vehicle points with the maximum latitude difference is larger, determining the sequence of the lower vehicle points as a lower vehicle basic path according to the bottom-to-top direction.
7. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the program, carries out the steps of the method of travel route planning according to any one of claims 1 to 5.
8. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of driving route planning according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011114841.7A CN111928870B (en) | 2020-10-19 | 2020-10-19 | Method and device for planning driving route, computing equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011114841.7A CN111928870B (en) | 2020-10-19 | 2020-10-19 | Method and device for planning driving route, computing equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111928870A CN111928870A (en) | 2020-11-13 |
| CN111928870B true CN111928870B (en) | 2021-03-05 |
Family
ID=73334485
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011114841.7A Active CN111928870B (en) | 2020-10-19 | 2020-10-19 | Method and device for planning driving route, computing equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111928870B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112396861B (en) * | 2020-11-26 | 2022-09-09 | 无锡职业技术学院 | Automobile auxiliary driving control method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106716066A (en) * | 2014-07-22 | 2017-05-24 | 莱夫特公司 | Ride chaining |
| CN108268965A (en) * | 2017-01-03 | 2018-07-10 | 北京嘀嘀无限科技发展有限公司 | For resource allocation, for the vehicles scheduling method and its device |
| CN110399999A (en) * | 2019-05-08 | 2019-11-01 | 腾讯科技（深圳）有限公司 | Service processing method, device, equipment and storage medium by bus |
| CN111383073A (en) * | 2018-12-31 | 2020-07-07 | 北京嘀嘀无限科技发展有限公司 | Multi-user co-power method and system |
| CN111738550A (en) * | 2020-05-21 | 2020-10-02 | 平安国际智慧城市科技股份有限公司 | Travel group guest method, device, equipment and storage medium based on dynamic planning |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180260787A1 (en) * | 2017-03-13 | 2018-09-13 | GM Global Technology Operations LLC | Systems, methods and devices for driver-rider matching adaptable to multiple rideshare models |
-
2020
- 2020-10-19 CN CN202011114841.7A patent/CN111928870B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106716066A (en) * | 2014-07-22 | 2017-05-24 | 莱夫特公司 | Ride chaining |
| CN108268965A (en) * | 2017-01-03 | 2018-07-10 | 北京嘀嘀无限科技发展有限公司 | For resource allocation, for the vehicles scheduling method and its device |
| CN111383073A (en) * | 2018-12-31 | 2020-07-07 | 北京嘀嘀无限科技发展有限公司 | Multi-user co-power method and system |
| CN110399999A (en) * | 2019-05-08 | 2019-11-01 | 腾讯科技（深圳）有限公司 | Service processing method, device, equipment and storage medium by bus |
| CN111738550A (en) * | 2020-05-21 | 2020-10-02 | 平安国际智慧城市科技股份有限公司 | Travel group guest method, device, equipment and storage medium based on dynamic planning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111928870A (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6904637B2 (en) | Systems and methods for determining transport stop locations | |
| US11922803B2 (en) | Method, apparatus, and system for detecting a merge lane traffic jam | |
| US20230227057A1 (en) | Reminding method and apparatus in assisted driving, reminding method and apparatus in map-assisted driving, and map | |
| CN112236648B (en) | Enhancing navigation experience using V2X supplemental information | |
| US10553110B2 (en) | Detection and estimation of variable speed signs | |
| EP2973497B1 (en) | Enriching driving experience with cloud assistance | |
| US9812007B2 (en) | Map generation system, map generation device, map generation method, and program | |
| JP6094543B2 (en) | Origin / Destination Extraction Device, Origin / Destination Extraction Method | |
| CN104870289B (en) | For the method for providing operation reserve for motor vehicle | |
| CN105683716A (en) | Contextual traffic or transit alerts | |
| US20160046297A1 (en) | Driving evaluation system, electronic device, driving evaluation method, and program | |
| KR102467375B1 (en) | Systems and methods for improved traffic situation visualization | |
| CN112598916B (en) | Navigation reminding method and device, electronic equipment and storage medium | |
| CN106662455A (en) | Warning notification system, warning notification method, and program | |
| EP2659227B1 (en) | Incremental network generation providing seamless network | |
| CN111859180B (en) | Get-on point recommendation method and system | |
| CN111928870B (en) | Method and device for planning driving route, computing equipment and storage medium | |
| CN111291775A (en) | Vehicle positioning method, device and system | |
| CN106468556A (en) | A kind of running information is shared, methods of exhibiting and device | |
| US12136170B2 (en) | Information management device, information management method, and storage medium | |
| JP5494501B2 (en) | Information processing system | |
| CN114252081B (en) | Positioning method, device, equipment and storage medium | |
| JP6314460B2 (en) | Position-dependent information processing system, position-dependent information processing method, program, and position-dependent information display device | |
| CN118155156A (en) | Lane matching method, apparatus, device, storage medium and computer program product | |
| JP2017167099A (en) | Route retrieval system and route retrieval program |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |