Route planning method and device, electronic equipment and computer readable storage medium

Abstract

The application provides a route planning method and device, electronic equipment and a computer readable storage medium. The method comprises: when a trigger operation is detected on a preset identifier of a map display interface, in response to the trigger operation on the preset identifier, a route information interface is displayed; when a starting point position and a terminal point position input in an information input area of the route information interface are received, the starting point position and the terminal point position are carried in a route planning request and sent to a server; candidate routes sent by the server for the route planning request are received; wherein the candidate routes are determined by the server according to the starting point position, the terminal point position and a transfer station map; and the candidate routes are displayed in a route display area of the route information interface. Through the application, the efficiency of route planning can be improved through artificial intelligence technology.

Description

Technical Field

[0001] This application relates to artificial intelligence technology, and more particularly to a route planning method, apparatus, electronic device, and computer-readable storage medium. Background Technology

[0002] Route planning utilizes artificial intelligence technology to analyze factors such as time and distance, providing users with routes from their specified origin to their specified destination, greatly facilitating their travel. Public transportation, due to its economic and convenient characteristics, has become the most important component of urban transportation, making public transportation route planning crucial within overall route planning.

[0003] In related technologies, when planning routes for users, a large search space is required, resulting in low search performance and a long time required to display the planned route to the user, ultimately leading to low efficiency in route planning. Summary of the Invention

[0004] This application provides a route planning method, apparatus, electronic device, and computer-readable storage medium, which can improve the efficiency of route planning.

[0005] The technical solution of this application embodiment is implemented as follows: This application provides a route planning method, including: When a trigger operation is detected on a preset marker on the map display interface, the route information interface is displayed in response to the trigger operation on the preset marker. When the starting point and ending point are input in the information input area of ​​the route information interface, the starting point and ending point are sent to the server along with the route planning request. The server receives candidate routes sent in response to the route planning request; wherein the candidate routes are determined by the server based on the starting point location, the ending point location, and a transfer station map, and the transfer station map is a search graph obtained by using all transfer boarding stations as graph nodes, so that the server can search for transfer routes between the starting point transfer boarding station and the ending point transfer boarding station from the transfer station map, and determine candidate routes based on the starting point location, the starting point transfer boarding station, the ending point transfer boarding station, the ending point location, and the transfer routes; The candidate routes are displayed in the route display area of ​​the route information interface.

[0006] This application provides a route planning method, including: The receiving terminal sends a route planning request; the route planning request includes the starting point location and the ending point location; In response to the route planning request, the origin transfer station and the destination transfer station are determined based on the origin location and the destination location. From the transfer station map, the transfer route between the origin transfer station and the destination transfer station is searched; the transfer station map is a search map obtained by using all transfer stations as graph nodes. Based on the starting point location, the starting point transfer station, the ending point transfer station, the ending point location, and the transfer route, candidate routes are determined; The candidate routes are sent to the terminal so that the terminal can display the candidate routes.

[0007] This application provides a route planning device, including: The information display module is used to display a route information interface in response to a trigger operation on a preset marker when a trigger operation is detected on the preset marker of the map display interface. The first sending module is used to send the starting point and the ending point in a route planning request to the server when the starting point and the ending point are received in the information input area of ​​the route information interface. The first receiving module is configured to receive candidate routes sent by the server in response to the route planning request; wherein the candidate routes are determined by the server based on the starting point location, the ending point location, and a transfer station map, and the transfer station map is a search map obtained by using all transfer boarding stations as graph nodes, so that the server can search for transfer routes between the starting point transfer boarding station and the ending point transfer boarding station from the transfer station map, and determine candidate routes based on the starting point location, the starting point transfer boarding station, the ending point transfer boarding station, the ending point location, and the transfer routes; The information display module is also used to display the candidate routes in the route display area of ​​the route information interface.

[0008] In some embodiments of this application, the information display module is further configured to, in response to a trigger operation on the candidate route detected, display a details information interface; in the text information display area of ​​the details information interface, display textual description information of the candidate route; the textual description information characterizes the transfer method of the candidate route, and the textual description information includes at least one or more of the following: the starting point location, the ending point location, the station corresponding to the starting point location, the station corresponding to the ending point location, the transfer route of the candidate route, the walking distance in the candidate route, the time and cost consumed by the candidate route, and details of public transportation routes; in the image information display area of ​​the details information interface, display image route information of the candidate route; the image route information characterizes the movement trajectory of the candidate route on the map.

[0009] In some embodiments of this application, the route planning device further includes: a route navigation module; The information display module is also used to display navigation icons in the text information display area; The route navigation module is used to navigate the transfer of the candidate route in response to the trigger operation on the navigation sign when a trigger operation is detected on the navigation sign.

[0010] This application provides a route planning device, including: The second receiving module is used to receive a route planning request sent by the terminal; the route planning request includes the starting point location and the ending point location; A route determination module is used to respond to the route planning request by determining the origin transfer station and the destination transfer station based on the origin location and the destination location; searching for transfer routes between the origin transfer station and the destination transfer station from a transfer station map; the transfer station map is a search map obtained by using all transfer stations as graph nodes; and determining candidate routes based on the origin location, the origin transfer station, the destination transfer station, the destination location, and the transfer route. The second sending module is used to send the candidate route to the terminal so that the terminal can display the candidate route.

[0011] In some embodiments of this application, the route determination module is further configured to: find candidate starting stations from map information for the starting point location; find candidate ending stations from map information for the ending point location; extract the starting transfer station corresponding to the candidate starting station from each station of the line corresponding to the candidate starting station; and extract the ending transfer station corresponding to the candidate ending station from each station of the line corresponding to the candidate ending station.

[0012] In some embodiments of this application, the route determination module is further configured to, based on the map information, search for routes from the starting point to the candidate starting point station, routes from the candidate starting point station to the starting point transfer station, routes from the ending point transfer station to the candidate ending point, and routes from the candidate ending point to the ending point; and to concatenate the routes from the starting point to the candidate starting point station, the routes from the candidate starting point station to the starting point transfer station, the transfer routes, the routes from the ending point transfer station to the candidate ending point, and the routes from the candidate ending point to the ending point into the candidate route.

[0013] In some embodiments of this application, the route determination module is further configured to use each of at least two search algorithms to radially diffuse from the starting transfer station to each transfer station in the transfer station map until the destination transfer station is reached, thereby obtaining a diffusion path between the starting transfer station and the destination transfer station; and to take the shortest diffusion path as the transfer route.

[0014] In some embodiments of this application, the route planning device further includes a station map construction module; The station map construction module is used to acquire the transfer boarding stations of each public transportation line to obtain a set of transfer boarding stations; for each transfer boarding station in the set of transfer boarding stations, a matching transfer boarding station is found in the set of transfer boarding stations; the edge pointing from each transfer boarding station to the matching transfer boarding station is used as the directed edge corresponding to each transfer boarding station; and the transfer station map is constructed by using the directed edges corresponding to each transfer boarding station.

[0015] In some embodiments of this application, the station map construction module is further configured to search from the set of transfer boarding stations for transfer boarding stations that are reached after a preset number of transfers from each transfer boarding station; and to use the transfer boarding stations reached after a preset number of transfers as the matching transfer boarding stations corresponding to each transfer boarding station.

[0016] In some embodiments of this application, the station map construction module is further configured to extract, from the transfer station map, transfer routes to be optimized that have at least two directed edges; calculate the corresponding transfer cost value for each of the at least two directed edges in the transfer routes to be optimized, and select the directed edge with the smallest transfer cost value from the at least two directed edges; delete the directed edges other than the directed edge with the smallest transfer cost value from the at least two directed edges to obtain the optimized transfer route corresponding to the transfer route to be optimized; and use the directed edges of the optimized transfer route and the directed edges of the transfer routes other than the transfer routes to be optimized in the transfer station map to construct the optimized transfer station map.

[0017] This application provides an electronic device, including: Memory, used to store executable route planning instructions; The processor, when executing executable route planning instructions stored in the memory, implements the route planning method provided in the embodiments of this application.

[0018] This application provides a computer-readable storage medium storing executable route planning instructions, which, when executed by a processor, implement the route planning method provided in this application.

[0019] The embodiments of this application have the following beneficial effects: When a trigger operation targeting a preset identifier is detected, the user enters the route information interface. Then, the user receives the starting and ending points in the information input area of ​​the route information interface to clarify the starting and ending points for route planning. Next, the user receives candidate routes determined by the server based on the starting and ending points and a transfer station map describing public transportation transfer methods, and displays the candidate routes. Since the transfer station map is a search graph obtained by using all transfer stations as graph nodes, the search space is significantly reduced compared to a search graph using all stations as graph nodes. Therefore, the terminal can display the planned route to the user in a shorter time, improving the efficiency of route planning. Attached Figure Description

[0020] Figure 1 This is an optional architecture diagram of the route planning system 100 provided in this application embodiment; Figure 2 This is a schematic diagram of the terminal structure provided in the embodiments of this application; Figure 3 This is a schematic diagram of the server structure provided in an embodiment of this application; Figure 4 This is an optional flowchart illustrating the route planning method provided in the embodiments of this application. Figure 1 ; Figure 5 This is a schematic diagram of the function icon window provided in the embodiments of this application; Figure 6 This is a schematic diagram of the triggering and displaying route information interface provided in an embodiment of this application; Figure 7 This is a schematic diagram of the input starting point position provided in an embodiment of this application; Figure 8 This is a schematic diagram illustrating candidate routes provided in an embodiment of this application; Figure 9 This is a schematic diagram of the textual description information provided in the embodiments of this application; Figure 10 This is a schematic diagram of the image route information provided in the embodiments of this application; Figure 11 This is a schematic diagram of the navigation service triggering provided in an embodiment of this application; Figure 12 This is an optional flowchart illustrating the route planning method provided in the embodiments of this application. Figure 2 ; Figure 13 This is a schematic diagram of the directed edges corresponding to the transfer boarding stations provided in the embodiments of this application; Figure 14 This is a schematic diagram of the path planning architecture provided in the embodiments of this application; Figure 15 This is a schematic diagram of the bus route network provided in the embodiments of this application. Detailed Implementation

[0021] To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings. The described embodiments should not be regarded as limitations on this application. All other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0022] In the following description, references are made to “some embodiments,” which describe a subset of all possible embodiments. However, it is understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0023] In the following description, the terms "first, second, third" are used merely to distinguish similar objects and do not represent a specific ordering of objects. It is understood that "first, second, third" may be interchanged in a specific order or sequence where permitted, so that the embodiments of this application described herein can be implemented in an order other than that illustrated or described herein.

[0024] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.

[0025] Before providing a further detailed description of the embodiments of this application, the nouns and terms involved in the embodiments of this application will be explained, and the nouns and terms involved in the embodiments of this application shall be interpreted as follows.

[0026] 1) Artificial Intelligence (AI) is the theory, methods, technology, and application systems that use digital computers or machines controlled by digital computers to simulate, extend, and expand human intelligence, perceive the environment, acquire knowledge, and use that knowledge to achieve optimal results. In other words, AI is a comprehensive technology within computer science that attempts to understand the essence of intelligence and produce a new kind of intelligent machine that can react in a way similar to human intelligence. AI studies the design principles and implementation methods of various intelligent machines, enabling them to possess the functions of perception, reasoning, and decision-making.

[0027] Artificial intelligence (AI) is a comprehensive discipline with a wide range of applications, encompassing both hardware and software technologies. Fundamental AI technologies generally include sensors, dedicated AI chips, cloud computing, distributed storage, big data processing, operating / interactive systems, and mechatronics. AI software primarily includes computer vision, speech processing, natural language processing, and machine learning / deep learning.

[0028] 2) Route planning refers to calculating the route from a given starting point to an ending point, including the initial and final walking routes, walking routes required for public transportation transfers, and at least one public transportation line used. It's important to note that "route" and "line" are different concepts. A route refers to the mode of transport from the starting point to the ending point, encompassing walking and transfers between different buses / trains; a line can be understood as commonly referred to as "bus route 5" or "line 2," which refers to routes planned by public transportation authorities.

[0029] 3) A station is a waiting point set up on a public transportation line. Each station belongs to only one public transportation line.

[0030] 4) A platform is formed by grouping together multiple stations that are close to each other. For example, a platform is formed by grouping together all stations within 50 meters of each other. A platform may be served by multiple public transportation lines.

[0031] 5) Transfer pairs: A person gets off at stop A on one public transport line and then walks or uses other means to board at stop B on another public transport line. Stops A and B together form a transfer pair. It should be noted that transfer pairs are ordered; that is, changing the order of the stops within a transfer pair will create another transfer pair.

[0032] For example, in a user's travel route, if a passenger gets off at station LiSp on line Li and walks or cycles to station LjSq on line Lj to board the train, then (LiSp, LjSq) is a transfer pair. It should be noted that (LjSq, LiSp) is another transfer pair, representing getting off at station LjSq and then boarding at station LiSp.

[0033] 6) Transfer boarding station, which is the station where passengers board in a transfer pair. For example, in (LiSp, LjSq), LiSp is the transfer boarding station. It should be noted that not all boarding stations can serve as transfer boarding stations.

[0034] 7) Transfer station map: This is a search graph constructed using all transfer and boarding stations on all public transportation lines as graph nodes. Using a graph search algorithm, transfer and boarding stations can be found from the transfer station map for route planning. It should be noted that transfer alighting stations and regular boarding stations are not included in the transfer station map.

[0035] 8) The optimal transfer boarding station graph is the search graph obtained after removing and optimizing some edges in the transfer boarding station graph.

[0036] With the research and advancement of artificial intelligence (AI) technology, AI is being studied and applied in various fields, such as smart homes, smart wearable devices, virtual assistants, smart speakers, smart marketing, autonomous driving, drones, smart healthcare, and smart customer service. It is believed that with the development of technology, AI will be applied in more fields and play an increasingly important role.

[0037] Route planning utilizes artificial intelligence technology to analyze factors such as time and distance, providing users with routes from their specified origin to their specified destination, greatly facilitating their travel. Public transportation, due to its economic and convenient characteristics, has become the most important component of urban transportation; therefore, public transportation route planning is also crucial within route planning.

[0038] In related technologies, each station or segment of all public transportation lines is typically used as a node in the search graph. For example, bus stops, subway stations, and light rail stations are all treated as nodes in the search graph. Then, path planning is performed in the search graph using algorithms such as Breadth First Search (BFS), Dijkstra's algorithm, and Astar heuristic search. Furthermore, during path planning, search pruning or offline pre-computation can be used to reduce the search space. The method for calculating the walking distance from the origin or destination to the candidate public transportation station is to calculate the actual walking distance from the road network segment to the candidate public transportation station offline, or to directly approximate the actual walking distance using Manhattan distance. Moreover, related technologies generally employ a single search algorithm to search for a Pareto optimal set of routes.

[0039] However, due to the large number of public transportation stations and routes, related technologies that use all stations or route segments as graph nodes result in a large search space, inevitably leading to low search performance and thus low route planning efficiency. Furthermore, even when methods like search pruning and offline computation are used to reduce the search space, they don't inherently optimize the search graph, limiting the potential for smaller search spaces and failing to fundamentally improve search performance, resulting in continued low route planning efficiency. Simultaneously, offline calculation of the actual walking distance from road network segments to candidate public transportation stations requires significant memory, and because public transportation data and road network data are coupled, they cannot be updated independently. Using Manhattan distance to approximate actual walking distances leads to inaccurate route costs, further reducing route planning accuracy. Finally, using a single search method makes it difficult to overcome the limitations of the chosen method, easily resulting in inaccurate searches and impacting the final route planning results.

[0040] The above analysis shows that in related technologies, the search space required for route planning is large, resulting in low search performance and a long time required to display the planned route to the user, ultimately leading to low route planning efficiency. Furthermore, these technologies also suffer from low accuracy in planning the optimal route.

[0041] This application provides a route planning method, apparatus, electronic device, and computer-readable storage medium, which can improve the efficiency of route planning. The exemplary application of the electronic device provided in this application is described below. The device provided in this application can be implemented as a terminal or as a server. More specifically, when the electronic device is used to receive a user's trigger operation and display candidate routes, it can be implemented as a terminal; when the electronic device is used to plan candidate routes based on the starting point and ending point, it can be implemented as a server. Exemplary applications of the electronic device will be described below.

[0042] See Figure 1 , Figure 1 This is an optional architecture diagram of the route planning system 100 provided in the embodiments of this application. In order to support a route planning application, the terminal 400 (one implementation of the electronic device) connects to the server 200 (another implementation of the electronic device) through the network 300. The network 300 can be a wide area network or a local area network, or a combination of the two.

[0043] Terminal 400 is used to receive the starting and ending positions input by the user and to display candidate routes to the user; server 200 is used to plan a route for the user based on the starting and ending positions input by the user.

[0044] When terminal 400 detects a trigger operation on a preset marker on the map display interface of graphical interface 400-1, it responds to the trigger operation for the preset marker by displaying a route information interface. Then, in the information input area of ​​the route information interface, it receives the user's input of the starting and ending points, and sends these points along with a route planning request to server 200 via network 300. Upon receiving the route planning request from terminal 400, server 200, in response to the request, determines the starting and ending transfer stations based on the starting and ending points. The server searches the transfer station map for transfer routes between the starting and ending transfer stations, and then determines candidate routes based on the starting point, starting and ending transfer stations, ending and ending points, and sends these candidate routes to terminal 400 via network 300. The transfer station map is a search map obtained by using all transfer stations as graph nodes. Finally, the terminal 400 displays candidate routes in the route display area of ​​the route information interface on the graphical interface 400-1 for the user to view.

[0045] In some embodiments, server 200 may be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. Terminal 400 may be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, etc., but is not limited to these. The terminal and server can be directly or indirectly connected via wired or wireless communication, which is not limited in this embodiment of the invention.

[0046] When the electronic device is implemented as a terminal, see Figure 2 , Figure 2 This is a schematic diagram of the terminal structure provided in the embodiments of this application. Figure 2 The terminal 400 shown includes at least one first processor 410, a first memory 450, at least one first network interface 420, and a first user interface 430. The various components in the terminal 400 are coupled together via a first bus system 440. It is understood that the first bus system 440 is used to implement communication between these components. In addition to a data bus, the first bus system 440 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in… Figure 2 The general labeled all buses as Bus System 440.

[0047] The first processor 410 can be an integrated circuit chip with signal processing capabilities, such as a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., wherein the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0048] The first user interface 430 includes one or more first output devices 431 that enable the presentation of media content, including one or more speakers and / or one or more visual displays. The first user interface 430 also includes one or more first input devices 432, including user interface components that facilitate user input, such as a keyboard, mouse, microphone, touch screen display, camera, other input buttons and controls.

[0049] The first memory 450 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid-state storage, hard disk drives, optical disk drives, etc. The first memory 450 may optionally include one or more storage devices physically located remote from the first processor 410.

[0050] The first memory 450 may include volatile memory or non-volatile memory, or both. The non-volatile memory may be read-only memory (ROM), and the volatile memory may be random access memory (RAM). The first memory 450 described in this application embodiment is intended to include any suitable type of memory.

[0051] In some embodiments, the first memory 450 is capable of storing data to support various operations, examples of which include programs, modules, and data structures or subsets or supersets thereof, as illustrated below.

[0052] The first operating system 451 includes system programs for handling various basic system services and performing hardware-related tasks, such as the framework layer, core library layer, and driver layer, for implementing various basic business functions and handling hardware-based tasks. The first network communication module 452 is used to reach other computing devices via one or more (wired or wireless) first network interfaces 420, exemplary first network interfaces 420 including: Bluetooth, Wi-Fi, and Universal Serial Bus (USB), etc. The first presentation module 453 is configured to enable the presentation of information (e.g., a user interface for operating peripheral devices and displaying content and information) via one or more first output devices 431 (e.g., a display screen, a speaker, etc.) associated with the first user interface 430. The first input processing module 454 is configured to detect and translate one or more user inputs or interactions from one or more first input devices 432.

[0053] In some embodiments, the apparatus provided in this application can be implemented in software. Figure 2 A route planning device 455 stored in a first memory 450 is shown. It may be software in the form of programs and plug-ins, including the following software modules: information display module 4551, first sending module 4552, first receiving module 4553, and route navigation module 4554. These modules are logically connected and can therefore be arbitrarily combined or further split according to the functions they implement.

[0054] The functions of each module will be explained below.

[0055] In other embodiments, the route planning device provided in this application can be implemented in hardware. As an example, the route planning device provided in this application can be a processor in the form of a hardware decoding processor, which is programmed to execute the route planning method provided in this application. For example, the processor in the form of a hardware decoding processor can be one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), or other electronic components.

