An optimal path calculation method for highly mobile and dispersed operations

Abstract

This invention discloses an optimal path calculation method for highly mobile and dispersed operations. This method determines a preferred target point and secondary target points, then considers traffic congestion and weather conditions between the secondary and preferred target points to obtain the estimated travel time from the preferred target point to each secondary target point. The secondary target point with the shortest estimated travel time is marked as the new preferred target point, and the original preferred target point is marked as a selected target point. The paths between the selected target points and the new preferred target points are recorded and marked as preferred sub-paths. Finally, based on all preferred sub-paths, the final target path is determined. This target path is the optimal route that allows exploration personnel to consider all detection locations, thereby saving travel time and improving exploration efficiency.

Description

Technical Field

[0001] This invention relates to the field of path calculation technology, and more specifically to an optimal path calculation method for highly mobile and dispersed operations. Background Technology

[0002] Natural resources refer to substances in nature that humans can directly obtain for production and daily life. Natural resources are mainly divided into three categories: first, non-renewable resources, such as various metallic and non-metallic minerals and fossil fuels, which require long geological periods to form; second, renewable resources, such as biological, water, and land resources, which can be reproduced or recycled in a relatively short time; and third, inexhaustible resources, such as wind and solar energy, whose utilization does not lead to a reduction in reserves. The central task of nature conservation is to protect, increase (referring to renewable resources), and rationally utilize natural resources to improve their regeneration and continued utilization capacity, thereby achieving a balance between environmental and socio-economic benefits.

[0003] Resource exploration, especially mineral resource exploration, requires staff to travel to different exploration sites for detection work. Among these, how to choose the travel routes between different exploration sites in order to save travel time is a pressing practical problem that needs to be solved. Summary of the Invention

[0004] The main objective of this invention is to provide an optimal path calculation method for highly mobile and dispersed operations, aiming to solve the problem of how to select travel paths between different exploration sites in order to save travel time.

[0005] The technical solution proposed in this invention is as follows:

[0006] An optimal path calculation method for highly mobile and dispersed operations, characterized by comprising:

[0007] Obtain the initial location point and multiple probe location points;

[0008] The detection point closest to the initial position point is selected as the preferred target point;

[0009] Determine whether there are other detection locations besides the preferred target point and the selected target point;

[0010] If so, mark the detection location points other than the preferred target point and the selected target point as secondary target points; obtain the distance between each secondary target point and the preferred target point, and mark it as secondary distance; based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, obtain the estimated travel time between the preferred target point and each of the secondary target points; mark the secondary target point corresponding to the shortest estimated travel time as the new preferred target point, and mark the original preferred target point as the selected target point; record the path between the selected target point and the new preferred target point, and mark it as the preferred sub-path; execute the step of determining whether there are other detection location points besides the preferred target point and the selected target point.

[0011] If not, merge the multiple preferred sub-paths into the target path.

[0012] Preferably, the step of obtaining the estimated travel time from the preferred target point to each of the secondary target points based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point includes:

[0013] Obtain road condition information between the secondary target point and the preferred target point, and obtain the travel speed between the preferred target point and the secondary target point based on the road condition information;

[0014] The initial travel time is obtained based on the travel speed and the secondary distance;

[0015] Based on the traffic congestion situation between the secondary target point and the preferred target point, and the initial travel time, a traffic-corrected travel time is obtained;

[0016] The estimated travel time is obtained based on the weather conditions between the secondary target point and the preferred target point, as well as the traffic-corrected travel time.

[0017] Preferably, the formula for calculating the travel speed between the preferred target point and the secondary target point by obtaining the road condition information between the secondary target point and the preferred target point based on the road condition information is as follows:

[0018] V1=A×V B ,

[0019] In the formula, V1 is the travel speed, in km / h; V B is the standard speed reference value, in km / h; A is the road condition parameter, a constant greater than 0, with different values ​​depending on different road conditions.

[0020] Preferably, the formula for calculating the initial travel time based on the travel speed and the secondary distance is as follows:

[0021]

[0022] In the formula, S1 is the initial travel time, in hours (h); L e The distance referred to is the second-order distance, in km.

[0023] Preferably, the formula for calculating the traffic-corrected travel time based on the traffic congestion situation between the secondary target point and the preferred target point, and the initial travel time, is as follows:

[0024] S2 = B × S1,

