Dynamic transfer path planning system and method based on multiple public transport modes

Abstract

The invention belongs to the technical field of path planning, and provides a dynamic transfer path planning system and method based on multiple public transport modes, and the main scheme is as follows: obtaining a navigation request instruction from installed navigation software through a client; acquiring initial planning path information in response to the navigation request instruction through the first server, and extracting first transfer intermediate node information in response to the navigation request instruction from the initial planning path information; receiving the first transfer intermediate node information through a second server, and dynamically correcting the first transfer intermediate node information based on historical planning path information of other manufacturer software except the current manufacturer navigation software; generating second transfer intermediate node information after dynamic correction, and generating final path planning information in response to the current navigation request instruction based on the second transfer intermediate node information; and sending the final path planning information in response to the current navigation request instruction to the client.

Description

Technical Field

[0001] The present invention relates to the technical field of path planning, and particularly to a dynamic transfer path planning system and method based on multiple public transportation modes. Background Art

[0002] Currently, when a user performs navigation through a navigation software on a client, the path planning work is generally completed by the server of the corresponding manufacturer. Although different manufacturers will set up separate servers to complete the path planning work, even for a separately set server, during the path planning process, in order to accurately complete the path calculation work between the departure place and the destination, it is not only necessary to receive the navigation request instructions of the client installed with the navigation software in real time, but also necessary to receive real-time public transportation data and real-time meteorological data, etc. Therefore, for the server, its computing pressure will fluctuate greatly with the increase in the frequency of users using the navigation software and the dynamic change characteristics of public transportation data and meteorological data. Especially during holidays or peak commuting hours, users' requirements for navigation accuracy and timeliness are more urgent, resulting in a further increase in the computing pressure and data synchronization pressure of the server.

[0003] Moreover, when a user uses a navigation software for navigation, in many cases, multiple types of public transportation modes need to cooperate with each other to complete the path planning work of the server. Therefore, how to accurately and timely complete the path planning work has always been a technical problem faced by the servers of each manufacturer. Summary of the Invention

[0004] The purpose of the present invention is to provide a dynamic transfer path planning system and method based on multiple public transportation modes, which can cooperate with a first server and a second server to jointly complete accurate and timely dynamic path planning work under the participation of multiple types of public transportation modes.

[0005] To solve its technical problems, the present invention adopts the following technical solutions: On the one hand, the present invention provides a dynamic transfer path planning system based on multiple public transportation modes, including: A client, installed with a navigation software, for obtaining navigation request instructions from the navigation software, and for obtaining the final path planning information in response to the current navigation request instructions from the second server; A first server, storing historical planned path information of the current manufacturer's navigation software, for receiving navigation request instructions of the client where the corresponding manufacturer's navigation software is located, obtaining initial planned path information in response to the navigation request instructions, and extracting first transfer intermediate node information in response to the navigation request instructions from the initial planned path information; The second server stores the historical planned path information of all manufacturers' navigation software, and is used to dynamically correct the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software. After dynamic correction, the second transfer intermediate node information is generated, and the final path planning information in response to the current navigation request instruction is generated based on the second transfer intermediate node information.

[0006] As a further optimization, after the first server receives the navigation request instruction from the client where the corresponding manufacturer's navigation software is located, it further includes: The first server determines whether it is the first time to receive the navigation request instruction sent by the client; If so, forward the navigation request instruction to the second server, and the second server directly generates the final path planning information in response to the current navigation request instruction based on the navigation request instruction. The second server synchronizes the final path planning information to the first server corresponding to the corresponding manufacturer's navigation software, and forwards it to the client through the first server; Otherwise, obtain the initial planned path information in response to the navigation request instruction.

[0007] As a further optimization, the first server also stores the first identification information of the corresponding manufacturer's navigation software; When the first server receives the navigation request instruction sent by the client, it determines whether the navigation request instruction contains the first identification information. When it contains, obtain the initial planned path information in response to the navigation request instruction, otherwise send a prompt message to the client.

[0008] As a further optimization, the navigation request instruction contains the user's starting point location information and destination information.

