CN110633933A - Method and device for planning ambiguous line - Google Patents
Method and device for planning ambiguous line Download PDFInfo
- Publication number
- CN110633933A CN110633933A CN201810662221.3A CN201810662221A CN110633933A CN 110633933 A CN110633933 A CN 110633933A CN 201810662221 A CN201810662221 A CN 201810662221A CN 110633933 A CN110633933 A CN 110633933A
- Authority
- CN
- China
- Prior art keywords
- point
- network point
- line
- current
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for planning an ambiguous line, and relates to the technical field of computers. One embodiment of the method comprises: acquiring a starting network point and a target network point, and taking the starting network point as a current network point; determining a next mesh point of the current mesh point according to the current mesh point; judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point; and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point. The implementation method simplifies the global overall planning of the ambiguous line into the local planning of each network point, achieves the beneficial effects of simpler and more convenient ambiguous line planning and high planning efficiency, and greatly reduces the data volume needing manual maintenance in the implementation process.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for planning an ambiguous line.
Background
In logistics route planning, all possible routes need to be planned and designed in advance, and when an actual route is selected, the planned route can be selected at will and all belong to standard operation. In the case that a plurality of different lines may exist between two points, the existence of such line ambiguity is allowed in the logistics line planning, that is, the connection path between the same starting point and the same end point allows a plurality of lines to be planned to realize logistics transportation.
Generally, the ambiguous lines do not need to be designed in advance, and the emphasis of the technology is mostly on the identification of the ambiguous lines, such as lines on a highway which are actually passed by vehicles in a cross-copied highway network through the help of RFID (radio frequency identification devices), path identification cards and the like. However, in logistics transportation, the driving operation of vehicles needs to be standardized, ambiguous routes need to be identified, and possible routes need to be planned in advance. At present, the planning of the ambiguous line is realized by adopting the traditional file or data persistence scheme to store the complete path of the whole logistics transportation network planned in advance. Firstly, all lines are completely planned, and then the whole planned ambiguous line network is subjected to complete digital persistence.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
1. if the network points are numerous and the available line network is complex, each line needs to be planned from the global perspective, the data volume of the lines needing manual maintenance is large, and the planning difficulty is quite large.
2. If the state of a certain network point in the line changes, the whole line related to the network point needs to be re-planned and designed, the line maintenance by the method has poor flexibility, and errors are easy to occur in the modification process.
3. When the actual route is judged to be coincident with the planned route, the comparison with all complete routes is required continuously, and the efficiency is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for planning an ambiguous line, which can simplify a global planning of an ambiguous line into a local planning of each node, where each node only needs to plan a node that can be reached by a current node, and determine a segment line of the current node, and does not need to plan a global line and each node through which the line passes, thereby achieving the beneficial effects of making planning of an ambiguous line simpler and more convenient, and having high planning efficiency, and greatly reducing the amount of data that needs to be manually maintained in the implementation process.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided an ambiguous line planning method including: acquiring a starting network point and a target network point, and taking the starting network point as a current network point; determining a next network point of the current network point according to the current network point and the database information; judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point; and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point.
Optionally, the determining whether the destination node can be reached from the next node includes: acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point; and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point.
Optionally, sequentially connecting the segment lines in series according to the mesh point to obtain a line from the departure mesh point to the destination mesh point, including: taking the starting network point as the current network point; connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point; until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point.
Optionally, the method further comprises: the stowage information of the next network point is the stowage information corresponding to the subsection route of the current network point; and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point.
Optionally, the method further comprises: in the vehicle running process, a sectional route where the vehicle runs is obtained in real time, whether a destination network point is included in the stowage information of the sectional route or not is judged, and if the destination network point is included, the vehicle is confirmed to be correct in the running route.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided an apparatus for planning an ambiguous line, including: the device comprises an acquisition module, a mesh point determination module, a segmentation determination module and a connection module; the obtaining module is configured to: acquiring a starting network point and a target network point, and taking the starting network point as a current network point; the mesh point determination module is configured to: determining a next network point of the current network point according to the current network point and the database information; the segment determination module is configured to: judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point; the connection module is used for: and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point.
Optionally, the segment determining module is further configured to: acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point; and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point.
Optionally, the connection module is further configured to: taking the starting network point as the current network point; connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point; until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point.
Optionally, the stowage information of the next node is stowage information corresponding to a segment route of the current node; the connection module is further configured to: and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point.
Optionally, the apparatus further comprises: a monitoring module; the monitoring module is used for: in the vehicle running process, a sectional route where the vehicle runs is obtained in real time, whether a destination network point is included in the stowage information of the sectional route or not is judged, and if the destination network point is included, the vehicle is confirmed to be correct in the running route.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the method for planning the ambiguous line provided by the embodiment of the invention.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by a processor, implementing the method for planning an ambiguous line provided by the embodiments of the present invention.
One embodiment of the above invention has the following advantages or benefits: the global overall planning of the ambiguous line is simplified into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point, and the segmented line of the current network point is determined, and the whole line and each network point through which the line passes are not needed to be planned, so that the beneficial effects of simpler and more convenient planning of the ambiguous line and high planning efficiency are realized, and the data volume needing manual maintenance is greatly reduced in the implementation process.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic diagram of a basic flow of a method for planning an ambiguous line according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of loading information corresponding to a segment route according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a preferred flow of a method for planning an ambiguous line in accordance with an embodiment of the present invention;
FIG. 4 is a schematic diagram of a series of segmented lines according to an embodiment of the present invention;
fig. 5 is a schematic diagram of basic modules of an ambiguous line planning apparatus according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The terms of art that may appear in embodiments of the invention are to be interpreted:
ambiguous line: the ambiguous route originally means that more than one driving route exists when a vehicle drives in from one point to another point in the expressway network. In the logistics, more than one logistics transportation line is extended between two points, and the logistics transportation purpose can be achieved through various transportation line selections.
Carrying: the loading of goods is reasonably arranged by fully utilizing the loading quality and volume of the transport tool and adopting an advanced loading method; the meaning of stowage is extended in the embodiment of the invention, and the destination of the vehicle with the goods in one route is also taken as a form of stowage.
Mesh point: the term "transportation node" refers generally to each transit node in a logistics system and may include, but is not limited to, warehouses, sorting centers, and distribution sites. The current net point is the starting point of the segment line of the current net point, and the next net point is the end point of the segment line of the current net point.
A circuit: refers to a transport route from a starting point to an end point.
Fig. 1 is a schematic diagram of a basic flow of an ambiguous line planning method according to an embodiment of the present invention. As shown in fig. 1, an embodiment of the present invention provides a method for planning an ambiguous line, including:
s101, acquiring a starting network point and a target network point, and taking the starting network point as a current network point;
s102, determining a next network point of the current network point according to the information of the current network point and a database;
s103, judging whether a target network point can be reached or not from the next network point, if so, taking a line from the current network point to the next network point as a segmented line of the current network point, taking the next network point as a new current network point, and determining a new segmented line of the current network point until the next network point of the current network point is the target network point;
and S104, sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the destination network point.
The embodiment of the invention simplifies the global overall planning of the ambiguous line into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point to determine the segmented line of the current network point, and does not need to plan the whole line and each network point through which the line passes, thereby realizing the beneficial effects of simpler and more convenient planning of the ambiguous line and high planning efficiency, and greatly reducing the data amount needing manual maintenance in the implementation process.
In the embodiment of the present invention, the determining whether the destination node can be reached from the next node includes: acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point; and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point. And the stowage information is also the stowage information corresponding to the subsection route of the current network point.
The embodiment of the invention separates the route planning which needs to go through a plurality of network points and carries out the route planning in a sectional route planning mode, expands the content attribute of the traditional stowage information, binds the network points on the sectional route in a stowage mode, and the bound stowage represents the destination which can be finally reached through the sectional route. Therefore, when the line planning is carried out, only each section of segmented line needs to be planned, and the segmented lines are connected in series through the judgment of the stowage information, so that the purpose of obtaining the line from the starting network point to the target network point can be achieved. The method and the device have the advantages that the ambiguous line planning is simpler and more convenient, the planning efficiency is high, and the data volume needing manual maintenance is greatly reduced in the implementation process.
In the embodiment of the present invention, the serially connecting the segment lines according to the network point to obtain the line from the starting network point to the destination network point includes: taking the starting network point as the current network point; connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point; until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point.
The embodiment of the invention simplifies the overall planning of the ambiguous circuit into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point, determines the sectional circuit of the current network point, and then connects the sectional circuits in series according to the sequence of the network points of each sectional circuit, thus realizing the purpose of obtaining the circuit from the starting network point to the target network point. The method and the device have the advantages that the ambiguous line planning is simpler and more convenient, the planning efficiency is high, and the data volume needing manual maintenance is greatly reduced in the implementation process.
In the embodiment of the present invention, the method further includes: as shown in fig. 2, the stowage information of the next node is the stowage information corresponding to the segment route of the current node; and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point. In the traditional ambiguous line planning, all possible global paths need to be planned and stored in advance, the workload is large for line planners, the overall planning is needed, and the line planners need to check and modify one by one once the lines are changed. The method of line loading is adopted, not only is the whole part broken up to make the line planning work simpler and more convenient, but also the expandability is good, and a certain network point or a sectional line in the line has a fault and can not pass through, and only the sectional line needs to be adjusted, and the whole line does not need to be adjusted.
Taking "Beijing" as a starting point and "Xiamen" as a destination point, planning a route from Beijing to Xiamen as an example: in the prior art, all complete routes need to be planned: a is Beijing-Tianjin-Zhengzhou-Nanchang-Fuzhou-Xiamen; b: Beijing-Nanjing-Fuzhou-Xiamen; c: Beijing-Shijiazhuang-Jinan-Shanghai-Xiamen; and the like. There may be 10-20 alternative routes, all of which need to be planned in advance and stored. Once changes are made, the changes are checked one by one, typically requiring a global route planning experience. The route from Beijing to mansion can be from Tianjin, or from Shijiazhuang, or directly to Nanjing. When the actual vehicle is in a delivery state, each network point is compared with 20 possible lines, and whether the network point is in the delivery state according to a certain route in the planned line is judged.
As shown in fig. 3, the method in the embodiment of the present invention includes the following steps: selecting a network point including a target network point from the stowage information; for example, the destination node "building door" is included in the stowage information of the selected nodes. Then, the starting network point 'Beijing' is used as the current network point, and the next network point of the current network point is determined in the selected network point according to the information in the database; for example, among the selected dots, the next dot of "beijing" may be: tianjin, Shijiazhuang, Nanjing, etc. Taking the line from the current net point to the next net point as the segmented line of the current net point; for example, the segmented route for "Beijing" is "Beijing-Tianjin". Taking the next net point as a new current net point, and determining the sectional route of the new current net point until the next net point of the current net point is a target net point; for example, the new current site is "tianjin", the sectional route of "tianjin" is determined to be "tianjin-zheng" in the above manner, and then the sectional route of "zheng" can be determined to be "zheng-xiamen" according to the same principle as described above, and since the next site "xiamen" of "zheng" is the same as the destination site, the determination of the sectional route is ended. As shown in fig. 4, the conditions for the series connection of segment line 1 and segment line 2 may include: (1) the stowage information of the two segmented lines comprises destination nodes; (2) the end point of segment line 1 is the same as the start point of segment line 2. The segmented routes are connected in series to obtain a route from Beijing to Xiamen: Beijing-Tianjin-Zhengzhou-Xiamen.
The embodiment of the invention can also determine the next network point of the current network point first, and then screen the next network point of the current network point according to the stowage information and the target network point of the next network point.
If the segmented line of Beijing-Tianjin is found to be unable to pass through due to the 'big snow covered road', the segmented line can not be connected in series in the route from 'Beijing' to 'Xiamen' only by adjusting the stowage information influenced by the segment line, for example, deleting or freezing part of dots in the stowage information corresponding to the segmented line, wherein 'Xiamen' is included. And simultaneously reselecting or determining other segmented lines of the Beijing to be connected in series.
When monitoring whether the vehicle runs according to the planned route, the previous method is to plan all possible routes in advance, and then monitor whether the vehicle is mistaken or not. At present, all possible lines do not need to be planned in advance, only the stowage information of each network point needs to be configured, and whether the line traveled by a vehicle can be connected in series to a destination network point is calculated in the actual monitoring and judging process. The method comprises the steps of acquiring a subsection route driven by a current vehicle in real time, judging whether destination points are included in the stowage information of the subsection route, and if so, confirming that the driving route of the vehicle is correct. The complexity of monitoring is greatly reduced.
Fig. 5 is a schematic diagram of basic modules of an ambiguous-line planning apparatus according to an embodiment of the present invention. As shown in fig. 5, an embodiment of the present invention provides an apparatus 500 for planning an ambiguous line, including: an acquisition module 501, a mesh point determination module 502, a segmentation determination module 503 and a connection module 504; the obtaining module 501 is configured to: acquiring a starting network point and a target network point, and taking the starting network point as a current network point; the mesh point determination module 502 is configured to: determining a next network point of the current network point according to the current network point and the database information; the segment determining module 503 is configured to: judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point; the connection module 504 is configured to: and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point.
The embodiment of the invention simplifies the global overall planning of the ambiguous line into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point to determine the segmented line of the current network point, and does not need to plan the whole line and each network point through which the line passes, thereby realizing the beneficial effects of simpler and more convenient planning of the ambiguous line and high planning efficiency, and greatly reducing the data amount needing manual maintenance in the implementation process.
In this embodiment of the present invention, the segmentation determining module 503 is further configured to: acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point; and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point. The embodiment of the invention separates the route planning which needs to go through a plurality of network points and carries out the route planning in a sectional route planning mode, expands the content attribute of the traditional stowage information, binds the network points on the sectional route in a stowage mode, and the bound stowage represents the destination which can be finally reached through the sectional route. Therefore, when the line planning is carried out, only each section of segmented line needs to be planned, and the segmented lines are connected in series through the judgment of the stowage information, so that the purpose of obtaining the line from the starting network point to the target network point can be achieved. The method and the device have the advantages that the ambiguous line planning is simpler and more convenient, the planning efficiency is high, and the data volume needing manual maintenance is greatly reduced in the implementation process.
In this embodiment of the present invention, the connection module 504 is further configured to: taking the starting network point as the current network point; connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point; until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point. The embodiment of the invention simplifies the overall planning of the ambiguous circuit into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point, determines the sectional circuit of the current network point, and then connects the sectional circuits in series according to the sequence of the network points of each sectional circuit, thus realizing the purpose of obtaining the circuit from the starting network point to the target network point. The method and the device have the advantages that the ambiguous line planning is simpler and more convenient, the planning efficiency is high, and the data volume needing manual maintenance is greatly reduced in the implementation process.
In the embodiment of the invention, the stowage information of the next network point is the stowage information corresponding to the subsection route of the current network point; the connection module 404 is further configured to: and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point. In the traditional ambiguous line planning, all possible global paths need to be planned and stored in advance, the workload is large for line planners, the overall planning is needed, and the line planners need to check and modify one by one once the lines are changed. The method of line loading is adopted, not only is the whole part broken up to make the line planning work simpler and more convenient, but also the expandability is good, and a certain network point or a sectional line in the line has a fault and can not pass through, and only the sectional line needs to be adjusted, and the whole line does not need to be adjusted.
In the embodiment of the present invention, the apparatus further includes: a monitoring module; the monitoring module is used for: in the vehicle running process, a sectional route where the vehicle runs is obtained in real time, whether a destination network point is included in the stowage information of the sectional route or not is judged, and if the destination network point is included, the vehicle is confirmed to be correct in the running route. Compared with the prior art, the embodiment of the invention greatly reduces the complexity and difficulty of monitoring and simultaneously ensures the accuracy.
Fig. 6 shows an exemplary system architecture 600 of a method or apparatus for planning an ambiguous line to which an embodiment of the present invention can be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 606. The network 604 is used to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 606. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal device 601, 602, 603 to interact with a server 606 over a network 604 to receive or send messages or the like. Various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like, may be installed on the terminal devices 601, 602, and 603.
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 606 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the terminal devices 601, 602, and 603. The background management server can analyze and process the received data such as the product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that the method for planning an ambiguous line provided by the embodiment of the present invention is generally executed by the server 606, and accordingly, the device for planning an ambiguous line is generally disposed in the server 606.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The invention also provides an electronic device and a readable storage medium according to the embodiment of the invention.
The electronic device of the embodiment of the invention comprises: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the method for planning the ambiguous line provided by the embodiment of the invention.
The computer readable medium of the embodiment of the present invention stores thereon a computer program, and the program, when executed by a processor, implements the method for planning an ambiguous line provided by the embodiment of the present invention.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, 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 section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data necessary for the operation of the system 700 are also stored. The CPU701, the ROM702, and the RAM703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input section 707 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. 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, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the central processing module (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises an acquisition module, a mesh point determination module, a segmentation determination module and a connection module. The names of the modules do not limit the modules themselves in some cases, and for example, the acquiring module may also be described as a "module for acquiring a departure website and a destination website".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: s101, acquiring a starting network point and a target network point, and taking the starting network point as a current network point; s102, determining a next network point of the current network point according to the information of the current network point and a database; s103, judging whether a target network point can be reached or not from the next network point, if so, taking a line from the current network point to the next network point as a segmented line of the current network point, taking the next network point as a new current network point, and determining a new segmented line of the current network point until the next network point of the current network point is the target network point; and S104, sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the destination network point.
According to the technical scheme of the embodiment of the invention, the overall planning of the ambiguous line is simplified into the local planning of each network point, each network point only needs to plan the network point which can be reached by starting from the current network point, the segmented line of the current network point is determined, and the planning of the overall line and each network point passing through the line is not needed, so that the beneficial effects of simpler and more convenient planning of the ambiguous line and high planning efficiency are realized, and the data volume needing manual maintenance is greatly reduced in the implementation process.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (12)
1. A method for planning an ambiguous line, comprising:
acquiring a starting network point and a target network point, and taking the starting network point as a current network point;
determining a next network point of the current network point according to the current network point and the database information;
judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point;
and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point.
2. The method of claim 1, wherein determining whether the destination node can be reached from the next node comprises:
acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point;
and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point.
3. The method of claim 1, wherein the step of sequentially connecting the segmented lines in series according to the mesh point to obtain a line from a starting mesh point to a destination mesh point comprises:
taking the starting network point as the current network point;
connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point;
until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point.
4. The method of claim 2, further comprising:
the stowage information of the next network point is the stowage information corresponding to the subsection route of the current network point;
and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point.
5. The method of claim 4, further comprising: in the vehicle running process, a sectional route where the vehicle runs is obtained in real time, whether a destination network point is included in the stowage information of the sectional route or not is judged, and if the destination network point is included, the vehicle is confirmed to be correct in the running route.
6. An apparatus for planning an ambiguous line, comprising: the device comprises an acquisition module, a mesh point determination module, a segmentation determination module and a connection module;
the obtaining module is configured to: acquiring a starting network point and a target network point, and taking the starting network point as a current network point;
the mesh point determination module is configured to: determining a next network point of the current network point according to the current network point and the database information;
the segment determination module is configured to: judging whether the next net point can reach the target net point, if so, taking the line from the current net point to the next net point as a segmented line of the current net point, taking the next net point as a new current net point, and determining the segmented line of the new current net point until the next net point of the current net point is the target net point;
the connection module is used for: and sequentially connecting the segmented lines in series according to the network points to obtain the line from the starting network point to the target network point.
7. The apparatus of claim 6, wherein the segmentation determination module is further configured to:
acquiring the stowage information of the next network point, wherein the stowage information comprises all network points which can be reached from the next network point;
and if the stowage information comprises the destination network point, confirming that the next network point can reach the destination network point.
8. The apparatus of claim 6, wherein the connection module is further configured to:
taking the starting network point as the current network point;
connecting the segmented line of the current network point with the segmented line of the next network point of the current network point, taking the next network point as a new current network point, and continuing to connect with the segmented line of the next network point of the new current network point;
until the next network point of the current network point is the target network point, so as to obtain the line from the starting network point to the target network point.
9. The apparatus according to claim 7, wherein the stowage information of the next node is the stowage information corresponding to the segment route of the current node;
the connection module is further configured to: and judging whether the sectional line can pass through, if the sectional line cannot pass through, adjusting the loading information corresponding to the sectional route, and re-determining the sectional route of the current network point.
10. The apparatus of claim 9, further comprising: a monitoring module; the monitoring module is used for: in the vehicle running process, a sectional route where the vehicle runs is obtained in real time, whether a destination network point is included in the stowage information of the sectional route or not is judged, and if the destination network point is included, the vehicle is confirmed to be correct in the running route.
11. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-5.
12. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810662221.3A CN110633933A (en) | 2018-06-25 | 2018-06-25 | Method and device for planning ambiguous line |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810662221.3A CN110633933A (en) | 2018-06-25 | 2018-06-25 | Method and device for planning ambiguous line |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110633933A true CN110633933A (en) | 2019-12-31 |
Family
ID=68967991
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810662221.3A Pending CN110633933A (en) | 2018-06-25 | 2018-06-25 | Method and device for planning ambiguous line |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110633933A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113077199A (en) * | 2020-01-06 | 2021-07-06 | 北京京东振世信息技术有限公司 | Method and device for determining distribution route |
-
2018
- 2018-06-25 CN CN201810662221.3A patent/CN110633933A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113077199A (en) * | 2020-01-06 | 2021-07-06 | 北京京东振世信息技术有限公司 | Method and device for determining distribution route |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110442121B (en) | Method and device for selecting transport vehicle route | |
| CN111859597A (en) | Evaluation method and system of automatic driving algorithm | |
| CN108985672A (en) | Information output method and device | |
| CN114036253A (en) | High-precision map data processing method and device, electronic equipment and medium | |
| CN113128743A (en) | Goods picking path planning method and device | |
| CN110657813B (en) | Method and device for optimizing planned roads in map | |
| CN111044062B (en) | Path planning and recommending method and device | |
| CN114519061A (en) | Map data updating method, device, electronic equipment and medium | |
| CN107085754B (en) | Information output method and device | |
| CN110633933A (en) | Method and device for planning ambiguous line | |
| CN113255950B (en) | Method and device for optimizing logistics network | |
| EP3016041A1 (en) | Schedule data standardization | |
| CN113222205A (en) | Path planning method and device | |
| CN110381471B (en) | Method and device for determining optimal base station for unmanned vehicle | |
| CN108810130B (en) | Method and device for planning distribution request | |
| CN113762573B (en) | Logistics network optimization method and device | |
| CN110274593B (en) | Path planning method and device | |
| CN109029476A (en) | A kind of method and apparatus for determining range coverage | |
| CN113762674B (en) | Order distribution method and device | |
| CN110375752B (en) | Method and device for generating navigation points | |
| CN110377019B (en) | Route generation method and device | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN113077199A (en) | Method and device for determining distribution route | |
| CN111597156A (en) | Civil aviation data processing method and device, electronic equipment and storage medium | |
| CN113778024A (en) | Method and device for scheduling equipment, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |