A method, device and terminal device for predicting the operation status of a manned mining truck

The location data and directed weight chart of the driverless mine card are obtained through unmanned mine cards, and their operating status is predicted, which solves the problem of route conflicts in the transportation operation area and improves transportation efficiency and safety.

CN118396188BActive Publication Date: 2024-11-08CHANGSHA INTELLIGENT DRIVING INST CORP LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410817794.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-06-24
Publication Date
2024-11-08
Estimated Expiration
2044-06-24

AI Technical Summary

Technical Problem

In the transportation operation area of ​​the mine area, the overlap of transportation routes between unmanned mine cards and manned mine cards leads to conflicts in driving routes, affecting transportation efficiency and safety. It is difficult for the existing technology to accurately predict the operating status of manned mine cards.

Method used

Obtain the location data of the driverless mine card and the directed weight chart of the transportation operation area through the driverless mine card, determine the target candidate route, and predict the operation status based on the routing attributes, coordinate the driving path of the driverless mine card to avoid congestion .

Benefits of technology

The production efficiency and transportation safety of the transportation operation area have been improved. By reasonably scheduling unmanned mine cards, congestion in the transportation operation area has been avoided, and the efficiency and safety of the overall transportation operation have been improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118396188B_ABST
    Figure CN118396188B_ABST
Patent Text Reader

Abstract

The present application provides a method, device and terminal device for predicting the operating status of a manned mining truck, and the method includes: obtaining the positioning data of the manned mining truck to be predicted through the unmanned mining truck; obtaining a directed weighted graph corresponding to the transportation operation area and multiple routes corresponding to the directed weighted graph; the route is a driving path between two stops in the transportation operation area; determining the target candidate route of the manned mining truck to be predicted based on the positioning data and the directed weighted graph; determining the operating status of the manned mining truck to be predicted based on the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route. This method can enable each unmanned mining truck and each manned mining truck in the transportation operation area to better coordinate operations, avoid congestion in the transportation operation area, and improve the production and transportation efficiency and transportation safety of the entire transportation operation area.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent scheduling technology, and in particular to a method, device and terminal equipment for predicting the operating status of a manned mining truck. Background Art

[0002] With the continuous development of science and technology, autonomous driving technology has been widely used in various fields, including mining transportation. In the transportation operation area of ​​the mining area, unmanned mining trucks and manned mining trucks are usually scheduled for mixed operation. Unmanned mining trucks can use autonomous driving technology to achieve more intelligent and efficient transportation, while manned mining trucks cannot directly feedback their own positioning data and operation status; and because the transportation routes of unmanned mining trucks and manned mining trucks overlap, there may be intersections and conflicts in the driving routes, which will affect the transportation scheduling of the transportation operation area, causing congestion in the transportation operation area, thereby affecting the production and transportation efficiency and transportation safety of the entire transportation operation area.

[0003] Therefore, how to accurately predict the operating status of manned mining trucks and improve the production and transportation efficiency and transportation safety in the transportation operation area is a technical problem that technical personnel in this field currently need to solve. Summary of the invention

[0004] The purpose of the present application is to provide a method, device, terminal equipment and computer-readable storage medium for predicting the operating status of a manned mining truck, which can enable the unmanned mining trucks and manned mining trucks in the transportation operation area to better coordinate operations and avoid congestion in the transportation operation area; and improve the production and transportation efficiency and transportation safety of the entire transportation operation area.

[0005] In a first aspect, the present application provides a method for predicting the operating status of a manned mining truck. The method comprises:

[0006] Obtain the positioning data of the manned mining truck to be predicted through the unmanned mining truck;

[0007] Acquire a directed weighted graph corresponding to a transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area;

[0008] Determine a target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph;

[0009] The operation state of the manned mining truck to be predicted is determined according to the candidate points in the target candidate route corresponding to the manned mining truck to be predicted and the route attributes of the target candidate route.

[0010] In one embodiment, determining the target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph includes:

[0011] If the positioning data includes a predicted trajectory, determining a candidate route according to the predicted trajectory and the directed weighted graph;

[0012] Determine the observation probability and transition probability corresponding to the hidden Markov model according to the predicted trajectory and the candidate route;

[0013] A state sequence is determined according to the observation probability and the transition probability to obtain a target candidate route.

[0014] In one embodiment, the method further comprises:

[0015] If the positioning data includes trajectory points, determining candidate routes according to the trajectory points and the directed weighted graph;

[0016] Determine the cost value corresponding to each of the candidate routes;

[0017] A target candidate route is determined from the candidate routes according to the cost values.

[0018] In one embodiment, determining the cost value corresponding to each of the candidate routes includes:

[0019] For each of the candidate routes, determining a candidate point corresponding to the trajectory point on the candidate route, and determining a projection distance between the candidate point and the trajectory point;

[0020] Determine a heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point;

[0021] The cost value of the candidate route is determined according to the projection distance and the heading angle difference.

[0022] In one embodiment, determining a target candidate route from each of the candidate routes according to each of the cost values ​​includes:

[0023] Arranging the cost values ​​of the candidate routes in a preset order;

[0024] Calculating the cost difference between two adjacent cost values ​​in descending order according to the cost value, and determining the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold;

[0025] A target candidate route is determined according to the similar candidate routes.

[0026] In one embodiment, determining the target candidate route according to the similar candidate routes includes:

[0027] Determining the candidate number of the similar candidate routes;

[0028] If the number of candidates is 1, the similar candidate route is determined as the target candidate route.

