A path planning method, device and equipment

By dividing the target area into sub-regions and marking it according to the number of passengers, the path that is most likely to be successful in carpooling is solved, and the problem of long driving time is achieved to take into account both the success rate and driving efficiency of carpooling.

CN114719876BActive Publication Date: 2024-11-05CHANGRAN ZHIXIANG (NINGXIA) NEW ENERGY TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210282066.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-22
Publication Date
2024-11-05
Estimated Expiration
2042-03-22

AI Technical Summary

Technical Problem

Carpooling usually takes longer to drive, resulting in the benefits of favorable prices not being fully reflected.

Method used

Divide the target area into several sub-regions, and mark it according to the number of passengers in the sub-regions to obtain the current location and destination of online car-hailing, divide the paths into fast sets and dense sets, and select the path that is most likely to be successful in carpooling.

Benefits of technology

It improves the probability of successful carpooling, while taking into account the efficiency of driving time, ensuring the economical and convenient travel of online car-hailing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114719876B_ABST
    Figure CN114719876B_ABST
Patent Text Reader

Abstract

The present invention discloses a path planning method, device and equipment, wherein the path planning method comprises the following steps: S1: dividing a target area into several sub-areas; S2: counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result; S3: obtaining the current position and current destination of the online car-hailing vehicle, and obtaining several first paths from the current position of the online car-hailing vehicle to the current destination; S4: dividing each first path into at least two sets according to the first element and / or the second element of each first path; S5: selecting a set as a target set according to the marks of the first sub-area and the second sub-area, and selecting the first path in the target set as the target path. When the present invention is used for path planning of carpooling in online car-hailing vehicles, it has the beneficial effect of taking into account the probability of successful carpooling and the driving time.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of path planning, and in particular to a path planning method, device and equipment. Background Art

[0002] At present, people often choose online ride-hailing as a means of travel. Online ride-hailing includes express, carpooling and hitchhiking. Among them, carpooling has the benefit of preferential prices, but on the other hand, the travel time of carpooling is usually longer.

[0003] In view of this, the present invention is proposed. Summary of the invention

[0004] The present invention proposes a path planning method, device and equipment for path planning of carpooling in online car-hailing.

[0005] In order to achieve the above object, the present invention adopts the following technical solutions:

[0006] A path planning method comprises the following steps:

[0007] S1: Divide the target area into several sub-areas;

[0008] S2: Counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result, wherein the number of first passengers in the sub-area is the number of passengers taking the sub-area as the destination;

[0009] S3: Obtain the current location and current destination of the online car-hailing vehicle, and obtain a plurality of first paths from the current location of the online car-hailing vehicle to the current destination;

[0010] S4: Divide each first path into at least two sets according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path;

[0011] S5: Select a set as a target set according to the marks of the first sub-area and the second sub-area, and select the first path in the target set as the target path, the first sub-area is the sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area.

[0012] Furthermore, S1 is to divide the target area into several sub-areas according to functions.

[0013] Furthermore, the S2 includes: S21: dividing 0-24 o'clock into several time periods; S22: when the time period ends, counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result.

[0014] Furthermore, the marking of the sub-region includes a sparse visitor region and a dense visitor region.

[0015] Further, S2 includes: S23: presetting a quantity threshold; S24: counting the number of first passengers in each sub-area, marking the sub-area where the number of first passengers is less than or equal to the quantity threshold as a sparsely populated area, and marking the sub-area where the number of first passengers is greater than the quantity threshold as a densely populated area.

[0016] Further, S2 includes: S25: counting the number of first passengers in each sub-area, and arranging each sub-area according to the number of first passengers; S26: marking several sub-areas with the smallest number of first passengers as sparsely populated areas, and marking the remaining sub-areas as densely populated areas.

[0017] Furthermore, the S4 is to divide each first path into a fast set and a guest dense set according to the first element and / or the second element of each first path.

[0018] Further, S5 includes: S51: when any sub-region of the first sub-region and the second sub-region is a guest-dense area, selecting a guest-dense set as a target set; when the first sub-region and the second sub-region are both guest-sparse areas, selecting a fast set as a target set; S52: selecting a first path in the target set as a target path.

[0019] A path planning device, comprising:

[0020] A first division module, used for dividing the target area into a plurality of sub-areas;

[0021] a marking module, used for counting the number of first passengers in each sub-area and marking each sub-area according to the statistical result, wherein the number of first passengers in the sub-area is the number of passengers with the sub-area as the destination;