[0009] As a further optimization, the first server obtains the initial planned path information in response to the navigation request instruction, which means: The first server obtains the first type of public transportation stations and the first location information within the first specified distance from the user's starting point location information, and calculates the first time for the user to walk or ride from the starting point to the first location of each first type of public transportation station; Obtain the second type of public transportation stations and the second location information within the second specified range from the user's destination information, and determine whether there are public transportation stations in the second type that can be directly transferred and coincide with the first type. If so, calculate the second time for the user to walk or ride from the coincident type of public transportation station to the destination; Based on the principle that the sum of the first time and the second time is the smallest, plan the initial planned path information for the navigation request instruction.

[0010] As a further optimization, if it is determined that there is no public transportation station in the second type that can be directly transferred and coincides with the first type, then obtain the public transportation stations of the second type that are transferred after getting off the station after traveling through the public transportation stations of the first type, and calculate the third time for the user to transfer from the public transportation stations of the first type to the public transportation stations of the second type; Based on the principle of the minimum sum of the first time, the second time, and the third time, plan the initial planned path information for the navigation request instruction.

[0011] As a further optimization, the first transfer intermediate node information extracted from the initial planned path information in response to the navigation request instruction refers to: If the initial planned path information is planned based on the principle of the minimum sum of the first time and the second time, then obtain the third position information in the public transportation stations of the first type for directly transferring with the public transportation stations of the second type, and the fourth position information in the public transportation stations of the second type for directly transferring with the public transportation stations of the first type, and use the third position information and the fourth position information as the first transfer intermediate node information; If the initial planned path information is planned based on the principle of the minimum sum of the first time, the second time, and the third time, then obtain the fifth position information in the public transportation stations of the first type for transferring with the public transportation stations of the second type after getting off the station, and the sixth position information in the public transportation stations of the second type for transferring with the public transportation stations of the first type, and use the fifth position information and the sixth position information as the first transfer intermediate node information.

[0012] As a further optimization, before the second server dynamically corrects the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software, it also includes: The client determines whether the navigation request instruction is obtained from a single navigation software. If so, the client assigns the second identification information to the navigation request instruction and sends the navigation request instruction assigned with the second identification information to the first server; When the first server extracts the first transfer intermediate node information in response to the navigation request instruction, set the second identification information in the first transfer intermediate node information and send it to the second server; Otherwise, the client assigns the third identification information to the navigation request instruction and sends the navigation request instruction assigned with the third identification information to the first server; When the first server extracts the first transfer intermediate node information in response to the navigation request instruction, set the third identification information in the first transfer intermediate node information and send it to the second server.

[0013] As a further optimization, when the second server receives the first transfer intermediate node information, the dynamic correction of the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software means: If the second identification information is set in the first transfer intermediate node information, then: The second server calls the historical planned path information of other manufacturers' software except the current manufacturer's navigation software that has been stored, corrects the third position information, the fourth position information, the fifth position information, and the sixth position information, and adjusts the sum of the calculated first time and the second time or the sum of the first time, the second time, and the third time according to the corrected position information; If the third identification information is set in the first transfer intermediate node information, then: The second server notifies the first server to obtain the real-time public transportation operation information of all manufacturers' navigation software. The second server updates the historical planned path information based on the real-time public transportation operation information obtained by all manufacturers' navigation software, and based on the updated historical planned path information of other manufacturers' software except the current manufacturer's navigation software, corrects the third position information, the fourth position information, the fifth position information, and the sixth position information, and adjusts the sum of the calculated first time and the second time or the sum of the first time, the second time, and the third time according to the corrected position information.

[0014] On the other hand, the present invention also provides a dynamic transfer path planning method based on multiple public transportation modes applied to the dynamic transfer path planning system based on multiple public transportation modes, including the following steps: Obtain a navigation request instruction from the installed navigation software through the client; Receive the navigation request instruction of the client where the corresponding manufacturer's navigation software is located through the first server, obtain the initial planned path information in response to the navigation request instruction, and extract the first transfer intermediate node information in response to the navigation request instruction from the initial planned path information; Receive the first transfer intermediate node information through the second server, and dynamically correct the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software; Generate the second transfer intermediate node information after dynamic correction, and generate the final path planning information in response to the current navigation request instruction based on the second transfer intermediate node information; Send the final path planning information in response to the current navigation request instruction to the client.