[0025] In the formula, S2 is the modified travel time of the traffic, in hours; B is a traffic parameter, a constant greater than 0, which takes different values ​​based on different traffic congestion conditions.

[0026] Preferably, the formula for calculating the estimated formation time based on the meteorological conditions between the secondary target point and the preferred target point, and the traffic-corrected travel time, is as follows:

[0027] S3 = C × S2,

[0028] In the formula, S3 is the estimated travel time in hours; C is a meteorological parameter, a constant greater than 0, which takes different values ​​based on different meteorological conditions.

[0029] Preferably, the step of merging multiple preferred sub-paths into a target path further includes:

[0030] Get all estimated travel times;

[0031] The estimated travel time between the preferred target point and the initial position point is obtained based on the distance between the preferred target point and the initial position point, the traffic congestion between the preferred target point and the initial position point, and the weather conditions between the preferred target point and the initial position point.

[0032] The total travel time is obtained based on the estimated travel time and all the estimated travel times.

[0033] Preferably, the step of obtaining the estimated travel time from the preferred target point to each of the secondary target points based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, further includes:

[0034] Obtain the actual travel time corresponding to the first preset number of preferred sub-paths;

[0035] Determine whether the first preset condition is met, wherein the first preset condition is: the actual travel time corresponding to the first preset number of preferred sub-paths is less than the corresponding estimated travel time;

[0036] If the first preset condition is met, the standard speed reference value will be increased.

[0037] Preferably, the step of obtaining the actual travel time corresponding to the first preset number of preferred sub-paths further includes:

[0038] Determine whether the second preset condition is met, wherein the second preset condition is: the actual travel time corresponding to the first preset number of preferred sub-paths is greater than the corresponding estimated travel time;

[0039] If the second preset condition is met, the standard speed reference value will be reduced.

[0040] Preferably, the method is applied to an optimal path calculation system for highly mobile and dispersed operations; the system includes a cloud server and a computing terminal; the computing terminal is communicatively connected to the cloud server; the method further includes:

[0041] The initial location point, the detection location point, and the target path are displayed on the computing terminal.

[0042] The above technical solution can achieve the following beneficial effects:

[0043] The optimal path calculation method proposed in this invention for highly mobile and dispersed operations solves the problem of how to select travel routes between different exploration locations to save travel time. This method determines the preferred target point and secondary target points, then considers traffic congestion and weather conditions between the secondary and preferred target points to obtain the estimated travel time from the preferred target point to each secondary target point. The secondary target point with the shortest estimated travel time is marked as the new preferred target point, and the original preferred target point is marked as the selected target point. The paths between the selected target points and the new preferred target points are recorded and marked as preferred sub-paths. Finally, based on all preferred sub-paths, the final target path is determined. This target path is the optimal travel route that allows exploration personnel to consider all exploration locations, thereby saving travel time and improving exploration efficiency. Attached Figure Description

[0044] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the structures shown in these drawings without creative effort.

[0045] Figure 1 This is a flowchart of the first embodiment of an optimal path calculation method for highly mobile and dispersed operations proposed in this invention. Detailed Implementation

[0046] It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the invention.

[0047] This invention proposes an optimal path calculation method for highly mobile and dispersed operations.

[0048] As attached Figure 1 As shown, in the first embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, this embodiment includes the following steps:

[0049] Step S110: Obtain the initial location point and multiple probe location points.

[0050] Specifically, the initial location point here is the current starting position of the exploration personnel; each exploration location point is the location point where exploration needs to be carried out.

[0051] Step S120: Select the detection location point closest to the initial location point as the preferred target point.

[0052] Specifically, the detection point closest to the initial location is taken as the first preferred target point, meaning the next exploration location is the detection point closest to the initial location.

[0053] Step S130: Determine whether there are other detection locations besides the preferred target point and the selected target point.

[0054] Specifically, after the path is determined in step S140, there are no other detection locations. If there are other detection locations, it means that path determination is required (i.e., step S140).

[0055] If so, proceed to step S140: mark the detection location points other than the preferred target point and the selected target point as secondary target points; obtain the distance between each secondary target point and the preferred target point, and mark it as a secondary distance; based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, obtain the estimated travel time between the preferred target point and each of the secondary target points; mark the secondary target point corresponding to the shortest estimated travel time as the new preferred target point, and mark the original preferred target point as the selected target point; record the path between the selected target point and the new preferred target point, and mark it as the preferred sub-path; and proceed to the step of determining whether there are other detection location points besides the preferred target point and the selected target point.

[0056] Specifically, for example, after determining the preferred target point (e.g., point A), there are 3 remaining detection locations (e.g., points B, C, and D). These 3 detection locations are then used as secondary target points. Based on the secondary distance, traffic congestion between the secondary target points and the preferred target point, and weather conditions between the secondary target points and the preferred target point, the estimated travel time from the preferred target point to each secondary target point is obtained (3 estimated travel times). The secondary target point corresponding to the shortest estimated travel time is then marked as the new preferred target point (e.g., point B), and the original preferred target point is marked as the selected target point (point A). The path between the selected target point and the new preferred target point is recorded and marked as a preferred sub-path. Here, only 2 secondary target points remain (points C and D), and a new preferred target point (point B) and a selected target point (point A) have been determined. Then, step S130 is executed again, and this process is repeated to obtain all the preferred sub-paths, thereby determining the entire exploration path.

[0057] If not, proceed to step S150: merge the multiple preferred sub-paths into a target path.

[0058] Specifically, if not, it means that all the preferred sub-paths have been determined, and at this point, multiple preferred sub-paths can be merged into the target path.

[0059] The optimal path calculation method proposed in this invention for highly mobile and dispersed operations solves the problem of how to select travel routes between different exploration locations to save travel time. This method determines the preferred target point and secondary target points, then considers traffic congestion and weather conditions between the secondary and preferred target points to obtain the estimated travel time from the preferred target point to each secondary target point. The secondary target point with the shortest estimated travel time is marked as the new preferred target point, and the original preferred target point is marked as the selected target point. The paths between the selected target points and the new preferred target points are recorded and marked as preferred sub-paths. Finally, based on all preferred sub-paths, the final target path is determined. This target path is the optimal travel route that allows exploration personnel to consider all exploration locations, thereby saving travel time and improving exploration efficiency.

[0060] In a second embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the first embodiment, step S140, which involves obtaining the estimated travel time from the preferred target point to each of the secondary target points based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, includes the following steps:

[0061] Step S210: Obtain road condition information between the secondary target point and the preferred target point, and obtain the travel speed between the preferred target point and the secondary target point based on the road condition information.

[0062] Step S220: Obtain the initial travel time based on the travel speed and the secondary distance.

[0063] Step S230: Based on the traffic congestion situation between the secondary target point and the preferred target point, and the initial travel time, obtain the traffic-corrected travel time.

[0064] Step S240: Based on the weather conditions between the secondary target point and the preferred target point, and the traffic-corrected travel time, the estimated travel time is obtained.

[0065] This embodiment provides a scheme for specifically determining the estimated travel time between the preferred target point and each of the secondary target points.

[0066] In a third embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the second embodiment, the calculation formula for obtaining road condition information between the secondary target point and the preferred target point, and obtaining the travel speed between the preferred target point and the secondary target point based on the road condition information, is as follows:

[0067] V1=A×V B ,

[0068] In the formula, V1 is the travel speed, in km / h; V B is the standard speed reference value, in km / h (60 km / h in this embodiment); A is the road condition parameter, a constant greater than 0, with different values ​​depending on the road condition; in this embodiment, the value is 2 when the road condition is a highway, 1.6 when the road condition is an asphalt paved road, 1.2 when the road condition is a cement road, 0.8 when the road condition is a mountain road, and 0.5 when the road condition is a dirt road.

[0069] In the fourth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the third embodiment, the calculation formula for obtaining the initial travel time based on the travel speed and the secondary distance is as follows:

[0070]

[0071] In the formula, S1 is the initial travel time, in hours (h); L e The distance referred to is the second-order distance, in km.

[0072] In the fifth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the fourth embodiment, the calculation formula for obtaining the traffic-corrected travel time based on the traffic congestion situation between the secondary target point and the preferred target point, and the initial travel time, is as follows:

[0073] S2 = B × S1,

[0074] In the formula, S2 is the modified travel time of the traffic, in hours; B is a traffic parameter, a constant greater than 0, which takes different values ​​based on different traffic congestion conditions; in this embodiment, when the traffic congestion is smooth, the value is 1; when the traffic congestion is moderate, the value is 1.5; and when the traffic congestion is severe, the value is 2.

[0075] In the sixth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the fifth embodiment, the calculation formula for obtaining the estimated formation time based on the meteorological conditions between the secondary target point and the preferred target point, and the traffic-corrected travel time, is as follows:

[0076] S3 = C × S2,

[0077] In the formula, S3 is the estimated travel time in hours; C is a meteorological parameter, a constant greater than 0, which takes different values ​​based on different meteorological conditions; in this embodiment, the value is 1 when the weather is sunny; the value is 1.3 when the weather is light rain; and the value is 2 when the weather is heavy rain or fog.

[0078] In the seventh embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the second embodiment, step S150 is followed by the following steps:

[0079] Step S710: Obtain all estimated travel times.

[0080] Step S720: Based on the distance between the preferred target point and the initial position point, the traffic congestion between the preferred target point and the initial position point, and the weather conditions between the preferred target point and the initial position point, the estimated travel time between the preferred target point and the initial position point is obtained.

[0081] Step S730: Based on the estimated travel time and all the estimated travel times, obtain the total travel time.

[0082] Specifically, the total travel time here is the estimated time required for the explorers to travel from their current initial position to all the exploration locations.

[0083] In the eighth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the third embodiment, step S140, which involves obtaining the estimated travel time from the preferred target point to each of the secondary target points based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, further includes the following steps:

[0084] Step S810: Obtain the actual travel time corresponding to the first preset number (e.g., 3) of preferred sub-paths.

[0085] Specifically, the actual travel time here refers to the time it takes for the exploration personnel to actually complete the optimal sub-path.

[0086] Step S820: Determine whether the first preset condition is met, wherein the first preset condition is: the actual travel time corresponding to the first preset number of preferred sub-paths is less than the corresponding estimated travel time.

[0087] Step S830: If the first preset condition is met, increase the standard speed reference value.

[0088] Specifically, if the actual travel time corresponding to the first three preferred sub-paths is less than the corresponding estimated travel time, it means that the actual speed of the exploration personnel is faster than the estimated speed. Therefore, the calculation formula for the estimated travel time in the above steps can be calibrated by increasing the standard speed reference value.

[0089] In the ninth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the eighth embodiment, step S810 is followed by the following steps:

[0090] Step S910: Determine whether the second preset condition is met, wherein the second preset condition is: the actual travel time corresponding to the first preset number of preferred sub-paths is greater than the corresponding estimated travel time.

[0091] Step S920: If the second preset condition is met, the standard speed reference value is reduced.

[0092] Specifically, if the actual travel time corresponding to the first three preferred sub-paths is greater than the corresponding estimated travel time, it means that the actual speed of the exploration personnel is slower than the estimated speed. Therefore, the calculation formula for the estimated travel time in the above steps can be calibrated by reducing the standard speed reference value.

[0093] Step S930: When neither the first preset condition nor the second preset condition is met, the standard speed reference value is kept unchanged.

[0094] Specifically, if neither the first preset condition nor the second preset condition is met, it means that the accuracy of the aforementioned calculation formula can meet the usage requirements, so the standard speed reference value does not need to be changed.

[0095] In the tenth embodiment of the optimal path calculation method for highly mobile and dispersed operations proposed in this invention, based on the first embodiment, it is applied to an optimal path calculation system for highly mobile and dispersed operations; the system includes a cloud server and a computing terminal (e.g., a smart mobile terminal); the computing terminal is communicatively connected to the cloud server; this embodiment further includes the following steps:

[0096] Step S1010: Display the initial location point, the detection location point, and the target path on the computing terminal.

[0097] Specifically, by displaying the initial location point, probe location point, and target path on the computing terminal, exploration personnel can be informed of the path planning results in real time.

[0098] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0099] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), including several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0100] The embodiments of the present invention have been described above with reference to the accompanying drawings. However, the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of the present invention without departing from the spirit and scope of the claims. All of these forms are within the protection scope of the present invention.

Claims