[0056] When the electronic device is implemented as a server, see Figure 3 , Figure 3 This is a schematic diagram of the server structure provided in an embodiment of this application. Figure 3 The server 200 shown includes at least one second processor 210, a second memory 250, at least one second network interface 220, and a second user interface 230. The various components of the server 200 are coupled together via a second bus system 240. It is understood that the second bus system 240 is used to implement communication between these components. In addition to a data bus, the second bus system 240 also includes a power bus, a control bus, and a status signal bus. However, for clarity, in… Figure 3 The various buses are all labeled as the second bus system 240.

[0057] The second processor 210 can be an integrated circuit chip with signal processing capabilities, such as a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., wherein the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0058] The second user interface 230 includes one or more second output devices 231 that enable the presentation of media content, including one or more speakers and / or one or more visual displays. The second user interface 230 also includes one or more second input devices 232, including user interface components that facilitate user input, such as a keyboard, mouse, microphone, touch screen display, camera, other input buttons and controls.

[0059] The second memory 250 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid-state storage, hard disk drives, optical disk drives, etc. The second memory 250 may optionally include one or more storage devices physically located remote from the second processor 210.

[0060] The second memory 250 may include volatile memory or non-volatile memory, or both. The non-volatile memory may be read-only memory (ROM), and the volatile memory may be random access memory (RAM). The second memory 250 described in this application embodiment is intended to include any suitable type of memory.

[0061] In some embodiments, the second memory 250 is capable of storing data to support various operations, examples of which include programs, modules, and data structures or subsets or supersets thereof, as illustrated below.

[0062] The second operating system 251 includes system programs for handling various basic system services and performing hardware-related tasks, such as the framework layer, core library layer, and driver layer, for implementing various basic business functions and handling hardware-based tasks. The second network communication module 252 is used to reach other computing devices via one or more (wired or wireless) second network interfaces 220, exemplary second network interfaces 220 including: Bluetooth, Wi-Fi, and Universal Serial Bus (USB), etc. The second presentation module 253 is configured to enable the presentation of information (e.g., a user interface for operating peripheral devices and displaying content and information) via one or more second output devices 231 (e.g., a display screen, a speaker, etc.) associated with the second user interface 230. The second input processing module 254 is used to detect and translate one or more user inputs or interactions from one or more second input devices 232.

[0063] In some embodiments, the apparatus provided in this application can be implemented in software. Figure 3 A route planning device 255 stored in a second memory 250 is shown. It may be software in the form of programs and plug-ins, including the following software modules: a second receiving module 2551, a route determination module 2552, a second sending module 2553, and a station map construction module 2554. These modules are logically related and can therefore be arbitrarily combined or further split according to the functions they implement.

[0064] The functions of each module will be explained below.

[0065] In other embodiments, the route planning device provided in this application can be implemented in hardware. As an example, the route planning device provided in this application can be a processor in the form of a hardware decoding processor, which is programmed to execute the route planning method provided in this application. For example, the processor in the form of a hardware decoding processor can be one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), or other electronic components.

[0066] For example, an embodiment of this application provides an electronic device, including: Memory, used to store executable route planning instructions; The processor, when executing executable route planning instructions stored in the memory, implements the route planning method provided in the embodiments of this application.

[0067] The route planning method provided in this application will be described below by taking into account exemplary applications and implementations of the electronic devices provided in the embodiments of this application as servers and terminals.

[0068] See Figure 4 , Figure 4 This is an optional flowchart illustrating the route planning method provided in the embodiments of this application. Figure 1 , will combine Figure 4 The steps shown are explained.

[0069] S101. When the terminal detects a trigger operation on a preset marker on the map display interface, it responds to the trigger operation on the preset marker and displays the route information interface.

[0070] This application embodiment is implemented in a scenario where a user uses a terminal to plan their travel route. When the terminal responds to a user's operation and displays a map on the screen, it detects the user's triggered operation on the map and determines the desired function based on the area where the triggered operation occurred. When the terminal detects a user's triggered operation on a preset marker, it understands that the user needs to plan their travel route. At this point, the terminal creates a route information interface and displays it on the terminal's screen, allowing the user to access route information from the interface.

[0071] It should be noted that the map display interface can be shown when the user interacts with the map application icon on the terminal's display screen, such as when the user clicks the "XX Map" icon on the main menu of the terminal's display screen. The map display interface can also be triggered by the user's voice, for example, after the terminal receives the user's spoken command "Open map," it will be displayed on the terminal's display screen.

[0072] In this embodiment, the preset identifier is an identifier used to trigger the route planning function. The preset identifier can be a graphic identifier, such as an image that can represent the route planning function; the preset identifier can also be a text identifier, such as the text "Plan a route for me" displayed on the interface; the preset identifier can also be an identifier composed of graphics and text, which is not limited in this application.

[0073] Furthermore, the preset identifier can be set in the first preset area of ​​the map display interface. The size and position of the first preset area can be set according to actual needs. For example, the size can be set to 50×50 and the position can be set in the lower left corner of the map display interface; or the size can be set to 100×100 and the position can be set in the upper right corner of the map display interface, etc. This application does not limit this.

[0074] In some embodiments, the first preset area can also be set in a function icon window in the map display interface. This function icon window provides different function icons for the map, such as a ride code icon or a taxi icon. In this case, the user's trigger operation on the preset icon in the map display interface is actually a selection operation for each different function icon. Furthermore, the function icon window can also change according to the user's swiping operation. For example, when the user drags the function icon window upward, the function icon window can be expanded to 90% of the map display interface (only 20% when not swiped upward), and the function icons or other information that are hidden when not swiped upward can be displayed in the function icon window. Alternatively, when the user drags the function icon window downward, the function icon window can be hidden in the map display interface.

[0075] For example, this application provides a schematic diagram of a function icon window, see [link / reference]. Figure 5 In the map display interface 5-1, there is a function icon window 5-11, which displays the icons for public transportation 5-111 (the default icon), taxi 5-112, ride code 5-113, and driving 5-114. When the user presses and drags this window upwards, function icon window 5-11 changes to function icon window 5-12. At this time, in addition to the icons for public transportation 5-111 (the default icon), taxi 5-112, ride code 5-113, and driving 5-114, function icon window 5-12 also displays the subway. Figure 5-12 The system includes icons for 1, location sharing (5-122), cycling (5-123), navigation voice (5-124), and nearby bus routes (257, 5-125, etc.), providing users with more features.

[0076] It is understood that the triggering operation can be a user's click, double-click, long-press, or swipe (swipe up, swipe down, etc.). This application does not make any specific limitations here.

[0077] In this embodiment, the route information interface may include an information input area and a route display area. The information input area can be located in a second preset area of ​​the route information interface, used to receive the start and end points input by the user, thereby triggering route planning. The route display area can be located in a third preset area of ​​the route information interface, used to display routes planned for the user in the past, and to display the planned route to the user when route planning is complete. It is understood that displaying routes already planned for the user aims to provide routes more quickly, because users' travel routes are very likely to be repetitive (e.g., daily commuting routes). In this case, the already planned routes cached on the terminal can be directly displayed to the user, thereby reducing redundancy on the server during route planning.

[0078] It is understood that the size and position of the second and third preset areas can be set according to the actual situation, and this application does not impose any restrictions on them.

[0079] For example, this application provides a schematic diagram of triggering the display of route information interface, see [link]. Figure 6When the terminal detects that the user clicks on the preset icon 6-11 on the map display interface 6-1, the terminal will create a route information interface 6-2 and jump from the map display interface 6-1 to the route information interface 6-2. In the route display area 6-21 of the route information interface 6-2, the terminal will display the bus route information determined based on the user's current geographical location, namely bus route 257 6-211, as well as routes planned for the user in the past, such as the route from Ocean Park to the Convention and Exhibition Center 6-212, and the route from the current location to the food court 6-213, etc.

[0080] S102. When the terminal receives the input start and end points in the information input area of ​​the route information interface, it sends the start and end points in the route planning request to the server.

[0081] After displaying the route information interface, the terminal can determine the user's intent based on the areas the user interacts with on the interface. When the terminal detects user interaction in the information input area of ​​the route information interface, it understands that the user wants to obtain a new travel route. At this point, the terminal receives the user's input start and end points in the information input area, generates a route planning request, and sends the start and end points along with the route planning request to the server via the network. The server receives the route planning request from the terminal, which includes the start and end points.

[0082] In this embodiment of the application, the information input area includes a starting point input sub-area and an ending point input sub-area. The terminal will take the location received in the starting point input sub-area as the starting point location and the location received in the ending point input sub-area as the ending point location.

[0083] Furthermore, in some embodiments of this application, the starting point location in the starting point input sub-region and the ending point location in the ending point input sub-region should both be locations present on the map. To obtain the correct starting point and ending point locations, the terminal can retrieve the content entered by the user in the starting point input sub-region or the ending point input sub-region, thereby displaying multiple locations associated with the user's input in an input pop-up window. This allows the user to select the location they actually want to plan their route from these locations and fill in the name of the selected location into the starting point input sub-region or the ending point input sub-region.

[0084] For example, this application provides a schematic diagram of the input starting point position, see [link to schematic diagram]. Figure 7In the route information interface 7-1, the information input area 7-11 contains a starting point input sub-area 7-111 and a destination input sub-area 7-112. When a user enters "Guomao" 7-113 in the starting point input sub-area 7-111 via keyboard or voice, the terminal can retrieve two locations based on the user's input information "Guomao," namely Guomao Building (Jiefang Road) 7-121 and Guomao Building Office Building 7-122, which are displayed in the floating window 7-12. Then, the location clicked by the user is entered into the starting point input sub-area, thus obtaining the starting point location.

[0085] In other embodiments, the starting point location in the starting point input sub-region and the ending point location in the ending point input sub-region can also be selected by the user on the map display interface. In this case, when the user clicks on the starting point input sub-region or the ending point input sub-region, they will be redirected to the map interface, thus using the location selected by the user by long-pressing on the map interface as the starting point location or the ending point location. Of course, in other embodiments, the starting point location and the ending point location can also be selected by the user on the map displayed on the map display interface before the route information interface is displayed; this application does not limit this.

[0086] It should be noted that in some embodiments of this application, when the terminal detects a user's trigger operation in the route display area, it assumes that the user wants to know about the planned routes. Then, based on which sub-area of ​​the planned route the trigger operation occurred in, it determines which route the user wants to view and displays the determined route in the route information interface.

[0087] S103. In response to the route planning request, the server determines the starting point transfer station and the ending point transfer station based on the starting point and ending point locations.

[0088] After receiving a route planning request, the server will first use map information based on the starting point and the destination to find the corresponding transfer station for the starting point and the corresponding transfer station for the destination, so as to facilitate subsequent route search on the transfer station map.