[0015] The beneficial effects of the present invention are as follows: The present invention abandons the traditional method of path planning for the navigation software of corresponding manufacturers by a single server only. Instead, based on the categories of manufacturers of the navigation software installed on the client side, for the navigation software of the same manufacturer category, the corresponding server completes the preliminary path planning work. Since the preliminary path planning work is based on historical planned path information and does not require obtaining real-time data from the public transportation system or the meteorological system every time a navigation request instruction is received, therefore, the data calculation pressure of the traditional path planning work using the first server is reduced, and there is no time delay in synchronizing public transportation data or meteorological data. At the same time, the present invention also sets up a second server and stores the historical planned path information of all manufacturers' navigation software through the second server to complete the dynamic correction work of the initial planned path information, which can not only solve the problem of data non-interoperability between different manufacturers' servers but also further improve the accuracy of the path planning work. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 FIG. is a schematic diagram of the composition structure of the dynamic transfer path planning system based on multiple public transportation modes in the first embodiment of the present invention; Figure 2 FIG. is a flowchart of the dynamic transfer path planning method based on multiple public transportation modes in the second embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0017] To make the objectives, 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 in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Usually, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0018] Embodiment 1 What this embodiment provides is a dynamic transfer path planning system based on multiple public transportation modes. The schematic diagram of its composition structure is shown in Figure 1 , where the system consists of the following parts: Client, installed with navigation software, used to obtain navigation request instructions from the navigation software and obtain the final path planning information in response to the current navigation request instruction from the second server; First server, storing the historical planned path information of the current manufacturer's navigation software, used to receive the navigation request instruction of the client where the corresponding manufacturer's navigation software is located, obtain the initial planned path information in response to the navigation request instruction, and extract the first transfer intermediate node information in response to the navigation request instruction from the initial planned path information; The second server stores historical planned path information of all manufacturers' navigation software, and is used to dynamically correct the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software. After dynamic correction, the second transfer intermediate node information is generated, and the final path planning information in response to the current navigation request instruction is generated based on the second transfer intermediate node information.

[0019] In this embodiment, due to the personalized usage requirements of users, multiple types of manufacturers' navigation software may be downloaded and installed in the client. And even if the user will use the navigation software of a preferred manufacturer to complete the navigation work in most cases, however, under the condition that the navigation software responds slowly or the path planning information is significantly deviated, the user may also use other manufacturers' navigation software in the client for navigation. By comprehensively comparing multiple manufacturers' navigation software and finally selecting the required navigation result. Therefore, in this embodiment, referring to Figure 1 , assuming that navigation software 1, navigation software 2, and even navigation software 3 are installed in the client, all of which can reasonably exist based on user needs. Under this condition, different manufacturers' navigation software generally configures corresponding first servers 1, first servers 2, and first servers n to manage the navigation software data storage and data calculation work under the corresponding manufacturer types.

[0020] It should be noted that after the user completes the download and installation of the navigation software through the client, the user may repeat the use of the same navigation software for navigation based on usage habits. Currently, for most navigation software, once used, many navigation software will be equipped with local historical search data recording work. However, after the navigation software is downloaded and installed, if it has not been used, the traditional approach is that as long as the navigation request instruction from the client is received, the corresponding first server will be directly used to complete the path planning work. However, under this condition, the first server can only retrieve the historical navigation data under the current manufacturer type and needs to synchronously obtain at least the real-time public transportation data of the public transportation system to complete the accurate path planning work. Therefore, there will be a large delay in the traditional path planning work and there may be problems with inaccurate path planning information. Therefore, in this embodiment, if the first server receives the navigation request instruction sent by the client for the first time, the path planning work will not be completed through the first server, but through the second server. Since the second server stores the historical planned path information of all manufacturers' navigation software, all manufacturers' historical planned path information can be directly retrieved for accurate and timely path planning work.

[0021] Therefore, in this embodiment, after the first server receives the navigation request instruction of the client where the corresponding manufacturer's navigation software is located, it may further include: The first server determines whether it is the first time to receive a navigation request instruction sent by the client; If so, forward the navigation request instruction to the second server. The second server directly generates the final path planning information in response to the current navigation request instruction based on the navigation request instruction. The second server synchronizes the final path planning information to the first server corresponding to the navigation software of the corresponding manufacturer, and forwards it to the client through the first server; Otherwise, obtain the initial planned path information in response to the navigation request instruction.

[0022] Generally speaking, the server's verification work on the legality and security of the request instruction is completed by whether the unique identifier of the client has been registered and authenticated with the server in advance. However, for the client on which the navigation software is installed, due to the increasingly common low adaptability requirements for downloading and installing navigation software, not only can smartphones be directly downloaded and used as clients, but also for other intelligent terminals, such as smart watches, many smart watches can directly download and install navigation software of many manufacturers. Therefore, in order to improve the legality and security of the source of the navigation request instruction, in this embodiment, for the first server, it no longer uses the traditional method of verifying the security of the navigation request instruction through the unique identifier of the client, but verifies the legality and security of the source of the navigation request instruction through the identifier of the navigation software. Therefore, in this embodiment, the first server also stores the first identifier information of the corresponding manufacturer's navigation software; When the first server receives a navigation request instruction sent by the client, it determines whether the navigation request instruction contains the first identifier information. If it contains, obtain the initial planned path information in response to the navigation request instruction, otherwise send a prompt message to the client.

[0023] Here, after the first server sends a prompt message to the client, the user can reselect the required navigation request instruction.

[0024] In the specific application process, whether the user's navigation request preference is the shortest distance, the minimum cost, or the shortest time, the user needs to edit the starting point location information and the destination information in the navigation request instruction. Therefore, in this embodiment, the navigation request instruction should at least include the user's starting point location information and the destination information.

[0025] It should be noted that when the user inputs a navigation request instruction using the client, their location is not fixed. In some cases, they are inside a bus stop or subway station. In other cases, there is a certain distance from the bus stop or subway station, and they need to walk or ride a bicycle before they can reach the corresponding public transportation station. Moreover, the user's destination may also be at a certain distance from the alighting station. Therefore, in this situation, the user needs to spend a relatively long time to complete walking or scanning the code to ride a bicycle. Therefore, in this embodiment, the first server obtaining the initial planned path information in response to the navigation request instruction may refer to: The first server obtains the first type of public transportation station and the first location information within the first specified distance from the user's starting point location information, and calculates the first time for the user to walk or ride a bicycle from the starting point to the first location of each first type of public transportation station; According to the user's destination information, obtain the second type of public transportation station and the second location information within the second specified range, and determine whether there is a public transportation station in the second type that can be directly transferred and coincides with the first type. If so, calculate the second time for the user to walk or ride a bicycle from the coincident type of public transportation station to the destination; Based on the principle of the minimum sum of the first time and the second time, plan the initial planned path information for the navigation request instruction.

[0026] For the principle of the minimum sum of the first time and the second time, the basis set in this embodiment is public transportation stations of the same type, such as transferring at the same subway station. Under this condition, the user often needs to spend a relatively long time to complete walking or riding a bicycle outside the subway station.

[0027] In addition, there is also a situation where the first type of public transportation station is a subway station, the second type of public transportation station is a bus station, and after passing through the subway first, it is necessary to walk out of the subway station halfway and then walk or ride a bicycle to a nearby bus station for transfer after getting off the subway. In this case, the user also needs to spend a relatively long time during the transfer process between the two public transportation methods. Therefore, in this embodiment, if it is determined that there is no public transportation station in the second type that can be directly transferred and coincides with the first type, obtain the second type of public transportation station for transfer after getting off the subway after passing through the first type of public transportation station, and calculate the third time for the user to transfer from the first type of public transportation station to the second type of public transportation station; Based on the principle of the minimum sum of the first time, the second time and the third time, plan the initial planned path information for the navigation request instruction.

