Planning method and device for ambiguous route

Abstract

The present invention discloses a method and device for planning an ambiguous route, and relates to the field of computer technology. A specific implementation of the method includes: obtaining a starting point and a destination point, and taking the starting point as the current point; determining the next point of the current point according to the current point; judging whether the destination point can be reached from the next point, and if so, taking the route from the current point to the next point as the segmented route of the current point, and taking the next point as the new current point, determining the segmented route of the new current point, until the next point of the current point is the destination point; connecting the segmented routes in series in sequence according to the points, to obtain the route from the starting point to the destination point. This implementation simplifies the global overall planning of ambiguous routes into local planning of each point, achieving the beneficial effect of making the ambiguous route planning simpler and more efficient, and greatly reducing the amount of data that needs to be manually maintained during the implementation process.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for planning an ambiguous route. Background Art

[0002] In logistics route planning, all possible routes need to be planned and designed in advance. When selecting the actual route, you can choose any of the planned routes, which is a standard operation. There may be multiple different routes between two points. In logistics route planning, this kind of route ambiguity is allowed, that is, the connection paths between the same starting point and the same end point allow multiple routes to be planned to realize logistics transportation.

[0003] Generally speaking, ambiguous routes do not need to be designed and planned in advance, and the focus of technology is mostly on the identification of ambiguous routes. For example, on highways, RFID and path identification cards are used to help identify the actual routes that vehicles travel in the staggered and replicated highway network. However, in logistics and transportation, it is necessary to standardize the driving operations of vehicles. Not only ambiguous routes need to be identified, but also possible routes need to be planned in advance. At present, the planning and implementation of ambiguous routes mostly use traditional files or data persistence solutions to store the complete path of the entire logistics and transportation network planned in advance. That is, all routes are first planned out completely, and then the entire planned ambiguous route network is fully digitally persisted.

[0004] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:

[0005] 1. If there are many outlets and the available line network is complex, each line needs to be planned from a global perspective. The amount of line data that needs to be manually maintained is large, and the planning difficulty is also quite high.

[0006] 2. If the status of a certain point in the line changes, the entire line involving the point needs to be replanned and designed. This method of line maintenance has poor flexibility and is prone to errors during the modification process.

[0007] 3. When judging whether the actual route is consistent with the planned route, it is necessary to constantly compare it with all complete routes, which is inefficient. Summary of the invention

[0008] In view of this, an embodiment of the present invention provides a planning method and device for an ambiguous route, which can simplify the global overall planning of the ambiguous route into the local planning of each network point. Each network point only needs to plan the network points that can be reached from the current network point and determine the segmented route of the current network point, without planning the overall route and the network points passed by the route. This achieves the beneficial effect of making the ambiguous route planning simpler and more efficient, and greatly reduces the amount of data that needs to be manually maintained during the implementation process.

[0009] To achieve the above-mentioned purpose, according to one aspect of an embodiment of the present invention, a planning method for an ambiguous route is provided, comprising: obtaining a starting point and a destination point, and taking the starting point as the current point; determining the next point of the current point according to the current point and database information; judging whether the destination point can be reached from the next point, and if so, taking the route from the current point to the next point as the segmented route of the current point, and taking the next point as the new current point, determining the segmented route of the new current point, until the next point of the current point is the destination point; and connecting the segmented routes in series in sequence according to the points to obtain a route from the starting point to the destination point.

[0010] Optionally, determining whether the destination point can be reached from the next point includes: obtaining loading information of the next point, the loading information including all points that can be reached from the next point; if the loading information includes the destination point, confirming that the destination point can be reached from the next point.

[0011] Optionally, each segmented route is connected in series in sequence according to the network points to obtain a route from the departure network point to the destination network point, including: taking the departure network point as the current network point; connecting the segmented route of the current network point with the segmented route of the next network point of the current network point, and taking the next network point as the new current network point, and continuing to connect with the segmented route of the next network point of the new current network point; until the next network point of the current network point is the destination network point, so as to obtain a route from the departure network point to the destination network point.

[0012] Optionally, the method also includes: the loading information of the next network point is the loading information corresponding to the segmented route of the current network point; judging whether the segmented route is passable, if the segmented route is not passable, adjusting the loading information corresponding to the segmented route, and re-determining the segmented route of the current network point.

[0013] Optionally, the method further includes: during the driving of the vehicle, obtaining the segmented route of the vehicle in real time, determining whether the loading information of the segmented route includes the destination point, and if so, confirming that the driving route of the vehicle is correct.