[0089] Understandably, the server can directly determine the transfer stations around the starting point as the starting point transfer station and the transfer stations around the ending point as the ending point transfer station. The server can also search for a suitable transfer station among the public transportation lines around the starting point as the starting point transfer station and another suitable transfer station among the public transportation lines around the ending point as the ending point transfer station; this application does not impose any limitations on this.

[0090] S104. The server searches the transfer route between the origin transfer station and the destination transfer station from the transfer station map.

[0091] It should be noted that in this embodiment, the transfer station graph is a search graph obtained by using all transfer boarding stations as graph nodes. Essentially, it utilizes directed edges to establish transfer relationships between different transfer boarding stations. For example, if one transfer boarding station can be reached by one transfer to another, then these two transfer boarding stations can be connected by a directed edge. After establishing such transfer relationships for all transfer boarding stations, the search graph constructed using the directed edges between each transfer boarding station is the transfer station graph. Therefore, the transfer station graph does not include stations that are not transfer boarding stations, greatly reducing the search space and thus significantly reducing the time required for route planning.

[0092] Since a transfer station map is essentially a search graph built from different transfer stations as graph nodes, it also includes both origin and destination transfer stations. The server first retrieves the pre-created transfer station map from storage, and then directly uses a search algorithm to find all feasible paths from the origin transfer station to the destination transfer station. These feasible paths are the transfer routes from the origin transfer station to the destination transfer station.

[0093] It should be noted that when the starting point and the ending point are on the same line (equivalent to the candidate starting point and the candidate ending point being on the same public transportation line), the server may not search for transfer routes in the transfer station map. Instead, it can take the intersection of the lines corresponding to the candidate starting point and the lines corresponding to the candidate ending point to obtain the direct route.

[0094] S105. The server determines candidate routes based on the starting point location, the starting point transfer station, the ending point transfer station, the ending point location, and the transfer route.

[0095] After the server finds the transfer route, it will also use map information to find the route from the starting point to the corresponding starting point transfer station and the route from the destination transfer station to the destination. Then, it will merge these two routes with the transfer route to obtain the candidate route.

[0096] It is understood that a candidate route refers to all routes determined by the server that can start from the starting point and reach the destination. In other words, a candidate route does not specifically refer to a single route, but may include one or more routes from the starting point to the destination. In some other embodiments of this application, the different routes in the candidate routes are obtained by the server after filtering and sorting all feasible routes.

[0097] S106. The server sends the candidate routes to the terminal so that the terminal can display the candidate routes.

[0098] After determining the candidate routes, the server sends them to the terminal via the network. For the terminal, the candidate routes are received only after it has sent a route planning request to the server. Therefore, the terminal receives the candidate routes sent by the server in accordance with the route planning request. Furthermore, the candidate routes are determined by the server based on the origin location, destination location, and a transfer station map. The transfer station map is a search graph obtained by using all transfer stations as graph nodes. The server searches the transfer station map to find transfer routes between the origin and destination transfer stations, and determines the candidate routes based on the origin location, origin transfer station, destination transfer station, destination location, and transfer route.

[0099] S107. The terminal displays candidate routes in the route display area of ​​the route information interface.

[0100] After receiving a candidate route, the terminal will display the candidate route in the route display area of ​​the route information interface. In some embodiments, the route display area already displays routes planned for the user in the past. Therefore, when the terminal displays a candidate route in the route display area, it cancels the display of routes planned for the user in the past and replaces them with the candidate route. In other embodiments, no routes are displayed in the route display area. In this case, the terminal directly displays the candidate route in the route display area.

[0101] It should be noted that since the candidate routes may include one or more routes from the starting point to the destination, in order to display all of these routes, the terminal can divide the route display area into at least one display sub-area, and then display these routes in each of the sub-areas. Therefore, the number of display sub-areas is the same as the number of routes in the candidate routes.

[0102] Understandably, each candidate route can include not only the transfer options from the starting point to the destination, but also the time and cost required for that route, so that users can choose the appropriate transfer option by considering the time and cost.

[0103] For example, Figure 8 This is a schematic diagram illustrating candidate routes provided in an embodiment of this application. See also... Figure 8 The starting point is the office building, and the ending point is the China World Trade Center. Therefore, the candidate routes include three routes that can reach the China World Trade Center from the office building: Route 8-a, Route 8-b, and Route 8-c. The route display area 8-11 in the route information interface 8-1 is divided into three sub-areas, each displaying one of the candidate routes. For example, sub-area 8-111 displays Route 8-a (Line 16, then Line 4, then Line 10, taking 1 hour and 35 minutes, walking 2.7 kilometers); sub-area 8-112 displays Route 8-b (Line 16, then Line 4, then Line 1, taking 1 hour and 34 minutes, walking 2.8 kilometers); and sub-area 8-113 displays Route 8-c (Bus 438, then Line 4, then Line 10, taking 1 hour and 50 minutes, walking 2.1 kilometers), allowing users to easily view different routes from the office building to the China World Trade Center.

[0104] In this embodiment, when the terminal detects a trigger operation targeting a preset identifier, it enters the route information interface. Then, it receives the start and end locations in the information input area of ​​the route information interface to clarify the start and end points for the user's route planning. Next, it receives candidate routes determined by the server based on the start and end locations and a transfer station map describing public transportation transfer methods, and displays these candidate routes. Because the search space of the transfer station map is relatively small, the terminal can display the planned route to the user in a shorter time, improving the efficiency of route planning.

[0105] In some embodiments of this application, after the terminal displays candidate routes in the route display area of ​​the route information interface, i.e., after S107, the method may further include: S108-S110, as follows: S108. When the terminal detects a trigger operation for a candidate route, it displays a detailed information interface in response to the trigger operation for the candidate route.

[0106] After displaying candidate routes, the terminal can also show details of the candidate routes based on user actions, providing users with more information about the candidate routes to help them understand them. In this case, the terminal will detect whether the user has performed a trigger action in the route display area, which is a trigger action for a candidate route. Then, in response to the trigger action, the terminal will create and display a details information interface to show the details of the candidate routes.

[0107] In some embodiments of this application, the candidate routes may include multiple routes from the starting point to the ending point. These routes are displayed in various sub-areas of the route display area. In this case, the terminal can determine which route in the candidate routes the user wants to view based on the sub-area where the triggering operation occurred and the correspondence between the sub-area and the route.

[0108] It should be noted that, in this embodiment of the application, the details information interface includes a text information display area and an image information display area, thereby displaying the details of the candidate route from both textual and image dimensions through these two display areas.

[0109] S109. The terminal displays text descriptions of candidate routes in the text information display area of ​​the details information interface.

[0110] The textual descriptions represent the transfer methods for the candidate routes.

[0111] The terminal parses the transfer information in text form from the candidate routes to obtain the text description information of the candidate routes. Then, it displays the text description information in the text information display area of ​​the details interface so that users can understand the transfer information of the candidate routes in the text information display area.

[0112] It is understandable that the transfer methods represented by the textual description information include routes from the starting point to the station corresponding to the starting point (which can be walking or cycling routes, etc.), transfer routes from the station corresponding to the starting point to the station corresponding to the destination (which can be subway, bus, etc.), and routes from the station corresponding to the destination to the destination (which can be walking or cycling routes, etc.).

[0113] Of course, the textual description information may also include information other than transfer routes. In some embodiments, the textual description information includes at least one of the following: origin location, destination location, station corresponding to the origin location, station corresponding to the destination location, transfer route of the candidate route, walking distance of the candidate route, time and cost of the candidate route, and detailed information of the public transportation route. The detailed information of the public transportation route may include passenger flow, comfort level, operating hours, and fare of the bus route used during the transfer.

[0114] For example, Figure 9This is a schematic diagram of the text description information provided in the embodiments of this application. At the bottom of the details information interface 9-1, there is a text information display area 9-11. In this display area, the route from the office building 9-111 (starting point) to the Guomao Building 9-112 (ending point) is displayed. The walking distance from the office building 9-111 to Yongfeng Road South Station 9-113 is 900 meters. The transfer route from Yongfeng Road South Station 9-113 to Jintai Xizhao Station 9-114 (the station corresponding to the ending point) is 438, then Line 4, then Line 10. The walking distance from Jintai Xizhao Station 9-114 to Guomao Building 9-112 is 600 meters. At the same time, the terminal also displays the time taken for the route: 1 hour and 50 minutes 9-115, the total walking distance, i.e., 2.1 kilometers 9-116, the number of stations the route passes through: 28 stations 9-117, and the cost of the route: 7 yuan 9-118, so that users can have a comprehensive understanding of the candidate routes.

[0115] S110. The terminal displays the image route information of the candidate routes in the image information display area of ​​the details information interface.

[0116] Among them, image route information represents the movement trajectory of candidate routes on the map.

[0117] The terminal analyzes the candidate routes to determine the movement trajectory of the candidate routes, such as the user's walking trajectory or the trajectory of the public transportation the user takes. Then, these movement trajectories are plotted on a map to obtain image route information that represents the trajectory of the candidate routes on the map. This image route information is displayed in the image information display area of ​​the details interface, so that the details of the candidate routes can be displayed to the user more intuitively through the movement trajectory, making it easier for the user to understand the candidate routes and make a decision.

[0118] For example, Figure 10 This is a schematic diagram of the image route information provided in an embodiment of this application. For example... Figure 10As shown, at the top of the details information interface 10-1, there is an image information display area 10-11. The terminal will draw the following routes on the map: the walking trajectory from the starting point, i.e., the office building, to Yongfeng Road South Station 10-111 (the distance is too short to show), the trajectory of bus route 438 from Yongfeng Road South Station 10-111 to Yuanmingyuan Station 10-112, the trajectory of Line 4 from Yuanmingyuan Station 10-112 to Haidian Huangzhuang Station 10-113, the trajectory of Line 10 from Haidian Huangzhuang Station 10-113 to Jintai Xizhao Station 10-114, and the walking trajectory from Jintai Xizhao Station 10-114 to Guomao Building (not shown). Then, the map with the movement trajectory of the candidate route segments is displayed in the image information display area 10-11, so that the candidate routes can be presented more intuitively and are easy for users to view.

[0119] In this embodiment of the application, when a user needs to view candidate information, a details information interface will be displayed on the terminal's display interface. In the text information display area of ​​the details information interface, text descriptions of the transfer methods of the candidate route will be displayed. In the image information display area of ​​the details information interface, image route information describing the movement trajectory of the candidate route on the map will be displayed. Thus, details of the candidate route can be provided to the user from two different dimensions, text and image, so that the user can understand the candidate route.

