CN111815080B - Path forward matching method, electronic device and storage medium - Google Patents
Path forward matching method, electronic device and storage medium Download PDFInfo
- Publication number
- CN111815080B CN111815080B CN202010918439.8A CN202010918439A CN111815080B CN 111815080 B CN111815080 B CN 111815080B CN 202010918439 A CN202010918439 A CN 202010918439A CN 111815080 B CN111815080 B CN 111815080B
- Authority
- CN
- China
- Prior art keywords
- path
- fence area
- follow
- route
- destination
- 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
- 238000000034 method Methods 0.000 title claims abstract description 74
- 238000004590 computer program Methods 0.000 claims description 15
- 238000010586 diagram Methods 0.000 description 20
- 238000010187 selection method Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0645—Rental transactions; Leasing transactions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Navigation (AREA)
Abstract
The embodiment of the invention provides a path forward matching method, electronic equipment and a storage medium. In the matching process of the paths along the road, the characteristic position of the first path, which is suitable for getting on or off the bus, is obtained, a fence area is generated according to the characteristic position, and then whether the second path and the first path are along the road or not is determined according to the generated fence area. The fence region comprises the upper and lower vehicle positions where the first path passes through, so that the second path can also be matched along the way according to the region where the first path passes through, the matching degree of the matching result along the way and the actual situation along the way is increased, and the accuracy of the matching result along the way is improved.
Description
Technical Field
The invention relates to the technical field of vehicle resource sharing, in particular to a path forward matching method, electronic equipment and a storage medium.
Background
In the field of vehicle resource sharing, it is generally necessary to match whether a route is followed, for example, in a car sharing process, it is necessary to determine whether each passenger is followed, and further allocate the passengers following the route to the same vehicle, so that a driver can transport each passenger to a destination with least time and effort.
In the prior art, when the departure places of two paths are relatively close (for example, the distance between the departure places is less than 5 kilometers) and the destinations are also relatively close (for example, the distance between the destinations is less than 5 kilometers), the two paths are determined to be successfully matched along the road, otherwise, the two paths are not along the road and cannot be distributed to the same vehicle during carpooling. For example, a user a provides travel information (including information such as a starting point, an end point and a starting time), a user B who initiates an in-route matching request provides travel information (including information such as a starting point, an end point and a starting time), a server defines a starting place range according to a starting place of the user a and a destination range according to a destination of the user a, if the starting place of the user B is within the defined starting place range and the destination of the user B is within the destination range, the in-route matching between the user a and the user B is successful, otherwise, the paths of the user a and the user B are not in-route. However, in many cases, although the two routes are far apart in origin and far apart in destination, the two routes are still actually straight-ahead, e.g., the route of user B is a certain segment of the route of user a.
Therefore, two paths of the forward road cannot be accurately matched only by judging whether the departure place is close to the destination or not, so that the forward road matching result is inconsistent with the actual forward road condition, and the accuracy of forward road matching is low.
Disclosure of Invention
Embodiments of the present invention provide a method for matching paths along roads, an electronic device, and a storage medium, so as to solve the problems that two paths along roads cannot be accurately matched only by whether a departure place is close and a destination is close, which causes a matching result along a road not to meet an actual condition along a road, and accuracy of matching along a road is low.
In view of the above technical problems, in a first aspect, an embodiment of the present invention provides a method for matching a path, including:
acquiring a characteristic position according to the first path; wherein the characteristic position comprises an entry and exit position of the first path suitable for entering and exiting the vehicle;
generating fence areas, wherein each fence area comprises at least one characteristic position;
determining whether a second path and the first path follow the road or not through the generated fence area;
wherein the determining whether the second path and the first path follow the path through the generated fence area comprises:
if the two path end points of the second path are both in the generated fence area, the second path and the first path are in the same path; the two path end points are a starting point of the second path and a destination of the second path;
and/or if a first path end point of the two path end points is in the generated fence area and a second path end point of the two path end points is not in the generated fence area, determining whether the second path and the first path follow the path or not through the second path end point, the generated fence area or the first path;
and/or if the two path end points are not in the generated fence area, determining whether the second path and the first path follow the path according to the first straight line, the second straight line and the generated fence area; the first straight line is determined according to a departure place of the second path and a destination of the first path, and the second straight line is determined according to the destination of the second path and the departure place of the first path.
Determining whether the second path and the first path follow the path according to the second path endpoint and the generated fence area includes:
for any one generated fence area, acquiring a tangent line which passes through the end point of the second path and is tangent to the fence area, and determining the distance between the end point of the second path and the tangent point in the tangent line as the tangent line distance corresponding to the fence area;
and acquiring the shortest tangential distance from the tangential distances corresponding to the fence areas, and determining whether the second path and the first path follow the path or not according to the shortest tangential distance and the path length of the first path.
Wherein the determining whether the second path and the first path follow the path through the second path endpoint and the first path comprises:
if the second path endpoint is the departure point of the second path, acquiring the departure point distance between the second path endpoint and the departure point of the first path, and determining whether the second path and the first path follow the path according to the departure point distance and the path length of the first path;
and/or if the second path end point is the destination of the second path, acquiring the destination distance between the second path end point and the destination of the first path, and determining whether the second path and the first path follow the path according to the destination distance and the path length of the first path.
Wherein the determining whether the second path and the first path follow the road through the first straight line, the second straight line and the generated fence area comprises:
for any one of the generated fence areas, if an intersection point exists between the fence area and the first straight line or the second straight line, taking the fence area as an intersected fence area;
and determining whether the second path and the first path are along according to the total number of the generated fence areas and the number of the crossed fence areas.
Before obtaining the feature position according to the first path, the method further includes:
acquiring at least two paths to be determined whether to follow the road, executing path determination operation each time to acquire a first path and a second path to be determined whether to follow the road at this time until each path of the at least two paths is traversed;
wherein the path determination operation comprises:
when the method is executed for the first time, the longest path in the at least two paths is taken as a first path for determining whether to follow the path at this time, and any path which is not traversed in the at least two paths is taken as a second path for determining whether to follow the path at this time;
when the route is not executed for the first time, generating a synthetic route according to a first route and a second route which are determined to be the following routes for the last time, taking the generated synthetic route as a first route to be determined whether to follow the routes at this time, and taking any route which is not traversed in the at least two routes as a second route to be determined whether to follow the routes at this time;
the synthesized path comprises a starting place and a destination of a first path which is determined to be an on-road last time, and a starting place and a destination of a second path which is determined to be an on-road last time.
Wherein, the obtaining the characteristic position according to the first path includes:
for any getting-on/off position, if the position of the getting-on/off position on the first path or the position of the getting-on/off position reaching the first path branch path meets a preset condition, taking the getting-on/off position as the characteristic position;
wherein the preset condition comprises at least one of the following conditions: the number of inflection points included in the branch path is less than a first threshold, and the path length of the branch path is less than a second threshold.
Wherein the generating a fenced area includes:
and for any characteristic position, generating a circular area taking the any characteristic position as a center of a circle as a fence area.
In a second aspect, an embodiment of the present invention 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 the steps of the method for determining a route sequence described above.
In a third aspect, an embodiment of the present invention provides a non-transitory readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method for determining a route sequence as described above.
The embodiment of the invention provides a path forward matching method, electronic equipment and a storage medium. In the matching process of the paths along the road, the characteristic position of the first path, which is suitable for getting on or off the bus, is obtained, a fence area is generated according to the characteristic position, and then whether the second path and the first path are along the road or not is determined according to the generated fence area. The fence region comprises the upper and lower vehicle positions where the first path passes through, so that the second path can also be matched along the way according to the region where the first path passes through, the matching degree of the matching result along the way and the actual situation along the way is increased, and the accuracy of the matching result along the way is improved.
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 introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic diagram of a specific scenario of path matching involved in a process of determining a path sequence according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a path matching method according to another embodiment of the present invention;
fig. 3 is a schematic diagram of a way matching method for two path end points of a second path in a generated fence area according to another embodiment of the present invention;
FIG. 4 is a schematic diagram of a forward matching method using tangential distance determination for only one of two path end points in a generated fence area according to another embodiment of the present invention;
fig. 5 is a schematic diagram of a forward path matching method using path end point distance determination for only one of two path end points in a generated fence area according to another embodiment of the present invention;
fig. 6 is a schematic diagram of a forward matching method provided by another embodiment of the present invention, in which neither path endpoint is in the generated fence area;
FIG. 7 is a schematic diagram of a landmark point selection method for short and medium trips according to another embodiment of the present invention;
fig. 8 is a schematic diagram of a point selection method for landmarks on a medium-distance trip according to another embodiment of the present invention;
fig. 9 is a schematic view of a feature position selection method according to any one of the getting-on/off positions on the first path according to another embodiment of the present invention;
fig. 10 is a schematic view of a feature position selection method according to a case where any one of the get-on/off positions is not on the first path according to another embodiment of the present invention;
fig. 11 is a schematic diagram of a fence range defining method according to another embodiment of the present invention.
Fig. 12 is a schematic physical structure 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.
Fig. 1 is a schematic diagram of a specific scenario involved in a path-following matching process. In the scenario 101 and the scenario 102, the path difference is large, and generally, path forward matching cannot be successfully performed. In the case of the route a and the route B in the scenes 103, 104, and 105, although the departure point or the destination point is far away from each other, the route has an inclusion relationship, and route-following matching can be successfully performed theoretically. The paths in the scenes 106, 107, and 108 overlap each other partially, and the scenes 109 and 110 do not include or overlap each other on the links, but are close to each other partially, and if the driver is allowed to appropriately detour, the driver can successfully perform the route following matching. However, in the prior art, the matching of the paths and the roads is performed only by whether the departure place is close to the destination, and therefore, the matching of the paths and the roads cannot be successfully performed through the scenes 103 to 110 in the prior art.
In view of the above technical drawbacks, the present embodiment provides a method for matching a path. The matching of the path and the forward path can be executed by the server or the terminal, for example, after the server receives the first path and the second path sent by the terminal, the forward path matching condition of the first path and the second path is determined by executing the matching method of the path and the forward path provided by the embodiment of the invention, the matching degree of the forward path matching result and the actual forward path condition is increased, and the accuracy of the forward path matching result is improved. The method for matching the path along the road can be applied to the car sharing process or other processes needing to judge whether the path is along the road, and the embodiment does not specifically limit the process.
Fig. 2 is a schematic flow chart of a path-following matching method provided in this embodiment.
Step 201: acquiring a characteristic position according to the first path; wherein the characteristic position comprises an entering and exiting position suitable for entering and exiting the vehicle of the first path.
The getting-on/off position is a position suitable for getting-on and getting-off of the vehicle along the first path, for example, the getting-on/off position may be a government agency, a parking lot, a roadside-lined parking space, or the like.
The upper and lower positions of the first path on the way comprise: a boarding/alighting location on the first route (e.g., a departure place, a destination of the first route, or a parking space in the first route, etc.), and a boarding/alighting location through which the first route passes (e.g., a market, a station, etc.).
Step 202: and generating fence areas, wherein each fence area comprises at least one characteristic position.
One or more characteristic positions are included in the fence area, and the shape of the fence area may be circular, triangular, and the like, which is not specifically limited by the embodiment.
Step 203: and determining whether the second path and the first path follow the road or not through the generated fence area.
Further, the method can also comprise the following steps:
and if the second path and the first path are along, generating a route passing through the departure place and the destination of the first path and passing through the departure place and the destination of the second path.
The first path and the second path in this embodiment are paths to be matched whether to follow a route, where both the first path and the second path may be paths planned according to a departure place and a destination, or paths autonomously selected by a user through a terminal.
For example, when the user a has a travel demand, a departure place and a destination of the user a may be input on the terminal. And after receiving the departure place and the destination input by the user A, the terminal sends the departure place and the destination information to the server. And after receiving the departure place and the destination of the user A, the server plans three paths, and feeds the paths back to the terminal to be displayed to the user A. Wherein, the server determines the path finally selected by the user a as the first path. On the other hand, the user B may also input the departure place and the destination of the user B at the terminal, and after receiving the departure place and the destination input by the user B, the terminal plans the path of the user B, and takes the path as the second path. The server determines whether the first path and the second path follow the path by executing the steps 201 to 203, and feeds back a matching result of the path following the path to the terminals of the user a and the user B.
The embodiment of the invention provides a path forward matching method, electronic equipment and a storage medium. In the matching process of the paths along the road, the characteristic position of the first path, which is suitable for getting on or off the bus, is obtained, a fence area is generated according to the characteristic position, and then whether the second path and the first path are along the road or not is determined according to the generated fence area. The fence region comprises the upper and lower vehicle positions where the first path passes through, so that the second path can also be matched along the way according to the region where the first path passes through, the matching degree of the matching result along the way and the actual situation along the way is increased, and the accuracy of the matching result along the way is improved.
The following describes a matching procedure of whether the second path and the first path follow the road: further, on the basis of the above embodiment, the determining, by the generated fence area, whether the second path and the first path follow the road includes at least the following three ways:
mode 1: if the two path end points of the second path are both in the generated fence area, the second path and the first path are in the same path; the two path end points are a starting point of the second path and a destination of the second path;
and/or, mode 2: if a first path end point of the two path end points is in the generated fence area and a second path end point of the two path end points is not in the generated fence area, determining whether the second path and the first path follow the path or not through the second path end point, the generated fence area or the first path;
and/or, mode 3: if the two path end points are not in the generated fence area, determining whether the second path and the first path follow the path or not according to the first straight line, the second straight line and the generated fence area; the first straight line is determined according to a departure place of the second path and a destination of the first path, and the second straight line is determined according to the destination of the second path and the departure place of the first path.
With respect to mode 1, the departure point and the destination point of the second path are both within the generated fence area, meaning that the departure point of the second path is within any fence area and the destination point of the second path is also within any fence area. For example, the starting point and the destination of the second route both pass through a certain fence area in the route of the first route, or the starting point of the second route is in the fence area where the starting point of the first route is located, and the destination of the second route passes through a certain fence area in the route of the first route.
For example, regarding the method 1, fig. 3 is a schematic diagram of a way matching method for two path end points of the second path in the generated fence area according to another embodiment of the present invention. A path a shown in fig. 3 is the first path, a path B is the second path, white dots are a departure point and a destination of the first path, diagonal dots are characteristic points determined by the first path, a circular range region is a fence region determined by the characteristic points determined by the first path, black dots are a departure point and a destination of the second path, and two broken lines represent travel paths of the path a and the path B, respectively. As shown in fig. 3, if the departure point and the destination of the route B are both within the fence area determined according to the route a, the route B and the route a are followed.
As for the mode 2, it should be noted that if the first path endpoint is the departure point of the second path, the second path endpoint is the destination of the second path; and if the first path endpoint is the destination of the second path, the second path endpoint is the departure place of the second path. In an actual car sharing scene, one path end point of the second path can be in a fence area, and the other path end point meets a certain condition, the two path matching is considered to be successful along the road, and then a path passing through the starting place and the destination of the first path and the starting place and the destination of the second path is planned.
In the above-described aspect 3, the first straight line is a straight line passing through the departure point of the second route and the destination of the first route, and the second straight line is a straight line passing through the destination of the second route and the departure point of the first route. The closer the first straight line and the second straight line are, the more similar the first path and the second path are, and under the condition that the first straight line and the second straight line meet a certain condition, the first path and the second path can be considered to be successfully matched along the path, so that a path passing through the departure place and the destination of the first path and passing through the departure place and the destination of the second path is planned.
In this embodiment, three route following matching methods for performing the first route and the second route are provided, and through the three route following matching methods, under the condition that the starting place of the first route and the starting place of the second route are far away, and the destination of the first route and the destination of the second route are also far away, the following matching of the routes is realized, and the accuracy of the following matching result is improved. With regard to the mode 2, further on the basis of the foregoing embodiments, the determining, by using the second path end point and the generated fence area, whether the second path and the first path follow the road includes:
for any one generated fence area, acquiring a tangent line which passes through the end point of the second path and is tangent to the fence area, and determining the distance between the end point of the second path and the tangent point in the tangent line as the tangent line distance corresponding to the fence area;
and acquiring the shortest tangential distance from the tangential distances corresponding to the fence areas, and determining whether the second path and the first path follow the path or not according to the shortest tangential distance and the path length of the first path.
Specifically, the determining whether the second path and the first path follow the path according to the shortest tangential distance and the path length of the first path includes:
if the shortest tangent distance is less than or equal to the product of the path length of the first path and a first preset parameter, determining that the second path and the first path are successfully matched in an in-line way, otherwise, failing to match in an in-line way.
The first preset parameter may be set manually, and may be a value ranging from 0 to 1, i.e., 5%, 10%, or the like, for example.
For any one of the generated fence areas, acquiring a tangent line passing through the second path end point and tangent to the any one of the fence areas, and determining a distance between the second path end point and a tangent point in the tangent line as a tangent line distance corresponding to the any one of the fence areas, including:
according to the distance between the center point of each fence area and the second path end point, acquiring a fence area (or a fence area sequenced in the order from small to large before a preset sequence, for example, the preset sequence is 3) with the distance between the center point of each fence area and the second path end point being smaller than a preset distance, and taking the fence area as a to-be-processed fence area;
and for any fence area to be processed, acquiring a tangent line which passes through the end point of the second path and is tangent to the fence area to be processed, and determining the distance between the end point of the second path and a tangent point in the tangent line as the tangent line distance corresponding to the fence area.
Fig. 4 is a schematic diagram of a forward matching method using tangential distance determination for only one of two path end points in a generated fence area according to another embodiment of the present invention. Specifically, in fig. 4, a route a is the first route, a route B is the second route, a departure place of the route B is not in the generated fence area, and a destination of the route B is in the generated fence area. Sorting according to the distance between the departure place of the path B and the central point of each fence area from small to large, and taking the fence area at the top 3 of the sorting, namely obtaining three fence areas shown in fig. 4. Respectively tangent lines are made on the departure place of the path B and the 3 fence areas, so that the tangent distance between the departure place of the path B and each tangent point is obtained, and the minimum tangent distance (namely the shortest tangent distance) is obtained. Setting the first preset parameter as 5%, if the minimum tangent distance is less than or equal to the product of the path length of the first path and 5%, that is, the path a and the path B follow the path.
In this embodiment, when the first path end point is in the fence area and the second path end point is not in the fence area, whether the first path and the second path follow the path is determined according to the shortest tangential distance between the second path end point and the fence area. When the shortest tangential distance meets a certain condition, the shortest tangential distance means that only minor adjustment is needed to the route, and a route passing through the departure place and the destination of the first route and the departure place and the destination of the second route can be planned. Therefore, the first path and the second path are considered to be more reasonable in the situation, and the matching accuracy of the paths along the path is improved.
With regard to the mode 2, further on the basis of the foregoing embodiments, the determining, by the second path endpoint and the first path, whether the second path and the first path follow the path includes:
if the second path endpoint is the departure point of the second path, acquiring the departure point distance between the second path endpoint and the departure point of the first path, and determining whether the second path and the first path follow the path according to the departure point distance and the path length of the first path;
and/or if the second path end point is the destination of the second path, acquiring the destination distance between the second path end point and the destination of the first path, and determining whether the second path and the first path follow the path according to the destination distance and the path length of the first path.
Determining whether the second path and the first path follow the road according to the distance from the departure place and the path length of the first path, wherein the determining comprises: if the distance from the starting place is smaller than or equal to the product of the path length of the first path and a second preset parameter, the first path and the second path are along, otherwise, the first path and the second path are not along.
Wherein the determining whether the second path and the first path follow the path according to the destination distance and the path length of the first path includes: if the destination distance is smaller than or equal to the product of the path length of the first path and a third preset parameter, the first path and the second path are along, otherwise, the first path and the second path are not along.
The second preset parameter and the third preset parameter may be both manually set, may be the same or different, and for example, both may be values ranging from 0 to 1, the second preset parameter may be 30% or 50%, and the third preset parameter may be 30% or 50%.
Fig. 5 is a schematic diagram of a forward path matching method using path end point distance determination for only one of two path end points in a generated fence area according to another embodiment of the present invention. In fig. 5, a route a is the first route, a route B is the second route, a departure point of the route B is in the generated fence area, and a destination of the route B is not in the generated fence area. And acquiring the destination distance between the destination of the path B and the destination of the first path. When the third preset parameter is set to be 30%, if the destination distance is less than or equal to the product of the path length of the first path and 30%, it can be determined that the path B and the path a follow the way.
In this embodiment, in a case where the first path end point is within the fence area and the second path end point is not within the fence area, whether the first path and the second path follow the road is determined by a distance between the second path end point and the departure place or the destination of the first path. When the end point of the second path which is not in the fence area is close enough to the end point of a certain path in the first path, a path which passes through the departure place and the destination of the first path and passes through the departure place and the destination of the second path can be planned only by slightly adjusting the route. Therefore, the first path and the second path are considered to be more reasonable in the situation, and the matching accuracy of the paths along the path is improved.
With regard to the mode 3, further on the basis of the above embodiments, the determining whether the second path and the first path follow the path through the first straight line, the second straight line and the generated fence area includes:
for any one of the generated fence areas, if an intersection point exists between the fence area and the first straight line or the second straight line, taking the fence area as an intersected fence area;
and determining whether the second path and the first path are along according to the total number of the generated fence areas and the number of the crossed fence areas.
Wherein, the crossing fence area comprises the following conditions: the intersection point of any fence region with the first straight line or the second straight line only or the intersection point of any fence region with the first straight line and the second straight line.
Determining whether the second path and the first path follow the path according to the total number of the generated fence areas and the number of the intersected fence areas, specifically comprising: if the number of the crossed fence areas is larger than or equal to the product of the total number of the fence areas generated according to the first path and a fourth preset parameter, the second path and the first path are along, and if not, the second path and the first path are not along.
The fourth preset parameter may be set manually, and may be a value ranging from 0 to 1, i.e., 40%, 50%, or the like, for example.
Fig. 6 is a schematic diagram of a way matching method provided by another embodiment of the present invention, in which neither path endpoint is in the generated fence area. The departure point of the route a and the destination of the route B are connected by a straight line to form a first straight line, and the destination of the route a and the departure point of the route B are connected by a straight line to form a second straight line. Specifically, in fig. 6, the total number of the generated fence areas is 14, the number of intersecting fences resulting from the intersection of the first straight line and the generated fence areas is 5, and the number of intersecting fences resulting from the intersection of the second straight line and the generated fence areas is 3, that is, the number of intersecting fences is 8. Taking a third preset parameter as 50%, that is, obtaining that the number of the intersected fence areas is greater than the product of the total number of the fence areas generated according to the first path and the third preset parameter, and determining that the first path and the second path are direct paths according to the path direct path matching method provided by this embodiment.
In this embodiment, when both the first path end point and the second path end point of the second path are not in the fence area, matching whether the first path and the second path follow the road is achieved through the first straight line and the second straight line. The path determined as the following path by the first straight line and the second straight line can be used for planning a path passing through the starting place and the destination of the first path and passing through the starting place and the destination of the second path by small adjustment. Therefore, the first path and the second path are considered to be more reasonable in the situation, and the matching accuracy of the paths along the path is improved. .
For matching the forward-route situations of the multiple travel routes, further, on the basis of the foregoing embodiments, before obtaining the feature position according to the first route, the method further includes:
acquiring at least two paths to be determined whether to follow the road, executing path determination operation each time to acquire a first path and a second path to be determined whether to follow the road at this time until each path of the at least two paths is traversed;
wherein the path determination operation comprises:
when the method is executed for the first time, the longest path in the at least two paths is taken as a first path for determining whether to follow the path at this time, and any path which is not traversed in the at least two paths is taken as a second path for determining whether to follow the path at this time;
when the route is not executed for the first time, generating a synthetic route according to a first route and a second route which are determined to be the following routes for the last time, taking the generated synthetic route as a first route to be determined whether to follow the routes at this time, and taking any route which is not traversed in the at least two routes as a second route to be determined whether to follow the routes at this time;
the synthesized path comprises a starting place and a destination of a first path which is determined to be an on-road last time, and a starting place and a destination of a second path which is determined to be an on-road last time.
For example, the user a, the user B, and the user C upload a travel route L1, an L2, and an L3 including a departure point and a destination of the respective travel through the terminal, respectively, where the length of the route L1 is longest, and when the server receives three routes L1, L2, and L3 and first performs a route determination operation, the server uses the route L1 as the first route to be determined whether to follow the route this time, and uses any one of the routes L2 and L3 (e.g., the route L2) as the second route to be determined whether to follow the route this time.
And if the matching result of the path L1 and the path L2 is a forward path, determining that the path L1 and the path L2 generate a synthetic path. The synthesized route includes a departure point and a destination of the route L1, and a departure point and a destination of the route L2. The combined path of the path L1 and the path L2 is used as a new first path, and the path L3 is used as a new second path, and it is determined whether the new first path and the new second path follow the path.
In this embodiment, the direct-route matching process for multiple routes is realized by executing the route determination operation each time, and even when the departure points and the destinations of the multiple routes differ greatly, the direct-route matching can be performed, so that the success rate of the direct-route matching for the multiple routes is increased.
For the feature position acquisition according to the first path, further, on the basis of the foregoing embodiments, the feature position acquisition according to the first path includes:
for any getting-on/off position, if the position of the getting-on/off position on the first path or the position of the getting-on/off position reaching the first path branch path meets a preset condition, taking the getting-on/off position as the characteristic position;
wherein the preset condition comprises at least one of the following conditions: the number of inflection points included in the branch path is less than a first threshold, and the path length of the branch path is less than a second threshold.
The upper and lower vehicle positions may be landmark positions on the first path. The landmark positions can be selected by a landmark selection method after planning each travel path.
Wherein the first threshold, which defines the number of inflection points, may be a parameter, such as 2, 4, etc. The second threshold may also be a parameter, such as 1km, 3km, etc.
The landmark point selection method comprises the following steps: selecting primary landmarks and secondary landmarks according to landmark division, selecting landmarks according to pedestrian volume changes of the landmarks, and selecting landmarks according to time factors;
for example, all landmarks are classified and filtered by the landmarks labeled on the general map.
Wherein classifying the all landmarks comprises: primary and secondary landmarks. The primary landmarks include famous buildings, such as government agencies, stations, markets, etc.; but also places where parking or waiting is convenient, such as parking lots, gas stations, etc. The secondary landmarks comprise the right side of intersection, the parking position of road surface marking and the like.
The main landmarks can be preferentially selected as the characteristic positions, the landmarks in the time period of the peak period of the stream of people are not selected as the characteristic positions, the characteristic positions are selected according to the business hours of the commercial places at the landmarks, and the like.
Specifically, the landmark through which the first path just passes can be determined by planning the first path; the pedestrian volume can be screened according to the congestion degree of the road at the landmark position; and time factors, namely whether the landmark positions are in business hours or not and whether the landmark positions are in morning and evening rush hours or not are used for screening. For example, a landmark that the first path passes right through or a landmark that is closer to the first path may be determined as a valid landmark, and a landmark that is farther from the first path may be determined as a discarded landmark; landmarks with large traffic volume or road congestion can be determined as abandoned landmarks and the like.
Fig. 7 is a schematic diagram of a landmark point selection method for medium and short trips according to another embodiment of the present invention.
Wherein, the medium and short distance journey is the route matching scene in the city, including: urban lines, viaducts, urban loops, etc.
The landmarks in the middle and short distance travel are distributed more uniformly, namely the effective landmarks can be used as the getting-on and getting-off positions of the first path suitable for getting-on and getting-off.
Fig. 8 is a schematic diagram of a point landmark selection method for a medium-distance trip according to an embodiment of the present invention.
The medium-long distance journey is a route matching scene among cities, and comprises the following steps: highway, national road, provincial road and the like.
The effective landmarks of the medium-long distance journey are gathered around the departure point and the destination of the first route, namely the effective landmarks around the departure point and the destination can be used as the getting-on/off positions suitable for getting-on and getting-off of the first route. The method can accurately position roads in the city by the assistance of effective landmark buildings around the departure place and the destination, and is convenient for passenger receiving and delivering processes in the car sharing process.
Further, the inflection point may include a turning point in the branch path passed by the first path from the loading and unloading position.
Fig. 9 is a schematic diagram of a feature position selection method according to any one of the getting-on/off positions on the first path according to another embodiment of the present invention.
And if the landmark is on the first path, directly selecting the landmark as the characteristic position.
Fig. 10 is a schematic diagram of a feature position selection method according to a case where any one of the get-on/off vehicle positions is not on the first path according to another embodiment of the present invention.
In this embodiment, when the first threshold is set to 2, that is, when the number of inflection points on the branch path from the upper and lower vehicle positions to the first path is less than 2, the upper and lower vehicle positions may be determined as the feature points; and setting the second threshold value as 1km, namely when the length of a branch path from the getting-on/off position to the first path is less than 1km, determining the getting-on/off position as the characteristic point. For example, there is no inflection point on the branch path from the getting-on/off station position 1 to the first path, and there is an inflection point on the branch path from the getting-on/off station position 2 to the first path, that is, the number of the inflection points is less than the first threshold, then the getting-on/off station position 1 and the getting-on/off station position 2 may be used as the characteristic point; two inflection points are arranged on a branch path from the getting-on/off position 3 to the first path, the path length of the branch path is 2km, namely the number of the inflection points is equal to a first threshold value, and the path length of the branch path is greater than a second threshold value, so that the getting-on/off position 3 cannot be used as the characteristic point.
In this embodiment, a method for determining whether the getting-on/off position is used as the characteristic position according to the preset condition is provided. The method can not only increase the number of the characteristic positions to the maximum, but also avoid the influence on the stroke caused by the positions of the upper vehicle and the lower vehicle which cannot be used as the characteristic points, so that the stroke path is more consistent with the actual condition, and meanwhile, the success rate of the forward matching is increased.
For the fence area generation, on the basis of the above embodiments, the method further includes:
and for any characteristic position, generating a circular area taking the any characteristic position as a center of a circle as a fence area.
Of course, the shape of the fence area may be a triangle, and the like, and the number of the feature positions in the fence area may also be one or more.
It should be noted that each fence area can have a different radius. For example, if the characteristic position a is a parking space and the characteristic position B is a mall, the radius of the fence area at the characteristic position B may be larger than that of the fence area at the characteristic position a because a place can be selected from the characteristic position B within a larger range to get on or off the vehicle. Of course, the fence areas may also use the same radius, and this embodiment is not limited to this.
Fig. 11 is a schematic diagram of a fence range defining method provided by an embodiment of the present invention.
In this embodiment, for any feature position, a circular area with the feature position as a center is generated as a fence area.
In this embodiment, the circular shape is used as the shape of the fence area, so that the tangential distance in the above mode 2 can be better obtained, statistics of the number of intersecting fence areas in the above mode 3 is facilitated, the operation of the matching method for the whole route along the road is simplified, and the user can obtain the result of matching along the road more quickly.
The embodiment provides a matching device for a path, which comprises:
the acquisition module is used for acquiring the characteristic position according to the first path; the characteristic position comprises an getting-on and getting-off position, which is suitable for getting on and getting off, of the first path;
the generating module is used for generating fence areas, wherein each fence area comprises at least one characteristic position;
and the determining module is used for determining whether the second path and the first path follow the road or not through the generated fence area.
The matching device for route following provided in this embodiment is suitable for the matching method for route following provided in the above embodiments, and is not described herein again.
The embodiment provides a matching device for an off-road route, which is used for acquiring a characteristic position suitable for getting on or off a vehicle of a first route in the off-road route matching process of the route, generating a fence area according to the characteristic position, and determining whether a second route and the first route are off-road or not according to the generated fence area. The fence region comprises the upper and lower vehicle positions where the first path passes through, so that the second path can also be matched along the way according to the region where the first path passes through, the matching degree of the matching result along the way and the actual situation along the way is increased, and the accuracy of the matching result along the way is improved.
Optionally, the determining, by the generated fence area, whether the second path and the first path follow the road includes:
if the two path end points of the second path are both in the generated fence area, the second path and the first path are in the same path; the two path end points are a starting point of the second path and a destination of the second path;
and/or if a first path end point of the two path end points is in the generated fence area and a second path end point of the two path end points is not in the generated fence area, determining whether the second path and the first path follow the path or not through the second path end point, the generated fence area or the first path;
and/or if the two path end points are not in the generated fence area, determining whether the second path and the first path follow the path according to the first straight line, the second straight line and the generated fence area; the first straight line is determined according to a departure place of the second path and a destination of the first path, and the second straight line is determined according to the destination of the second path and the departure place of the first path.
Optionally, the determining, by the second path end point and the generated fence area, whether the second path and the first path are along includes:
for any one generated fence area, acquiring a tangent line which passes through the end point of the second path and is tangent to the fence area, and determining the distance between the end point of the second path and the tangent point in the tangent line as the tangent line distance corresponding to the fence area;
and acquiring the shortest tangential distance from the tangential distances corresponding to the fence areas, and determining whether the second path and the first path follow the path or not according to the shortest tangential distance and the path length of the first path.
Optionally, the determining, through the second path endpoint and the first path, whether the second path and the first path are along the way includes:
if the second path endpoint is the departure point of the second path, acquiring the departure point distance between the second path endpoint and the departure point of the first path, and determining whether the second path and the first path follow the path according to the departure point distance and the path length of the first path;
and/or if the second path end point is the destination of the second path, acquiring the destination distance between the second path end point and the destination of the first path, and determining whether the second path and the first path follow the path according to the destination distance and the path length of the first path.
Optionally, the determining whether the second path and the first path follow the path through the first straight line, the second straight line and the generated fence area includes:
for any one of the generated fence areas, if an intersection point exists between the fence area and the first straight line or the second straight line, taking the fence area as an intersected fence area;
and determining whether the second path and the first path are along according to the total number of the generated fence areas and the number of the crossed fence areas.
Optionally, before the obtaining the feature position according to the first path, the method further includes:
acquiring at least two paths to be determined whether to follow the road, executing path determination operation each time to acquire a first path and a second path to be determined whether to follow the road at this time until each path of the at least two paths is traversed;
wherein the path determination operation comprises:
when the method is executed for the first time, the longest path in the at least two paths is taken as a first path for determining whether to follow the path at this time, and any path which is not traversed in the at least two paths is taken as a second path for determining whether to follow the path at this time;
when the route is not executed for the first time, generating a synthetic route according to a first route and a second route which are determined to be the following routes for the last time, taking the generated synthetic route as a first route to be determined whether to follow the routes at this time, and taking any route which is not traversed in the at least two routes as a second route to be determined whether to follow the routes at this time;
the synthesized path comprises a starting place and a destination of a first path which is determined to be an on-road last time, and a starting place and a destination of a second path which is determined to be an on-road last time.
Optionally, the obtaining the feature position according to the first path includes:
for any getting-on/off position, if the position of the getting-on/off position on the first path or the position of the getting-on/off position reaching the first path branch path meets a preset condition, taking the getting-on/off position as the characteristic position;
wherein the preset condition comprises at least one of the following conditions: the number of inflection points included in the branch path is less than a first threshold, and the path length of the branch path is less than a second threshold.
Optionally, the generating a fenced area includes:
and for any characteristic position, generating a circular area taking the any characteristic position as a center of a circle as a fence area.
Fig. 12 is a schematic physical structure diagram of an electronic device according to an embodiment of the present invention.
Wherein, this electronic equipment includes: the memory 1201, the processor 1202, the communication interface 1203 and the communication bus 1204, wherein the memory 1201, the processor 1202 and the communication interface 1203 are communicated with each other through the communication bus 1204. The processor 1202 may call logic instructions in the memory 1201 to perform the following method: acquiring a characteristic position according to a first path, wherein the characteristic position comprises an getting-on and getting-off position of a vehicle on and off in a time domain where the first path passes; generating fence areas, wherein each fence area comprises at least one characteristic position; and determining whether the second path and the first path follow the road through the generated fence area.
In addition, the logic instructions in the memory 1201 can be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units 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 several instructions for causing a terminal 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.
Further, an embodiment of the present invention discloses a computer program product, the computer program product comprising a computer program stored on a non-transitory readable storage medium, the computer program comprising program instructions, which when executed by a computer, the computer is capable of performing the method provided by the above-mentioned method embodiments, for example, including: acquiring a characteristic position according to a first path, wherein the characteristic position comprises an getting-on and getting-off position of a vehicle on and off in a time domain where the first path passes; generating fence areas, wherein each fence area comprises at least one characteristic position; and determining whether the second path and the first path follow the road through the generated fence area.
In another aspect, an embodiment of the present invention further provides a non-transitory readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of any of the method for matching a route according to the embodiments of the present invention.
A computer program is stored thereon, and when executed by a processor, the computer program is implemented to execute the transmission method provided by the above embodiments, for example, the computer program includes: acquiring a characteristic position according to a first path, wherein the characteristic position comprises an getting-on and getting-off position of a vehicle on and off in a time domain where the first path passes; generating fence areas, wherein each fence area comprises at least one characteristic position; and determining whether the second path and the first path follow the road through the generated fence area.
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 can clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform. Based on such understanding, the above technical solutions may be essentially or partially implemented in the form of software products, which may be stored in readable storage media, such as ROM/RAM, magnetic disk, optical disk, etc., and include several instructions for enabling a terminal 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 (9)
1. A method for matching a path, comprising:
acquiring a characteristic position according to the first path; the characteristic position comprises an getting-on and getting-off position, which is suitable for getting on and getting off, of the first path;
generating fence areas, wherein each fence area comprises at least one characteristic position;
determining whether a second path and the first path follow the road or not through the generated fence area;
wherein the determining whether the second path and the first path follow the path through the generated fence area comprises: if the two path end points are not in the generated fence area, determining whether the second path and the first path follow the path or not according to the first straight line, the second straight line and the generated fence area; the first straight line is determined according to the departure place of the second path and the destination of the first path, and the second straight line is determined according to the destination of the second path and the departure place of the first path; the two path end points are a starting point of the second path and a destination of the second path;
the determining whether the second path and the first path follow the path through the first straight line, the second straight line and the generated fence area includes:
for any one of the generated fence areas, if an intersection point exists between the fence area and the first straight line or the second straight line, taking the fence area as an intersected fence area;
and determining whether the second path and the first path are along according to the total number of the generated fence areas and the number of the crossed fence areas.
2. The method for matching a path following according to claim 1, wherein the determining whether the second path and the first path follow the path through the generated fence area further comprises:
if the two path end points of the second path are both in the generated fence area, the second path and the first path are in the same path;
and/or if a first path end point of the two path end points is in the generated fence area and a second path end point of the two path end points is not in the generated fence area, determining whether the second path and the first path follow the path or not through the second path end point, the generated fence area or the first path.
3. The method for matching a path following according to claim 2, wherein said determining whether the second path and the first path follow the path through the second path end point and the generated fence area comprises:
for any one generated fence area, acquiring a tangent line which passes through the end point of the second path and is tangent to the fence area, and determining the distance between the end point of the second path and the tangent point in the tangent line as the tangent line distance corresponding to the fence area;
and acquiring the shortest tangential distance from the tangential distances corresponding to the fence areas, and determining whether the second path and the first path follow the path or not according to the shortest tangential distance and the path length of the first path.
4. The method for matching a path following according to claim 2, wherein said determining whether the second path and the first path follow the path through the second path end point and the first path comprises:
if the second path endpoint is the departure point of the second path, acquiring the departure point distance between the second path endpoint and the departure point of the first path, and determining whether the second path and the first path follow the path according to the departure point distance and the path length of the first path;
and/or if the second path end point is the destination of the second path, acquiring the destination distance between the second path end point and the destination of the first path, and determining whether the second path and the first path follow the path according to the destination distance and the path length of the first path.
5. The method for matching a path profile according to claim 1, wherein before the obtaining the feature position according to the first path, the method further comprises:
acquiring at least two paths to be determined whether to follow the road, executing path determination operation each time to acquire a first path and a second path to be determined whether to follow the road at this time until each path of the at least two paths is traversed;
wherein the path determination operation comprises:
when the method is executed for the first time, the longest path in the at least two paths is taken as a first path for determining whether to follow the path at this time, and any path which is not traversed in the at least two paths is taken as a second path for determining whether to follow the path at this time;
when the route is not executed for the first time, generating a synthetic route according to a first route and a second route which are determined to be the following routes for the last time, taking the generated synthetic route as a first route to be determined whether to follow the routes at this time, and taking any route which is not traversed in the at least two routes as a second route to be determined whether to follow the routes at this time;
the synthesized path comprises a starting place and a destination of a first path which is determined to be an on-road last time, and a starting place and a destination of a second path which is determined to be an on-road last time.
6. The method for matching a path following according to claim 1, wherein the obtaining a feature position according to a first path includes:
for any getting-on/off position, if the position of the getting-on/off position on the first path or the position of the getting-on/off position reaching the first path branch path meets a preset condition, taking the getting-on/off position as the characteristic position;
wherein the preset condition comprises at least one of the following conditions: the number of inflection points included in the branch path is less than a first threshold, and the path length of the branch path is less than a second threshold.
7. The method for matching a path profile according to claim 1, wherein the generating a fence area comprises:
and for any characteristic position, generating a circular area taking the any characteristic position as a center of a circle as a fence area.
8. 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 implements the steps of the path-following matching method according to any one of claims 1 to 7 when executing the program.
9. A non-transitory readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for matching a path profile according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918439.8A CN111815080B (en) | 2020-09-04 | 2020-09-04 | Path forward matching method, electronic device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010918439.8A CN111815080B (en) | 2020-09-04 | 2020-09-04 | Path forward matching method, electronic device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111815080A CN111815080A (en) | 2020-10-23 |
| CN111815080B true CN111815080B (en) | 2020-12-08 |
Family
ID=72859962
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010918439.8A Active CN111815080B (en) | 2020-09-04 | 2020-09-04 | Path forward matching method, electronic device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111815080B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113764087B (en) * | 2021-08-26 | 2024-03-15 | 南京天溯自动化控制***有限公司 | Hospital material distribution method, device, server and storage medium |
| CN114822046B (en) * | 2022-04-07 | 2023-04-28 | 青岛海信网络科技股份有限公司 | Short-distance taxi management method, device and apparatus |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104268147A (en) * | 2014-08-23 | 2015-01-07 | 李全波 | Method for realizing network map functions of private car carpooling system |
| CN105243836A (en) * | 2015-10-14 | 2016-01-13 | 深圳市十方联智科技有限公司 | Carpooling method and device |
| CN107564271A (en) * | 2017-09-14 | 2018-01-09 | 厦门信息港建设发展股份有限公司 | The share-car method of one species public transport |
| CN111199451A (en) * | 2018-11-20 | 2020-05-26 | 现代自动车株式会社 | Car sharing service system and car sharing service method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150254581A1 (en) * | 2014-03-04 | 2015-09-10 | iCarpool, Inc. | Rideshare system and method to facilitate instant carpooling |
-
2020
- 2020-09-04 CN CN202010918439.8A patent/CN111815080B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104268147A (en) * | 2014-08-23 | 2015-01-07 | 李全波 | Method for realizing network map functions of private car carpooling system |
| CN105243836A (en) * | 2015-10-14 | 2016-01-13 | 深圳市十方联智科技有限公司 | Carpooling method and device |
| CN107564271A (en) * | 2017-09-14 | 2018-01-09 | 厦门信息港建设发展股份有限公司 | The share-car method of one species public transport |
| CN111199451A (en) * | 2018-11-20 | 2020-05-26 | 现代自动车株式会社 | Car sharing service system and car sharing service method |
Non-Patent Citations (1)
| Title |
|---|
| Uroad：一种高效的大规模多对多拼车匹配算法;曹斌 等;《计算机研究与发展》;20191231;第866-883页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111815080A (en) | 2020-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104464274B (en) | Rideshare is called a taxi method and server | |
| CN105243836B (en) | A kind of share-car method and apparatus | |
| CN105387864B (en) | Path planning device and method | |
| CN112419706B (en) | Real-time single processing method and server | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN111815080B (en) | Path forward matching method, electronic device and storage medium | |
| CN109615887A (en) | Wisdom traffic network system signal guidance method | |
| CN106940928A (en) | Order allocation method and device | |
| CN107238393A (en) | It is a kind of to be gone on a journey Intelligent planning method based on shared economic personnel | |
| TWI550534B (en) | System for matching users and a method thereof | |
| CN112542043B (en) | Method and system for identifying bus net coverage blind area based on mobile phone signaling and big data analysis | |
| CN110398254B (en) | Method and system for relieving traffic congestion | |
| CN103578287B (en) | Vehicle dispatching system and vehicle dispatching method | |
| CN102346041B (en) | Route planning method and service equipment based on real-time road condition | |
| CN107844842A (en) | One kind uses car order processing method and server | |
| CN110375762B (en) | Method and device for assisting in planning navigation path | |
| CN111366166B (en) | Navigation path planning method and device | |
| WO2022193995A1 (en) | Map updating method, and map-based driving decision-making method and apparatus | |
| CN113532459A (en) | Predictive navigation route planning method and system | |
| CN106885581A (en) | A kind of method for path navigation for vehicle | |
| CN113408903A (en) | Order processing method and device, electronic equipment and readable storage medium | |
| CN102305633A (en) | Vehicle navigation system for re-optimizing paths by considering multiple terminal paths | |
| CN107610498A (en) | A kind of automobile trip of city traffic peak period automatically selects route methods | |
| CN112529338A (en) | Method for calculating degree of forward road | |
| CN112945253A (en) | Travel route recommendation method, system and device |
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 |