CN113689021A - Method and apparatus for outputting information - Google Patents
Method and apparatus for outputting information Download PDFInfo
- Publication number
- CN113689021A CN113689021A CN202010425698.7A CN202010425698A CN113689021A CN 113689021 A CN113689021 A CN 113689021A CN 202010425698 A CN202010425698 A CN 202010425698A CN 113689021 A CN113689021 A CN 113689021A
- Authority
- CN
- China
- Prior art keywords
- coordinate point
- coordinate
- target
- point
- points
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 78
- 230000008569 process Effects 0.000 claims abstract description 34
- 238000013507 mapping Methods 0.000 claims description 22
- 230000015654 memory Effects 0.000 claims description 19
- 239000013598 vector Substances 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 7
- 230000008859 change Effects 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000012937 correction Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Navigation (AREA)
Abstract
The application discloses a method and a device for outputting information, and relates to the technical field of maps. The specific implementation scheme is as follows: acquiring original path planning information, including a coordinate point set ordered according to a first-come-later distribution sequence; performing the following updating process by taking the first coordinate point as the starting coordinate point: determining a coordinate point next to the initial coordinate point as an end coordinate point according to a distribution sequence; selecting a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points as a target coordinate point; determining whether the target coordinate point passes through when the distribution is carried out between the starting coordinate point and the ending coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the initial coordinate point and the termination coordinate point; if the ending coordinate point is the last coordinate point, outputting updated path planning information; if not, the updating process is continuously executed by taking the termination coordinate point as the starting coordinate point. This embodiment enables correction of the compliance in the path planning.
Description
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to the technical field of maps.
Background
The VRP (route planning) Problem refers to a certain number of customers, each having a different number of goods required, and a distribution center provides the goods to the customers, and a fleet 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 (distribution time window, Vehicle working time, loading capacity and the like).
In the prior art, due to the VRP algorithm and the map data, the requirement of the road property cannot be completely met. Map data can only be checked back through unreasonable places in the results, and if the problems are caused by the map data, a map team is promoted to solve the problems in terms of data quality. The passive feedback and problem solving mode has low efficiency, and the quality of solving the forward road property of the VRP can not be improved in a large scale.
Disclosure of Invention
A method, apparatus, device, and storage medium for outputting information are provided.
According to a first aspect, there is provided a method for outputting information, comprising: acquiring original path planning information, wherein the path planning information comprises a coordinate point set which is sequenced according to a first-to-last distribution sequence; performing the following updating process by taking the first coordinate point as the starting coordinate point: determining a coordinate point next to the initial coordinate point as an end coordinate point according to a distribution sequence; selecting a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points as a target coordinate point; determining whether the target coordinate point passes through when the distribution is carried out between the starting coordinate point and the ending coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the initial coordinate point and the termination coordinate point; if the ending coordinate point is the last coordinate point, outputting updated path planning information; and if the ending coordinate point is not the last coordinate point, taking the ending coordinate point as the starting coordinate point to continue to execute the updating process.
According to a second aspect, there is provided an apparatus for outputting information, comprising: an acquisition unit configured to acquire original path planning information, wherein the path planning information includes a set of coordinate points ordered in a first-to-last delivery order; an updating unit configured to perform an updating process with the first coordinate point as a starting coordinate point as follows: determining a coordinate point next to the initial coordinate point as an end coordinate point according to a distribution sequence; selecting a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points as a target coordinate point; determining whether the target coordinate point passes through when the distribution is carried out between the starting coordinate point and the ending coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the initial coordinate point and the termination coordinate point; if the ending coordinate point is the last coordinate point, outputting updated path planning information; and the circulating unit is configured to continue to execute the updating process by taking the termination coordinate point as the starting coordinate point if the termination coordinate point is not the last coordinate point.
According to a third aspect, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of the first aspect.
According to a fourth aspect, there is provided a non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method of any of the first aspects.
According to the technology of the application, the problem that the path rule can not completely meet the requirement of the forward road performance is solved, the forward road performance of the path planning result can be greatly improved, and inherent defects of map data and an algorithm are overcome.
It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present application may be applied;
FIG. 2 is a flow diagram for one embodiment of a method for outputting information, in accordance with the present application;
3a-3c are schematic diagrams of an application scenario of a method for outputting information according to the present application;
FIG. 4 is a flow diagram of yet another embodiment of a method for outputting information according to the present application;
FIG. 5 is a schematic block diagram illustrating one embodiment of an apparatus for outputting information according to the present application;
fig. 6 is a block diagram of an electronic device for a method of outputting information according to an embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. 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 present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 shows an exemplary system architecture 100 to which embodiments of the present method for outputting information or apparatus for outputting information may be applied.
As shown in fig. 1, the system architecture 100 may include an ordering terminal 101, a server 102, and a distribution terminal 103. The ordering terminal 101, the server 102, and the distribution terminal 103 are connected via a wired network or a wireless network.
The user may use the ordering terminal 101 to send an order request to the server 102. The order request includes information such as item name, quantity, shipping address, etc. Various communication client applications, such as a web browser application, a shopping application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like, may be installed on the ordering terminal 101.
After receiving the plurality of order requests, the server 102 plans a delivery route according to different receiving addresses. The goal is to meet the customer's needs and achieve goals such as shortest distance, least cost, least time consumption, etc. under certain constraints (delivery time window, vehicle length of operation, load, etc.). In actual services, some service scenarios have additional requirements on [ forward property ], that is, from the delivery of a- > C, if a customer B passes through, the customer B needs to deliver the service in the order of a- > B- > C, and the customer C cannot be delivered and then returns to the first delivery B.
The server 102 may further optimize existing path planning information to improve the ease of travel.
The server 102 outputs the optimized path planning information to the distribution terminal 103. The distribution terminal 103 is provided with navigation software, and the navigation software navigates the vehicles to distribution network points for article distribution according to the distribution sequence indicated by the path planning information.
The server may be hardware or software. When the server is hardware, it may be implemented as a distributed server cluster formed by multiple servers, or may be implemented as a single server. When the server is software, it may be implemented as multiple pieces of software or software modules (e.g., multiple pieces of software or software modules used to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.
It should be noted that the method for outputting information provided by the embodiment of the present application is generally performed by the server 102, and accordingly, the apparatus for outputting information is generally disposed in the server 102.
It should be understood that the number of ordering terminals, servers, distribution terminals in fig. 1 is merely illustrative. Any number of ordering terminals, servers, distribution terminals may be provided according to implementation needs.
With continued reference to FIG. 2, a flow 200 of one embodiment of a method for outputting information in accordance with the present application is shown. The method for outputting information comprises the following steps:
In this embodiment, an execution subject (for example, a server shown in fig. 1) of the method for outputting information may receive designed path planning information from a third-party server through a wired connection manner or a wireless connection manner, where the path planning information includes a set of coordinate points sorted in a delivery order from first to last. For example, 37 and 38 shown in fig. 3a are coordinate points of distribution nodes, after the path planning, path planning information from 37 to 38 is returned, and this information includes coordinate point information passing from 37 to 38, and A, C shown in fig. 3b and 3c is information of two adjacent coordinate points. The original path planning information is distributed in the order of the sequence numbers from small to large. The method aims to find out the coordinate points distributed along the road in the original path planning information and readjust the distribution sequence.
In the present embodiment, the first coordinate point refers to a coordinate point that is ranked first in the set of coordinate points, i.e., a departure point of the route. It is possible to adjust the order of coordinate points other than the first coordinate point.
In step 203, the coordinate point next to the start coordinate point is determined as the end coordinate point according to the distribution sequence.
In the present embodiment, the coordinate point is adjusted in segments each time starting from the first coordinate point. The goal of the first adjustment is to determine whether an in-path coordinate point exists between the first coordinate point and its next coordinate point, i.e., the first coordinate point and the second coordinate point. The same process is performed for each segment, and in order to simplify the description of the process, a coordinate point of the start in the segment is taken as a start coordinate, and a coordinate point of the end in the segment is taken as an end coordinate.
At step 204, coordinate points other than the start coordinate point and the end coordinate point are selected from the set of coordinate points as target coordinate points.
In this embodiment, it is determined whether there are other coordinate points between the start coordinate point and the end coordinate point that can follow the route. Thus excluding both endpoints. Furthermore, a coordinate point that has been previously updated in the current round of sorting is not required to be the target coordinate point of the current round of sorting.
In some optional implementations of the present embodiment, coordinate points that are not updated in the order, except for the start coordinate point and the end coordinate point, are selected from the set of coordinate points as candidate coordinate points. And acquiring a mapping coordinate point of the candidate coordinate point mapped on a road closest to the candidate coordinate point, and determining the candidate coordinate point as a target coordinate point if the shortest distance from the mapping coordinate point to a line segment consisting of the starting coordinate point and the ending coordinate point is less than a certain distance threshold. As shown in fig. 3B, the network point S is a point to be distributed, and includes longitude and latitude, and a point (B) after the correction of the point S can be obtained through map recotify (correction) application, and if the point exists, the point is located on the road. It can be understood as a mapping of any coordinate point on the road closest to it. In fact, the mesh point S may be mapped on a plurality of roads, and the application only takes the mapped coordinate point on the road closest to the mesh point S as the mapping coordinate point. The search speed is improved by reducing the search range of the target coordinate point, so that the path optimization speed is improved.
As shown in fig. 3B and 3c, the path line segment (AC) and the dot mapped coordinate point B may form a triangle. Based on the constructed triangle, the target coordinate point screening is carried out based on some characteristics of the triangle.
The shortest distance of B to the line segment AC is smaller than a predetermined second threshold (for example, 10 meters, which may be set according to the road width). It should be noted that the shortest distance from B to line segment AC is different from the distance from B to the line on which AC is located. The latter is the length of the perpendicular line segment from B to AC, and the former needs to consider the shape of triangle ABC. If the angle CAB and the angle ACB < ═ 90 degrees, the shortest distance is the distance of the vertical segment, as shown in fig. 3 b. Otherwise min (BC, BA), as shown in FIG. 3 c.
In step 205, it is determined whether the target coordinate point has passed while being distributed between the start coordinate point and the end coordinate point.
In this embodiment, the start coordinate point and the end coordinate point may be combined into a first trajectory, the start coordinate point, the target coordinate point, and the end coordinate point may be combined into a second trajectory, and the similarity between the first trajectory and the second trajectory may be calculated. The track similarity is usually calculated by using a distance function, and there are many common track similarity indexes, for example, the CPD distance is to find two points with the closest distance between the two points in the two tracks, and the distance of the point pair is used as the track distance. If the similarity is greater than a predetermined similarity threshold, the target coordinate point may be deemed to have passed in the delivery between the start coordinate point and the end coordinate point. If a plurality of target coordinate points exist, whether the target coordinate points are the forward points needs to be judged one by one.
In some optional implementations of this embodiment, a triangle is constructed by the mapping coordinate point, the start coordinate point, and the end coordinate point of the target coordinate point; and if the included angle between a first vector formed by the starting coordinate point and the mapping coordinate point and a second vector formed by the mapping coordinate point and the termination coordinate point is less than 90 degrees, determining that the target coordinate point passes through when the target coordinate point is distributed between the starting coordinate point and the termination coordinate point. As shown in FIG. 3B, if the direction of travel of the line is A → B, the angle α between vectors AB and BC is less than 90 degrees. This condition is primarily used to define that B needs to be between AC. Avoiding the situation shown in figure 3 c. If the rule is not present, it is determined that the AC path passes B when the BC distance is smaller than the distance threshold, resulting in erroneous determination.
If the process is passed, the distribution sequence of the target coordinate points is updated to be between the starting coordinate point and the ending coordinate point in step 206.
In this embodiment, if it is determined in step 205 that the target coordinate point passes through the distribution between the start coordinate point and the end coordinate point, the target coordinate point is an in-route point, and the distribution may be performed before the end coordinate point. The delivery order of the target coordinate points is updated to be between the start coordinate point and the end coordinate point. For example, the delivery order of the start coordinate points is 37, the delivery order of the end coordinate points is 38, the original delivery order of the target coordinate points is 41, the order of the target coordinate points is updated to 38, and the updated order is used in the next round of planning. The subsequent coordinate points in the current round of planning also use the original delivery sequence. But the coordinate points that have been updated are not selected as target coordinate points when the target coordinate points are selected subsequently.
And if the target coordinate point is not passed through during distribution between the starting coordinate point and the ending coordinate point, the target coordinate point is not a forward-route point. No sequence adjustment is required.
For the found coordinates of the following roads, the overall sequence of the line needs to be adjusted. The adjustment rules are as follows:
1. if the coordinate point S1S 2S3 is found to pass in the route from A to B, if S1S 2S3 is sequentially after B in the original route, S1S 2S3 is moved to before B, and the following sequence is sequentially delayed. If a plurality of target coordinate points are the forward route points, the target coordinate points close to the initial coordinate point are arranged in front according to the sequencing of the distance from the initial coordinate point. Sequential point detection among a plurality of target coordinate points is not needed, and therefore the optimization speed of path planning is improved.
2. If S1S 2S3 is just before B in the original sequence, it indicates that the coordinates have been determined when the path is to B, and no adjustment is needed.
The adjustment just inserts the larger distribution order to the smaller distribution order.
And step 207, if the ending coordinate point is the last coordinate point, outputting the updated path planning information.
In this embodiment, if there are multiple target coordinate points, and each target coordinate point determines whether it is an on-route point, if the termination coordinate is the last coordinate point, the route update of the current round is completed, and the updated route planning information may be output to the distribution terminal. And the distribution terminal performs vehicle navigation according to the updated path planning information.
In step 208, if the ending coordinate point is not the last coordinate point, the ending coordinate point is used as the starting coordinate point to continue the updating process.
In this embodiment, if there are multiple target coordinate points, and each target coordinate point is determined to be a forward route point, if the ending coordinate is not the last coordinate point, the ending coordinate point in the current updating process is taken as the starting coordinate point in the next updating process, and the updating process is continuously executed. For example, a coordinate point with order 38 is set as the start coordinate of the next update, and it is determined whether there is a forward path point between the coordinate point with order 38 and the coordinate point with order 39.
In some optional implementations of the embodiment, in response to receiving the request for the additional coordinate point, the updating process is performed with the additional coordinate point as the target coordinate point. The dynamic adjustment of the path can be realized, the added coordinate point is added to the distribution along the road in time, and the distribution cost is saved.
With continued reference to fig. 3a, fig. 3a is a schematic diagram of an application scenario of the method for outputting information according to the present embodiment. In the present application scenario, the server receives the original path planning information shown in fig. 3 a. The delivery order for each coordinate point is identified in the original planning information, e.g. 37-41. The distribution is carried out in the order from small to large. First, a coordinate point in order 37 is set as a start coordinate point, and a coordinate point in order 38 is set as an end coordinate point. The order of acquiring the candidate target coordinate points is 39, 40, 41, respectively. Whether the vehicle passes through the target coordinate points in the order of 39, 40 and 41 in the process of being assigned from the coordinate point in the order of 37 to the coordinate point in the order of 38 is sequentially determined through the above steps. It is calculated that only coordinate points with an order of 40 are the way points. Thus, the order of the coordinate points in order 40 can be adjusted to 38, and the order can be sequentially corrected. Then, whether the coordinate point with the order of 41 passes through between the coordinate point with the order of 38 and the coordinate point with the order of 39 in the original path planning information is judged. If the non-passing order is 41 coordinate points, the order of 41 coordinate points is not adjusted.
The method provided by the above embodiment of the present application can simulate a vehicle to plan a delivery process according to a route through route planning data, and correct a delivery point on a forward road but not delivered to a corresponding forward road position by determining a condition that the vehicle passes through the delivery point but is not delivered in the route, thereby implementing correction of forward road performance.
With further reference to fig. 4, a flow 400 of yet another embodiment of a method for outputting information is shown. The process 400 of the method for outputting information includes the steps of:
In step 402, the following updating process is performed with the first coordinate point as the starting coordinate point.
In step 403, the coordinate point next to the start coordinate point is determined as the end coordinate point in the distribution order.
At step 404, coordinate points other than the start coordinate point and the end coordinate point are selected from the set of coordinate points as target coordinate points.
At step 405, it is determined whether the target coordinate point passes when being distributed between the start coordinate point and the end coordinate point.
In step 406, if the distribution sequence of the target coordinate points passes, the distribution sequence of the target coordinate points is updated to be between the starting coordinate point and the ending coordinate point.
In step 407, if the ending coordinate point is the last coordinate point, the updated path planning information is output.
In step 408, if the ending coordinate point is not the last coordinate point, the ending coordinate point is used as the starting coordinate point to continue the updating process.
In this embodiment, after a round of sequence adjustment, a path re-planning situation may occur in a new sequence, and at this time, the new path may pass through some other coordinate points, so that there is still a situation that the final route looks out of the way. Here, by setting the switch, the circuit can be re-planned according to the adjusted sequence through the switch on cycle processing, and the circuit can be adjusted again according to the planned circuit. The maximum number of cycles may be set according to the number of coordinate points, for example, 100 coordinate points may be set for 10 cycles, and 1000 coordinate points may be set for 50 cycles. If the maximum number of cycles is reached, step 411 is performed. Otherwise, step 410 is performed.
And step 410, if the maximum cycle number is not reached, judging whether the sequence adjustment of the current round has new sequence change.
In this embodiment, although the maximum number of cycles is not reached, if the current sequence adjustment does not bring any gain, the cycle process may be ended. Otherwise, the loop continues to execute step 401-408.
In step 411, if the maximum cycle number is reached, or there is no new sequence change, the updated path planning information is output.
In this embodiment, if the maximum number of cycles is reached, or there is no new sequence change, it indicates that the route planning has been optimized to a certain extent, and the route planning may be output to the delivery terminal for vehicle navigation, and the vehicle will deliver according to the sequence of the new route planning.
As can be seen from fig. 4, compared with the embodiment corresponding to fig. 2, the flow 400 of the method for outputting information in the present embodiment embodies the effect of loop enhancement. In addition, since there is no path between individual points due to an overrun of QPS (number of requests per second) in path planning, the determination of the forward path point may fail, and the influence of this on the final effect can be reduced by executing the loop.
After the technical scheme is used, under the condition that the map quality is kept unchanged, the sequential correction rate of the logistics list discharging result is 40% on average, the smoothness of the result can be greatly improved, and the inherent defects of map data and an algorithm are avoided.
As shown in fig. 5, the apparatus 500 for outputting information of the present embodiment includes: an acquisition unit 501, an update unit 502, and a loop unit 503. The obtaining unit 501 is configured to obtain original path planning information, where the path planning information includes a set of coordinate points ordered in a first-to-last delivery order. An updating unit 502 configured to perform the following updating process with the first coordinate point as a starting coordinate point: determining a coordinate point next to the initial coordinate point as an end coordinate point according to a distribution sequence; selecting a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points as a target coordinate point; determining whether the target coordinate point passes through when the distribution is carried out between the starting coordinate point and the ending coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the initial coordinate point and the termination coordinate point; and if the ending coordinate point is the last coordinate point, outputting the updated path planning information. A loop-back unit 503 configured to continue performing the above-described updating process with the end coordinate point as the start coordinate point if the end coordinate point is not the last coordinate point.
In this embodiment, the specific processes of the obtaining unit 501, the updating unit 502 and the circulating unit 503 of the apparatus 500 for outputting information may refer to steps 201 and 208 in the corresponding embodiment of fig. 2.
In some optional implementations of this embodiment, the loop unit 503 is further configured to: and circularly executing the updating process based on the updated path planning information until no new sequence change exists or the maximum circulation times are reached.
In some optional implementations of this embodiment, the updating unit 502 is further configured to: selecting coordinate points which are not updated and sorted except the initial coordinate point and the termination coordinate point from the coordinate point set as candidate coordinate points; acquiring a mapping coordinate point of the candidate coordinate point mapped on a road closest to the candidate coordinate point; and if the shortest distance from the mapping coordinate point to a line segment formed by the starting coordinate point and the ending coordinate point is less than a certain distance threshold, determining the candidate coordinate point as a target coordinate point.
In some optional implementations of this embodiment, the updating unit 502 is further configured to: constructing a triangle through the mapping coordinate point, the starting coordinate point and the ending coordinate point of the target coordinate point; and if the included angle between a first vector formed by the starting coordinate point and the mapping coordinate point and a second vector formed by the mapping coordinate point and the termination coordinate point is less than 90 degrees, determining that the target coordinate point passes through when the target coordinate point is distributed between the starting coordinate point and the termination coordinate point.
In some optional implementations of this embodiment, the updating unit 502 is further configured to: and in response to the fact that the number of the target coordinate points passing through when the distribution is carried out between the starting coordinate point and the ending coordinate point is larger than 1, sequencing according to the sequence that the distance between the target coordinate points and the starting coordinate points is from small to large.
In some optional implementations of this embodiment, the updating unit 502 is further configured to: in response to receiving the request for the additional coordinate point, the above-described updating process is performed with the additional coordinate point as the target coordinate point.
According to an embodiment of the present application, an electronic device and a readable storage medium are also provided.
As shown in fig. 6, is a block diagram of an electronic device for outputting information according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.
As shown in fig. 6, the electronic apparatus includes: one or more processors 601, memory 602, and interfaces for connecting the various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). In fig. 6, one processor 601 is taken as an example.
The memory 602 is a non-transitory computer readable storage medium as provided herein. Wherein the memory stores instructions executable by at least one processor to cause the at least one processor to perform the method for outputting information provided herein. The non-transitory computer readable storage medium of the present application stores computer instructions for causing a computer to perform the method for outputting information provided herein.
The memory 602, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the method for outputting information in the embodiments of the present application (for example, the obtaining unit 501, the updating unit 502, and the circulating unit 503 shown in fig. 5). The processor 601 executes various functional applications of the server and data processing, i.e., implements the method for outputting information in the above-described method embodiments, by executing non-transitory software programs, instructions, and modules stored in the memory 602.
The memory 602 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of an electronic device for outputting information, and the like. Further, the memory 602 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 602 optionally includes memory located remotely from the processor 601, which may be connected to an electronic device for outputting information via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device of the method for outputting information may further include: an input device 603 and an output device 604. The processor 601, the memory 602, the input device 603 and the output device 604 may be connected by a bus or other means, and fig. 6 illustrates the connection by a bus as an example.
The input device 603 may receive input numeric or character information and generate key signal inputs related to user settings and function controls of the electronic apparatus for outputting information, such as an input device like a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointer, one or more mouse buttons, a track ball, a joystick, etc. The output devices 604 may include a display device, auxiliary lighting devices (e.g., LEDs), and tactile feedback devices (e.g., vibrating motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
According to the technical scheme of the embodiment of the application, the problem of how to judge that a certain distribution point passes through in the distribution path is solved. And performs sequence adjustment according to the determination. The method can effectively improve the smoothness of the final result of the VRP, and better meet the actual logistics dispatching scene and the needs of some industries.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.
The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (14)
1. A method for outputting information, comprising:
acquiring original path planning information, wherein the path planning information comprises a coordinate point set which is sequenced according to a first-to-last distribution sequence;
performing the following updating process by taking the first coordinate point as the starting coordinate point: determining a coordinate point next to the starting coordinate point as an ending coordinate point according to a distribution sequence; selecting, as a target coordinate point, a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points; determining whether the target coordinate point passes at the time of delivery between the start coordinate point and the end coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the starting coordinate point and the ending coordinate point; if the termination coordinate point is the last coordinate point, outputting updated path planning information;
and if the termination coordinate point is not the last coordinate point, taking the termination coordinate point as the starting coordinate point to continue to execute the updating process.
2. The method of claim 1, wherein the method further comprises:
and circularly executing the updating process based on the updated path planning information until no new sequence change exists or the maximum circulation times are reached.
3. The method of claim 1, wherein the selecting, from the set of coordinate points, a coordinate point other than the start coordinate point and the end coordinate point as a target coordinate point comprises:
selecting, as candidate coordinate points, coordinate points from the set of coordinate points that are not updated in the order, except for the start coordinate point and the end coordinate point;
acquiring a mapping coordinate point of the candidate coordinate point mapped on a road closest to the candidate coordinate point;
and if the shortest distance from the mapping coordinate point to a line segment formed by the starting coordinate point and the ending coordinate point is less than a certain distance threshold, determining the candidate coordinate point as a target coordinate point.
4. The method of claim 3, wherein the determining whether the target coordinate point is passed while being dispatched between the start coordinate point and the end coordinate point comprises:
constructing a triangle by mapping coordinate points of the target coordinate point, the start coordinate point and the end coordinate point;
and if the included angle between a first vector formed by the starting coordinate point and the mapping coordinate point and a second vector formed by the mapping coordinate point and the termination coordinate point is less than 90 degrees, determining that the target coordinate point passes through when the target coordinate point is distributed between the starting coordinate point and the termination coordinate point.
5. The method according to one of claims 1-4, wherein the method further comprises:
and in response to the fact that the number of the target coordinate points passing through when the distribution is carried out between the starting coordinate point and the ending coordinate point is larger than 1, sequencing according to the sequence that the distance between the target coordinate points and the starting coordinate points is from small to large.
6. The method according to one of claims 1-4, wherein the method further comprises:
in response to receiving the request for the additional coordinate point, the above-described updating process is performed with the additional coordinate point as the target coordinate point.
7. An apparatus for outputting information, comprising:
an acquisition unit configured to acquire original path planning information, wherein the path planning information includes a set of coordinate points ordered in a first-to-last delivery order;
an updating unit configured to perform an updating process with the first coordinate point as a starting coordinate point as follows: determining a coordinate point next to the starting coordinate point as an ending coordinate point according to a distribution sequence; selecting, as a target coordinate point, a coordinate point other than the start coordinate point and the end coordinate point from the set of coordinate points; determining whether the target coordinate point passes at the time of delivery between the start coordinate point and the end coordinate point; if so, updating the distribution sequence of the target coordinate points to be between the starting coordinate point and the ending coordinate point; if the termination coordinate point is the last coordinate point, outputting updated path planning information;
and the circulating unit is configured to continue to execute the updating process by taking the termination coordinate point as the starting coordinate point if the termination coordinate point is not the last coordinate point.
8. The apparatus of claim 7, wherein the circulation unit is further configured to:
and circularly executing the updating process based on the updated path planning information until no new sequence change exists or the maximum circulation times are reached.
9. The apparatus of claim 7, wherein the update unit is further configured to:
selecting, as candidate coordinate points, coordinate points from the set of coordinate points that are not updated in the order, except for the start coordinate point and the end coordinate point;
acquiring a mapping coordinate point of the candidate coordinate point mapped on a road closest to the candidate coordinate point;
and if the shortest distance from the mapping coordinate point to a line segment formed by the starting coordinate point and the ending coordinate point is less than a certain distance threshold, determining the candidate coordinate point as a target coordinate point.
10. The apparatus of claim 7, wherein the update unit is further configured to:
constructing a triangle by mapping coordinate points of the target coordinate point, the start coordinate point and the end coordinate point;
and if the included angle between a first vector formed by the starting coordinate point and the mapping coordinate point and a second vector formed by the mapping coordinate point and the termination coordinate point is less than 90 degrees, determining that the target coordinate point passes through when the target coordinate point is distributed between the starting coordinate point and the termination coordinate point.
11. The apparatus according to one of claims 7-10, wherein the updating unit is further configured to:
and in response to the fact that the number of the target coordinate points passing through when the distribution is carried out between the starting coordinate point and the ending coordinate point is larger than 1, sequencing according to the sequence that the distance between the target coordinate points and the starting coordinate points is from small to large.
12. The apparatus according to one of claims 7-10, wherein the updating unit is further configured to:
in response to receiving the request for the additional coordinate point, the above-described updating process is performed with the additional coordinate point as the target coordinate point.
13. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.
14. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010425698.7A CN113689021B (en) | 2020-05-19 | 2020-05-19 | Method and device for outputting information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010425698.7A CN113689021B (en) | 2020-05-19 | 2020-05-19 | Method and device for outputting information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113689021A true CN113689021A (en) | 2021-11-23 |
| CN113689021B CN113689021B (en) | 2024-04-30 |
Family
ID=78576058
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010425698.7A Active CN113689021B (en) | 2020-05-19 | 2020-05-19 | Method and device for outputting information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113689021B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024103974A1 (en) * | 2022-11-17 | 2024-05-23 | 北京京东振世信息技术有限公司 | Path planning method, system and apparatus, electronic device, and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008097252A2 (en) * | 2006-06-22 | 2008-08-14 | Roy Sandberg | Method and apparatus for robotic path planning, selection, and visualization |
| US20090063035A1 (en) * | 2007-08-29 | 2009-03-05 | Alexander Mandel | Method and Apparatus for Path Planning and Distance Calculation |
| CN105679037A (en) * | 2016-03-29 | 2016-06-15 | 重庆云途交通科技有限公司 | Dynamic path planning method based on user travel habit |
| CN107480929A (en) * | 2017-08-21 | 2017-12-15 | 浪潮软件股份有限公司 | A kind of method, intelligent terminal, service terminal and system for generating Distribution path |
| CN107817000A (en) * | 2017-10-25 | 2018-03-20 | 广州汽车集团股份有限公司 | Paths planning method, device and the computer equipment of automatic driving vehicle |
| CN109808692A (en) * | 2017-11-17 | 2019-05-28 | 丰田自动车株式会社 | Autonomous driving system |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN110095134A (en) * | 2019-05-16 | 2019-08-06 | 李培嵩 | It is a kind of using the preference of user as the method and system of the path planning of core and navigation |
| CN110400020A (en) * | 2019-07-31 | 2019-11-01 | 北京百度网讯科技有限公司 | Method and apparatus for output information |
-
2020
- 2020-05-19 CN CN202010425698.7A patent/CN113689021B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008097252A2 (en) * | 2006-06-22 | 2008-08-14 | Roy Sandberg | Method and apparatus for robotic path planning, selection, and visualization |
| US20090063035A1 (en) * | 2007-08-29 | 2009-03-05 | Alexander Mandel | Method and Apparatus for Path Planning and Distance Calculation |
| CN105679037A (en) * | 2016-03-29 | 2016-06-15 | 重庆云途交通科技有限公司 | Dynamic path planning method based on user travel habit |
| CN107480929A (en) * | 2017-08-21 | 2017-12-15 | 浪潮软件股份有限公司 | A kind of method, intelligent terminal, service terminal and system for generating Distribution path |
| CN107817000A (en) * | 2017-10-25 | 2018-03-20 | 广州汽车集团股份有限公司 | Paths planning method, device and the computer equipment of automatic driving vehicle |
| CN109808692A (en) * | 2017-11-17 | 2019-05-28 | 丰田自动车株式会社 | Autonomous driving system |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN110095134A (en) * | 2019-05-16 | 2019-08-06 | 李培嵩 | It is a kind of using the preference of user as the method and system of the path planning of core and navigation |
| CN110400020A (en) * | 2019-07-31 | 2019-11-01 | 北京百度网讯科技有限公司 | Method and apparatus for output information |
Non-Patent Citations (2)
| Title |
|---|
| 周才云: "KR济南分公司物流配送路径优化研究", 工程科技Ⅱ辑;经济与管理科学 * |
| 王宇;陈海涛;李煜;李海川;: "基于Grid-GSA算法的植保无人机路径规划方法", 农业机械学报, no. 07 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024103974A1 (en) * | 2022-11-17 | 2024-05-23 | 北京京东振世信息技术有限公司 | Path planning method, system and apparatus, electronic device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113689021B (en) | 2024-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109784820A (en) | A kind of express delivery routing intelligence solution, device, terminal device and storage medium | |
| CN110705800B (en) | Mixed travel route determination method, device, equipment and storage medium | |
| CN110617825B (en) | Vehicle positioning method and device, electronic equipment and medium | |
| CN104992241A (en) | Goods picking path generation method and generation apparatus, and corresponding storage management system | |
| CN110737849B (en) | Travel scheme recommendation method, device, equipment and storage medium | |
| CN112802325B (en) | Vehicle queuing length detection method and device | |
| CN110986980A (en) | Planned route detection method and device and electronic equipment | |
| CN112100302B (en) | Map information point display method, apparatus, device and readable storage medium | |
| CN112529890A (en) | Method and device for processing track, road side equipment and cloud control platform | |
| CN114036253A (en) | High-precision map data processing method and device, electronic equipment and medium | |
| CN115062868B (en) | Pre-polymerization type vehicle distribution path planning method and device | |
| CN113532456A (en) | Method and device for generating navigation route | |
| CN113887828B (en) | Intelligent supply chain production, transportation and marketing cooperation and real-time network planning method and device | |
| CN113888769B (en) | Inspection method and device and electronic equipment | |
| CN113689021A (en) | Method and apparatus for outputting information | |
| CN116046000A (en) | Path planning method, system, device, electronic equipment and storage medium | |
| CN113723721B (en) | Intelligent scheduling method, device, equipment and storage medium based on logistics transportation | |
| CN115608623A (en) | Method and apparatus for determining picking information | |
| CN111750876A (en) | Road network repairing method, device, equipment and storage medium | |
| CN111027423B (en) | Automatic driving lane line detection method and device and electronic equipment | |
| CN114756774A (en) | Travel scheme recommendation method, travel scheme recommendation device, model training equipment and storage medium | |
| CN114781972A (en) | Method, device, equipment and medium for determining cargo transportation scheme | |
| CN110728721B (en) | Method, device and equipment for acquiring external parameters | |
| CN114330807A (en) | Route determination method and device and electronic equipment | |
| US20210166186A1 (en) | Information processing device, moving device, information processing system, method, and program |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |