Line generation method, device, equipment and storage medium

By selecting the administrative regions accessible by road transportation at the starting point and the administrative regions accessible by non-highway transportation, the shortest route from the departure point to the remote area is generated, which solves the problem of the inability to plan the route in the existing technology and improves the travel of users Experience.

CN111782749BActive Publication Date: 2024-11-01BEIJING BAIDU NETCOM SCI & TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202010598479.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-06-28
Publication Date
2024-11-01
Estimated Expiration
2040-06-28

AI Technical Summary

Technical Problem

The existing technology cannot effectively plan the end route from the starting point to the remote area, resulting in poor user travel experience.

Method used

By selecting the first administrative region that can be reached by road transportation from the starting point, determining the second administrative region that can be reached by multiple adjacent non-highway transportation vehicles, and selecting the route with the least time as the final route, the starting point to the goal is achieved The route to the ground is generated.

Benefits of technology

It solves the problem that routes cannot be planned in remote areas, improves users' travel experience, and realizes intelligent route search from the starting point to the remote area.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111782749B_ABST
    Figure CN111782749B_ABST
Patent Text Reader

Abstract

The present application discloses a route generation method, device, equipment and storage medium, which relates to the fields of intelligent transportation and intelligent search; the specific implementation scheme is: select a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination belongs, wherein the first administrative district is an area that can only be reached from the departure place by road transportation; there are multiple second administrative districts, and the second administrative district is an area that can be reached from the departure place by non-road transportation; determine candidate routes from the departure place to the second administrative district, and from the second administrative district to the destination; select the candidate route with the shortest time from the candidate routes as the final route from the departure place to the destination. Through this application, the generation of travel routes from the departure place to relatively remote areas is realized, which improves the travel experience of users.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to computer technology, and specifically to intelligent search and intelligent transportation technology; the present application provides a route generation method, device, equipment and storage medium. Background Art

[0002] Currently, almost all mainstream map applications can provide good route planning capabilities for densely populated areas (such as coastal cities in eastern China), but for remote areas (such as Xinjiang, Tibet, Qinghai, etc. in China), they usually plan longer routes or even no routes. Summary of the invention

[0003] The present disclosure provides a method, apparatus, device and storage medium for generating a line.

[0004] According to one aspect of the present disclosure, a route generation method is provided, comprising: selecting a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination is located, wherein the first administrative district is an area that can only be reached from a departure point by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure point by non-road transportation; determining candidate routes from the departure point to the second administrative district, and from the second administrative district to the destination; and selecting the candidate route with the shortest time from the candidate routes as the final route from the departure point to the destination.

[0005] According to another aspect of the present disclosure, a route generation device is provided, comprising: a first selection module, for selecting a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination is located, wherein the first administrative district is an area that can only be reached from a departure point by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure point by non-road transportation; a determination module, for determining candidate routes from the departure point to the second administrative district, and from the second administrative district to the destination; a second selection module, for selecting the candidate route with the shortest time from the candidate routes as the final route from the departure point to the destination.

[0006] According to another aspect of the present disclosure, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the above-mentioned circuit generation method.

[0007] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the above-mentioned circuit generation method.

[0008] The technology according to the present application solves the problem in the prior art that a route from a starting point to a destination in a remote area cannot be planned, realizes the generation of a route from a starting point to a relatively remote area, and improves the user's travel experience.

[0009] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present application.

[0011] Figure 1 is a flow chart of a method for generating a circuit according to an embodiment of the present application;

[0012] Figure 2 is a schematic diagram of multimodal transport path planning based on the constructed data structure according to the present application;

[0013] Figure 3 is a schematic diagram of the structure of a circuit generating device according to an embodiment of the present application;

[0014] Figure 4 It is a block diagram of an electronic device used to implement the circuit generation method of the embodiment of the present application. DETAILED DESCRIPTION

[0015] The following is a description of exemplary embodiments of the present application in conjunction with the accompanying drawings, including various details of the embodiments of the present application to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present application. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0016] The present application embodiment provides a method for generating a line. Figure 1 is a flow chart of a method for generating a circuit according to an embodiment of the present application, such as Figure 1 As shown, the steps of the method include:

[0017] Step S102, selecting a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination is located, wherein the first administrative district is an area that can only be reached from the departure point by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure point by non-road transportation;

[0018] It should be noted that the non-road vehicles in the embodiments of the present application can be airplanes, trains, high-speed trains, ships, etc. That is, as long as the vehicles are not traveling on the road, they are in the embodiments of the present application. The road vehicles involved in the embodiments of the present application include: cars, motorcycles and other vehicles that can travel on the road. Based on this, the areas reached by the non-road vehicles in the embodiments of the present application are areas that cannot be reached by airplanes, trains, high-speed trains, ships and other vehicles; because most areas can be reached by the above-mentioned airplanes, trains, high-speed trains, ships and other vehicles, only relatively remote areas have not yet developed the above-mentioned non-road vehicles. That is, the areas that can only be reached by road vehicles from the departure point, that is, the areas that cannot be reached by non-road vehicles, are relatively remote areas.

[0019] In addition, the levels of administrative districts in the embodiments of the present application may include: county-level administrative districts, city-level administrative districts, and provincial-level administrative districts. Of course, if there are other division rules or division methods, they are also within the protection scope of the present application, such as: state-level administrative districts, county-level administrative districts, city-level administrative districts, and town-level administrative districts; the above-mentioned administrative district level division is only an example.

[0020] Step S104, determining candidate routes from the departure location to the second administrative district, and from the second administrative district to the destination;

[0021] Step S106, selecting the candidate route with the shortest travel time from the candidate routes as the final route from the departure point to the destination.

[0022] It can be known from the above steps S102 to S106 that since the first administrative district cannot be reached by non-road transportation, routes to multiple second administrative districts adjacent to the first administrative district can be generated first, and the second administrative district is an area that can be reached by non-road transportation; therefore, there are multiple routes from the departure point to the second administrative district, and there are also multiple routes from the second administrative district to the destination, and then the candidate route with the shortest time is selected from the candidate routes as the final route from the departure point to the destination, thereby realizing the generation of the route from the departure point to the remote destination, that is, realizing the intelligent search of the route from the departure point to the destination, solving the problem in the prior art that it is impossible to plan a route from the starting point to the end point for the user for a relatively remote destination, thereby improving the user's travel experience.

[0023] It should be noted that in the remote areas involved in the embodiments of the present application, the optional minimum administrative unit is the county-level administrative district. For example, if the destination is Village A, the final destination is preferably the county-level administrative district to which Village A belongs, and then the route from the departure point to the destination is planned. That is, when the first administrative district is the county-level administrative district to which the destination area belongs, the method of selecting the second administrative district from the neighboring administrative districts of the first administrative district involved in step S102 in the embodiments of the present application can further be:

[0024] Step S102-11, determining the provincial administrative region to which the first administrative region belongs;

[0025] Step S102-12, selecting a second administrative district adjacent to the first administrative district from the provincial-level administrative districts to which the first administrative district belongs, wherein the second administrative district includes: an administrative district at the same level as the first administrative district, and / or an administrative district at a higher level than the first administrative district.

[0026] Normally, to go to a certain place, the common way is to first plan to the province where the destination is located, and then further plan to the city where the destination is located, and then to the neighboring county of the county where the destination is located; of course, it is also possible to directly plan to the neighboring county of the county where the destination is located. For example, if the destination is in County A, it is first planned to the provincial capital city of Province B, the provincial administrative region where County A is located, and then planned to City C, the municipal administrative region where County A is located, and then planned to multiple counties D adjacent to County A, that is, after planning the provincial capital city, you can first determine the municipal administrative region higher than the first administrative region, and then plan the administrative region at the same level as the first administrative region as the second administrative region; of course, it can also be: if the destination is in County A, it is first planned to the provincial capital city of Province B, the provincial administrative region where County A is located, and then planned to multiple counties D adjacent to County A, that is, after planning the provincial capital city, you can directly determine the administrative region at the same level as the first administrative region as the second administrative region. It can be seen that the second administrative region can be determined relatively quickly by the above steps S102-11 and S102-12.

[0027] Based on the above steps S102-11 and S102-12, the method of determining the candidate routes from the departure place to the second administrative district and from the second administrative district to the destination involved in step S104 in the embodiment of the present application can further be:

[0028] Step S104-11, determining the capital city of the provincial-level administrative region to which the second administrative region belongs from the departure place, and determining the city-level city of the municipal-level administrative region to which the second administrative region belongs from the departure place;

[0029] Step S104-12, determining candidate routes from the departure place to the provincial capital, the provincial capital to the municipal city, and the municipal city to the second administrative district.

[0030] For the above steps S104-11 and S104-12, taking the above-mentioned County A as an example, the specific steps may be: firstly plan a non-highway traffic route from the departure place to the capital city of Province D, such as the flight route-time from the departure place to the capital city of Province D, the train route-time from the departure place to the capital city of Province D, the train route-time from the departure place to the capital city of Province D, etc., and then plan a non-highway traffic route from the capital city of Province D to the municipal city where County A is located. It can be seen that the candidate routes from the departure place to the second administrative district can be quickly planned through the above steps S104-11 and S104-12.

[0031] However, although the above method can quickly plan a route, there is still a situation: although County A is in Province B, if County A is adjacent to Province F, and the time taken for the route from the departure point to Province F and then to County A is less than the time taken for the route from the departure point to Province B and then to County A, then the method of selecting the second administrative district from the neighboring administrative districts of the first administrative district involved in step S102 of the embodiment of the present application can be further:

[0032] Step S102-21, determining the provincial administrative region to which the first administrative region belongs;

[0033] Step S102-22, selecting a third administrative district adjacent to the first administrative district from the provincial-level administrative districts to which the first administrative district belongs, wherein the third administrative district includes administrative districts at the same level as the first administrative district and / or administrative districts at a higher level than the first administrative district;

[0034] Step S102-23, selecting a fourth administrative district adjacent to the first administrative district from the provincial-level administrative districts adjacent to the provincial-level administrative district to which the first administrative district belongs, wherein the fourth administrative district includes: an administrative district at the same level as the first administrative district, and / or an administrative district at a higher level than the first administrative district;

[0035] Among them, the second administrative district includes the third administrative district and the fourth administrative district.

[0036] From the above steps S102-21 to 102-23, if the destination is located near the border of two provinces, then the route from the destination in the adjacent provincial road and the route from the province to the destination can be planned, and the final route can be determined from all the above routes. For example, County A is located at the junction of Province B and Province C, but County A belongs to Province B; then it can be planned from the departure point to the capital city of Province A, then to the municipal city where County A is located, and then to the neighboring county of County A, that is, the second administrative district. It can also be planned from the departure point to the capital city of Province B, and then to the neighboring administrative district of County A, which is in Province C, and then the second administrative district is determined. Although this method is more complicated than the above method of directly determining the route from the province, this method can more reasonably plan a route that takes less time.

[0037] Based on the above steps S102-21 to S102-23, the method of determining the candidate routes from the departure place to the second administrative district and from the second administrative district to the destination involved in step S104 in the embodiment of the present application can further be:

[0038] Step S104-21, determining the first provincial capital city of the provincial administrative region to which the second administrative region belongs from the departure place, and determining the first municipal city of the municipal administrative region to which the second administrative region belongs;

[0039] Step S104-22, determining first candidate routes from the departure place to the first provincial capital city, the first provincial capital city to the first municipal city, and the first municipal city to the second administrative district;

[0040] Step S104-23, determining a second provincial capital city in a neighboring provincial administrative region from the departure place to the provincial administrative region to which the first administrative region belongs, and determining a second city-level city in a neighboring provincial administrative region that is adjacent to the second administrative region;