[0029] In one embodiment, the method further comprises:

[0030] If the number of candidates is greater than 1, determining whether each of the similar candidate routes is an offload route;

[0031] If all of the similar candidate routes are the unloading routes, then for each of the similar candidate routes, determining the number of vehicles on the future travel path of the manned mining truck to be predicted in the similar candidate route;

[0032] The similar candidate route with the least number of vehicles is determined as the target candidate route.

[0033] In one embodiment, the method further comprises:

[0034] If the similar candidate routes are not all the unloading routes, the target candidate route is determined from a plurality of the similar candidate routes according to the vehicle offset and the heading angle of the trajectory point of the manned mining truck to be predicted.

[0035] In a second aspect, the present application also provides an operating status prediction device for a manned mining truck. The device comprises:

[0036] A positioning data acquisition module is used to acquire positioning data of a manned mining truck to be predicted through an unmanned mining truck;

[0037] A route acquisition module, used to acquire a directed weighted graph corresponding to a transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area;

[0038] A target candidate route determination module, used to determine the target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph;

[0039] The operating state prediction module is used to determine the operating state of the manned mining truck to be predicted according to the candidate points in the target candidate route corresponding to the manned mining truck to be predicted and the route attributes of the target candidate route.

[0040] In a third aspect, the present application further provides a terminal device, wherein the terminal device comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above method when executing the computer program.

[0041] In a fourth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the above method are implemented.

[0042] The present application provides a method for predicting the operating status of a manned mining truck. The method predicts a target candidate route of the manned mining truck to be predicted based on the positioning data of the manned mining truck to be predicted obtained by the unmanned mining truck and the directed weighted graph corresponding to the transportation operation area, and determines the operating status of the manned mining truck to be predicted according to the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route; by predicting the operating status of the manned mining truck, the unmanned mining truck can be more reasonably dispatched, and the transportation tasks and driving routes can be arranged; the unmanned mining trucks and the manned mining trucks in the transportation operation area can be better coordinated to avoid congestion in the transportation operation area; and the production and transportation efficiency and transportation safety of the entire transportation operation area are improved.

[0043] It can be understood that the operating status prediction device, terminal device and computer-readable storage medium of a manned mining truck provided in the embodiment of the present application have the same beneficial effects as the operating status prediction method of the manned mining truck mentioned above, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0045] Figure 1 A flowchart of a method for predicting the operating status of a manned mining truck provided in an embodiment of the present application;

[0046] Figure 2 A schematic diagram of a directed weighted graph provided in an embodiment of the present application;

[0047] Figure 3 A schematic diagram of a process for determining a target candidate route provided in an embodiment of the present application;

[0048] Figure 4 and Figure 5 A schematic diagram of a matching result based on a Viterbi dynamic programming algorithm provided in an embodiment of the present application;

[0049] Figures 6 to 8 A schematic diagram of matching results of similar candidate routes and trajectory points provided in an embodiment of the present application;

[0050] Fig. 9 A flowchart of another method for predicting the operating status of a manned mining truck provided in an embodiment of the present application;

[0051] Fig.10 A schematic diagram of the structure of an operating state prediction device for a manned mining truck provided in an embodiment of the present application;

[0052] Fig.11 A schematic diagram of the structure of a terminal device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0053] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0054] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or combinations thereof.

[0055] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0056] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.

[0057] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.

[0058] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways. "Multiple" means "two or more".

[0059] A method for predicting the operating status of a manned mining truck provided in an embodiment of the present application can be executed by a processor of a terminal device when running a corresponding computer program; the terminal device can be an intelligent scheduling device corresponding to a transportation operation area.

[0060] Figure 1 The flowchart of a method for predicting the operating status of a manned mining truck provided in an embodiment of the present application is shown. For the sake of convenience, only the part related to the present embodiment is shown. The method provided in the present embodiment includes the following steps:

[0061] S100: Acquire positioning data of a manned mining truck to be predicted through an unmanned mining truck.

[0062] Among them, positioning data refers to data that characterizes the location information of the manned mining truck to be predicted, including trajectory points and predicted trajectories. The unmanned mining truck determines the positioning data of the manned mining truck to be predicted through pre-installed sensors such as body cameras, lidars, and millimeter-wave radars.

[0063] In a specific example, the vehicle body camera collects images of obstacles around it, and by identifying the obstacle images, when it is determined that the obstacle is a manned mining truck, the vehicle obtains its own position information through the positioning device; obtains the distance and direction between the manned mining truck and itself through the laser radar or millimeter wave radar; and determines the trajectory point of the manned mining truck based on its own position information and the distance and direction between the manned mining truck and itself. Specifically, after the unmanned mining truck determines the positioning data of the manned mining truck to be predicted, it sends the positioning data of the manned mining truck to be predicted to the intelligent scheduling device through MQTT (Message Queuing TelemetryTransport), so that the intelligent scheduling device obtains the positioning data of the manned mining truck to be predicted.

[0064] S200: Acquire a directed weighted graph corresponding to the transport operation area and a plurality of routes corresponding to the directed weighted graph; a route is a driving path between two stop points in the transport operation area.

[0065] The transportation operation area refers to the mine unloading area in the mining production line, where manned and unmanned mining trucks work together. In the transportation operation area, the driving path of unmanned mining trucks is generally fixed. Although the driving path of manned mining trucks is random, due to geographical restrictions, it will not deviate greatly from the operating path of unmanned mining trucks.