[0022] An acquisition module, used to acquire the current location and current destination of the online car-hailing vehicle, and acquire a plurality of first paths from the current location of the online car-hailing vehicle to the current destination;

[0023] A second division module, configured to divide each first path into at least two sets according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path;

[0024] A selection module is used to select a set as a target set according to the marks of the first sub-area and the second sub-area, and select the first path in the target set as the target path, wherein the first sub-area is the sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area.

[0025] A path planning device, comprising:

[0026] GPS module;

[0027] Display module;

[0028] Speaker module;

[0029] processor;

[0030] Memory;

[0031] and one or more computer programs;

[0032] Wherein the one or more computer programs are stored in the memory, and the one or more computer programs include instructions, and when the instructions are executed by the path planning device, the path planning device executes the path planning method provided by the present invention.

[0033] Compared with the prior art, the present invention has the following beneficial effects: first, the target area is divided into several sub-areas, and each sub-area is marked; second, each first path is divided into at least two sets; third, a set is selected as the target set according to the marks of the first sub-area and the second sub-area, and the first path in the target set is selected as the target path. Specifically, if any of the first sub-area and the second sub-area is a passenger-dense area, it means that more passengers choose the sub-area where the current destination is located or the sub-area adjacent to the sub-area where the current destination is located as the destination in the previous time period, and then it means that the current travel has a greater chance of successful carpooling, so the passenger-dense set is selected as the target set, and the first path in the target set is selected as the target path to ensure the probability of successful carpooling; if the first sub-area and the second sub-area are both passenger-sparse areas, it means that fewer passengers choose the sub-area where the current destination is located and the sub-area adjacent to the sub-area where the current destination is located as the destination in the previous time period, and then it means that the current travel has a lower chance of successful carpooling, so the fast set is selected as the target set, and the first path in the target set is selected as the target path to ensure the speed of travel. In summary, when the present invention is used for route planning of carpooling in online car-hailing, it has the beneficial effect of taking into account both the probability of successful carpooling and the driving time. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 is a flow chart of a path planning method in an embodiment;

[0035] Figure 2 A schematic diagram of dividing a target area into sub-areas in an embodiment;

[0036] Figure 3 Schematic diagram of a path planning device in an embodiment. DETAILED DESCRIPTION

[0037] The following will be combined with the accompanying drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. The fixed connection in this embodiment can be completed by welding, bonding, screws or interference fit.

[0038] Embodiment 1:

[0039] A path planning method, such as Figure 1 As shown, the following steps are included:

[0040] S1: Divide the target area into several sub-areas.

[0041] In this embodiment, the target area may be the range covered by a certain city, such as determining the range covered by cities such as Shanghai and Beijing as the target area.

[0042] In this embodiment, the target area can be divided into several sub-areas according to functions, such as the functions of residence, shopping, business, etc. Figure 2 As shown, the target area is composed of several sub-areas with residential functions, several sub-areas with shopping functions, and several sub-areas with business functions.

[0043] S2: Count the number of first passengers in each sub-area, and mark each sub-area according to the statistical result. The number of first passengers in the sub-area is the number of passengers with the sub-area as the destination.

[0044] In this embodiment, S1 and S2 divide the target area into several sub-areas, and at the end of the time period, mark each sub-area according to the number of the first passengers in each sub-area. The purpose of these two steps is to select different paths for navigation according to the different markings of the sub-areas.

[0045] In this embodiment, when implemented specifically, the S2 may include: S21: divide 0-24 o'clock into several time periods; S22: when the time period ends, count the number of first passengers in each sub-area, and mark each sub-area according to the statistical result. In an illustrative embodiment, 0-24 o'clock is divided into 24 time periods, each time period is 1 hour long, and the hour is the end time of each time period. Every hour, that is, the end time of a time period, count the number of first passengers in each area, and mark each sub-area according to the statistical result. Specifically, every hour, the mark of each sub-area is updated according to the number of first passengers in each sub-area in the previous hour.

[0046] In this embodiment, during specific implementation, the marking of sub-areas may include sparsely populated areas and densely populated areas. At the end of a certain time period, if the number of first passengers in a sub-area is large during the time period, it means that more passengers choose places within the sub-area as their destinations during the time period. At this time, the sub-area is marked as a densely populated area, otherwise it is marked as a sparsely populated area.