[0028] It should be noted that for the first specified range and the second specified range in this embodiment, they can be freely adjusted based on the density of the bus stops or subway stations. However, in order to reduce the data processing pressure of the first server for calculating the initial planned path information, the range should not be set too large, as long as there are 1-3 public transportation stations within the specified range and the transfer work can be completed.

[0029] Here, for the above two different transfer methods, the first server will respond with different initial planned path information based on the navigation request instruction. In one case, the first transfer intermediate node information extracted from the initial planned path information in response to the navigation request instruction means that if the initial planned path information is planned based on the principle of the minimum sum of the first time and the second time, the third position information of the first type of public transportation station for directly transferring with the second type of public transportation station and the fourth position information of the second type of public transportation station for directly transferring with the first type of public transportation station are obtained, and the third position information and the fourth position information are used as the first transfer intermediate node information. In another case, if the initial planned path information is planned based on the principle of the minimum sum of the first time, the second time, and the third time, the fifth position information of the first type of public transportation station for transferring with the second type of public transportation station after getting off and the sixth position information of the second type of public transportation station for transferring with the first type of public transportation station are obtained, and the fifth position information and the sixth position information are used as the first transfer intermediate node information.

[0030] It should be noted that in this embodiment, two servers will be set, namely the first server and the second server. For the first server, after the initial planned path information is calculated, even if the historical planned path information of the current manufacturer's navigation software is stored in the first server, it can complete the path planning work relatively accurately based on the historical data. However, in order to further improve the accuracy of the path planning work, the traditional method requires obtaining the real-time public transportation data of the public transportation system to assist in generating the initial planned path information, which will cause a large delay in the client to obtain the navigation result. Therefore, in this embodiment, the second server will be set, and the dynamic calibration work of the initial planned path information will be completed through the historical planned path information of all manufacturers' navigation software stored in the second server.

[0031] In most cases, the second server can directly complete the dynamic correction of the first transfer intermediate node information based on the navigation request instruction. However, since the second server needs to interface with the first servers of various manufacturer types, in order to ensure the security of the data in all manufacturer servers, it is necessary to further limit the navigation request instruction. Therefore, in this embodiment, before the second server dynamically corrects the first transfer intermediate node information based on the historical planned path information of other manufacturer software except the current manufacturer's navigation software, it may further include: The client determines whether the navigation request instruction is obtained from a single navigation software. If so, the client assigns second identification information to the navigation request instruction and sends the navigation request instruction assigned with the second identification information to the first server; After the first server extracts the first transfer intermediate node information in response to the navigation request instruction, it sets the second identification information in the first transfer intermediate node information and sends it to the second server; Otherwise, the client assigns third identification information to the navigation request instruction and sends the navigation request instruction assigned with the third identification information to the first server; After the first server extracts the first transfer intermediate node information in response to the navigation request instruction, it sets the third identification information in the first transfer intermediate node information and sends it to the second server.

[0032] Therefore, for the above two cases, that is, the second identification information is set in the first transfer intermediate node information, or the third identification information is set in the first transfer intermediate node information. In order to ensure that the first server and the second server complete the path planning task as soon as possible while ensuring the data security of the two servers, in this embodiment, when the second server receives the first transfer intermediate node information, the dynamic correction of the first transfer intermediate node information based on the historical planned path information of other manufacturer software except the current manufacturer's navigation software means: In the first case, if the second identification information is set in the first transfer intermediate node information, then: The second server calls the stored historical planned path information of other manufacturer software except the current manufacturer's navigation software, corrects the third position information, the fourth position information, the fifth position information, and the sixth position information, and adjusts the sum of the calculated first time and the second time or the sum of the first time, the second time, and the third time according to the corrected position information; In the second case, if the third identification information is set in the first transfer intermediate node information, then: The second server notifies the first server to obtain real-time public transportation operation information from all manufacturers' navigation software. The second server updates the historical planned path information based on the real-time public transportation operation information obtained from all manufacturers' navigation software, and corrects the third location information, fourth location information, fifth location information, and sixth location information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software after the update, and adjusts the sum of the calculated first time and second time or the sum of the first time, second time, and third time according to the corrected location information.