[0066] Specifically, the intelligent dispatching device obtains the road network data of the transport operation area, constructs a corresponding directed weighted graph based on the road network data, and determines multiple routes based on the directed weighted graph. The road network data includes map information of stops and driving routes in the transport operation area; in actual applications, the road network data corresponding to the transport operation area can be obtained through GRPC (Google Remote Procedure Call).

[0067] Figure 2 A schematic diagram of a directed weighted graph provided in an embodiment of the present application; Figure 2 As shown in the figure, the nodes in the directed weighted graph are the stop points in the transport operation area, including loading and unloading points and starting points, etc. The edges in the directed weighted graph are the driving paths in the transport operation area. The route is the driving path between two stop points in the transport operation area. The corresponding route is determined according to the shortest path between any two nodes in the directed weighted graph. A route also represents the driving path corresponding to the two nodes.

[0068] Specifically, for each node in the directed weighted graph, the shortest path corresponding to the node and other nodes is determined, that is, the corresponding route is determined. In practical applications, the shortest path from the node to the remaining nodes can be searched through the Dijkstra algorithm, so that the shortest path between any two nodes in the directed weighted graph can be obtained, that is, the corresponding route is determined and pre-stored in the cache of the intelligent scheduling device.

[0069] In this step, a directed weighted graph is constructed in advance according to the road network data, and the shortest path between any two nodes is determined through path search to obtain the corresponding route; when the route matching is subsequently performed according to the positioning data of the manned mining truck to be predicted, the matching can be directly performed based on the route, thereby reducing the calculation time and improving the real-time performance of map matching.

[0070] S300: Determine a target candidate route of the manned mining truck to be predicted based on the positioning data and the directed weighted graph.

[0071] The target candidate route refers to the route that is determined from various routes and best matches the manned mining truck to be predicted.

[0072] In this embodiment, the target candidate route of the manned mining truck to be predicted is determined based on the positioning data and the directed weighted graph; specifically, the target candidate route of the manned mining truck to be predicted is determined based on the mapping relationship between the positioning data and the directed weighted graph, and the routes corresponding to the predetermined directed weighted graph.

[0073] S400: Determine the operation status of the manned mining truck to be predicted according to the candidate points in the target candidate route corresponding to the manned mining truck to be predicted and the route attributes of the target candidate route.

[0074] The route attributes include the task type, starting point, loading and unloading points and destination corresponding to the route, etc. This embodiment does not limit the specific content of the route attributes.

[0075] Specifically, according to the mapping relationship between the trajectory points of the manned mining truck to be predicted and the target candidate route, the candidate point corresponding to the manned mining truck to be predicted is determined in the target candidate route; the route attributes of the target candidate route are obtained, and the operating status of the manned mining truck to be predicted is determined according to the candidate point and the route attributes; wherein the operating status includes the task type, destination, current route and actual location.

[0076] An embodiment of the present application provides a method for predicting the operating status of a manned mining truck. The method predicts a target candidate route of the manned mining truck to be predicted based on the positioning data of the manned mining truck to be predicted obtained by the unmanned mining truck and the directed weighted graph corresponding to the transportation operation area, and determines the operating status of the manned mining truck to be predicted based on the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route; by predicting the operating status of the manned mining truck, the unmanned mining truck can be more reasonably dispatched, and the transportation tasks and driving routes can be arranged; the unmanned mining trucks and the manned mining trucks in the transportation operation area can be better coordinated to avoid congestion in the transportation operation area; and the production and transportation efficiency and transportation safety of the entire transportation operation area are improved.

[0077] On the basis of the above-mentioned embodiment, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, the target candidate route of the manned mining truck to be predicted is determined according to the positioning data and the directed weighted graph, including:

[0078] If the positioning data includes a predicted trajectory, determining a candidate route based on the predicted trajectory and the directed weighted graph;

[0079] Determine the observation probability and transition probability corresponding to the hidden Markov model according to the predicted trajectory and candidate routes;

[0080] The state sequence is determined according to the observation probability and transition probability to obtain the target candidate route.

[0081] The predicted trajectory refers to the sequence of predicted trajectory points of the manned mining truck to be predicted determined by the unmanned mining truck. Figure 3 A schematic diagram of a process for determining a target candidate route provided by an embodiment of the present application; in this embodiment, if the positioning data includes a predicted trajectory, the candidate route is determined according to the predicted trajectory and the directed weighted graph; specifically, after a scene graph is constructed according to the road network data of the transportation operation area and the corresponding directed weighted graph is determined, the corresponding route is determined based on the directed weighted graph;

[0082] Each predicted trajectory point in the predicted trajectory is mapped to a directed weighted graph to obtain a corresponding candidate route. In practical applications, the trajectory data can be preprocessed, and the candidate route is determined based on the predicted trajectory after the preprocessing operation and the directed weighted graph.

[0083] In a specific example, for each route, the sub-segments corresponding to the route are determined, and the projection distances corresponding to the predicted trajectory points to each sub-segment are determined; the size relationships of the projection distances are compared, and the sub-segment with the shortest projection distance is determined as the target sub-segment; the predicted trajectory point is vertically mapped to the target sub-segment to obtain the corresponding candidate point; the projection distance from the predicted trajectory point to the candidate point is obtained, and it is determined whether the projection distance is less than or equal to the candidate radius; if the projection distance is less than or equal to the candidate radius, the route corresponding to the target sub-segment is determined to be the candidate route, that is, the route where the candidate point is located is determined to be the candidate route.