[0047] In this embodiment, during specific implementation, the following method can be used to mark the sub-areas: S23: preset a quantity threshold; S24: count the number of first passengers in each sub-area, mark the sub-area where the number of first passengers is less than or equal to the quantity threshold as a sparsely populated area, and mark the sub-area where the number of first passengers is greater than the quantity threshold as a densely populated area.

[0048] In this embodiment, during specific implementation, the following method can also be used to mark the sub-areas: S25: count the number of first passengers in each sub-area, and arrange the sub-areas according to the number of first passengers; S26: mark several sub-areas with the smallest number of first passengers as sparsely populated areas, and mark the remaining sub-areas as densely populated areas.

[0049] S3: Obtain the current location and current destination of the online-hailing vehicle, and obtain several first paths from the current location of the online-hailing vehicle to the current destination.

[0050] In this embodiment, the current location refers to the current location of the online car-hailing vehicle, which can be obtained through the GPS module; the current destination refers to the destination that the online car-hailing vehicle is currently going to. The method of this embodiment is applied to carpooling in online car-hailing vehicles. There may be multiple passengers in the carpooling vehicle, that is, there will be multiple destinations. In the prior art, the carpooling vehicle will determine one of the destinations as the current destination to be reached based on the specific locations of the multiple destinations, so this process will not be repeated.

[0051] In this embodiment, the navigation technology in the prior art may be used to obtain a plurality of first paths from the current location to the current destination, so the process will not be described in detail.

[0052] In this embodiment, a time interval may be preset, and when a time interval ends, the current position of the online-hailing vehicle is updated, and the first path is updated, that is, S3-S5 is repeatedly executed at the end of each time interval.

[0053] S4: Divide each first path into at least two sets according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path.

[0054] In this embodiment, S3 and S4 obtain several first paths from the current location of the online car-hailing vehicle to the current destination, and divide the several first paths. The purpose of these two steps is to select the first paths in different sets for navigation according to the different markings of the sub-areas.

[0055] In this embodiment, during specific implementation, in S4, each first path may be divided into a fast set and a guest dense set according to the first element and / or the second element of each first path.

[0056] In this embodiment, after determining several first paths in S3, the navigation technology in the prior art can be used to obtain the estimated time of each first path. In specific implementation, when the estimated time of a first path is short, the first path can be divided into a fast set, otherwise it can be divided into a guest-dense set. It can be seen that the first path in the fast set in this embodiment has a faster driving speed.

[0057] In this embodiment, after determining several first paths in S3, the sub-areas passed by each first path can be determined, and then the number of guest-dense sub-areas passed by each first path can be determined. When the number of guest-dense sub-areas passed by a first path is large, the first path can be divided into a guest-dense set, otherwise it can be divided into a fast set. It can be seen that the first path in the guest-dense set in this embodiment has a greater possibility of successful carpooling.

[0058] S5: Select a set as a target set according to the marks of the first sub-area and the second sub-area, and select the first path in the target set as the target path, the first sub-area is the sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area.

[0059] In this embodiment, when implemented specifically, the S5 may include: S51: when any sub-area of ​​the first sub-area and the second sub-area is a guest-dense area, select the guest-dense set as the target set; when the first sub-area and the second sub-area are both guest-sparse areas, select the fast set as the target set; S52: select the first path in the target set as the target path.

[0060] In this embodiment, if any of the first sub-area and the second sub-area is a passenger-dense area, it means that in the previous time period, more passengers chose the sub-area where the current destination is located or a place in the sub-area adjacent to the sub-area where the current destination is located as the destination, which further indicates that the current trip has a greater possibility of successful carpooling. Therefore, the passenger-dense set is selected as the target set, and the first path in the target set is selected as the target path to ensure the probability of successful carpooling.

[0061] In this embodiment, if the first sub-area and the second sub-area are both sparsely populated areas, it means that fewer passengers chose the sub-area where the current destination is located and the places in the sub-area adjacent to the sub-area where the current destination is located as their destinations in the previous time period, which further indicates that the current travel has a low possibility of successful carpooling. Therefore, the quick set is selected as the target set, and the first path in the target set is selected as the target path to ensure the travel time.

[0062] Embodiment 2:

[0063] A path planning device, such as Figure 3 As shown, including:

[0064] A first division module, used for dividing the target area into a plurality of sub-areas;

[0065] a marking module, used for counting the number of first passengers in each sub-area and marking each sub-area according to the statistical result, wherein the number of first passengers in the sub-area is the number of passengers with the sub-area as the destination;