[0041] Step S104-24, determining second candidate routes from the departure place to the second provincial capital city, the second provincial capital city to the second municipal city, and the second municipal city to the second administrative district.

[0042] For the above steps S104-21 to S104-24, taking the above-mentioned County A located at the junction of Province B and Province C as an example, a first candidate route can be planned from the departure place to the capital city of Province A, then to the municipal city where County A is located, and then to the neighboring county of County A. A second candidate route can also be planned from the departure place to the capital city of Province B, and then to the neighboring administrative district of County A. Finally, the first candidate route and the second candidate route are combined, and then combined with the candidate route of highway traffic from the second administrative district to the destination to determine the final route with the least time. It can be seen that the method in steps S104-21 to S104-24 can more comprehensively plan the route with the least time.

[0043] Optionally, the method of selecting the second administrative district from the neighboring administrative districts of the first administrative district involved in step S104 in the embodiment of the present application may further be:

[0044] Step S104-31, determining a fifth administrative district that can be reached from the departure point by non-road transportation from the neighboring administrative districts, wherein there are multiple fifth administrative districts; and the level of the fifth administrative district is higher than or equal to the first administrative district;

[0045] Step S104-32, selecting a preset number of administrative districts from multiple fifth administrative districts according to the distance to the destination in ascending order, wherein the selected administrative district is the second administrative district.

[0046] There is another situation that the departure place can go directly to the administrative district adjacent to the destination without passing through the provincial capital city of the province where the destination is located and the city-level city where the destination is located. Therefore, through the above steps S104-31 and S104-32, it can be known that it is not necessary to consider the province and city-level city of the destination first, as long as the administrative district adjacent to the destination can plan a non-highway transportation route to the departure place, that is, this method can more quickly and reasonably intelligently search for routes.

[0047] For the route generation method involved in the embodiment of the present application, in a specific application scenario, the planning of the intermodal route can be completed by constructing a data structure, wherein the specific construction process can be:

[0048] First, construct the county KD-Tree and city KD-Tree: Since KD-Tree can support fast search process in multidimensional data space, collect the longitude and latitude information of cities at the county and city administrative levels, and construct the data structure K-Dimension Tree (KD-Tree) for the two administrative regions: longitude and latitude are used as coordinates, and the city information of the county / city is used as data. The KD-Tree constructed based on county data is called the county KD-Tree; the KD-Tree constructed based on city data is called the city KD-Tree. Since longitude and latitude are two-dimensional data, the latitude K of KD-Tree = 2. The KD-Tree data structure supports the search interface: given the longitude and latitude of the destination and the number of target cities N, the interface can return the first N cities closest to the longitude and latitude of the destination in a very short time. Therefore, based on the county KD-Tree, the neighboring counties of the destination can be searched; based on the city KD-Tree, the neighboring cities of the destination can be searched.

[0049] Secondly, build an index structure for provinces and capital cities: collect information about the longitude and latitude of the capital city and the province. Create a HashMap data structure with the province name and the longitude and latitude of the capital city. Given a province name, you can find the capital city of that province.

[0050] Based on the constructed data structure, the process of planning the multimodal transport route is as follows: Figure 2 As shown, based on Figure 2 , the planning steps of the multimodal transport path include:

[0051] Step S202, searching for nearby cities;

[0052] Among them, the latitude and longitude of the user's destination are used to find N1 counties closest to the user's destination from the county KD-Tree, and N2 cities closest to the user's destination are found from the city KD-Tree; the straight-line distance is used to find the N3 provincial capitals closest to the user's destination from all provincial capitals; the user's destination is reversely geocoded to obtain the county (latitude and longitude), city (latitude and longitude), and province information of the destination, and the provincial information is used to find the provincial capital city (latitude and longitude) of the province where the user's destination is located. In this way, up to N1+N2+N3+3 nearby cities can be found.

[0053] Step S204, parallel path planning;

[0054] Among them, the user's starting point is used as the starting point of the trunk line, and each nearby city found in step (1) is used as the end point of the trunk line to request the path planning service to plan the train / plane route for the user in parallel. For each route, the path planning service is requested to complete the route planning of the sections that need to be replaced using rapid transportation tools (such as cars, trucks, etc.) at the starting point (starting point ~ train / plane first station), the end point (train / plane last station ~ end point) and the intermediate transfer point. Finally, the two routes are integrated and become the actual planned route from the starting point to the end point. It should be noted that when the rapid transportation tool route is planned at the end point, the starting point of the rapid transportation tool is the train / plane terminal, and the end point is the destination actually entered by the user.

[0055] Step S206, route selection;

[0056] Among them, the route with the shortest time consumption is selected from all the routes planned in step S204 and returned to the user as the final route of the multimodal transport.

[0057] Through the above steps S202 to S206, the route from the departure point to the remote destination can be intelligently searched, and the route with the shortest travel time can be selected from multiple routes.

[0058] According to an embodiment of the present application, the present application also provides a line generation device, Figure 3 is a schematic diagram of the structure of a circuit generating device according to an embodiment of the present application, such as Figure 3 As shown, the device comprises:

[0059] The first selection module 301 is used to select a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination belongs, wherein the first administrative district is an area that can only be reached from the departure point by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure point by non-road transportation;

[0060] A determination module 302, for determining candidate routes from the departure location to the second administrative district, and from the second administrative district to the destination;

[0061] The second selection module 303 is used to select the candidate route with the shortest travel time from the candidate routes as the final route from the departure point to the destination.

[0062] Optionally, the first administrative district in the embodiment of the present application is the county-level administration to which the destination is located. Based on this, the first selection module 301 in the embodiment of the present application may further include: a first determination unit, used to determine the provincial-level administrative district to which the first administrative district belongs; a first selection unit, used to select a second administrative district adjacent to the first administrative district from the provincial-level administrative district to which the first administrative district belongs, wherein the second administrative district includes: an administrative district of the same level as the first administrative district, and / or an administrative district of a higher level than the first administrative district.

[0063] Optionally, the first administrative district in the embodiment of the present application is the county-level administrative district to which the destination is located; the first selection module 301 in the embodiment of the present application may further include: a second determination unit, used to determine the provincial-level administrative district to which the first administrative district belongs; a second selection unit, used to select a third administrative district adjacent to the first administrative district from the provincial-level administrative district to which the first administrative district belongs, wherein the third administrative district includes administrative districts of the same level as the first administrative district, and / or administrative districts of a higher level than the first administrative district; a third selection unit, used to select a fourth administrative district adjacent to the first administrative district from provincial-level administrative districts adjacent to the provincial-level administrative district to which the first administrative district belongs, wherein the fourth administrative district includes: an administrative district of the same level as the first administrative district, and / or an administrative district of a higher level than the first administrative district; wherein the second administrative district includes the third administrative district and the fourth administrative district.

[0064] Optionally, the determination module 302 in the embodiment of the present application may further include: a third determination unit, used to determine the provincial capital city from the departure place to the provincial-level administrative region to which the second administrative region belongs, and to determine the municipal-level city from the departure place to the municipal-level administrative region to which the second administrative region belongs; a fourth determination unit, used to determine candidate routes from the departure place to the provincial capital city, the provincial capital city to the municipal-level city, and the municipal-level city to the second administrative region.

[0065] Optionally, the determination module 302 in the embodiment of the present application may further include: a fifth determination unit, used to determine the first provincial capital city from the departure place to the provincial administrative region to which the second administrative region belongs, and to determine the first municipal-level city in the municipal administrative region to which the second administrative region belongs; a sixth determination unit, used to determine the first candidate route from the departure place to the first provincial capital city, the first provincial capital city to the first municipal-level city, and the first municipal-level city to the second administrative region; a seventh determination unit, used to determine the second provincial capital city from the departure place to the provincial administrative region adjacent to the provincial administrative region to which the first administrative region belongs, and to determine the second municipal-level city adjacent to the second administrative region in the adjacent provincial administrative region; an eighth determination unit, used to determine the second candidate route from the departure place to the second provincial capital city, the second provincial capital city to the second municipal-level city, and the second municipal-level city to the second administrative region.