[0084] After the candidate routes are determined, the observation probability and transition probability corresponding to the Hidden Markov Model (HMM) are determined according to the predicted trajectory and the candidate routes.

[0085] It should be noted that the establishment of the hidden Markov model is based on the following two assumptions:

[0086] Assumption 1: The projection distance between the trajectory point and the candidate point follows a normal distribution. The smaller the projection distance between the two, the greater the probability that the trajectory point is generated because the manned mining truck to be predicted is at the candidate point. In other words, for the trajectory point ( The trajectory point corresponding to the time), all candidate routes corresponding to it The corresponding observation probabilities , indicating that the manned mining truck to be predicted is actually on the candidate route The observed trajectory points The probability of , the calculation method obeys the above assumption 1; therefore, the observation probability is calculated according to the normal distribution probability density function of the projection distance between the trajectory point and the candidate point.

[0087] Hypothesis 2: At two adjacent moments, the closer the first path distance between two candidate points is to the second path distance between two trajectory points, the greater the probability that the manned mining truck to be predicted will transfer from the previous candidate point to the next candidate point; that is, for trajectory points and its candidate routes , track point and its candidate routes , each has a transition probability, indicating that the vehicle has Move to candidate route The probability of , the calculation method follows assumption 2, for Time track point The corresponding candidate routes, for Time track point Corresponding candidate routes. Therefore, the transfer probability is calculated according to the exponential distribution probability density function of the difference between the first path distance between the two candidate points and the second path distance between the two trajectory points. The first path distance and the second path distance can be calculated by Euclidean distance, or by other methods, which is not limited in this embodiment.

[0088] In this embodiment, after the observation probability and the transition probability are determined, the state sequence is determined according to the observation probability and the transition probability to obtain the target candidate route. Specifically, the optimal state sequence is solved by the Viterbi dynamic programming algorithm, that is, the candidate route that maximizes the observation probability and the transition probability at each moment, that is, the target candidate route is determined.

[0089] Figure 4 and Figure 5 A schematic diagram of a matching result based on the Viterbi dynamic programming algorithm provided in an embodiment of the present application; Figure 4 and Figure 5 As shown, the lines in the area represent several routes of the directed weighted graph corresponding to the transportation operation area; Figure 4 The dots in represent the predicted trajectory point sequence of the vehicle; Figure 5 The dots in the figure are the candidate point sequences obtained after map matching of the predicted trajectory point sequence. The route where the candidate point sequence is located is the target candidate route, so the target candidate route is determined.

[0090] It can be seen that according to the method of this embodiment, when the positioning data includes the predicted trajectory, the target candidate route can be determined efficiently and conveniently.

[0091] On the basis of the above embodiments, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, the method further includes:

[0092] If the positioning data includes trajectory points, candidate routes are determined based on the trajectory points and the directed weighted graph;

[0093] Determine the cost value corresponding to each candidate route;

[0094] A target candidate route is determined from each candidate route according to each generation value.

[0095] If the positioning data includes trajectory points, candidate routes are determined according to the trajectory points and the directed weighted graph; specifically, the trajectory points are mapped into the directed weighted graph to obtain corresponding candidate routes.

[0096] In a specific example, for each route, the sub-segments corresponding to the route are determined, and the projection distances from the trajectory point to each sub-segment are determined; the size relationships of the projection distances are compared, and the sub-segment with the shortest projection distance is determined as the target sub-segment; the trajectory point is vertically mapped to the target sub-segment to obtain the corresponding candidate point; the projection distance from the trajectory point to the candidate point is obtained, and it is determined whether the projection distance is less than or equal to the candidate radius; if the projection distance is less than or equal to the candidate radius, the route corresponding to the target sub-segment is determined to be the candidate route, that is, the route where the candidate point is located is determined to be the candidate route.

[0097] After the candidate routes are determined, the cost values ​​corresponding to the candidate routes are calculated according to the geometric relationship between the trajectory points and the candidate routes; and then the target candidate route is determined from the candidate routes according to the cost values.

[0098] It can be seen that according to the method of this embodiment, when the positioning data includes trajectory points, the target candidate route can be determined efficiently and conveniently, thereby improving the prediction efficiency of the operating status of manned mining trucks.

[0099] Based on the above embodiment, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, determining the cost value corresponding to each candidate route includes:

[0100] For each candidate route, determine a candidate point corresponding to the trajectory point on the candidate route, and determine a projection distance between the candidate point and the trajectory point;

[0101] Determine the heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point;

[0102] The cost value of the candidate route is determined according to the projection distance and the heading angle difference.

[0103] It should be noted that, according to the geometric relationship between the trajectory point and each candidate route, the smaller the projection distance between the candidate point and the trajectory point, the larger the cost value of the corresponding candidate route; the smaller the difference between the heading angle of the candidate point and the heading angle of the trajectory point, the larger the cost value of the corresponding candidate route.

[0104] For each candidate route, a candidate point corresponding to the trajectory point is determined on the candidate route, and the projection distance between the candidate point and the trajectory point is determined, and the heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point is determined, and the cost value of the candidate route is determined according to the projection distance and the heading angle difference; wherein the projection distance may be a Euclidean distance, or the projection distance may be calculated in other ways, which is not limited in this embodiment.

[0105] In a specific example, the cost value is calculated as follows:

[0106] ;

[0107] in, Indicates the cost value of the candidate route; Represents the projection distance between the candidate point and the trajectory point; Indicates the heading angle difference between the candidate point and the trajectory point; represents the distance weight coefficient, represents the heading angle weight coefficient, Represents the candidate radius.

[0108] It can be seen that according to the method of this embodiment, the cost value of the candidate route can be determined efficiently and conveniently, thereby improving the efficiency of determining the target candidate route and improving the prediction efficiency of the operating status of the manned mining truck.

[0109] Based on the above embodiment, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, determining a target candidate route from each candidate route according to each generation value includes:

[0110] Arrange the cost values ​​of each candidate route in a preset order;

[0111] Calculate the cost difference between two adjacent cost values ​​in descending order according to the cost value, and determine the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold;

[0112] The target candidate route is determined based on the similar candidate routes.

[0113] In this embodiment, after determining the cost values ​​corresponding to the candidate routes, the cost values ​​of the candidate routes are arranged in a preset order; for example, they may be arranged in ascending order of the cost values ​​or in descending order of the cost values, which is not limited in this embodiment.

[0114] In a specific example, firstly, the candidate routes are arranged in descending order according to the cost value, and the candidate route with the first cost value is determined as the similar candidate route; then the cost value difference corresponding to two adjacent cost values ​​is calculated in sequence. Specifically, starting from the cost value with the second cost value, the cost difference between the cost value of the current candidate route and the cost value of the previous candidate route is calculated to obtain the cost difference of the current candidate route; determine whether the cost difference is less than or equal to the preset cost difference threshold; if the cost difference is less than or equal to the preset cost difference threshold, the current candidate route is determined as a similar candidate route; otherwise, that is, the cost difference is greater than the preset cost difference threshold, it is determined that the current candidate route does not belong to the similar candidate route, and the traversal of the cost difference calculation is terminated. After all the similar candidate routes are determined after the traversal, the target candidate route is determined from the similar candidate routes.

[0115] It can be seen that according to the method of this embodiment, by determining similar candidate routes and determining the target candidate route based on the similar candidate routes, the target candidate route finally determined can have the highest matching degree with the trajectory point, thereby improving the accuracy of the operating status prediction of the manned mining truck.

[0116] Based on the above embodiment, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, determining a target candidate route according to similar candidate routes includes:

[0117] Determine the number of candidates for similar candidate routes;

[0118] If the number of candidates is 1, the similar candidate route is determined as the target candidate route.

[0119] In this embodiment, after all similar candidate routes are determined, the candidate number of the similar candidate routes is determined, and it is determined whether the candidate number of the similar candidate routes is 1; if the candidate number of the similar candidate routes is 1, it means that only the candidate route with the highest cost value is determined as the similar candidate route, and the cost value of the similar candidate route is much higher than that of other candidate routes, that is, the geometric features of the similar candidate route are obviously similar to the geometric features of the trajectory points, so the similar candidate route is determined as the target candidate route.

[0120] In this embodiment, when the candidate number of the similar candidate routes is 1, the similar candidate routes are directly determined as the target candidate routes, so the target candidate routes can be determined efficiently and conveniently.

[0121] On the basis of the above embodiments, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, the method further includes:

[0122] If the number of candidates is greater than 1, determine whether each similar candidate route is an offload route;

[0123] If all the similar candidate routes are unloading routes, then for each similar candidate route, the number of vehicles on the future driving path of the manned mining truck to be predicted in the similar candidate route is determined;

[0124] The similar candidate route with the least number of vehicles is determined as the target candidate route.

[0125] In this embodiment, when the number of candidates of similar candidate routes is greater than 1, the target candidate route is determined from multiple similar candidate routes. If the number of candidates of similar candidate routes is greater than 1, it means that there are multiple candidate routes with higher cost values ​​with similar geometric features, and other algorithms need to be used in combination with actual scenarios to further determine the target candidate route from multiple similar candidate routes.

[0126] It should be noted that when there are multiple candidates for similar candidate routes, it is first determined whether each similar candidate route is an unloading route. An unloading route refers to a route whose route attribute is a loading and unloading task. If all similar candidate routes are unloading routes, when the driver performs a loading and unloading task, he or she will often choose an idle loading and unloading point or one with the shortest waiting time to perform the loading and unloading task in order to improve work efficiency.

[0127] Therefore, for each similar candidate route, the number of vehicles in the future driving path of the manned mining truck to be predicted in the similar candidate route is determined; that is, the future driving path of the manned mining truck to be predicted is determined according to the trajectory points and driving direction of the manned mining truck to be predicted; then the number of vehicles corresponding to the future driving path is determined, and the number of vehicles also represents the waiting time required to perform the loading and unloading task; the similar candidate route with the least number of vehicles is selected as the target candidate route.

[0128] In this embodiment, when the candidate number of similar candidate routes is greater than 1 and each similar candidate route is an unloading route, the similar candidate route with the least number of vehicles on the future driving path of the manned mining truck to be predicted is determined as the target candidate route. The target candidate route corresponds to the shortest loading and unloading waiting time, thereby improving the loading and unloading efficiency of the manned mining truck to be predicted.

[0129] On the basis of the above embodiments, this embodiment further illustrates and optimizes the technical solution. Specifically, in this embodiment, the method further includes:

[0130] If all the similar candidate routes are not unloading routes, the target candidate route is determined from multiple similar candidate routes according to the vehicle offset and the heading angle of the trajectory point of the manned mining truck to be predicted.

[0131] In this embodiment, when it is determined that not all of the similar candidate routes are unloading routes, that is, the similar candidate routes include the unloading routes and other routes, a target candidate route is determined from a plurality of similar candidate routes.