[0014] To achieve the above-mentioned purpose, according to another aspect of an embodiment of the present invention, there is provided a planning device for an ambiguous route, comprising: an acquisition module, a node determination module, a segmentation determination module, and a connection module; the acquisition module is used to: acquire a starting node and a destination node, and take the starting node as the current node; the node determination module is used to: determine the next node of the current node according to the current node and database information; the segmentation determination module is used to: determine whether the destination node can be reached from the next node, and if so, take the route from the current node to the next node as the segmentation route of the current node, and take the next node as the new current node to determine the segmentation route of the new current node, until the next node of the current node is the destination node; the connection module is used to: connect the segmentation routes in series in sequence according to the nodes to obtain the route from the starting node to the destination node.

[0015] Optionally, the segment determination module is further used to: obtain the loading information of the next network point, the loading information including all the network points that can be reached from the next network point; if the loading information includes the destination network point, confirm that the destination network point can be reached from the next network point.

[0016] Optionally, the connection module is further used to: take the departure point as the current point; connect the segmented route of the current point with the segmented route of the next point of the current point, and take the next point as the new current point, and continue to connect with the segmented route of the next point of the new current point; until the next point of the current point is the destination point, so as to obtain the route from the departure point to the destination point.

[0017] Optionally, the loading information of the next outlet is the loading information corresponding to the segmented route of the current outlet; the connection module is also used to: determine whether the segmented route is passable, if the segmented route is not passable, adjust the loading information corresponding to the segmented route, and redetermine the segmented route of the current outlet.

[0018] Optionally, the device also includes: a monitoring module; the monitoring module is used to: obtain the segmented route of the vehicle in real time during the vehicle's driving process, determine whether the loading information of the segmented route includes the destination point, and if so, confirm that the vehicle's driving route is correct.

[0019] To achieve the above-mentioned purpose, according to another aspect of an embodiment of the present invention, there is provided an electronic device, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the ambiguous route planning method provided in an embodiment of the present invention.

[0020] To achieve the above objective, according to another aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, the method for planning an ambiguous route provided by an embodiment of the present invention is implemented.

[0021] One embodiment of the above invention has the following advantages or beneficial effects: the global overall planning of ambiguous routes is simplified into local planning of each network point, and each network point only needs to plan the network points that can be reached from the current network point and determine the segmented route of the current network point, without planning the overall route and the network points passed by the route, thereby achieving the beneficial effects of making ambiguous route planning simpler and more efficient, and greatly reducing the amount of data that needs to be manually maintained during the implementation process.

[0022] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0024] Figure 1 is a schematic diagram of a basic process of a method for planning an ambiguous route according to an embodiment of the present invention;

[0025] Figure 2 is a schematic diagram of loading information corresponding to a segmented route according to an embodiment of the present invention;

[0026] Figure 3 is a schematic diagram of a preferred process of a method for planning an ambiguous route according to an embodiment of the present invention;

[0027] Figure 4 is a schematic diagram of segmented lines connected in series according to an embodiment of the present invention;

[0028] Figure 5 is a schematic diagram of basic modules of an ambiguous route planning device according to an embodiment of the present invention;

[0029] Figure 6 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0030] Figure 7 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0031] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention 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 may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0032] Glossary of technical terms that may appear in the embodiments of the present invention:

[0033] Ambiguous routes: Ambiguous routes originally refer to the fact that there is more than one route for a vehicle to enter from one point to another in the highway network. In logistics, it is extended to mean that there is more than one logistics transportation route between two points, and the logistics transportation purpose can be achieved through multiple transportation route options.

[0034] Loading: originally refers to making full use of the load capacity and volume of the transport vehicle, adopting advanced loading methods, and rationally arranging the loading of goods; in the embodiments of the present invention, the meaning of loading is extended, and the destination where the vehicle can carry goods on a route is also regarded as a form of loading.

[0035] Outlet: generally refers to each transfer node in the logistics system, which may include but is not limited to warehouses, sorting centers, and distribution sites. The current outlet is the starting point of the segmented route of the current outlet, and the next outlet is the end point of the segmented route of the current outlet.

[0036] Route: refers to a transportation route from the starting point to the end point.

[0037] Figure 1 FIG. 1 is a schematic diagram of the basic process of the method for planning an ambiguous route according to an embodiment of the present invention. Figure 1 As shown, an embodiment of the present invention provides a method for planning an ambiguous route, including:

[0038] Step S101. Obtain the departure point and the destination point, and use the departure point as the current point;

[0039] Step S102. Determine the next network point of the current network point according to the current network point and database information;

[0040] Step S103. Determine whether the destination node can be reached from the next node. If so, use the route from the current node to the next node as the segment route of the current node, and use the next node as the new current node to determine the segment route of the new current node until the next node of the current node is the destination node;

[0041] Step S104: Connect the segmented routes in series according to the nodes to obtain a route from the departure node to the destination node.

[0042] The embodiment of the present invention simplifies the global overall planning of ambiguous routes into local planning of each network point. Each network point only needs to plan the network points that can be reached from the current network point and determine the segmented route of the current network point, without planning the overall route and the network points passed by the route. This achieves the beneficial effects of making ambiguous route planning simpler and more efficient, and greatly reduces the amount of data that needs to be manually maintained during the implementation process.

[0043] In an embodiment of the present invention, determining whether the destination node can be reached from the next node includes: obtaining the loading information of the next node, wherein the loading information includes all nodes that can be reached from the next node; if the loading information includes the destination node, confirming that the destination node can be reached from the next node. The loading information is also the loading information corresponding to the segmented route of the current node.

[0044] The embodiment of the present invention splits the route planning that needs to go through multiple outlets into segmented route planning, expands the content attributes of traditional loading information, binds the outlets to the segmented route in a loading manner, and the bound loading represents the destination that can be reached through the segmented route. In this way, when planning the route, it is only necessary to plan each segmented route, and by connecting the segmented routes in series based on the loading information, the purpose of obtaining the route from the departure outlet to the destination outlet can be achieved. The beneficial effects of making ambiguous route planning simpler and more efficient are achieved, and the amount of data that needs to be manually maintained is greatly reduced during the implementation process.

[0045] In an embodiment of the present invention, each segmented route is sequentially connected in series according to the network point to obtain a route from the departure network point to the destination network point, including: taking the departure network point as the current network point; connecting the segmented route of the current network point with the segmented route of the next network point of the current network point, and taking the next network point as the new current network point, and continuing to connect with the segmented route of the next network point of the new current network point; until the next network point of the current network point is the destination network point, so as to obtain a route from the departure network point to the destination network point.

[0046] The embodiment of the present invention simplifies the global overall planning of ambiguous routes into local planning of each network point. Each network point only needs to plan the network points that can be reached from the current network point, determine the segmented routes of the current network point, and then connect the segmented routes in series according to the order of the network points of each segmented route, so as to achieve the purpose of obtaining the route from the starting network point to the destination network point. The beneficial effects of making the ambiguous route planning simpler and more efficient are achieved, and the amount of data that needs to be manually maintained is greatly reduced during the implementation process.

[0047] In an embodiment of the present invention, the method further comprises: Figure 2As shown, the loading information of the next network point is the loading information corresponding to the segmented route of the current network point; determine whether the segmented route is passable. If the segmented route is not passable, adjust the loading information corresponding to the segmented route, and redetermine the segmented route of the current network point. Traditional ambiguous route planning requires all possible global paths to be planned and stored in advance. It is a large workload for route planners and requires an overall plan. Once there is a change, they must be checked and modified one by one. The use of route loading not only breaks down the whole into parts to make route planning easier, but also has good scalability. If a certain network point or segmented route in the route fails and cannot be passed, only the segmented route needs to be adjusted, without adjusting the entire route.

[0048] Take "Beijing" as the departure point and "Xiamen" as the destination point, and plan the route from Beijing to Xiamen as an example: In the existing technology, all complete routes need to be planned: A: Beijing-Tianjin-Zhengzhou-Nanchang-Fuzhou-Xiamen; B: Beijing-Nanjing-Fuzhou-Xiamen; C: Beijing-Shijiazhuang-Jinan-Shanghai-Xiamen; etc. There may be 10 to 20 optional routes, all of which need to be planned and stored in advance. Once there are changes, they must be checked and modified one by one, and generally global route planning experience is required. The route from Beijing to Xiamen can go through Tianjin, Shijiazhuang, or directly to Nanjing. When the vehicle actually delivers goods, each point needs to be compared with more than 20 possible routes to determine whether it is following a certain point in the planned route.