[0066] Optionally, the first selection module in the embodiment of the present application may further include: a ninth determination unit, used to determine, from neighboring administrative districts, a fifth administrative district that can be reached from the departure point by non-road transportation, wherein there are multiple fifth administrative districts; the level of the fifth administrative district is higher than or equal to the first administrative district; a fourth selection unit, used to select a preset number of administrative districts from multiple fifth administrative districts in ascending order of distance to the destination, wherein the selected administrative district is the second administrative district.

[0067] According to an embodiment of the present application, the present application also provides an electronic device and a readable storage medium.

[0068] like Figure 4 , is a block diagram of an electronic device according to a method for generating a circuit according to an embodiment of the present application. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present application described and / or required herein.

[0069] like Figure 4As shown, the electronic device includes: one or more processors 401, a memory 402, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input / output device (such as a display device coupled to an interface). In other embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple electronic devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 4 A processor 401 is taken as an example.

[0070] The memory 402 is a non-transitory computer-readable storage medium provided in the present application. The memory stores instructions executable by at least one processor to enable the at least one processor to perform the circuit generation method provided in the present application. The non-transitory computer-readable storage medium of the present application stores computer instructions, which are used to enable a computer to perform the circuit generation method provided in the present application.

[0071] The memory 402 is a non-transient computer-readable storage medium that can be used to store non-transient software programs, non-transient computer executable programs and modules, such as program instructions / modules corresponding to the circuit generation method in the embodiment of the present application (for example, the attached Figure 3 The processor 401 executes various functional applications and data processing of the server by running the non-transient software programs, instructions and modules stored in the memory 402, that is, the line generation method in the above method embodiment is implemented.

[0072] The memory 402 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the electronic device generating the circuit, etc. In addition, the memory 402 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 402 may optionally include a memory remotely arranged relative to the processor 401, and these remote memories may be connected to the electronic device generating the circuit via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0073] The electronic device of the line generation method may further include: an input device 403 and an output device 404. The processor 401, the memory 402, the input device 403 and the output device 404 may be connected via a bus or other means. Figure 4 The example of connecting through bus is taken in the following.

[0074] The input device 403 can receive input digital or character information, and generate key signal input related to user settings and function control of the electronic device generating the circuit, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator bar, one or more mouse buttons, a trackball, a joystick and other input devices. The output device Y04 may include a display device, an auxiliary lighting device (e.g., an LED) and a tactile feedback device (e.g., a vibration motor), etc. The display device may include, but is not limited to, a liquid crystal display (LCD), a light emitting diode (LED) display and a plasma display. In some embodiments, the display device may be a touch screen.

[0075] Various implementations of the systems and techniques described herein can be realized in digital electronic circuit systems, integrated circuit systems, dedicated ASICs (application specific integrated circuits), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0076] These computer programs (also referred to as programs, software, software applications, or code) include machine instructions for programmable processors and can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, device, and / or means (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and / or data to a programmable processor.

[0077] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and the input from the user can be received in any form (e.g., acoustic input, voice input, or tactile input).

[0078] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0079] A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.

[0080] According to the technical solution of the embodiment of the present application, an intermodal route can be generated from a departure point to a remote destination, which provides convenience for users' travel and improves their travel experience.

[0081] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this application can be executed in parallel, sequentially or in different orders, as long as the expected results of the technical solution disclosed in this application can be achieved, and this document is not limited here.

[0082] The above specific implementations do not constitute a limitation on the protection scope of this application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of this application should be included in the protection scope of this application.

Claims