[0132] Specifically, for each similar candidate route, perform the following operations to confirm whether the similar candidate route is the target candidate route:

[0133] Determine the route centerline of the similar candidate route, expand the preset width to both sides along the route centerline, and obtain the corresponding route area polygon, that is, determine the vehicle offset range; wherein, this embodiment does not limit the specific value of the preset width, such as 3m;

[0134] Get the regional heading angle, and calculate the difference between the heading angle of the trajectory point and the regional heading angle;

[0135] Determine whether the trajectory point is within the area of ​​the routing area polygon, that is, determine whether the vehicle offset is within the vehicle offset range, and determine whether the difference is within the preset error tolerance range; wherein, this embodiment does not limit the specific value of the preset error tolerance range, such as a value of 15°;

[0136] If the trajectory point is within the area range of the routing area polygon and the difference is within the preset error tolerance range, it is determined that the similar candidate route is successfully matched with the trajectory point, and the similar candidate route is the target candidate route; otherwise, if the trajectory point is not within the area range of the routing area polygon, or the difference is not within the preset error tolerance range, it is determined that the similar candidate route is not the target candidate route.

[0137] Figures 6 to 8 A schematic diagram of matching results of similar candidate routes and trajectory points provided in an embodiment of the present application, wherein: Figure 6 In the example, the trajectory point is not within the area of ​​the routing area polygon, which means that the matching between the candidate routing and the trajectory point fails; Figure 7 In the example, the difference between the heading angle of the area and the heading angle of the trajectory point is greater than the preset error tolerance range, which indicates that the matching between the candidate route and the trajectory point fails; Figure 8 In the example, the trajectory point is within the area of ​​the routing area polygon, and the difference is within the preset error tolerance range, so it is determined that the similar candidate route is successfully matched with the trajectory point.

[0138] It can be seen that according to the method of this embodiment, a target candidate route can be determined from a plurality of similar candidate routes.

[0139] In order to enable those skilled in the art to better understand the technical solutions in this application, the technical solutions in the embodiments of this application are described in detail below in combination with actual application scenarios. Fig. 9 The flowchart of another method for predicting the operating status of a manned mining truck provided by an embodiment of the present application is shown. The specific steps of the method for predicting the operating status of a manned mining truck are as follows:

[0140] Obtain the positioning data of the manned mining truck to be predicted through the unmanned mining truck;

[0141] Obtaining a directed weighted graph corresponding to the transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area;

[0142] If the positioning data includes a predicted trajectory, the target candidate route is determined according to the map matching algorithm: the candidate route is determined according to the predicted trajectory and the directed weighted graph; the observation probability is calculated according to the normal distribution probability density function of the projection distance between the trajectory point and the candidate point; the transition probability is calculated according to the exponential distribution probability density function of the difference between the first path distance between the two candidate points and the second path distance between the two trajectory points; the state sequence is determined according to the observation probability and the transition probability to obtain the target candidate route;

[0143] If the positioning data includes trajectory points, candidate routes are determined based on the trajectory points and the directed weighted graph;

[0144] Determine the cost value corresponding to each candidate route: for each candidate route, determine the candidate point corresponding to the trajectory point on the candidate route, and determine the projection distance between the candidate point and the trajectory point; determine the heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point; determine the cost value of the candidate route according to the projection distance and the heading angle difference;

[0145] Sorting candidate routes and determining similar candidate routes: arranging the cost values ​​of each candidate route in a preset order; calculating the cost difference between two adjacent cost values ​​in order from high to low according to the cost values, and determining the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold;

[0146] Determine the number of candidates for similar candidate routes; if the number of candidates is 1, determine the candidate route with the highest cost as the target candidate route;

[0147] If the number of candidates is greater than 1, determine whether all the similar candidate routes are offload routes;

[0148] If all the similar candidate routes are unloaded routes, the target candidate route is determined according to the quantity balance algorithm: for each similar candidate route, the number of vehicles on the future driving path of the manned mining truck to be predicted in the similar candidate route is determined; the similar candidate route with the least number of vehicles is determined as the target candidate route;

[0149] If all the similar candidate routes are not unloading routes, the target candidate route is determined according to the regional matching algorithm: the target candidate route is determined from multiple similar candidate routes according to the vehicle offset and the heading angle of the trajectory point of the manned mining truck to be predicted;

[0150] Determine the operation status of the manned mining truck to be predicted according to the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route;

[0151] Output the operating status of the manned mining truck to be predicted.

[0152] An embodiment of the present application provides a method for predicting the operating status of a manned mining truck. The method predicts a target candidate route of the manned mining truck to be predicted based on the positioning data of the manned mining truck to be predicted obtained by the unmanned mining truck and the directed weighted graph corresponding to the transportation operation area, and determines the operating status of the manned mining truck to be predicted based on the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route; by predicting the operating status of the manned mining truck, the unmanned mining truck can be more reasonably dispatched, and the transportation tasks and driving routes can be arranged; the unmanned mining trucks and the manned mining trucks in the transportation operation area can be better coordinated to avoid congestion in the transportation operation area; and the production and transportation efficiency and transportation safety of the entire transportation operation area are improved.

[0153] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0154] Fig.10 FIG. 1 is a schematic diagram of a structure of an operating state prediction device for a manned mining truck provided in an embodiment of the present application. Fig.10 As shown, the operating state prediction device of the manned mining truck of this embodiment includes a positioning data acquisition module 1010, a route acquisition module 1020, a target candidate route determination module 1030 and an operating state prediction module 1040; wherein,