1. A method for optimal path computation for highly mobile dispersion operations, characterized by, The method comprises the following steps: acquiring an initial position point and a plurality of probe position points; selecting a probe position point closest to the initial position point as a preferred target point; determining whether there are other probe position points except the preferred target point and a selected target point; if yes, marking the probe position points except the preferred target point and the selected target point as secondary target points; acquiring distances between the secondary target points and the preferred target point, and marking the distances as secondary distances; obtaining estimated travel times between the preferred target point and the secondary target points based on the secondary distances, traffic congestion conditions between the secondary target points and the preferred target point, and weather conditions between the secondary target points and the preferred target point; marking a secondary target point corresponding to the shortest estimated travel time as a new preferred target point, and marking the original preferred target point as a selected target point; recording a path between the selected target point and the new preferred target point, and marking the path as a preferred sub-path; and performing the step of determining whether there are other probe position points except the preferred target point and the selected target point; if no, combining a plurality of the preferred sub-paths into a target path; the step of obtaining the estimated travel times between the preferred target point and the secondary target points based on the secondary distances, traffic congestion conditions between the secondary target points and the preferred target point, and weather conditions between the secondary target points and the preferred target point comprises the following steps: acquiring road condition information between the secondary target points and the preferred target point, and obtaining a travel speed between the preferred target point and the secondary target points based on the road condition information; obtaining an initial travel time based on the travel speed and the secondary distance; obtaining a traffic corrected travel time based on traffic congestion conditions between the secondary target points and the preferred target point, and the initial travel time; obtaining the estimated travel time based on weather conditions between the secondary target points and the preferred target point, and the traffic corrected travel time; a calculation formula of the step of obtaining the travel speed between the preferred target point and the secondary target points based on the road condition information is: ， wherein, is the traveling speed, in km / h; is a standard speed reference value, in km / h; A is a road condition parameter, which is a constant greater than 0 and takes different values based on different road conditions; when the road condition is a highway, the value is 2; when the road condition is an asphalt paved road, the value is 1.6; when the road condition is a cement road, the value is 1.2; when the road condition is a mountain road, the value is 0.8; and when the road condition is a dirt road, the value is 0.

5.

2. The optimal path computation method for highly fluid dispersion operations of claim 1, wherein, a calculation formula of the step of obtaining the initial travel time based on the travel speed and the secondary distance is: ， In the formula, is the initial travel duration, in h; is the secondary distance, in km.

3. The optimal path computation method for highly fluid dispersion operations of claim 2, wherein, a calculation formula of the step of obtaining the traffic corrected travel time based on traffic congestion conditions between the secondary target points and the preferred target point, and the initial travel time is: ， In the formula, is the traffic modification travel time, in hours; B is a traffic parameter, which is a constant greater than 0, and takes different values based on different traffic congestion situations.

4. The optimal path computation method for highly fluid dispersion operations of claim 3, wherein, a calculation formula of the step of obtaining the estimated travel time based on weather conditions between the secondary target points and the preferred target point, and the traffic corrected travel time is: ， In the formula, is the estimated travel time, in hours; C is a meteorological parameter, which is a constant greater than 0 and takes different values based on different meteorological conditions.

5. The optimal path computation method for highly fluid dispersion operations of claim 1, wherein, the step of combining a plurality of the preferred sub-paths into a target path further comprises the following steps: acquiring all the estimated travel times; obtaining an estimated travel time between the preferred target point and the initial position point based on a distance between the preferred target point and the initial position point, traffic congestion conditions between the preferred target point and the initial position point, and weather conditions between the preferred target point and the initial position point; obtaining a total travel time based on the estimated travel time between the preferred target point and the initial position point, and all the estimated travel times.

6. The optimal path computation method for highly fluid dispersion operations of claim 1, wherein, The estimated travel time between the preferred target point and each of the secondary target points is obtained based on the secondary distance, traffic congestion between the secondary target point and the preferred target point, and weather conditions between the secondary target point and the preferred target point, and then further includes: acquiring actual travel times corresponding to the previous preset number of preferred sub-paths; determining whether a first preset condition is met, wherein the first preset condition is that the actual travel times corresponding to the previous preset number of preferred sub-paths are all less than the corresponding estimated travel times; if the first preset condition is met, increasing the standard speed reference value.

7. The optimal path computation method for highly fluid dispersion operations of claim 6, wherein, The acquiring of the actual travel times corresponding to the previous preset number of preferred sub-paths further includes: determining whether a second preset condition is met, wherein the second preset condition is that the actual travel times corresponding to the previous preset number of preferred sub-paths are all greater than the corresponding estimated travel times; if the second preset condition is met, decreasing the standard speed reference value.

8. The optimal path computation method for highly fluid dispersion operations of claim 1, wherein, The system is applied to an optimal path calculation system for highly mobile and dispersed operations; the system includes a cloud server and a calculation terminal; the calculation terminal is in communication connection with the cloud server; The method further includes: displaying the initial position point, the detection position point, and the target path on the calculation terminal.

Images