[0120] In some embodiments of this application, after the terminal displays the text description information of the candidate route in the text information display area of ​​the details information interface, that is, after S110, the method may further include: S111-S112, as follows: S111. The terminal displays navigation icons in the text information display area.

[0121] In reality, users may not be familiar with the routes, especially the walking routes from the starting point to its corresponding station, or from the destination to its corresponding station. In such cases, the terminal can provide navigation services. Of course, the terminal first needs to determine if the user requires navigation. This can be done by displaying navigation icons in the text information display area, allowing the terminal to determine user needs based on their interaction with these icons.

[0122] S112. When the terminal detects a trigger operation on a navigation sign, it responds to the trigger operation on the navigation sign and provides navigation for the transfer of the candidate route.

[0123] When the terminal detects that the user has triggered an operation on the navigation sign, it will know that the user needs navigation for the transfer of the candidate route, and then call the navigation system to guide the user to make a smooth transfer based on the user's current location.

[0124] Understandably, the transfer navigation for candidate routes can include navigation from the starting point to the corresponding station, navigation from the transfer exit station to the transfer boarding station, and navigation from the corresponding station to the destination. In other words, the transfer navigation for candidate routes can include navigation for all sections that the user needs to complete manually, i.e., navigation for sections that the user needs to complete by walking or cycling.

[0125] For example, this application provides a schematic diagram of triggering a navigation service, see [link / reference]. Figure 11 In the text information display area 11-1, next to the 900-meter walking distance from the office building 11-11 to Yongfeng Road South Station 11-12, there is a navigation sign, namely the walking navigation button 11-13. When the terminal detects that the user clicks the button, it will provide the user with navigation service from the office building to Yongfeng Road South Station, so that the user can reach the boarding station smoothly.

[0126] In this embodiment, the terminal will also display navigation icons in the text information display area. By triggering the navigation icons, the terminal can determine whether the user needs navigation services. When the user needs navigation services, the terminal will provide navigation services to the user so that the user can travel smoothly according to the planned candidate routes.

[0127] Figure 12 This is an optional flowchart illustrating the route planning method provided in the embodiments of this application. Figure 2 In some embodiments of this application, the server determines the starting point transfer station and the ending point transfer station based on the starting point location and the ending point location. The specific implementation process of S103 may include: S1031-S1032, as follows: S1031. The server finds candidate starting stations from the map information for the starting point location and candidate ending stations from the map information for the ending point location.

[0128] The server first searches the map information for public transportation stations within a preset range, centered on the starting point location, and selects these stations as candidate starting point stations. Simultaneously, the server searches the map information for public transportation stations within a preset range, centered on the destination location, and selects these stations as candidate destination stations. In other words, in this embodiment, the server searches the map information for public transportation stations near the starting point location and near the destination location, respectively, to obtain candidate starting point stations and candidate destination stations.

[0129] It is understood that the preset range can be set to 500 meters, 1 kilometer, or other values ​​according to actual needs. This application embodiment does not limit this.

[0130] In some embodiments of this application, the server can search for stations within a preset range relative to the start or end location by pre-establishing a spatial index, such as a map index (R-tree). In other embodiments, the server can search for candidate start and end stations within a preset range by comparing the locations of all public transportation stations with the start and end locations.

[0131] S1032. The server extracts the starting transfer boarding station corresponding to the candidate starting station from each station of the line corresponding to the candidate starting station, and extracts the destination transfer boarding station corresponding to the candidate destination station from each station of the line corresponding to the candidate destination station.

[0132] After identifying candidate origin and destination stations, the server needs to determine the transfer stations reachable from each candidate origin station and the transfer stations reachable from each candidate destination station. This allows the server to determine the transfer route based on the transfer stations. In this process, the server searches along the public transport lines from the candidate origin station to its destination station, using the found transfer stations as origin transfer stations. Similarly, for the public transport lines corresponding to the candidate destination stations, the server searches along the lines from the candidate destination station to its origin station, using the found transfer stations as destination transfer stations. In other words, the server searches for origin transfer stations in the forward direction along the public transport lines corresponding to the candidate origin station and searches for destination transfer stations in the reverse direction along the public transport lines corresponding to the candidate destination station.

[0133] Furthermore, in some embodiments of this application, the server may take the first transfer station found by searching along the positive direction of the public transportation line corresponding to the candidate starting station as the starting transfer station, and take the first transfer station found by searching along the opposite direction of the public transportation line corresponding to the candidate ending station as the ending transfer station.

[0134] In some other embodiments of this application, the server may select the transfer station with the most transferable public transportation lines from among the multiple transfer stations searched along the positive direction of the public transportation line corresponding to the candidate starting station as the starting transfer station, and select the transfer station with the largest transfer passenger flow from among the multiple transfer stations searched along the negative direction of the public transportation line corresponding to the candidate ending station as the ending transfer station.

[0135] Of course, the server can also extract the origin transfer boarding station corresponding to the candidate origin station from each station of the public transportation line corresponding to the candidate origin station, and extract the destination transfer boarding station corresponding to the candidate destination station from each station of the public transportation line corresponding to the candidate destination station, according to other methods.

[0136] In some embodiments of this application, the server determines candidate routes based on the starting point location, the starting point transfer station, the ending point transfer station, the ending point location, and the transfer route. The specific implementation process of S105 may include: S1051-S1052, as follows: S1051. Based on the map information, the server searches for routes from the starting point to the candidate starting point station, routes from the candidate starting point station to the starting point transfer station, routes from the destination transfer station to the candidate destination station, and routes from the candidate destination station to the destination location.

[0137] S1052. The server combines the route from the starting point to the candidate starting point station, the route from the candidate starting point station to the starting point transfer station, the transfer route, the route from the ending transfer station to the candidate ending point station, and the route from the candidate ending point station to the ending point into a candidate route.

[0138] After obtaining the transfer routes, the server needs to plan the routes from the starting point to the candidate starting point stations and from the candidate ending point stations to the ending point. Both routes are completed by the user independently without relying on public transportation. Therefore, the route can be planned using walking or cycling route planning services to ensure the user can reach the candidate starting point station and the ending point station independently. Simultaneously, the route from the candidate starting point station to the starting point transfer station must be part of the public transportation line corresponding to the candidate starting point station and is known. Similarly, the route from the ending point transfer station to the candidate ending point station is also part of the public transportation line corresponding to the candidate ending point station and is also known. The server sequentially concatenates the planned routes from the starting point to the candidate starting point station, from the candidate starting point station to the starting point transfer station, the transfer routes between the starting point transfer station and the ending point transfer station, the route from the ending point transfer station to the candidate ending point station, and the route from the candidate ending point station to the ending point station to obtain the candidate route.

[0139] It is understandable that candidate starting stations are all stations within a preset range of the starting point location, and candidate ending stations are all stations within a preset range of the ending point location. Neither of these refers to a specific station. Therefore, the different routes included in the candidate routes correspond to the different routes planned from each of the candidate starting stations to each of the candidate ending stations.

[0140] It should be noted that when planning routes from the starting point to candidate starting points and from candidate ending points to the final destination, the server can also call the walking distance matrix service to obtain the walking distances from the starting point to the candidate starting point and from the candidate ending point to the final destination, respectively. Alternatively, it can call the cycling distance matrix service to obtain the cycling distances from the starting point to the candidate starting point and from the candidate ending point to the final destination, respectively. These walking or cycling distances are then provided to the user so they can choose their preferred route. Understandably, using the walking distance matrix service or cycling matrix service decouples public transportation route data from road network data, allowing for independent updates of both. Furthermore, these services accurately calculate the actual walking or cycling distances, facilitating the user's selection of the optimal candidate route.

[0141] Furthermore, both walking distance matrix service and cycling distance matrix service can be implemented using algorithms such as contraction hierarchies (CH) and automatic navigation hybrid algorithms (e.g., RPHAST algorithm), which are not limited in this application.

[0142] Of course, in other embodiments, Manhattan distance can be used as an approximation of walking or cycling distance in order to quickly calculate walking or cycling distance.

[0143] In this embodiment, the server can find candidate starting stations and candidate ending stations based on the starting and ending locations. Then, it extracts the starting transfer boarding station from the route corresponding to the candidate starting station and the ending transfer boarding station from the route corresponding to the candidate ending station. Then, it searches for the transfer route from the starting transfer boarding station to the ending transfer boarding station from the transfer station map. Finally, it splices the candidate route based on the transfer route. This reduces the search space for transfers and improves the route planning efficiency of the server.

[0144] In some embodiments of this application, the server searches for the transfer route between the origin transfer station and the destination transfer station from the transfer station map. The specific implementation process of S104 may include: S1041-S1042, as follows: S1041. The server uses each of at least two search algorithms to radially diffuse through each transfer station in the transfer station map, starting from the origin transfer station, until it diffuses to the destination transfer station, thus obtaining the diffusion path between the origin transfer station and the destination transfer station.

[0145] S1042. The shortest diffusion path is used as the transfer route.

[0146] In this embodiment, when searching for transfer routes from the transfer station map, the server does not use a single search algorithm, but rather at least two search algorithms. This is because different search algorithms prioritize different transfer routes. For example, the BFS algorithm prioritizes routes with fewer transfers, while the ASTAR algorithm prioritizes routes with lower costs. Using only one search algorithm might miss routes that also perform well in other aspects. Therefore, this application chooses to use at least two search algorithms, such as using both BFS and ASTAR algorithms, to ensure that the different search algorithms complement each other. Specifically, the server uses each search algorithm to first expand from the starting transfer station to the surrounding transfer stations, and then expands again from the surrounding transfer stations, and so on, until a transfer station that is expanded to become the final transfer station. This expanded path is then considered a diffusion path. Next, the server selects the shortest diffusion path from the diffusion paths between the origin transfer station and the destination transfer station, and uses the selected shortest diffusion path as the corresponding transfer route for each search algorithm.

[0147] In this embodiment, the server utilizes at least two search algorithms to search the transfer station map, allowing the different search algorithms to complement each other and resulting in a greater variety of selected transfer routes, thus providing users with more route options.

[0148] In some embodiments of this application, before the terminal sends the starting and ending positions in the route planning request to the server, and before the server receives the route planning request sent by the terminal, i.e. before S102, the method may further include: S201-S204, as follows: S201. The server obtains the transfer and boarding stations for each public transportation line, and obtains a set of transfer and boarding stations.

[0149] Before searching for transfer routes from the transfer station map, the server needs to construct the transfer station map first. At this time, the server will first obtain the stations of each public transportation line from the map information, then determine which of the stations of each public transportation line are transfer boarding stations, and obtain the transfer boarding stations of each public transportation line to obtain a set of transfer boarding stations.