[0033] Embodiment 2 Based on Embodiment 1, this embodiment provides a dynamic transfer path planning method for a dynamic transfer path planning system based on multiple public transportation modes. The flowchart is shown in Figure 2 , and the method includes the following steps: S1. Obtain a navigation request instruction from the installed navigation software through the client; S2. Receive the navigation request instruction of the client where the corresponding manufacturer's navigation software is located through the first server, obtain the initial planned path information in response to the navigation request instruction, and extract the first transfer intermediate node information in response to the navigation request instruction from the initial planned path information; S3. Receive the first transfer intermediate node information through the second server, and dynamically correct the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software; S4. Generate the second transfer intermediate node information after dynamic correction, and generate the final path planning information in response to the current navigation request instruction based on the second transfer intermediate node information; S5. Send the final path planning information in response to the current navigation request instruction to the client.

[0034] According to the description of Embodiment 1, the application scenario and implementation principle of this embodiment are the same as those of Embodiment 1, so they will not be elaborated here.

[0035] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. For those skilled in the art, the present invention can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A dynamic transfer path planning system based on multiple public transportation modes, characterized in that, Including: A client, installed with navigation software, for obtaining a navigation request instruction from the navigation software and for obtaining final path planning information in response to the current navigation request instruction from a second server; A first server, storing historical planned path information of the current manufacturer's navigation software, for receiving a navigation request instruction from the client where the corresponding manufacturer's navigation software is located, for obtaining initial planned path information in response to the navigation request instruction, and for extracting first transfer intermediate node information in response to the navigation request instruction from the initial planned path information; A second server, storing historical planned path information of all manufacturers' navigation software, for dynamically correcting the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software, generating second transfer intermediate node information after dynamic correction, and generating final path planning information in response to the current navigation request instruction based on the second transfer intermediate node information.

2. The dynamic transfer path planning system based on multiple public transportation modes according to claim 1, characterized in that After the first server receives a navigation request instruction from the client where the corresponding manufacturer's navigation software is located, it further includes: The first server determines whether it is the first time to receive a navigation request instruction sent by the client; If so, it forwards the navigation request instruction to the second server, and the second server directly generates final path planning information in response to the current navigation request instruction based on the navigation request instruction. The second server synchronizes the final path planning information to the first server corresponding to the corresponding manufacturer's navigation software, and forwards it to the client through the first server; Otherwise, it obtains initial planned path information in response to the navigation request instruction.

3. The dynamic transfer path planning system based on multiple public transportation modes according to claim 1, wherein The first server also stores first identification information of the corresponding manufacturer's navigation software; When the first server receives a navigation request instruction sent by the client, it determines whether the navigation request instruction contains the first identification information. When it contains, it obtains initial planned path information in response to the navigation request instruction, otherwise it sends a prompt message to the client.

4. The dynamic transfer path planning system based on multiple public transportation modes according to claim 1, wherein The navigation request instruction contains user starting point location information and destination information.

5. The dynamic transfer path planning system based on multiple public transportation modes according to claim 4, wherein, The first server obtains initial planned path information in response to the navigation request instruction, which means: The first server obtains first-type public transportation stations and first location information within a first specified distance from the user starting point location information, and calculates the first time for the user to walk or ride from the starting point to the first location of each first-type public transportation station; Obtains second-type public transportation stations and second location information within a second specified range from the user destination information, and determines whether there are public transportation stations in the second type that can be directly transferred and coincide with the first type. If so, calculates the second time for the user to walk or ride from the coincident type of public transportation station to the destination; Based on the principle that the sum of the first time and the second time is the smallest, initial planned path information is planned for the navigation request instruction.