[0049] like Figure 3 As shown, the method in the embodiment of the present invention includes the following steps: select the outlets including the destination outlet in the loading information; for example, the loading information of these selected outlets all includes the destination outlet "Xiamen". Then, the departure outlet "Beijing" is used as the current outlet, and the next outlet of the current outlet is determined among the selected outlets according to the information in the database; for example, among the selected outlets, the next outlets of "Beijing" can be: Tianjin, Shijiazhuang, Nanjing, etc. The route from the current outlet to the next outlet is used as the segmented route of the current outlet; for example, the segmented route of "Beijing" is "Beijing-Tianjin". The next node is used as the new current node, and the segmented route of the new current node is determined until the next node of the current node is the destination node; for example, the new current node is "Tianjin", and the segmented route of "Tianjin" is determined to be "Tianjin-Zhengzhou" through the above method, and then the segmented route of "Zhengzhou" can be determined to be "Zhengzhou-Xiamen" according to the above content. Since the next node "Xiamen" of "Zhengzhou" is the same as the destination node, the segmented route determination is completed. Figure 4As shown, the conditions for connecting segment route 1 and segment route 2 in series may include: (1) the loading information of the two segment routes both include the destination network point; (2) the end point of segment route 1 is the same as the starting point of segment route 2. By connecting the segment routes in series, the route from "Beijing" to "Xiamen" is obtained: Beijing-Tianjin-Zhengzhou-Xiamen.

[0050] The embodiment of the present invention may also first determine the next network point of the current network point, and then select the next network point of the current network point according to the loading information of the next network point and the destination network point.

[0051] If it is found that the "Beijing-Tianjin" segment route is impassable due to "heavy snow blocking the road", it is only necessary to adjust the loading information affected by this segment route, for example, delete the loading information corresponding to this segment route or freeze some of the points in the loading information, including "Xiamen", so that this segment route will not be connected in series with the route from "Beijing" to "Xiamen". At the same time, reselect or confirm other segment routes of "Beijing" for connection in series.

[0052] When monitoring whether a vehicle is traveling along the planned route, the previous practice was to plan all possible routes in advance, and then use them to monitor whether the vehicle is sent or arrived at the wrong location. Now, there is no need to plan all possible routes in advance. You only need to configure the loading information of each network point, and calculate whether the route taken by the vehicle can be connected to the destination network point in series during actual monitoring and judgment. That is, the segmented route of the current vehicle is obtained in real time, and it is determined whether the loading information of the segmented route includes the destination network point. If it does, it is confirmed that the vehicle's route is correct. This greatly reduces the complexity of monitoring.

[0053] Figure 5 Schematic diagram of basic modules of an ambiguous route planning device according to an embodiment of the present invention. Figure 5 As shown, an embodiment of the present invention provides an ambiguous route planning device 500, including: an acquisition module 501, a network point determination module 502, a segmentation determination module 503, and a connection module 504; the acquisition module 501 is used to: acquire a starting network point and a destination network point, and take the starting network point as the current network point; the network point determination module 502 is used to: determine the next network point of the current network point according to the current network point and database information; the segmentation determination module 503 is used to: determine whether the destination network point can be reached from the next network point, and if so, take the route from the current network point to the next network point as the segmentation route of the current network point, and take the next network point as the new current network point to determine the segmentation route of the new current network point until the next network point of the current network point is the destination network point; the connection module 504 is used to: connect the segmentation routes in series in sequence according to the network points to obtain the route from the starting network point to the destination network point.

[0054] The embodiment of the present invention simplifies the global overall planning of ambiguous routes into local planning of each network point. Each network point only needs to plan the network points that can be reached from the current network point and determine the segmented route of the current network point, without planning the overall route and the network points passed by the route. This achieves the beneficial effects of making ambiguous route planning simpler and more efficient, and greatly reduces the amount of data that needs to be manually maintained during the implementation process.

[0055] In an embodiment of the present invention, the segment determination module 503 is also used to: obtain the loading information of the next network point, the loading information includes all the network points that can be reached from the next network point; if the loading information includes the destination network point, it is confirmed that the destination network point can be reached from the next network point. The embodiment of the present invention splits the route planning that needs to go through multiple network points into segmented route planning, and expands the content attributes of traditional loading information, and binds the network points to the segmented route in a loading manner. The bound loading represents the destination that can be finally reached through the segmented route. In this way, when planning the route, it is only necessary to plan each segmented route, and the segmented routes are connected in series by judging the loading information, so as to achieve the purpose of obtaining the route from the departure network point to the destination network point. The beneficial effects of making ambiguous route planning simpler and more efficient are achieved, and the amount of data that needs to be manually maintained is greatly reduced during the implementation process.