1. A method for generating a line, comprising: Selecting a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination is located, wherein the first administrative district is an area that can only be reached from the departure place by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure place by non-road transportation; determining candidate routes from the departure location to the second administrative region, and from the second administrative region to the destination; Selecting a candidate route with the shortest time from the candidate routes as a final route from the departure place to the destination; The first administrative district is the county-level administrative district to which the destination is located; the second administrative district selected from the neighboring administrative districts of the first administrative district includes: Determine the provincial administrative region to which the first administrative region belongs; Selecting a second administrative district adjacent to the first administrative district from the provincial-level administrative district to which the first administrative district belongs, wherein the second administrative district includes: an administrative district at the same level as the first administrative district, and / or an administrative district at a higher level than the first administrative district; Wherein, the selecting a second administrative district from the neighboring administrative districts of the first administrative district further comprises: Find the first N1 counties closest to the longitude and latitude of the destination in the county KD-Tree, find the first N2 cities closest to the longitude and latitude of the destination in the city KD-Tree, and find the first N3 provincial capital cities closest to the longitude and latitude of the destination in the province HashMap, the county KD-Tree is constructed based on the longitude and latitude of each of the multiple counties included in the set area and the city information, the city KD-Tree is constructed based on the longitude and latitude of each of the multiple cities included in the set area and the city information, and the province HashMap is constructed based on the province name and the longitude and latitude of the provincial capital city of each of the multiple provinces included in the set area, and N1, N2, and N3 are all positive integers; Among the N1 county-level administrative regions to which the N1 counties respectively belong, the N2 city-level administrative regions to which the N2 cities respectively belong, and the N3 provincial-level administrative regions to which the N3 provincial capital cities respectively belong, the area that can be reached from the departure place by non-road transportation is determined as the second administrative region.

2. The method according to claim 1, wherein: The second administrative district includes a fourth administrative district, and selecting the second administrative district from the neighboring administrative districts of the first administrative district further includes: Determine the provincial administrative region to which the first administrative region belongs; The fourth administrative district adjacent to the first administrative district is selected from the neighboring provincial administrative districts of the provincial administrative district to which the first administrative district belongs, wherein the fourth administrative district includes: an administrative district at the same level as the first administrative district, and / or an administrative district at a higher level than the first administrative district.

3. The method according to claim 1, wherein: Determining candidate routes from the departure location to the second administrative district, and from the second administrative district to the destination, including: Determine the capital city of the province-level administrative region to which the second administrative region belongs from the departure place, and determine the city-level city from the departure place to the city-level administrative region to which the second administrative region belongs; Determine candidate routes from the departure place to the provincial capital city, from the provincial capital city to the municipal city, and from the municipal city to the second administrative region.

4. The method according to claim 2, wherein: Determining candidate routes from the departure location to the second administrative district, and from the second administrative district to the destination, including: Determine the first capital city of the provincial administrative region to which the second administrative region belongs from the departure place, and determine the first city-level city of the municipal administrative region to which the second administrative region belongs; Determine a first candidate route from the departure place to the first provincial capital city, from the first provincial capital city to the first municipal city, and from the first municipal city to the second administrative district; Determine the second provincial capital city of the provincial administrative region adjacent to the provincial administrative region to which the first administrative region belongs, and determine the second city-level city adjacent to the second administrative region in the adjacent provincial administrative region; Determine second candidate routes from the departure place to the second provincial capital city, from the second provincial capital city to the second municipal city, and from the second municipal city to the second administrative district.

5. The method according to claim 1, wherein: Selecting a second administrative district from among the neighboring administrative districts of the first administrative district comprises: Determine a fifth administrative district from the neighboring administrative districts that can be reached from the departure place by non-highway transportation, wherein the number of the fifth administrative districts is plural; and the level of the fifth administrative district is higher than or equal to the first administrative district; A preset number of administrative districts are selected from the plurality of fifth administrative districts in ascending order of distance to the destination, wherein the selected administrative districts are the second administrative districts.