6. The dynamic transfer path planning system based on multiple public transportation modes according to claim 5, wherein, If it is determined that there is no public transportation station in the second type that can be directly transferred and coincides with the first type, then obtain the public transportation stations of the second type that are transferred after getting off the station after traveling through the public transportation stations of the first type, and calculate the third time for the user to transfer from the public transportation stations of the first type to the public transportation stations of the second type; Based on the principle of minimizing the sum of the first time, the second time, and the third time, plan the initial planned path information for the navigation request instruction.

7. The dynamic transfer route planning system based on multiple public transportation modes according to claim 6, wherein, Extracting the first transfer intermediate node information in response to the navigation request instruction from the initial planned path information means: If the initial planned path information is planned based on the principle of minimizing the sum of the first time and the second time, then obtain the third position information in the public transportation stations of the first type for directly transferring with the public transportation stations of the second type, and the fourth position information in the public transportation stations of the second type for directly transferring with the public transportation stations of the first type, and use the third position information and the fourth position information as the first transfer intermediate node information; If the initial planned path information is planned based on the principle of minimizing the sum of the first time, the second time, and the third time, then obtain the fifth position information in the public transportation stations of the first type for transferring with the public transportation stations of the second type after getting off the station, and the sixth position information in the public transportation stations of the second type for transferring with the public transportation stations of the first type, and use the fifth position information and the sixth position information as the first transfer intermediate node information.

8. The dynamic transfer path planning system based on multiple public transportation modes according to claim 1, wherein Before the second server dynamically corrects the first transfer intermediate node information based on the historical planned path information of other manufacturer software except the current manufacturer's navigation software, it also includes: The client determines whether the navigation request instruction is obtained from a single navigation software. If so, the client assigns the second identification information to the navigation request instruction and sends the navigation request instruction assigned with the second identification information to the first server; After the first server extracts the first transfer intermediate node information in response to the navigation request instruction, set the second identification information in the first transfer intermediate node information and send it to the second server; Otherwise, the client assigns the third identification information to the navigation request instruction and sends the navigation request instruction assigned with the third identification information to the first server; After the first server extracts the first transfer intermediate node information in response to the navigation request instruction, set the third identification information in the first transfer intermediate node information and send it to the second server.

9. The dynamic transfer route planning system based on multiple public transportation modes according to claim 8, wherein, When the second server receives the first transfer intermediate node information, dynamically correcting the first transfer intermediate node information based on the historical planned path information of other manufacturer software except the current manufacturer's navigation software means: If the second identification information is set in the first transfer intermediate node information, then: The second server calls the historical planned path information of other manufacturers' software stored except the current manufacturer's navigation software, corrects the third location information, the fourth location information, the fifth location information, and the sixth location information, and adjusts the sum of the calculated first time and the second time or the sum of the first time, the second time, and the third time according to the corrected location information; If the third identification information is set in the first transfer intermediate node information, then: The second server notifies the first server to obtain the real-time public transportation operation information of all manufacturers' navigation software. The second server updates the historical planned path information based on the real-time public transportation operation information obtained by all manufacturers' navigation software, and corrects the third location information, the fourth location information, the fifth location information, and the sixth location information based on the updated historical planned path information of other manufacturers' software except the current manufacturer's navigation software, and adjusts the sum of the calculated first time and the second time or the sum of the first time, the second time, and the third time according to the corrected location information.

10. A method for dynamic transfer path planning based on multiple public transportation modes, applied to the dynamic transfer path planning system based on multiple public transportation modes according to any one of claims 1-9, characterized in that, It includes the following steps: Obtain a navigation request instruction from the installed navigation software through the client; Receive the navigation request instruction of the client where the corresponding manufacturer's navigation software is located through the first server, obtain the initial planned path information in response to the navigation request instruction, and extract the first transfer intermediate node information in response to the navigation request instruction from the initial planned path information; Receive the first transfer intermediate node information through the second server, and dynamically correct the first transfer intermediate node information based on the historical planned path information of other manufacturers' software except the current manufacturer's navigation software; Generate the second transfer intermediate node information after dynamic correction, and generate the final path planning information in response to the current navigation request instruction based on the second transfer intermediate node information; Send the final path planning information in response to the current navigation request instruction to the client.

Images