CN112556707A - Path planning method and device - Google Patents
Path planning method and device Download PDFInfo
- Publication number
- CN112556707A CN112556707A CN201910914042.9A CN201910914042A CN112556707A CN 112556707 A CN112556707 A CN 112556707A CN 201910914042 A CN201910914042 A CN 201910914042A CN 112556707 A CN112556707 A CN 112556707A
- Authority
- CN
- China
- Prior art keywords
- sub
- path
- distance
- road network
- road
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000013439 planning Methods 0.000 title claims abstract description 35
- 238000003860 storage Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 9
- 238000000638 solvent extraction Methods 0.000 claims 1
- 238000004422 calculation algorithm Methods 0.000 description 15
- 238000010586 diagram Methods 0.000 description 15
- 238000009826 distribution Methods 0.000 description 12
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000003064 k means clustering Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000000137 annealing Methods 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000013598 vector Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a path planning method and a path planning device, and relates to the technical field of logistics. One embodiment of the method comprises: dividing a target road network into a plurality of sub-road networks according to each destination address in a destination set; taking each destination address as a node, inquiring the distance between nodes in the sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition; and combining the sub-paths between different sub-network networks to obtain the moving path. According to the embodiment, the target road network is divided into a plurality of sub-road networks according to the destination address, the path in each sub-road network is planned respectively, and then the path between different sub-road networks is planned, so that when the distance is inquired, the distance between the destinations in each sub-road network is inquired respectively, and then the distance between the sub-paths of different sub-road networks is inquired, so that the distance is inquired in two stages, the inquiry quantity can be effectively reduced, and the inquiry efficiency is improved.
Description
Technical Field
The invention relates to the technical field of logistics, in particular to a path planning method and a path planning device.
Background
The logistics distribution is widely applied to daily life and enterprise operation, and connects production and consumption to meet the increasing social consumption demand. The high-efficiency reasonable distribution is the guarantee of the smooth operation of the logistics system, whether the distribution route is arranged reasonably or not has great influence on the distribution speed, the cost and the benefit, and especially the determination of a multi-user distribution line is more complex. The distribution route of the vehicle is correctly and reasonably arranged, so that the transportation time can be effectively saved, the utilization rate of the vehicle is improved, and the cost is reduced.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art: for the whole network data query method, in the large-scale path planning oriented problem, the path distances between all two places cannot be obtained in a short time due to large data volume; similarly, too large road network basic data may reduce the solution efficiency of large-scale path planning. For larger order volumes, longer query times are required, such query speeds are inadequate for real-time path planning, and query times grow exponentially as the order volume grows.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for planning a moving path, where a target road network is divided into a plurality of sub-road networks according to each destination address in a destination set, a path in each sub-road network is planned, and then paths between different sub-road networks are planned, so that when a distance is queried, a distance between destinations in each sub-road network is queried, and then a distance between sub-paths in different sub-road networks is queried, so that a distance is queried in two stages, which can effectively reduce a query amount and improve query efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a movement path planning method including: dividing a target road network into a plurality of sub-road networks according to each destination address in a destination set; taking each destination address as a node, inquiring the distance between each node in each sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition; and combining the sub-paths between different sub-network networks to obtain the moving path.
Optionally, dividing the target road network into a plurality of sub-road networks according to each destination address in the destination set includes: determining longitude and latitude coordinates of each destination address in the destination set; clustering the orders according to the longitude and latitude coordinates to obtain a plurality of categories; and dividing the target road network into a plurality of sub-road networks according to the destination addresses belonging to the same category.
Optionally, before merging sub-paths between different sub-path networks, the method further includes: taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes; and determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition.
Optionally, the preset constraint condition includes at least one of: vehicle weight bearing limits, vehicle capacity limits, and order time window limits.
To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided a movement path planning apparatus including: the road network dividing module is used for dividing the target road network into a plurality of sub-road networks according to each destination address in the destination set; the sub-path planning module is used for taking each destination address as a node, inquiring the distance between each node in the sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition; and the sub-path merging module is used for merging sub-paths among different sub-path networks to obtain a moving path.
Optionally, the road network dividing module is further configured to: determining longitude and latitude coordinates of each destination address in the destination set; clustering the orders according to the longitude and latitude coordinates to obtain a plurality of categories; and dividing the target road network into a plurality of sub-road networks according to the destination addresses belonging to the same category.
Optionally, the sub-path merging module is further configured to: taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes; and determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition.
Optionally, the preset constraint condition includes at least one of: vehicle weight bearing limits, vehicle capacity limits, and order time window limits.
To achieve the above object, according to still another aspect of embodiments 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 path planning method of the embodiment of the invention.
To achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program implementing the path planning method of the embodiments of the present invention when executed by a processor.
One embodiment of the above invention has the following advantages or benefits: the target road network is divided into a plurality of sub-road networks according to each destination address in the destination set; taking each destination address as a node, inquiring the distance between each node in each sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition; determining whether to merge sub-paths between different sub-network; if the path data query method is adopted, the sub paths between different sub-path networks are combined, so that the effective distance data in the path network can be queried in two stages, and the number of paths calculated each time is reduced, so that the query quantity of the path data is reduced, and the query efficiency of the path data is improved.
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 main flow of a path planning method according to an embodiment of the present invention;
FIG. 2-1 is a schematic diagram of a path planning method for dividing a target road network according to an embodiment of the present invention;
fig. 2-2 is a schematic diagram of a sub-path determined by the path planning method according to the embodiment of the present invention;
fig. 3 is a schematic diagram of a main flow of a path planning method according to another embodiment of the present invention;
FIG. 4 is a schematic diagram of the main modules of a path planner according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 6 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.
Fig. 1 is a schematic diagram of a main flow of a mobile aggregation planning method according to an embodiment of the present invention, as shown in fig. 1, the method includes:
step S101: dividing a target road network into a plurality of sub-road networks according to each destination address in a destination set;
step S102: taking each destination address as a node, inquiring the distance between each node in each sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition;
step S103: taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes;
step S104: determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition;
step S105: if so, combining the sub-paths between different sub-network networks to obtain a moving set.
For step S101, as an example, the destination may be a shipping address of an order to be delivered, and the order set is a set of order shipping addresses. The destination road network refers to a distribution area in which the distribution center (or the destination) is responsible, and each destination address in the destination set is dispersed in the destination road network. In the logistics distribution path planning, a basic principle needs to be satisfied, that is, orders in a geographic area are distributed to a distribution vehicle as much as possible on the premise of ensuring that the orders arrive at a receiving address specified by a customer on time, so that the distribution cost is reduced as much as possible. Therefore, in this step, the target road network is divided into a plurality of sub-road networks according to the receiving address (i.e., destination address) of each order, so that orders with close distances are divided into the same sub-road network.
For step S102, the preset constraint condition includes at least one of the following: vehicle weight bearing limits, vehicle capacity limits, and order time window limits. In alternative embodiments, the constraint condition may also include a mileage limit, or the like. Wherein the order time window limit refers to completing delivery of the order within a defined time frame.
The process of determining the sub-path according to the distance between each node in the sub-road network and the preset constraint condition can be regarded as a Vehicle Routing Problem (VRP). The Vehicle Routing Problem (VRP) refers to a certain number of customers, each having a different number of goods, and the distribution center provides the customers with goods, and a fleet of vehicles is responsible for distributing the goods and organizing appropriate driving routes, so as to meet the needs of the customers and achieve the purposes of shortest route, minimum cost, minimum time consumption and the like under certain constraints. The current methods commonly used for vehicle routing problems can be divided into exact algorithms (exact algorithm) and heuristic methods (heuritics), wherein the exact algorithms include a branch boundary method, a branch cutting method, a set covering method and the like; the heuristic solution includes a saving method, a simulated annealing method, a deterministic annealing method, a tabu search method, a genetic algorithm, a neural network, an ant colonizing algorithm and the like. In this embodiment, the sub-path in each sub-network may be planned by using any of the above methods, which is not limited herein.
In this embodiment, the distance between nodes in each sub-network is queried, so that the query data amount can be greatly reduced, and the query efficiency is improved. Specifically, assuming that N orders (N is an integer greater than 1) are shared in the order set, the destination road network is divided into M sub-road networks (M is an integer greater than 1) according to the delivery addresses of the N orders, and the jth sub-road network D is selectedjBelongs to the sub-road network DjThe order quantity of (a) is qj。
The number S of distances to be queried in the prior art1N × (N-1). In this step, the number of distances to be queried
From this, it can be seen that the number of distances to be queried in this step is much smaller than that in the prior art. As a specific example, as shown in fig. 2-1, assuming that N is 30 and M is 9, specifically: q. q.s1＝5，q2＝4，q3＝3，q4＝4，q5＝4，q6＝2，q7＝4，q8＝2，q9If 3, then S1＝30×29＝870，
In this step, only the path in each sub-network is planned, and the paths between the sub-networks need to be planned, that is, under the condition that the constraint condition is met, the orders in the adjacent areas are distributed to one distribution vehicle as much as possible, so that the distribution cost is minimized. Therefore, in this embodiment, it is also necessary to determine whether to merge sub-paths between different sub-path networks.
In step S103, the process of determining whether the sub-paths are merged may be regarded as planning the path based on a new node, and the node may be the center of each sub-path. If two new nodes are planned on the same path when the path is planned, determining that sub-paths corresponding to the two new nodes can be merged into one path. Specifically, reference may be made to step S102.
Assuming that the sub-path planned in step S102 is H, the number of distances to be queried in this step is S3H × (H-1). The number of the distance to be queried finally in this embodiment is S'1＝S2+S3. Therefore, the number of the distances required to be queried in the method of the embodiment of the invention is less than and much less than the number of the required queries in the prior art. Continuing with the above example as an example, as shown in fig. 2-2, H ═ 12, then S'1216, which is smaller than 980 in the prior art.
According to the path planning method provided by the embodiment of the invention, the target road network is divided into a plurality of sub-road networks according to each destination address in the destination set, the path in each sub-road network is planned respectively, and then the paths between different sub-road networks are planned, so that when the distance is inquired, the distance between the destinations in each sub-road network is inquired respectively, and then the distance between the sub-paths of different sub-road networks is inquired, so that the distance is inquired in two stages, the inquiry quantity can be effectively reduced, and the inquiry efficiency is improved.
Fig. 3 is a schematic diagram of a main flow of a path planning method according to another embodiment of the present invention, as shown in fig. 3, the method includes:
step S301: determining longitude and latitude coordinates of each destination address in the destination set;
step S302: clustering the destinations according to the longitude and latitude coordinates to obtain a plurality of categories;
step S303: dividing a target road network into a plurality of sub-road networks according to destination addresses belonging to the same category;
step S304: taking the destination address as a node, inquiring the distance between nodes in each road network for each road network, and determining a sub-path according to the distance and a preset constraint condition;
step S305: taking the center of each sub-path as a new node, and inquiring the distance between the new nodes;
step S306: determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition;
step S307: if so, combining the sub-paths between different sub-network networks to obtain the moving path.
Steps S303 to S307 may refer to the embodiment shown in fig. 1, and the present invention is not described herein again.
For step S302, clustering is performed by grouping data points into clusters, wherein similar data points are in the same cluster and dissimilar data points are in different clusters, wherein similarity can be calculated in clusters using a variety of different methods. In the embodiment of the invention, clustering can be realized by using algorithms such as a partition-based K-means algorithm, a density-based DBSCAN algorithm or a Gaussian Mixture Model (GMM) -based maximum Expectation (EM) clustering algorithm. As a preferred embodiment, the K-means algorithm clustering is adopted in the embodiment. The K-means clustering algorithm is a non-hierarchical clustering algorithm, data are divided into specific classes on the basis of minimum error, the distance between the classes is used as a similarity index, and the smaller the distance between two vectors is, the higher the similarity is. The K-means clustering algorithm starts with K random centroids. The algorithm will calculate the distance of each point to the centroid. Each point will be assigned to the cluster centroid closest to it. The cluster centroid is then updated based on the newly assigned points to the cluster. The above process is repeated several times until the centroid does not change any more.
In the embodiment, the order is clustered by using the K-means clustering algorithm, so that the calculation is simple and convenient, the speed is high, and the real-time path planning efficiency is improved.
Fig. 4 is a schematic diagram of main modules of a path planning apparatus 400 according to an embodiment of the present invention, and as shown in fig. 4, the apparatus 400 includes:
a road network dividing module 401, configured to divide a target road network into a plurality of sub-road networks according to each destination address in the destination set;
a sub-path planning module 402, configured to use each destination address as a node, query, for each sub-path network, a distance between nodes in the sub-path network, and determine a sub-path according to the distance and a preset constraint condition;
and a sub-path merging module 403, configured to merge sub-paths between different sub-network networks to obtain a moving set.
Optionally, the road network dividing module 401 is further configured to:
determining longitude and latitude coordinates of each destination address in the destination set;
clustering the orders according to the longitude and latitude coordinates to obtain a plurality of categories;
and dividing the target road network into a plurality of sub-road networks according to the destination addresses belonging to the same category.
Optionally, the sub-path merging module 403 is further configured to:
taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes;
and determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition.
Optionally, the constraint includes at least one of: vehicle weight bearing limits, vehicle capacity limits, and order time window limits.
According to the path planning device provided by the embodiment of the invention, the target road network is divided into a plurality of sub-road networks according to each destination address in the destination set; taking the destination address as a node, inquiring the distance between nodes in each road network for each road network, and determining a sub-path according to the distance and a preset constraint condition; taking each sub-path as a new node, and determining whether to merge sub-paths between different sub-network or not according to the distance between all new nodes and a preset constraint condition; if the path data query method is adopted, the sub paths between different sub-path networks are combined, so that the effective distance data in the path network can be queried in two stages, and the number of paths calculated each time is reduced, so that the query quantity of the path data is reduced, and the query efficiency of the path data is improved.
The device can execute the method provided by the embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided by the embodiment of the present invention.
Fig. 5 shows an exemplary system architecture 500 to which the path planning method or the path planning apparatus according to the embodiments of the present invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 505, and a server 505. The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. Various communication client applications may be installed on the terminal devices 501, 502, 503.
The terminal devices 501, 502, 503 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 505 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 501, 502, 503. The background management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (e.g., target push information and product information) to the terminal device.
It should be noted that the path planning method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the path planning apparatus is generally disposed in the server 505.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 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. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 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 may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
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 includes a sending module, an obtaining module, a determining module, and a first processing module. The names of these modules do not in some cases constitute a limitation on the unit itself, and for example, the sending module may also be described as a "module that sends a picture acquisition request to a connected server".
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:
dividing a target road network into a plurality of sub-road networks according to each destination address in a destination set;
taking each destination address as a node, inquiring the distance between each node in each sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition;
and combining the sub-paths between different sub-network networks to obtain the moving path.
According to the technical scheme of the embodiment of the invention, the target road network is divided into a plurality of sub-road networks according to each destination address in the destination set, the path in each sub-road network is planned respectively, and then the paths among different sub-road networks are planned, so that when the distance is inquired, the distance between the destinations in each sub-road network is inquired respectively, and then the distance between the sub-paths of different sub-road networks is inquired, so that the distance is inquired in two stages, the inquiry quantity can be effectively reduced, and the inquiry efficiency is improved.
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 (10)
1. A method of path planning, comprising:
dividing a target road network into a plurality of sub-road networks according to each destination address in a destination set;
taking each destination address as a node, inquiring the distance between each node in each sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition;
and combining the sub-paths between different sub-network networks to obtain the moving path.
2. The method of claim 1, wherein dividing the target road network into a plurality of sub-road networks according to each destination address in the destination set comprises:
determining longitude and latitude coordinates of each destination address in the destination set;
clustering the orders according to the longitude and latitude coordinates to obtain a plurality of categories;
and dividing the target road network into a plurality of sub-road networks according to the destination addresses belonging to the same category.
3. The method of claim 1, wherein prior to merging sub-paths between different networks of sub-paths, the method further comprises:
taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes;
and determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition.
4. A method according to any of claims 1-3, wherein the preset constraints comprise at least one of: vehicle weight bearing limits, vehicle capacity limits, and order time window limits.
5. A movement path planning apparatus, comprising:
the road network dividing module is used for dividing the target road network into a plurality of sub-road networks according to each destination address in the destination set;
the sub-path planning module is used for taking each destination address as a node, inquiring the distance between each node in the sub-road network for each sub-road network, and determining a sub-path according to the distance and a preset constraint condition;
and the sub-path merging module is used for merging sub-paths among different sub-path networks to obtain a moving path.
6. The apparatus of claim 5, wherein said road network partitioning module is further configured to:
determining longitude and latitude coordinates of each destination address in the destination set;
clustering the orders according to the longitude and latitude coordinates to obtain a plurality of categories;
and dividing the target road network into a plurality of sub-road networks according to the destination addresses belonging to the same category.
7. The apparatus of claim 5, wherein the sub-path merging module is further configured to:
taking the central point of each sub-path as a new node, and inquiring the distance between the new nodes;
and determining whether to merge sub-paths between different sub-road networks according to the distance between the new nodes and a preset constraint condition.
8. The apparatus according to any one of claims 5-7, wherein the preset constraint condition comprises at least one of: vehicle weight bearing limits, vehicle capacity limits, and order time window limits.
9. 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-4.
10. 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-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910914042.9A CN112556707A (en) | 2019-09-25 | 2019-09-25 | Path planning method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910914042.9A CN112556707A (en) | 2019-09-25 | 2019-09-25 | Path planning method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112556707A true CN112556707A (en) | 2021-03-26 |
Family
ID=75029530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910914042.9A Pending CN112556707A (en) | 2019-09-25 | 2019-09-25 | Path planning method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112556707A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180075568A1 (en) * | 2016-09-14 | 2018-03-15 | Boe Technology Group Co., Ltd. | Order processing method, apparatus and system |
| CN108830528A (en) * | 2018-06-15 | 2018-11-16 | 重庆城市管理职业学院 | Express mail Distribution path planing method based on time-space attribute |
| CN109282826A (en) * | 2018-07-03 | 2019-01-29 | 四川驹马科技有限公司 | The method and its system of map multi-point path planning are carried out based on polymerization methods |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN109978213A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of task path planning method and device |
-
2019
- 2019-09-25 CN CN201910914042.9A patent/CN112556707A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180075568A1 (en) * | 2016-09-14 | 2018-03-15 | Boe Technology Group Co., Ltd. | Order processing method, apparatus and system |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN109978213A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | A kind of task path planning method and device |
| CN108830528A (en) * | 2018-06-15 | 2018-11-16 | 重庆城市管理职业学院 | Express mail Distribution path planing method based on time-space attribute |
| CN109282826A (en) * | 2018-07-03 | 2019-01-29 | 四川驹马科技有限公司 | The method and its system of map multi-point path planning are carried out based on polymerization methods |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111366160B (en) | Path planning method, path planning device and terminal equipment | |
| CN107624190B (en) | System and method for accelerating route search | |
| Schermer et al. | Algorithms for solving the vehicle routing problem with drones | |
| CN108492068B (en) | Method and device for path planning | |
| CN110645983A (en) | Path planning method, device and system for unmanned vehicle | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN108734559A (en) | A kind of order processing method and apparatus | |
| US11949760B2 (en) | System and method for content parsing | |
| CN110334091A (en) | A kind of data fragmentation distributed approach, system, medium and electronic equipment | |
| WO2020164319A1 (en) | Goods pickup method and device | |
| CN109902990A (en) | A kind of supply chain logistics distribution routing planning system | |
| CN111461383A (en) | Method and device for planning distribution path | |
| CN113673932A (en) | Logistics network planning method and device | |
| CN111178810B (en) | Method and device for generating information | |
| Zheng et al. | Online trichromatic pickup and delivery scheduling in spatial crowdsourcing | |
| CN109978213B (en) | Task path planning method and device | |
| WO2020005600A1 (en) | Planning for goods allocation | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN112200336A (en) | Method and device for planning vehicle driving path | |
| CN109597810A (en) | A kind of task cutting method, device, medium and electronic equipment | |
| CN113128743A (en) | Goods picking path planning method and device | |
| CN111044062A (en) | Path planning and recommending method and device | |
| CN111428925B (en) | Method and device for determining distribution route | |
| CN113077106A (en) | Time window-based article transportation method and device | |
| CN112556707A (en) | Path planning method and device |
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 |