[0150] Understandably, the map information, which includes the station data corresponding to the stations of various public transportation lines, can retain information about the stations, such as whether they are transfer stations and which public transportation lines one can transfer to. Thus, the server can determine which stations are transfer stations based on the station data in the map information, thereby obtaining a set of transfer stations.

[0151] S202. For each transfer station in the set of transfer stations, the server searches for a matching transfer station in the set of transfer stations.

[0152] S203. The server will point to the edge that matches the transfer station from each transfer station, which will be the directed edge corresponding to each transfer station.

[0153] After obtaining the set of transfer boarding stations, the server reads the station data corresponding to each transfer boarding station to determine the reachable transfer boarding stations from each transfer boarding station. These reachable transfer boarding stations are then designated as the matching transfer boarding stations for each transfer boarding station. The server then uses the edges originating from each transfer boarding station and pointing to the matching transfer boarding stations corresponding to each transfer boarding station as directed edges for each transfer boarding station. These directed edges represent the transfer relationships between each transfer boarding station and the matching transfer boarding stations.

[0154] For example, Figure 13 This is a schematic diagram of the directed edges corresponding to the transfer boarding stations provided in the embodiments of this application. If a transfer boarding station LiSu can reach another transfer boarding station LjSv through a transfer at station LiSr, then LjSv is the matching transfer boarding station of LiSu. Figure 13 The solid line edge pointing from LiSu to LjSv is the directed edge corresponding to LiSu, and Figure 13 The dashed line from LiSu to LiSr, and then from LiSr to LjSv, represents the transfer relationship between LiSu and LjSv.

[0155] S204. The server uses the directed edges corresponding to each transfer boarding station to piece together the transfer station map.

[0156] After the server determines the directed edges corresponding to each transfer station, it will connect all the directed edges to obtain a network search graph, which is the transfer station graph.

[0157] In this embodiment of the application, the server can construct a transfer station map using the transfer boarding stations of each bus line before receiving the route planning request sent by the terminal, so that the server can search for transfer routes in the transfer station map and reduce the search space.

[0158] In some embodiments of this application, the server searches for a matching transfer station from the set of transfer stations for each transfer station. The specific implementation process of S202 may include: S2021-S2022, as follows: S2021. The server searches the set of transfer stations to find the transfer stations that can be reached after a preset number of transfers from each transfer station.

[0159] S2022. The server will use the transfer stations reached after a preset number of transfers as the matching transfer stations corresponding to each transfer station.

[0160] The server uses each transfer station in the set of transfer stations as the starting station, finds the transfer stations that can be reached after a preset number of transfers, and uses these transfer stations as the matching transfer stations for each transfer station. In this way, the server completes the search for matching transfer stations.

[0161] Understandably, the preset number can be set according to actual conditions. For example, it can be set to 1, so that the matched transfer stations are the transfer stations that can be reached after one transfer from each transfer station; or it can be set to 2, so that the matched transfer stations are the transfer stations that can be reached after two transfers from each transfer station. Of course, the preset number can also be set to other values, which are not limited here.

[0162] In this embodiment of the application, the server can extract the transfer stations that can be reached after a preset number of transfers from the set of transfer stations, and use them as matching transfer stations, so that the directed edge corresponding to each transfer station can be constructed by using each transfer station and its corresponding matching transfer station.

[0163] In some embodiments of this application, after the server constructs the transfer station map using the directed edges corresponding to each transfer boarding station, i.e. after S204, the method may further include: S205-S208, as follows: S205. The server extracts transfer routes to be optimized from the transfer station map that have at least two directed edges.

[0164] In practice, there are likely to be multiple different transfer routes between a given transfer station and its corresponding matching transfer station; that is, there may be multiple directed edges between the transfer station and its matching matching transfer station. Therefore, the transfer routes between the transfer station and its matching matching transfer station may be redundant. In this embodiment, the goal is to remove this redundancy to optimize the transfer station graph. In this case, the server will first determine from the transfer station graph that there are at least two directed edges that need to be optimized.

[0165] It should be noted that the transfer route to be optimized can refer to the route from one public transportation line to another public transportation line through a transfer. In this case, at least two directed edges can respectively represent the transfer methods corresponding to the same transfer boarding station on one public transportation line to at least two different transfer boarding stations on another public transportation line.

[0166] For example, when transferring from L2 to L5, there are two transfer options: transferring from L2S1 to L5S1 and transferring from L2S1 to L5S2. Therefore, the route from L2 to L5 is the transfer route to be optimized.

[0167] In some embodiments, the transfer route to be optimized may also include transfer routes that start from the same platform (a platform refers to a group of transfer stations that are very close to each other, for example, less than 50 meters apart) and reach the same transfer station. For example, if a platform has three transfer stations, L5S1, L4S2, and L6S2, then the transfer route starting from that platform and transferring to the same transfer station L7S1 is the transfer route to be optimized.

[0168] S206. For at least two directed edges in the transfer route to be optimized, the server calculates the corresponding transfer cost value for each, and selects the directed edge with the smallest transfer cost value from the at least two directed edges.

[0169] After obtaining the transfer route to be optimized, the server calculates the transfer cost value for each directed edge in the route, compares the transfer costs of each directed edge with each other, determines the minimum transfer cost value, and selects the directed edge corresponding to the minimum transfer cost value.

[0170] It should be noted that the transfer value of each directed edge can include both walking value and transportation value. The walking value can be calculated based on factors such as the time required to walk, the walking distance, and even the weather, while the transportation value can be calculated based on factors such as the distance traveled, the cost of the ride, the waiting time, the travel time, and the comfort level of the vehicle.

[0171] In some embodiments, the value of walking can also be replaced by the value of cycling. The value of cycling can be calculated by factors such as cycling time, cycling distance, and the amount of money required for cycling. This application does not limit this.

[0172] S207. The server deletes all directed edges from at least two directed edges except for the one with the lowest cost, to obtain the optimized route corresponding to the route to be optimized.

[0173] S208. The server uses the directed edges corresponding to the optimized routes and the directed edges corresponding to the routes other than the routes to be optimized in the transfer station map to connect them to form the optimized transfer station map.

[0174] After obtaining the directed edge with the minimum transfer cost, the server will delete all directed edges from at least two of the directed edges corresponding to the transfer route to be optimized, except for the one with the minimum transfer cost. This yields the optimized route. Finally, the directed edges of the transfer routes that do not require optimization (i.e., the transfer routes in the transfer station graph excluding the one to be optimized) are concatenated with the directed edges of the optimized route to obtain the optimized transfer station graph. This further reduces the search space.

[0175] It should be noted that after the optimized transfer station map is determined, when the server receives a route planning request from the terminal, it can respond to the route planning request and determine candidate routes based on the starting point location, the ending point location, and the optimized transfer station map, thereby improving route planning efficiency.

[0176] In this embodiment of the application, the server can also extract the transfer routes to be optimized from the transfer station map, and then optimize the transfer routes to be optimized according to the transfer cost value, thereby deleting redundant directed edges in the transfer routes to be optimized. In this way, the server can obtain the optimized transfer station map, further reducing the search space for candidate routes.

[0177] The following will describe an exemplary application of the embodiments of this application in a real-world application scenario.

[0178] This embodiment of the application is implemented in the scenario of querying travel routes on a user's smartphone map application. The main interface (map display interface) of the smartphone (terminal) map application has a virtual "Public Transport" button (preset icon). When the smartphone detects that the user has clicked this virtual button and entered the starting point and destination (receiving the entered starting and destination locations in the information input area), it sends the starting point and destination (a route planning request carrying the starting and destination locations) to the backend (server). After the backend plans the route, it sends the route to the smartphone, and the smartphone displays the route planned by the backend (candidate routes).

[0179] The backend path planning is divided into online and offline parts. Figure 14 This is a schematic diagram of the path planning architecture provided in an embodiment of this application. See also... Figure 14 The offline part first calculates the transfer pairs 14-1, and then constructs the optimal transfer boarding station map (optimized transfer station map) 14-2.

[0180] The calculation of transfer pairs only requires finding stations within a certain threshold distance from Manhattan and calculating the actual walking distance.

[0181] The construction of the optimal transfer boarding station map can be divided into two parts, which will be illustrated below with examples.

[0182] See Figure 15 , Figure 15 This is a schematic diagram of the bus route (public transportation route) network provided in the embodiments of this application. The hollow circles are the stops. There are a total of 8 bus routes, namely L0, L1, ..., L7. LiSj represents the stop Sj of route Li. There are multiple routes from the starting point to the destination. For example, from the starting point, walk to L0S0 to board the bus, ride to L0S1 and get off, then walk to L2S1 to board the bus, ride L2 to L2S3 and get off, walk to L4S2, then ride from L4S2 to L4S4, get off and walk to L7S1 to board the bus, ride L7 to L7S3, and finally walk from L7S3 to the destination.

[0183] The construction of the optimal transfer boarding station map is divided into edge optimization of the optimal transfer boarding stations on the same line (a route from one public transport line to another public transport line via transfer), and edge optimization of the transfer routes from the platform to the transfer boarding station (transfer routes from the same platform to the same transfer boarding station via transfer). The following section combines... Figure 15 These two will be explained separately.

[0184] 1. Edge optimization of the optimal transfer boarding station on the same route: When constructing the edge of the optimal transfer boarding station between L2 and L5, L2S1 to L5S1 is one possible edge, and L2S1 to L5S2 is another possible edge (at least two directed edges for the transfer route to be optimized). Specifically, L2S1 to L5S1 actually involves getting off at L2S3 and transferring to L5S1, and L2S1 to L5S2 actually involves getting off at L2S4 and transferring to L5S2. Therefore, we can obtain: C1 = Cost of the ride from L2S3 to L2S4 + Cost of the walk from L2S4 to L5S2 C2 = Walking cost from L2S3 to L5S1 + Travel cost from L5S1 to L5S2 If C2 (transfer cost) is greater than or equal to C1 (transfer cost), then L2S1 to L5S2 is a redundant edge (a directed edge other than the directed edge with the minimum transfer cost), and the optimal route (optimized transfer route) will not pass through it, so it will not become an edge in the optimal transfer boarding station map.

[0185] 2. Optimization of the edge from the platform to the transfer station: Figure 15 The transfer stations L5S1, L4S2, and L6S2 are very close together, so these three transfer stations belong to the same platform, denoted as platform A. Transferring from platform A to L7S1 will result in three possible edges: L5S1 to L7S1, L4S2 to L7S1, and L6S2 to L7S1. Therefore: C1 = L5 waiting time cost + L5S1 to L5S3 travel segment cost + L5S3 to L7S1 walking segment cost C2 = L4 waiting time cost + cost of the ride from L4S2 to L4S4 + cost of the walk from L4S4 to L7S1 C3 = L6 waiting time cost + L6S2 to L6S3 travel segment cost + L6S3 to L7S1 walking segment cost The backend compares C1, C2, and C3. If C1 is the smallest, only the edge from L5S1 to L7S1 is retained; if C2 is the smallest, only the edge from L4S2 to L7S1 is retained; and if C3 is the smallest, only the edge from L6S2 to L7S1 is retained. In other words, the backend only retains the optimal edge from platform A to L7S1.

[0186] This completes the offline portion.

[0187] See also Figure 14 The online part first searches for stations (14-3), then calls the walking distance matrix service (14-4), performs parallel search using two algorithms (14-5), and finally sorts and filters routes (14-6) to obtain the final set of routes (candidate routes).

[0188] Station search involves first identifying candidate stations around the starting point (candidate starting point stations) and candidate stations around the ending point (candidate ending point stations). At this point, candidate stations within a few kilometers (preset range) are typically found, which can usually be queried online by pre-establishing a spatial index.

[0189] Calling the walking distance matrix service means obtaining the actual walking route distance (walking distance) from the starting point to the candidate stations around the starting point, and the actual walking route distance from the candidate stations around the ending point to the ending point. The walking distance matrix service can be implemented using the CH+RPHAST algorithm.

[0190] Before performing an online search on the optimal transfer station map, the backend needs to map candidate stations to their corresponding transfer stations in the map. For example, for candidate stations L0S0 around the starting point, the first transfer station is found along the L0 line (the line corresponding to the candidate starting point), i.e., L0S1 (the starting point transfer station). For candidate stations L7S3 around the destination, the first transfer station is found along the opposite direction of the L7 line (the line corresponding to the candidate destination), i.e., L7S1 (the destination transfer station). Then, the backend uses these two found transfer stations to search the optimal transfer station map (searching for transfer routes). This uses a dual-algorithm parallel search (at least two search algorithms): BFS route search and Astar route search. This is because BFS excels at prioritizing routes with the fewest transfers, but when starting or ending stations are densely packed, it may not find the optimal solution after a certain number of search steps. Astar effectively solves this problem because it excels at prioritizing routes with low cost, thus complementing BFS.

[0191] For direct routes, the backend does not need to search in the optimal transfer station map. Instead, it can directly obtain the route by taking the intersection of the route set involved in the candidate origin station and the route set involved in the candidate destination station.

[0192] The backend system searches the set of routes, then sorts and filters them to obtain the final set of routes. It's understandable that the sorting can be based on machine learning or measurement strategy rules.

[0193] The above method enables the search of transfer routes from the transfer station map, thereby reducing the search space and improving search performance. Further optimization of the transfer station map yields an optimal map that significantly reduces the search space, further enhancing search performance and improving route planning efficiency. Simultaneously, the parallel search using a combination of two algorithms leverages their complementary nature to increase route diversity.

[0194] The following description continues to illustrate the exemplary structure of the route planning device 455 provided in the embodiments of this application as a software module. In some embodiments, such as... Figure 2 As shown, the software module stored in the route planning device 455 in the first memory 450 may include: The information display module 4551 is used to display a route information interface in response to a trigger operation on a preset marker when a trigger operation is detected on the preset marker of the map display interface. The first sending module 4552 is used to send the starting point and the ending point in a route planning request to the server when the starting point and the ending point are received in the information input area of ​​the route information interface. The first receiving module 4553 is used to receive candidate routes sent by the server in response to the route planning request; wherein the candidate routes are determined by the server based on the starting point location, the ending point location, and the transfer station map, and the transfer station map is a search map obtained by using all transfer boarding stations as graph nodes, so that the server can search for transfer routes between the starting point transfer boarding station and the ending point transfer boarding station from the transfer station map, and determine candidate routes based on the starting point location, the starting point transfer boarding station, the ending point transfer boarding station, the ending point location, and the transfer routes; The information display module 4551 is also used to display the candidate routes in the route display area of ​​the route information interface.

[0195] In some embodiments of this application, the information display module 4551 is further configured to, in response to a trigger operation on the candidate route detected, display a details information interface; in the text information display area of ​​the details information interface, display text description information of the candidate route; the text description information characterizes the transfer method of the candidate route, and the text description information includes at least one or more of the following: the starting point location, the ending point location, the station corresponding to the starting point location, the station corresponding to the ending point location, the transfer route of the candidate route, the walking distance in the candidate route, the time and cost consumed by the candidate route, and details of public transportation routes; in the image information display area of ​​the details information interface, display image route information of the candidate route; the image route information characterizes the movement trajectory of the candidate route on the map.

[0196] In some embodiments of this application, the route planning device 455 further includes: a route navigation module 4554; The information display module 4551 is also used to display navigation icons in the text information display area; The route navigation module 4554 is used to navigate the transfer of the candidate route in response to the trigger operation on the navigation sign when a trigger operation is detected on the navigation sign.

[0197] The following description continues to illustrate the exemplary structure of the route planning device 255 provided in the embodiments of this application as a software module. In some embodiments, such as... Figure 3 As shown, the software module stored in the route planning device 255 in the second memory 250 may include: The second receiving module 2551 is used to receive a route planning request sent by the terminal; the route planning request includes the starting point location and the ending point location; The route determination module 2552 is configured to, in response to the route planning request, determine the starting point transfer boarding station and the ending point transfer boarding station based on the starting point location and the ending point location; search for transfer routes between the starting point transfer boarding station and the ending point transfer boarding station from the transfer station map; the transfer station map is a search map obtained by using all transfer boarding stations as graph nodes; and determine candidate routes based on the starting point location, the starting point transfer boarding station, the ending point transfer boarding station, the ending point location, and the transfer routes. The second sending module 2553 is used to send the candidate route to the terminal so that the terminal can display the candidate route.

[0198] In some embodiments of this application, the route determination module 2552 is further configured to: find candidate starting stations from map information for the starting point location; find candidate ending stations from map information for the ending point location; extract the starting transfer station corresponding to the candidate starting station from each station of the line corresponding to the candidate starting station; and extract the ending transfer station corresponding to the candidate ending station from each station of the line corresponding to the candidate ending station.

[0199] In some embodiments of this application, the route determination module 2552 is further configured to, based on the map information, search for routes from the starting point to the candidate starting point station, routes from the candidate starting point station to the starting point transfer station, routes from the ending point transfer station to the candidate ending point, and routes from the candidate ending point to the ending point; and to concatenate the routes from the starting point to the candidate starting point station, the routes from the candidate starting point station to the starting point transfer station, the transfer routes, the routes from the ending point transfer station to the candidate ending point, and the routes from the candidate ending point to the ending point into the candidate route.

[0200] In some embodiments of this application, the route determination module 2552 is further configured to use each of at least two search algorithms to radially diffuse from the starting transfer station to each transfer station in the transfer station map until the destination transfer station is reached, thereby obtaining a diffusion path between the starting transfer station and the destination transfer station; and to take the shortest diffusion path as the transfer route.

[0201] In some embodiments of this application, the route planning device 255 further includes a station map construction module 2554; The station map construction module 2554 is used to acquire the transfer boarding stations of each public transportation line to obtain a set of transfer boarding stations; for each transfer boarding station in the set of transfer boarding stations, a matching transfer boarding station is found in the set of transfer boarding stations; the edge pointing from each transfer boarding station to the matching transfer boarding station is used as the directed edge corresponding to each transfer boarding station; and the transfer station map is constructed by using the directed edges corresponding to each transfer boarding station.

[0202] In some embodiments of this application, the station map construction module 2554 is further configured to search from the set of transfer boarding stations for transfer boarding stations that are reached after a preset number of transfers from each transfer boarding station; and to use the transfer boarding stations reached after a preset number of transfers as the matching transfer boarding stations corresponding to each transfer boarding station.

[0203] In some embodiments of this application, the station map construction module 2554 is further configured to extract, from the transfer station map, transfer routes to be optimized that have at least two directed edges; calculate the corresponding transfer cost value for each of the at least two directed edges in the transfer routes to be optimized, and select the directed edge with the smallest transfer cost value from the at least two directed edges; delete the directed edges other than the directed edge with the smallest transfer cost value from the at least two directed edges to obtain the optimized transfer route corresponding to the transfer route to be optimized; and use the directed edges of the optimized transfer route and the directed edges of the transfer routes other than the transfer routes to be optimized in the transfer station map to construct the optimized transfer station map.

[0204] This application provides a computer program product or computer program that includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the route planning method described above in this application.

[0205] This application provides a computer-readable storage medium storing executable instructions, including executable route planning instructions. When the executable route planning instructions are executed by a processor, the processor will execute the route planning method provided in this application.

[0206] In some embodiments, the computer-readable storage medium may be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; or it may be a variety of devices including one or any combination of the above-mentioned memories.

[0207] In some embodiments, executable route planning instructions may take the form of a program, software, software module, script, or code, written in any form of programming language (including compiled or interpreted languages, or declarative or procedural languages), and may be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.

[0208] As an example, executable route planning instructions may, but do not necessarily, correspond to files in a file system. They may be stored as part of a file that holds other programs or data, for example, in one or more scripts in a HyperText Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple collaborative files (e.g., a file that stores one or more modules, subroutines, or code sections).

[0209] As an example, executable route planning instructions can be deployed to execute on a single computing device, or on multiple computing devices located at one location, or on multiple computing devices distributed across multiple locations and interconnected via a communication network.

[0210] The above description is merely an embodiment of this application and is not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, and improvements made within the spirit and scope of this application are included within the scope of protection of this application.

Claims

1. A route planning method, characterized in that, include: When a trigger operation is detected on a preset marker on the map display interface, the route information interface is displayed in response to the trigger operation on the preset marker. When the starting point and ending point are input in the information input area of ​​the route information interface, the starting point and ending point are sent to the server along with the route planning request. The server receives candidate routes in response to the route planning request; wherein the candidate routes are determined by the server based on the starting point location, the ending point location, and an optimized transfer station map. The optimized transfer station map is a search graph obtained by using all transfer boarding stations as graph nodes. The optimized transfer station map includes directed edges for each of the transfer boarding stations, and the directed edges represent the transfer relationships between transfer boarding stations, so that the server can use each of at least two search algorithms to plan routes starting from the starting transfer boarding station. The process begins by radially spreading each transfer boarding station in the optimized transfer station map until it reaches the destination transfer boarding station, thus obtaining the diffusion path between the starting transfer boarding station and the destination transfer boarding station. The shortest diffusion path is taken as the transfer route. Candidate routes are determined based on the starting location, the starting transfer boarding station, the destination transfer boarding station, the destination location, and the transfer route. The transfer boarding station is the boarding station in a transfer pair, which includes two stations that can be transferred via non-vehicle means. The optimized transfer station map is obtained as follows: from the transfer station map spliced ​​by the directed edges, the transfer routes to be optimized with at least two directed edges are extracted; from the at least two directed edges in the transfer routes to be optimized, the directed edge with the minimum transfer cost is selected; from the at least two directed edges, all directed edges except the directed edge with the minimum transfer cost are deleted to obtain the optimized transfer routes corresponding to the transfer routes to be optimized; using the directed edges of the optimized transfer routes and the directed edges of the transfer routes in the transfer station map other than the transfer routes to be optimized, the optimized transfer station map is spliced ​​together. The candidate routes are displayed in the route display area of ​​the route information interface; wherein, the server obtains the walking distance corresponding to the route from the starting point to the candidate starting point station and the walking distance corresponding to the route from the candidate ending point station to the ending point by calling the walking distance matrix service, and the walking distance is used for the user to select the optimal candidate route.

2. The method according to claim 1, characterized in that, After displaying the candidate routes in the route display area of ​​the route information interface, the method further includes: When a trigger operation is detected for the candidate route, a detailed information interface is displayed in response to the trigger operation for the candidate route; In the text information display area of ​​the details information interface, the text description information of the candidate route is displayed; the text description information represents the transfer method of the candidate route, and the text description information includes at least one of the following: the starting point location, the ending point location, the station corresponding to the starting point location, the station corresponding to the ending point location, the transfer route of the candidate route, the walking distance of the candidate route, the time and cost of the candidate route, and the details of the public transportation line; The image information display area of ​​the details information interface displays the image route information of the candidate route; the image route information represents the movement trajectory of the candidate route on the map.

3. The method according to claim 2, characterized in that, After displaying the text description information of the candidate route in the text information display area of ​​the details information interface, the method further includes: Display navigation icons in the text information display area; When a trigger operation is detected on the navigation sign, navigation is performed for the transfer of the candidate route in response to the trigger operation on the navigation sign.

4. A route planning method, characterized in that, include: Get the transfer station map; From the transfer station map, extract the transfer routes to be optimized that have at least two directed edges; From at least two directed edges in the transfer route to be optimized, select the directed edge with the minimum transfer cost. From the at least two directed edges, delete all directed edges except the one with the lowest transfer cost to obtain the optimized transfer route corresponding to the transfer route to be optimized. Using the directed edges of the optimized transfer routes and the directed edges of the transfer routes in the transfer station map other than the transfer route to be optimized, the optimized transfer station map is constructed. Receive route planning requests sent by the terminal; The route planning request includes the starting point and the ending point; In response to the route planning request, the origin transfer station and the destination transfer station are determined based on the origin location and the destination location. Using at least two search algorithms, each of the search algorithms is used to radially diffuse from the origin transfer station to each transfer station in the optimized transfer station map until the destination transfer station is reached, thereby obtaining the diffusion path between the origin transfer station and the destination transfer station. The shortest diffusion path will be used as the transfer route; The optimized transfer station map is a search graph obtained by using all transfer boarding stations as graph nodes. The optimized transfer station map includes directed edges for each transfer boarding station, and the directed edges represent the transfer relationship between transfer boarding stations. The transfer boarding station is the boarding station in a transfer pair, and the transfer pair includes two stations that can be transferred by non-passenger means. Based on the starting point location, the starting point transfer station, the ending point transfer station, the ending point location, and the transfer route, candidate routes are determined; The candidate routes are sent to the terminal so that the terminal can display the candidate routes; wherein, by calling the walking distance matrix service, the walking distances corresponding to the routes from the starting point to the candidate starting point station and the walking distances corresponding to the routes from the candidate ending point station to the ending point are obtained respectively, and the walking distances are used for the user to select the optimal candidate route.

5. The method according to claim 4, characterized in that, The process of determining the origin transfer station and the destination transfer station based on the origin location and the destination location includes: For the starting point location, candidate starting point stations are found from the map information; and for the ending point location, candidate ending point stations are found from the map information. Among the stations of the line corresponding to the candidate origin station, the origin transfer boarding station corresponding to the candidate origin station is extracted; and among the stations of the line corresponding to the candidate destination station, the destination transfer boarding station corresponding to the candidate destination station is extracted.

6. The method according to claim 5, characterized in that, The process of determining candidate routes based on the starting point location, the starting point transfer station, the ending point transfer station, the ending point location, and the transfer route includes: Based on the map information, routes from the starting point to the candidate starting point station, routes from the candidate starting point station to the starting point transfer station, routes from the destination transfer station to the candidate destination station, and routes from the candidate destination station to the destination point are searched. The candidate route is formed by combining the route from the starting point to the candidate starting point station, the route from the candidate starting point station to the starting point transfer station, the transfer route, the route from the ending point transfer station to the candidate ending point station, and the route from the candidate ending point station to the ending point.

7. The method according to any one of claims 4 to 6, characterized in that, The process of obtaining the transfer station map includes: The transfer and boarding stations for each public transportation line are obtained to form a set of transfer and boarding stations; For each transfer station in the set of transfer stations, find a matching transfer station from the set of transfer stations. The edge pointing from each transfer boarding station to the matching transfer boarding station is taken as the directed edge corresponding to each transfer boarding station; The transfer station map is constructed by piecing together the directed edges corresponding to each transfer boarding station.

8. The method according to claim 7, characterized in that, For each transfer station in the set of transfer stations, finding a matching transfer station from the set of transfer stations includes: From the set of transfer stations, search for the transfer station that can be reached by starting from each of the transfer stations and going through a preset number of transfers. The transfer stations reached after a preset number of transfers are taken as the matching transfer stations corresponding to each transfer station.

9. A route planning device, characterized in that, include: The information display module is used to display a route information interface in response to a trigger operation on a preset marker when a trigger operation is detected on the preset marker of the map display interface. The first sending module is used to send the starting point and the ending point in a route planning request to the server when the starting point and the ending point are received in the information input area of ​​the route information interface. The first receiving module is configured to receive candidate routes sent by the server in response to the route planning request; wherein the candidate routes are determined by the server based on the starting point location, the ending point location, and an optimized transfer station map. The optimized transfer station map is a search graph obtained by using all transfer boarding stations as graph nodes. The optimized transfer station map includes directed edges for each of the transfer boarding stations, and the directed edges represent the transfer relationships between the transfer boarding stations. The server uses at least two search algorithms to radially diffuse from the starting transfer boarding station to each transfer boarding station in the optimized transfer station map until it diffuses to the ending transfer boarding station, thereby obtaining a diffusion path between the starting transfer boarding station and the ending transfer boarding station; the shortest diffusion path is taken as the transfer route; and based on the starting point location and the starting transfer... Candidate routes are determined by the boarding station, the destination transfer boarding station, the destination location, and the transfer route; wherein, the transfer boarding station is the boarding station in the transfer pair, and the transfer pair includes two stations that can be transferred by non-transfer means; wherein, the optimized transfer station map is obtained by the following method: extracting the transfer routes to be optimized from the transfer station map spliced ​​by the directed edges; selecting the directed edge with the minimum transfer cost from the at least two directed edges in the transfer routes to be optimized; deleting the directed edges other than the directed edge with the minimum transfer cost from the at least two directed edges to obtain the optimized transfer route corresponding to the transfer route to be optimized; using the directed edges of the optimized transfer route and the directed edges of the transfer routes in the transfer station map other than the transfer route to be optimized, the optimized transfer station map is spliced ​​together. The information display module is also used to display the candidate routes in the route display area of ​​the route information interface; wherein, the server obtains the walking distance corresponding to the route from the starting point to the candidate starting point station and the walking distance corresponding to the route from the candidate ending point station to the ending point by calling the walking distance matrix service, and the walking distance is used for the user to select the optimal candidate route.

10. A route planning device, characterized in that, include: The station map construction module is used to obtain the transfer station map; From the transfer station map, extract the transfer routes to be optimized that have at least two directed edges; From at least two directed edges in the transfer route to be optimized, select the directed edge with the minimum transfer cost; from the at least two directed edges, delete all directed edges except the directed edge with the minimum transfer cost to obtain the optimized transfer route corresponding to the transfer route to be optimized. Using the directed edges of the optimized transfer routes and the directed edges of the transfer routes in the transfer station map other than the transfer route to be optimized, the optimized transfer station map is constructed. The second receiving module is used to receive route planning requests sent by the terminal; The route planning request includes the starting point and the ending point; The route determination module is used to respond to the route planning request and determine the starting point transfer station and the ending point transfer station based on the starting point location and the ending point location. Using at least two search algorithms, each of the search algorithms is used to radially diffuse from the origin transfer station to each transfer station in the optimized transfer station map until the destination transfer station is reached, thereby obtaining the diffusion path between the origin transfer station and the destination transfer station. The shortest diffusion path will be used as the transfer route; The optimized transfer station map is a search graph obtained by using all transfer boarding stations as graph nodes. The optimized transfer station map includes directed edges for each transfer boarding station, and the directed edges represent the transfer relationship between transfer boarding stations. A transfer boarding station is a boarding station in a transfer pair, and the transfer pair includes two stations that can be transferred via non-transfer methods. Candidate routes are determined based on the starting location, the starting transfer boarding station, the ending transfer boarding station, the ending location, and the transfer route. The second sending module is used to send the candidate routes to the terminal so that the terminal can display the candidate routes; wherein, the server obtains the walking distance corresponding to the route from the starting point to the candidate starting point station and the walking distance corresponding to the route from the candidate ending point station to the ending point by calling the walking distance matrix service, and the walking distance is used for the user to select the optimal candidate route.

11. An electronic device, characterized in that, include: Memory, used to store executable route planning instructions; The processor, when executing executable route planning instructions stored in the memory, implements the method of any one of claims 1 to 3, or implements the method of any one of claims 4 to 8.

12. A computer-readable storage medium, characterized in that, The device stores executable route planning instructions, which, when executed by a processor, implement the method described in any one of claims 1 to 3; or, when executed by a processor, implement the method described in any one of claims 4 to 8.

13. A computer program product comprising computer-executable instructions or a computer program, characterized in that, When the computer-executable instructions or computer program are executed by a processor, they implement the method according to any one of claims 1 to 3, or the method according to any one of claims 4 to 8.

Images