[0155] The positioning data acquisition module 1010 is used to acquire the positioning data of the manned mining truck to be predicted through the unmanned mining truck;

[0156] The route acquisition module 1020 is used to acquire a directed weighted graph corresponding to the transport operation area and a plurality of routes corresponding to the directed weighted graph; a route is a driving path between two stop points in the transport operation area;

[0157] A target candidate route determination module 1030 is used to determine a target candidate route of a manned mining truck to be predicted based on the positioning data and the directed weighted graph;

[0158] The operation state prediction module 1040 is used to determine the operation state of the manned mining truck to be predicted according to the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route.

[0159] An operating status prediction device for a manned mining truck provided in an embodiment of the present application has the same beneficial effects as the operating status prediction method for a manned mining truck described above.

[0160] In one of the embodiments, the target candidate route determination module includes:

[0161] A first candidate route determination submodule, configured to determine a candidate route according to the predicted trajectory and the directed weighted graph if the positioning data includes a predicted trajectory;

[0162] The probability calculation submodule is used to determine the observation probability and transition probability corresponding to the hidden Markov model based on the predicted trajectory and candidate routes;

[0163] The first target candidate route determination submodule is used to determine the state sequence according to the observation probability and the transition probability to obtain the target candidate route.

[0164] In one embodiment, a device for predicting the operating state of a manned mining truck further includes:

[0165] A second candidate route determination submodule, configured to determine a candidate route according to the trajectory points and the directed weighted graph if the positioning data includes trajectory points;

[0166] A cost value determination submodule, used to determine the cost value corresponding to each candidate route;

[0167] The second target candidate route determination submodule is used to determine the target candidate route from each candidate route according to each generation value.

[0168] In one embodiment, the cost value determination submodule includes:

[0169] a projection distance calculation unit, for determining, for each candidate route, a candidate point corresponding to the trajectory point on the candidate route, and determining a projection distance between the candidate point and the trajectory point;

[0170] A heading angle difference calculation unit, used to determine the heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point;

[0171] The cost value calculation unit is used to determine the cost value of the candidate route according to the projection distance and the heading angle difference.

[0172] In one embodiment, the second target candidate route determination submodule includes:

[0173] A cost value sorting unit, used to sort the cost values ​​of each candidate route in a preset order;

[0174] A similar candidate route determination unit, used to calculate the cost difference between two adjacent cost values ​​in descending order according to the cost value, and determine the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold;

[0175] The target candidate route determining unit is used to determine the target candidate route according to the similar candidate routes.

[0176] In one of the embodiments, the target candidate route determination unit includes:

[0177] A candidate quantity determination subunit, used to determine the candidate quantity of similar candidate routes;

[0178] The first target candidate route determination subunit is configured to determine a similar candidate route as a target candidate route if the number of candidates is 1.

[0179] In one embodiment, a device for predicting the operating state of a manned mining truck further includes:

[0180] an unloading route determination subunit, for determining whether each of the similar candidate routes is an unloading route if the number of candidates is greater than 1;

[0181] A vehicle quantity determination subunit is used to determine the number of vehicles on the future travel path of the manned mining truck to be predicted in the similar candidate routes for each similar candidate route if all the similar candidate routes are unloading routes;

[0182] The second target candidate route determination subunit is used to determine the similar candidate route with the least number of vehicles as the target candidate route.

[0183] In one embodiment, a device for predicting the operating state of a manned mining truck further includes:

[0184] The third target candidate route determination subunit is used to determine a target candidate route from a plurality of similar candidate routes according to the vehicle offset and the heading angle of the trajectory point of the manned mining truck to be predicted if not all of the similar candidate routes are unloading routes.

[0185] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0186] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0187] Fig.11 A schematic diagram of the structure of a terminal device provided in an embodiment of the present application. Fig.11 As shown, the terminal device 1100 of this embodiment includes a memory 1101, a processor 1102, and a computer program 1103 stored in the memory 1101 and executable on the processor 1102; when the processor 1102 executes the computer program 1103, the steps in the above-mentioned embodiments of the method for predicting the working state of a manned mining truck are implemented; or when the processor 1102 executes the computer program 1103, the functions of each module / unit in the above-mentioned device embodiments are implemented.

[0188] Exemplarily, the computer program 1103 may be divided into one or more modules / units, one or more modules / units are stored in the memory 1101, and are executed by the processor 1102 to implement the method of the embodiment of the present application. One or more modules / units may be a series of computer program instruction segments that can perform specific functions, and the instruction segments are used to describe the execution process of the computer program 1103 in the terminal device 1100. For example, the computer program 1103 may be divided into a positioning data acquisition module, a route acquisition module, a target candidate route determination module, and an operation status prediction module, and the specific functions of each module are as follows:

[0189] A positioning data acquisition module is used to acquire positioning data of a manned mining truck to be predicted through an unmanned mining truck;

[0190] A route acquisition module, used to acquire a directed weighted graph corresponding to a transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area;

[0191] A target candidate route determination module, used to determine the target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph;

[0192] The operating state prediction module is used to determine the operating state of the manned mining truck to be predicted according to the candidate points in the target candidate route corresponding to the manned mining truck to be predicted and the route attributes of the target candidate route.

[0193] In application, the terminal device 1100 may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The terminal device 1100 may include but is not limited to a memory 1101 and a processor 1102. Those skilled in the art will appreciate that Fig.11 It is only an example of a terminal device and does not constitute a limitation of the terminal device. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the terminal device may also include input and output devices, network access devices, buses, etc.; among which, the input and output devices may include cameras, audio acquisition / playback devices, display screens, etc.; the network access device may include a communication module for wireless communication with external devices.