[0066] An acquisition module, used to acquire the current location and current destination of the online car-hailing vehicle, and acquire a plurality of first paths from the current location of the online car-hailing vehicle to the current destination;

[0067] A second division module, configured to divide each first path into at least two sets according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path;

[0068] A selection module is used to select a set as a target set according to the marks of the first sub-area and the second sub-area, and select the first path in the target set as the target path, wherein the first sub-area is the sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area.

[0069] Embodiment three:

[0070] A path planning device includes: a GPS module, a display module, a speaker module, a processor, a memory, and one or more computer programs. In specific implementation, the path planning device can be an intelligent terminal, such as a mobile phone, which is equipped with a GPS module, a display module, a speaker module, a processor, a memory, and one or more computer programs.

[0071] The one or more computer programs are stored in the memory, and the one or more computer programs include instructions. When the instructions are executed by the path planning device, the path planning device executes the path planning method described in Example 1.

[0072] The GPS module is used to obtain the current location of the online car-hailing vehicle; the display module is used to display the target path; and the speaker module is used to voice broadcast the target path.

[0073] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can make equivalent replacements or changes according to the technical scheme and inventive concept of the present invention within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A path planning method, It is characterized in that The steps include: S1: Divide the target area into several sub-areas; S2: Counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result, wherein the number of first passengers in the sub-area is the number of passengers taking the sub-area as the destination; S3: Obtain the current location and current destination of the online car-hailing vehicle, and obtain a plurality of first paths from the current location of the online car-hailing vehicle to the current destination; S4: Divide each first path into at least two sets according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path; S5: selecting a set as a target set according to the marks of the first sub-area and the second sub-area, and selecting a first path in the target set as a target path, wherein the first sub-area is a sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area; Among them, the markings of the sub-areas include a sparse guest area and a dense guest area; the S4 is to divide each first path into a fast set and a dense guest set according to the first element and / or the second element of each first path; the S5 includes: S51: when any sub-area of ​​the first sub-area and the second sub-area is a dense guest area, the dense guest set is selected as the target set, and when the first sub-area and the second sub-area are both sparse guest areas, the fast set is selected as the target set; S52: select the first path in the target set as the target path.

2. The path planning method according to claim 1, It is characterized in that The S1 is to divide the target area into several sub-areas according to functions.

3. The path planning method according to claim 1, It is characterized in that The S2 includes: S21: dividing 0-24 o'clock into several time periods; S22: when the time period ends, counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result.

4. The path planning method according to claim 1, It is characterized in that The S2 includes: S23: presetting a quantity threshold; S24: counting the number of first passengers in each sub-area, marking the sub-area where the number of first passengers is less than or equal to the quantity threshold as a sparsely populated area, and marking the sub-area where the number of first passengers is greater than the quantity threshold as a densely populated area.

5. The path planning method according to claim 1, It is characterized in that The S2 includes: S25: counting the number of first passengers in each sub-area, and arranging each sub-area according to the number of first passengers; S26: marking several sub-areas with the smallest number of first passengers as sparse passenger areas, and marking the remaining sub-areas as dense passenger areas.

6. A path planning device, It is characterized in that include: A first division module, used for dividing the target area into a plurality of sub-areas; A marking module, used for counting the number of first passengers in each sub-area, and marking each sub-area according to the statistical result, wherein the marking of the sub-area includes a sparse passenger area and a dense passenger area, and the number of first passengers in the sub-area is the number of passengers with the sub-area as the destination; An acquisition module, used to acquire the current location and current destination of the online car-hailing vehicle, and acquire a plurality of first paths from the current location of the online car-hailing vehicle to the current destination; A second division module, configured to divide each first path into a fast set and a guest dense set according to a first element and / or a second element of each first path, wherein the first element is an estimated time of the first path, and the second element is a mark of a sub-area passed by the first path; A selection module is used to select a set as a target set according to the marks of the first sub-area and the second sub-area, select the guest-dense set as the target set when any of the first sub-area and the second sub-area is a guest-dense area, select the fast set as the target set when both the first sub-area and the second sub-area are guest-sparse areas, and select the first path in the target set as the target path, the first sub-area is the sub-area where the current destination is located, and the second sub-area is a sub-area adjacent to the first sub-area.

7. A path planning device, It is characterized in that include: GPS module; Display module; Speaker module; processor; Memory; and one or more computer programs; The one or more computer programs are stored in the memory, and the one or more computer programs include instructions, which, when executed by the path planning device, enable the path planning device to execute the path planning method as described in any one of claims 1 to 5.