6. A circuit generation device, comprising: A first selection module is used to select a second administrative district from the neighboring administrative districts of the first administrative district to which the travel destination is located, wherein the first administrative district is an area that can only be reached from the departure point by road transportation; there are multiple second administrative districts, and the second administrative districts are areas that can be reached from the departure point by non-road transportation; a determination module, configured to determine candidate routes from the departure location to the second administrative district, and from the second administrative district to the destination; A second selection module, configured to select a candidate route with the shortest time from the candidate routes as a final route from the departure place to the destination; The first administrative district is the county-level administrative district to which the destination is located; the first selection module includes: A first determining unit, used to determine the provincial administrative region to which the first administrative region belongs; A first selection unit is configured to select a second administrative region adjacent to the first administrative region from the provincial administrative region to which the first administrative region belongs, wherein the second administrative region includes: an administrative region at the same level as the first administrative region, and / or an administrative region at a higher level than the first administrative region; Wherein, the first selection module is specifically used for: Wherein, the selecting a second administrative district from the neighboring administrative districts of the first administrative district further comprises: Find the first N1 counties closest to the longitude and latitude of the destination in the county KD-Tree, find the first N2 cities closest to the longitude and latitude of the destination in the city KD-Tree, and find the first N3 provincial capital cities closest to the longitude and latitude of the destination in the province HashMap, the county KD-Tree is constructed based on the longitude and latitude of each of the multiple counties included in the set area and the city information, the city KD-Tree is constructed based on the longitude and latitude of each of the multiple cities included in the set area and the city information, and the province HashMap is constructed based on the province name and the longitude and latitude of the provincial capital city of each of the multiple provinces included in the set area, and N1, N2, and N3 are all positive integers; Among the N1 county-level administrative regions to which the N1 counties respectively belong, the N2 city-level administrative regions to which the N2 cities respectively belong, and the N3 provincial-level administrative regions to which the N3 provincial capital cities respectively belong, the area that can be reached from the departure place by non-road transportation is determined as the second administrative region.

7. The device according to claim 6, wherein: The second administrative district includes the fourth administrative district, and the first selection module further includes: A second determining unit is used to determine the provincial administrative region to which the first administrative region belongs; A third selection unit is used to select the fourth administrative region adjacent to the first administrative region from the provincial administrative regions adjacent to the provincial administrative region to which the first administrative region belongs, wherein the fourth administrative region includes: an administrative region of the same level as the first administrative region, and / or an administrative region of a higher level than the first administrative region.

8. The device according to claim 6, wherein: The determination module comprises: A third determining unit is used to determine the capital city of the provincial administrative region to which the second administrative region belongs from the departure place, and to determine the city-level city of the municipal administrative region to which the second administrative region belongs from the departure place; The fourth determining unit is used to determine candidate routes from the departure place to the provincial capital city, the provincial capital city to the municipal city, and the municipal city to the second administrative region.

9. The device according to claim 7, wherein: The determination module comprises: A fifth determining unit is used to determine the first capital city of the provincial administrative region to which the second administrative region belongs from the departure place, and to determine the first municipal city of the municipal administrative region to which the second administrative region belongs; a sixth determining unit, configured to determine a first candidate route from the departure place to the first provincial capital city, from the first provincial capital city to the first municipal city, and from the first municipal city to the second administrative district; A seventh determining unit is used to determine a second provincial capital city of a neighboring provincial administrative region from the departure place to the provincial administrative region to which the first administrative region belongs, and to determine a second city-level city in the neighboring provincial administrative region that is adjacent to the second administrative region; An eighth determination unit is used to determine second candidate routes from the departure place to the second provincial capital city, from the second provincial capital city to the second municipal city, and from the second municipal city to the second administrative district.

10. The device according to claim 6, wherein: The first selection module comprises: a ninth determining unit, configured to determine, from the neighboring administrative regions, a fifth administrative region that can be reached from the departure point by a non-road transportation vehicle, wherein the number of the fifth administrative regions is plural; and the level of the fifth administrative region is higher than or equal to the first administrative region; The fourth selection unit is used to select a preset number of administrative districts from the plurality of fifth administrative districts in ascending order of distance to the destination, wherein the selected administrative district is the second administrative district.

11. An electronic device, comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 5.

12. A non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • Path query method and apparatus

    CN105243131A

  • Navigation method and device

    CN106323317A