[0194] In applications, the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0195] In applications, the memory can be an internal storage unit of a terminal device, such as a hard disk or memory of the terminal device; it can also be an external storage device of the terminal device, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the terminal device; it can also include both the internal storage unit and the external storage device of the terminal device. The memory is used to store operating systems, applications, boot loaders, data, and other programs, such as program codes of computer programs. The memory can also be used to temporarily store data that has been output or is about to be output.

[0196] The embodiment of the present application further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.

[0197] The present application implements all or part of the processes in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of each of the above-mentioned method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may at least include: any entity or device that can carry the computer program code to the terminal device, a recording medium, a computer memory, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), an electrical carrier signal, a telecommunication signal, and a software distribution medium. For example, a USB flash drive, a mobile hard disk, a disk or an optical disk.

[0198] A computer-readable storage medium provided in an embodiment of the present application has the same beneficial effects as the above-mentioned method for predicting the operating status of a manned mining truck.

[0199] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0200] Those of ordinary skill in the art will appreciate that the devices and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0201] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interface, indirect coupling or communication connection of devices, which can be electrical, mechanical or other forms.

[0202] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A method for predicting the operating status of a manned mining truck, characterized in that: The method comprises: Obtain the positioning data of the manned mining truck to be predicted through the unmanned mining truck; Acquire a directed weighted graph corresponding to a transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area; Determine a target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph; Determining the operation state of the manned mining truck to be predicted according to the candidate points corresponding to the manned mining truck to be predicted in the target candidate route and the route attributes of the target candidate route; If the positioning data includes trajectory points, determining candidate routes according to the trajectory points and the directed weighted graph; Determine the cost value corresponding to each of the candidate routes; including: for each of the candidate routes, determine a candidate point corresponding to the trajectory point on the candidate route, and determine the projection distance between the candidate point and the trajectory point; determine the heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point; determine the cost value of the candidate route according to the projection distance and the heading angle difference; Determine a target candidate route from each of the candidate routes according to each of the cost values; including: arranging the cost values ​​of each of the candidate routes in a preset order; calculating the cost difference between two adjacent cost values ​​in order from high to low according to the cost values, and determining the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold; and determining the target candidate route according to the similar candidate route.

2. The method according to claim 1, characterized in that The step of determining the target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph includes: If the positioning data includes a predicted trajectory, determining a candidate route according to the predicted trajectory and the directed weighted graph; Determine the observation probability and transition probability corresponding to the hidden Markov model according to the predicted trajectory and the candidate route; A state sequence is determined according to the observation probability and the transition probability to obtain a target candidate route.

3. The method according to claim 1, characterized in that: The determining the target candidate route according to the similar candidate routes includes: Determining the candidate number of the similar candidate routes; If the number of candidates is 1, the similar candidate route is determined as the target candidate route.

4. The method according to claim 3, characterized in that The method further comprises: If the number of candidates is greater than 1, determining whether each of the similar candidate routes is an offload route; If all of the similar candidate routes are the unloading routes, then for each of the similar candidate routes, determining the number of vehicles on the future travel path of the manned mining truck to be predicted in the similar candidate route; The similar candidate route with the least number of vehicles is determined as the target candidate route.

5. The method according to claim 4, characterized in that The method further comprises: If not all of the similar candidate routes are the unloading routes, the target candidate route is determined from a plurality of the similar candidate routes according to the vehicle offset and the heading angle of the trajectory point of the manned mining truck to be predicted.

6. A device for predicting the operating status of a manned mining truck, characterized in that: The device comprises: A positioning data acquisition module is used to acquire positioning data of a manned mining truck to be predicted through an unmanned mining truck; A route acquisition module, used to acquire a directed weighted graph corresponding to a transport operation area and a plurality of routes corresponding to the directed weighted graph; the route is a driving path between two stop points in the transport operation area; A target candidate route determination module, used to determine the target candidate route of the manned mining truck to be predicted according to the positioning data and the directed weighted graph; An operation status prediction module, used to determine the operation status of the manned mining truck to be predicted according to the candidate points in the target candidate route corresponding to the manned mining truck to be predicted and the route attributes of the target candidate route; a second candidate route determination submodule, configured to determine a candidate route according to the trajectory points and the directed weighted graph if the positioning data includes trajectory points; A cost value determination submodule, used to determine the cost value corresponding to each of the candidate routes; A second target candidate route determination submodule, configured to determine a target candidate route from each of the candidate routes according to each of the cost values; Among them, the cost value determination submodule includes: a projection distance calculation unit, configured to determine, for each of the candidate routes, a candidate point corresponding to the trajectory point on the candidate route, and determine a projection distance between the candidate point and the trajectory point; A heading angle difference calculation unit, used to determine a heading angle difference between the heading angle of the candidate point and the heading angle of the trajectory point; A cost value calculation unit, used to determine the cost value of the candidate route according to the projection distance and the heading angle difference; Among them, the second target candidate route determination submodule includes: A cost value sorting unit, used to sort the cost values ​​of the candidate routes in a preset order; A similar candidate route determination unit, configured to calculate the cost difference between two adjacent cost values ​​in descending order according to the cost value, and determine the candidate route as a similar candidate route when the cost difference is less than or equal to a preset cost difference threshold; The target candidate route determining unit is used to determine the target candidate route according to the similar candidate routes.

7. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.