[0056] In the embodiment of the present invention, the connection module 504 is also used to: take the starting point as the current point; connect the segmented route of the current point with the segmented route of the next point of the current point, and take the next point as the new current point, and continue to connect with the segmented route of the next point of the new current point; until the next point of the current point is the destination point, so as to obtain the route from the starting point to the destination point. The embodiment of the present invention simplifies the global overall planning of ambiguous routes into local planning of each point. Each point only needs to plan the points that can be reached from the current point, determine the segmented route of the current point, and then connect the segmented routes in series according to the order of the points of each segmented route, so as to achieve the purpose of obtaining the route from the starting point to the destination point. The beneficial effects of making the ambiguous route planning simpler and more efficient are achieved, and the amount of data that needs to be manually maintained is greatly reduced during the implementation process.

[0057] In an embodiment of the present invention, the loading information of the next network point is the loading information corresponding to the segmented route of the current network point; the connection module 404 is also used to determine whether the segmented route is passable. If the segmented route is not passable, the loading information corresponding to the segmented route is adjusted, and the segmented route of the current network point is re-determined. Traditional ambiguous route planning requires all possible global paths to be planned and stored in advance, which is a large workload for route planners and requires an overall plan. Once there is a change, it must be checked and modified one by one. The use of route loading not only breaks down the whole into parts to make route planning easier, but also has good scalability. If a certain network point or segmented route in the route fails and cannot be passed, only the segmented route needs to be adjusted, without adjusting the entire route.

[0058] In the embodiment of the present invention, the device further comprises: a monitoring module; the monitoring module is used to: during the driving process of the vehicle, obtain the segmented route of the vehicle in real time, determine whether the loading information of the segmented route includes the destination network point, and if so, confirm that the driving route of the vehicle is correct. Compared with the prior art, the embodiment of the present invention greatly reduces the complexity and difficulty of monitoring, while ensuring accuracy.

[0059] Figure 6 An exemplary system architecture 600 is shown to which an ambiguous route planning method or an ambiguous route planning device according to an embodiment of the present invention can be applied.

[0060] like Figure 6 As shown, system architecture 600 may include terminal devices 601, 602, 603, network 604 and server 606. Network 604 is used to provide a medium for communication links between terminal devices 601, 602, 603 and server 606. Network 604 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0061] The user can use the terminal devices 601, 602, 603 to interact with the server 606 through the network 604 to receive or send messages, etc. Various communication client applications can be installed on the terminal devices 601, 602, 603, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0062] The terminal devices 601 , 602 , and 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers, etc.

[0063] Server 606 may be a server that provides various services, such as a backend management server that provides support for shopping websites browsed by users using terminal devices 601, 602, and 603. The backend management server may analyze and process received data such as product information query requests, and feed back the processing results to the terminal device.

[0064] It should be noted that the ambiguous route planning method provided in the embodiment of the present invention is generally executed by the server 606 , and accordingly, the ambiguous route planning device is generally disposed in the server 606 .

[0065] It should be understood that Figure 6 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to the implementation requirements.

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

[0067] The electronic device of the embodiment of the present invention includes: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the planning method of the ambiguous route provided by the embodiment of the present invention.

[0068] The computer-readable medium of the embodiment of the present invention stores a computer program, and when the program is executed by a processor, the method for planning an ambiguous route provided by the embodiment of the present invention is implemented.

[0069] Reference below Figure 7 , which shows a schematic diagram of the structure of a computer system 700 of a terminal device suitable for implementing an embodiment of the present invention. Figure 7 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0070] like Figure 7 As shown, the computer system 700 includes a central processing module (CPU) 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage part 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0071] The following components are connected to the I / O interface 705: an input section 707 including a keyboard, a mouse, etc.; an output section 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, a modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage section 708 as needed.

[0072] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 709, and / or installed from the removable medium 711. When the computer program is executed by the central processing module (CPU) 701, the above-mentioned functions defined in the system of the present invention are executed.

[0073] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0074] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0075] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes an acquisition module, a network point determination module, a segment determination module, and a connection module. The names of these modules do not constitute a limitation on the modules themselves in some cases, for example, the acquisition module may also be described as a "module for acquiring a departure network point and a destination network point".

[0076] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently and not be installed in the device. The above computer-readable medium carries one or more programs. When the above one or more programs are executed by a device, the device includes: step S101. Obtain the starting point and the destination point, and take the starting point as the current point; step S102. Determine the next point of the current point according to the current point and database information; step S103. Determine whether the destination point can be reached from the next point. If so, take the route from the current point to the next point as the segmented route of the current point, and take the next point as the new current point to determine the segmented route of the new current point until the next point of the current point is the destination point; step S104. Connect the segmented routes in series according to the points to obtain the route from the starting point to the destination point.

[0077] According to the technical solution of the embodiment of the present invention, the global overall planning of ambiguous routes is simplified into local planning of each network point. Each network point only needs to plan the network points that can be reached from the current network point and determine the segmented route of the current network point, without planning the overall route and the network points passed by the route. This achieves the beneficial effects of making ambiguous route planning simpler and more efficient, and greatly reduces the amount of data that needs to be manually maintained during the implementation process.

[0078] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for planning an ambiguous route, characterized in that: include: Get the departure point and destination point, and use the departure point as the current point; Determine the next network point of the current network point according to the current network point and database information; Determine whether the destination node can be reached from the next node. If so, use the route from the current node to the next node as the segment route of the current node, and use the next node as the new current node to determine the segment route of the new current node until the next node of the current node is the destination node; wherein the node is bound to the segment route in a loading manner, and the bound loading represents the destination that can be finally reached through the segment route; Connect each segmented route in series according to the network points to obtain the route from the starting network point to the destination network point.

2. The method according to claim 1, characterized in that Determining whether the destination node can be reached from the next node includes: Obtaining the loading information of the next network point, wherein the loading information includes all network points that can be reached from the next network point; If the loading information includes the destination network point, it is confirmed that the destination network point can be reached from the next network point.

3. The method according to claim 1, characterized in that Connect each segmented route in series according to the network points to obtain the route from the departure network point to the destination network point, including: Set the departure point as the current point; Connect the segmented line of the current network point with the segmented line of the next network point of the current network point, and use the next network point as the new current network point, and continue to connect with the segmented line of the next network point of the new current network point; Until the next node of the current node is the destination node, a route from the departure node to the destination node is obtained.

4. The method according to claim 2, characterized in that: The method further comprises: The loading information of the next network point is the loading information corresponding to the segmented route of the current network point; Determine whether the segmented route is passable. If the segmented route is not passable, adjust the loading information corresponding to the segmented route and re-determine the segmented route of the current network point.

5. The method according to claim 4, characterized in that The method further includes: during the driving process of the vehicle, obtaining the segmented route of the vehicle in real time, judging whether the loading information of the segmented route includes the destination network point, and if so, confirming that the driving route of the vehicle is correct.

6. A device for planning an ambiguous route, characterized in that: include: Acquisition module, network point determination module, segment determination module, connection module; The acquisition module is used to: acquire the departure point and the destination point, and use the departure point as the current point; The network point determination module is used to: determine the next network point of the current network point according to the current network point and database information; The segment determination module is used to: determine whether the destination network point can be reached from the next network point, and if so, use the route from the current network point to the next network point as the segment route of the current network point, and use the next network point as the new current network point to determine the segment route of the new current network point until the next network point of the current network point is the destination network point; wherein the network point is bound to the segment route in a loading manner, and the bound loading represents the destination that can be finally reached through the segment route; The connection module is used to connect the segmented lines in series in sequence according to the network points to obtain a line from the departure network point to the destination network point.

7. The device according to claim 6, characterized in that The segment determination module is further used for: Obtaining the loading information of the next network point, wherein the loading information includes all network points that can be reached from the next network point; If the loading information includes the destination network point, it is confirmed that the destination network point can be reached from the next network point.

8. The device according to claim 6, characterized in that The connection module is further used for: Set the departure point as the current point; Connect the segmented line of the current network point with the segmented line of the next network point of the current network point, and use the next network point as the new current network point, and continue to connect with the segmented line of the next network point of the new current network point; Until the next node of the current node is the destination node, a route from the departure node to the destination node is obtained.

9. The device according to claim 7, characterized in that The loading information of the next network point is the loading information corresponding to the segmented route of the current network point; The connection module is also used to determine whether the segmented route is passable. If the segmented route is not passable, the loading information corresponding to the segmented route is adjusted, and the segmented route of the current network point is re-determined.

10. The device according to claim 9, characterized in that The device also includes: a monitoring module; the monitoring module is used to: during the vehicle driving process, obtain the segmented route of the vehicle in real time, determine whether the loading information of the segmented route includes the destination network point, and if so, confirm that the vehicle's driving route is correct.

11. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 5.

12. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images