A coal mine data intelligent management method based on big data

Abstract

The application relates to the technical field of intelligent management of coal mine data, and discloses a coal mine data intelligent management method based on big data, which comprises the following steps: setting a fixed route for each transport vehicle, and transporting staff according to the route; setting a signal collection point in a mine tunnel, and collecting speed information of the transport vehicle by a base station; when staff at a special position send a call request, the system establishes a strategy by screening a sequence to screen the most suitable transport vehicle to respond to the request; the transport vehicle selection is optimized by calculating the uniform speed of the transport vehicle, the planned route and the influence degree, and path conflicts are avoided; a transfer vehicle is introduced when necessary to ensure the transportation efficiency; finally, the scheduling accuracy and flexibility are improved through real-time data collection and big data analysis, and the mine tunnel transportation system is ensured to be efficiently and safely operated.

Description

Technical Field

[0001] The present invention relates to the technical field of intelligent coal mine data management, and in particular to a method for intelligent coal mine data management based on big data. Background Art

[0002] Coal mining operations, especially the transportation and dispatch management of workers within mine tunnels, often face a series of problems such as low transportation efficiency, irrational personnel scheduling, and mine traffic congestion. Current coal mine transportation systems mostly rely on traditional manual scheduling and simple traffic management methods. These systems fail to effectively integrate the complex geographical environment of mine tunnels and the dynamic needs of workers for intelligent scheduling, resulting in low operational efficiency and severe resource waste. With the advancement of automation and informatization in the coal mining industry, intelligent dispatch solutions based on emerging technologies such as big data, the Internet of Things, and artificial intelligence have gradually become a hot topic of research in the coal mining industry.

[0003] Existing coal mine transportation scheduling systems are mostly based on fixed-route scheduling models, typically performing simple scheduling based solely on the transporter's scheduled routes and times, lacking dynamic scheduling capabilities. This model can easily lead to traffic conflicts and uneven resource allocation in the complex environment of mine tunnels. Traditional scheduling methods are often unable to effectively respond to urgent needs of workers in intersecting mine tunnels or in special locations. Furthermore, many existing coal mine scheduling systems fail to fully utilize the various sensors and signal collection points deployed within the mine tunnels, failing to optimize scheduling strategies through real-time monitoring of transporter speeds, position changes, and other data. This results in an inability to adjust transporter routes or priorities based on actual conditions, leading to traffic congestion within the mine tunnels and delayed staff pick-up and drop-off.

[0004] To this end, this method proposes a method of collecting speed information of vehicles transporting workers in the mine tunnel through base stations set at intervals. When workers in special locations need to use vehicles, the location information, speed information and established route information of all vehicles are compared, all information is processed, and a vehicle route plan is screened out that has the least impact on all vehicles, can meet the needs of all workers on the current vehicle, and at the same time meet the vehicle needs of workers in special locations. Summary of the Invention

[0005] The present invention provides a method for intelligent management of coal mine data based on big data, which promotes the solution of the problems mentioned in the above background technology.

[0006] The present invention provides the following technical solution: a method for intelligent management of coal mine data based on big data, comprising:

[0007] When using rubber-tyred trackless vehicles to transport workers within coal mine tunnels, the trackless rubber-tyred vehicles shall be recorded as transport vehicles;

[0008] Set a predetermined route for each transport vehicle;

[0009] The predetermined route is specifically as follows: each transport vehicle travels along an initial fixed route in the mine tunnel;

[0010] Control the transport vehicle to move along the established route in the mine tunnel to transport personnel;

[0011] Signal collection points are set up at intervals in the mine tunnel, and a base station is used at each signal collection point to collect speed information of transport vehicles passing through the base station;

[0012] When a staff member in a special location issues a ride request, the screening sequence establishment strategy is executed;

[0013] The special location is specifically: a location that is not passed by the established routes of all transport vehicles, and this location is recorded as a special location;

[0014] The taxi request specifically includes: calling a transport vehicle to the location where the taxi request is currently issued;

[0015] Establish a strategy based on the screening sequence to select a transport vehicle to respond to the ride request;

[0016] The screening sequence establishment strategy includes:

[0017] The time when the ride request is sent is recorded as the request time;

[0018] At the request time, each base station that each transport vehicle passes through is obtained and recorded as the base station passed by each transport vehicle;

[0019] Obtain the speed information recorded by each base station of each transport vehicle, and record it as the route speed of each transport vehicle at each base station;

[0020] For each transport vehicle:

[0021] Obtain the number of base stations passed through and obtain the passing speed of each base station passed through;

[0022] Calculate the sum of all path speeds and divide the sum by the number of path base stations. The result is used as the average speed of the transport vehicle at the request time.

[0023] Optionally, the screening sequence establishment strategy further includes:

[0024] For each transport vehicle, obtain all routes to a specific location and record them as the planned routes of each transport vehicle;

[0025] Obtain the total distance of each planned route respectively, and record it as the planned distance of each planned route;

[0026] For each planned route:

[0027] acquire the average speed of the transport vehicle corresponding to the planned route;

[0028] acquire the planned distance of the planned route;

[0029] divide the planned distance by the average speed, and take the result as the planned time of the planned route;

[0030] establish a screening sequence, and sequentially record each planned route in the screening sequence according to the length of the planned time corresponding to the planned route from short to long.

[0031] Optionally, the establishing a strategy according to the screening sequence and screening a transport vehicle to respond to the call request comprises:

[0032] for each planned route:

[0033] acquire each intersection passed through by the planned route, and record each intersection as a planned passage intersection of each planned route;

[0034] The intersection is specifically a mine intersection formed by the intersection of mine roads.

[0035] acquire the time for the transport vehicle to arrive at each planned passage intersection when the transport vehicle travels according to the planned route, and the time is specifically:

[0036] acquire the distance from the starting point of the planned route to each planned passage intersection, respectively, and divide the distance by the average speed of the transport vehicle corresponding to the planned route, respectively, to take the result as the planned passage time corresponding to each planned passage intersection;

[0037] acquire the predetermined route of another transport vehicle other than the transport vehicle corresponding to the planned route, and screen a predetermined route passing through any planned passage intersection, and record the predetermined route as an intersection route;

[0038] acquire the planned passage intersection passed through by each intersection route, and record the planned passage intersection as an intersection intersection;

[0039] acquire the average speed of the transport vehicle corresponding to each intersection route, acquire the location of the transport vehicle at the request time, acquire the distance from the location to the intersection intersection according to the predetermined route, and divide the distance by the average speed of the transport vehicle, and take the result as the intersection time of the intersection route;

[0040] compare the intersection time with the planned passage time one by one, if there is a certain intersection time identical with a certain planned passage time, mark the intersection time;

[0041] acquire the number of marked intersection times, and record the number as the influence number of the planned route.

[0042] Optionally, the establishing a strategy according to the screening sequence and screening a transport vehicle to respond to the call request comprises:

[0043] Setting a threshold for determining the extent to which the planned route affects other transport vehicles traveling along the established route;

[0044] Obtain the impact quantity of each planned route and compare it with the degree threshold;

[0045] If the number of impacts on the planned route is greater than or equal to the degree threshold, the planned route is deemed to have a serious impact on other transport vehicles and is recorded as an excluded route;

[0046] If the impact quantity of the planned route is less than the degree threshold, it is determined that the planned route does not affect other transport vehicles and is recorded as a reserved route;

[0047] Traversing the planned routes in the screening sequence, removing the planned routes identified as excluded routes from the screening sequence, and recording the new screening sequence as the candidate sequence;

[0048] Based on the candidate sequence, a transport vehicle is selected to respond to the ride request.

[0049] Optionally, selecting a transport vehicle to respond to the ride request according to the candidate sequence includes:

[0050] S1. In the candidate sequence, select the first planned route according to the order of the elements in the sequence and record it as the verification route;

[0051] S2. Obtain the transport vehicle corresponding to the verification route, which is recorded as the verification transport vehicle;

[0052] S3. Obtain and verify that the established route that the transport vehicle has not passed at the time of the request is recorded as a route not passed;

[0053] S4. Obtain and verify whether there are any staff members on the transport vehicle who get off the vehicle on the route that has not been passed;

[0054] S5. If it does not exist, select the current verification transport vehicle to respond to the ride request, and control the current verification transport vehicle to arrive at the special location according to the verification route;

[0055] S6. When the verification transport vehicle arrives at the special location and receives the call from the staff member, the verification transport vehicle is controlled to select a shortest path to the end of the predetermined route of the verification transport vehicle as the subsequent route of the verification transport vehicle;

[0056] S7. If there are staff members on the verification transport vehicle who get off along the route that has not been taken, determine whether the verification transport vehicle's movement along the verification route affects the staff members who get off along the route.

[0057] Optionally, the step of determining whether the verification transport vehicle's movement along the verification route affects staff members who disembark along the route includes:

[0058] S8, all routes from the special position to the predetermined route of the verification transport vehicle are obtained, and are recorded as return routes;

[0059] S9, the verification route is combined with each return route respectively, and each combined route is recorded as a special transport route;

[0060] S10, the total distance of each special transport route is obtained;

[0061] S11, the total distances of all special transport routes are compared;

[0062] S12, the special transport route with the shortest total distance is selected, and is recorded as the selected transport route of the verification transport vehicle;

[0063] S13, the drop-off locations of the existing staff on the verification transport vehicle are obtained, and it is determined whether all the drop-off locations are on the selected transport route;

[0064] S14, if all the drop-off locations are on the selected transport route, it is determined that the staff who drop off along the way are not affected by the travel of the verification transport vehicle according to the verification route, and the verification transport vehicle is controlled to travel according to the selected transport route, and receives the staff who drop off at the special position during the travel;

[0065] S15, if there is a drop-off location not on the selected transport route, it is determined that the staff who drop off along the way are affected by the travel of the verification transport vehicle according to the verification route, and the number of affected staff is obtained.

[0066] Optionally, the number of affected staff includes:

[0067] S16, the number of staff whose drop-off locations are not on the selected transport route is obtained, and is recorded as the number of affected staff;

[0068] S17, if the number of affected staff is equal to 1, it is determined whether the affected staff cannot normally drop off, including:

[0069] S18, the staff whose drop-off location is not on the selected transport route is obtained, and the location of the drop-off location of the staff is recorded as a target location;

[0070] S19, it is determined whether the mine tunnel where the target location is located is a one-way lane;

[0071] S20, if the mine tunnel where the target location is located is a one-way lane, it is determined whether there is a transfer vehicle;

[0072] S21. If the mine road where the target location is located is a two-way U-turn lane, control the verification transport vehicle to travel according to the selected transportation route, and receive a vehicle request from a staff member at a special location during the travel. After returning to the established route of the verification transport vehicle, the vehicle travels toward the target location, and after passing the target location, continues to travel according to the established route.

[0073] S22. If the number of affected workers is greater than 1, reselect the verification transport vehicle;

[0074] S23, the reselection and verification of the transport vehicle is specifically:

[0075] S24: Remove the current verification route from the candidate sequence, and select the first planned route in the new candidate sequence according to the order of the elements in the sequence as the new verification route, and execute steps S1-S24 in sequence.

[0076] Optionally, determining whether there is a transfer vehicle includes:

[0077] S25. Obtain the location of the verification transport vehicle at the time of the request, and record the location as the transfer location;

[0078] S26. Obtain established routes of other transport vehicles other than the verification transport vehicle to form an established route set;

[0079] S27. Selecting established routes that sequentially pass through the transfer location and the target location from the established route set to form a set of candidate established routes;

[0080] S28. If the set of established routes to be selected is an empty set, the current verification route is removed from the candidate sequence, and the first planned route in the new candidate sequence is selected according to the order of the elements in the sequence as the new verification route, and steps S1 to S28 are executed in sequence;

[0081] S29. If the set of established routes to be selected is not an empty set, then obtaining the route that each element in the set of established routes to be selected has taken before the request time, and recording it as the completed route of each element;

[0082] S30, traversing each element in the set of candidate established routes in sequence, deleting the elements whose routes pass through transfer locations from the set of candidate established routes, and recording the resulting new set as the set to be verified;

[0083] S31. If the set to be verified is not an empty set, it is determined that there is a transfer vehicle, and the transfer transport vehicle is selected;

[0084] S32. If the set to be verified is an empty set, it is determined that there is no transfer vehicle, and the current verification route is removed from the candidate sequence. In the new candidate sequence, the first planned route is selected according to the order of the elements in the sequence as the new verification route, and steps S1-S32 are executed in sequence.

[0085] When all elements in the candidate sequence are eliminated and there is no transfer vehicle, another non-working transport vehicle is deployed to control the transport vehicle to transport the staff member who issued the ride request.

[0086] Optionally, the screening transfer vehicle includes:

[0087] If there is a transfer vehicle, the time when the transport vehicle corresponding to each element in the set to be verified arrives at the transfer location is obtained separately, including:

[0088] Get the average speed of the transport vehicle corresponding to each element in the set to be verified;

[0089] Get the distance that the transport vehicle corresponding to each element in the set to be verified has traveled to the transfer location along the established route at the requested time, and divide the distance by the average speed of the corresponding transport vehicle, and use the result as the time when the corresponding transport vehicle arrives at the transfer location;

[0090] Select the transport vehicle that takes the shortest time to reach the transfer location and record it as the transfer transport vehicle;

[0091] Workers whose drop-off locations are not on the selected transportation routes will be recorded as affected personnel;

[0092] Control and verify that the transport vehicle enables the affected personnel on board to get off at their current location at the requested time;

[0093] After the affected personnel get off the vehicle, the control and verification vehicle moves along the selected transport route, and during the journey, it receives a request from a staff member at a special location to call for a ride. After the selected transport route is completely passed, the vehicle continues to move along the established route until it reaches the destination of the established route;

[0094] At the same time, the transfer transport vehicle is controlled to pick up the affected persons at the transfer location while traveling along its predetermined route, and transport the affected persons to the target location.

[0095] The present invention has the following beneficial effects:

[0096] 1. By setting an initial fixed route for each transport vehicle and ensuring that the transport vehicles follow the established route, traffic congestion can be effectively avoided and smooth flow between transport vehicles can be ensured. This method reduces the risk of traffic congestion caused by route randomness and improves the operating efficiency of the coal mine transportation system. Through orderly transport vehicle scheduling, it can ensure that workers in the mine tunnel are delivered to their destination in a timely manner, while improving the controllability of coal mine transportation and reducing delays caused by operational errors or arbitrariness.

[0097] 2. By setting up signal collection points in the mine tunnel and using base stations to collect the speed information of transport vehicles, the operating status of the transport vehicles can be monitored in real time. By collecting and analyzing the speed information of each transport vehicle, managers can quickly determine the traffic flow conditions in the mine tunnel and take timely measures to avoid accidents or congestion. In addition, this real-time data collection provides an accurate basis for subsequent scheduling decisions, and can optimize the scheduling of transport vehicles more flexibly. At the same time, this method of setting information collection points at intervals can transmit the data collected by each base station to the ground data processing center through the line, which can ensure the transmission and collection of signals in the mine tunnel.

[0098] 3. By calculating the average speed of each transport vehicle at the time of request and combining it with the planned route, the travel time of each transport vehicle can be accurately predicted. This approach avoids the errors that may be caused by scheduling based solely on distance by accurately calculating the speed and route of each transport vehicle, making scheduling more accurate and ensuring that the transport vehicle can reach the requested location in a timely manner via the optimal path. In addition, this can also be dynamically adjusted according to real-time conditions, improving the operating efficiency of the transportation system.

[0099] 4. The introduction of a screening sequence establishment strategy allows for the flexible selection of the most suitable transport vehicle to respond to staff members' ride requests in special circumstances. This strategy ensures that transport vehicles within the mine can be quickly dispatched based on real-time conditions through a comprehensive analysis of each transport vehicle's path, speed, and impact. This not only avoids the inefficiency caused by overly rigid scheduling methods, but also improves the system's response speed in emergency situations. Through multi-angle evaluation, the deployment of personnel and vehicles within the mine is optimized.

[0100] 5. By setting impact thresholds, routes that affect other haulers are excluded, thus avoiding unnecessary scheduling interference. This method analyzes the impact of each planned route to ensure that no haulers arriving at the same intersection at the same time as other haulers traveling on their established routes are selected, thereby avoiding routes that may cause large-scale traffic congestion or delays. This strategy not only reduces traffic conflicts within the mine tunnels, but also effectively selects the most suitable haulers, ensuring efficient and smooth hauler scheduling.

[0101] 6. When verifying the selection of transport vehicles, by calculating the total distance of various special transportation routes and selecting the shortest path, the distance and time traveled by the transport vehicles can be significantly reduced without the need for workers to get off the vehicles. This process ensures the maximum utilization of resources, reduces time wasted due to unnecessary detours, and improves the overall efficiency of the coal mine transportation system. At the same time, this also reduces traffic pressure within the mine tunnels, helping to improve the smooth operation of the entire transportation system.

[0102] 7. When determining and verifying whether the transport vehicle will affect the workers who need to get off the vehicle, the transport vehicle's chosen route is ensured to take into account the workers' needs for getting off, thus avoiding inconvenience to the workers due to inappropriate routes. This strategy improves the satisfaction and safety of the workers, and also reduces delays and confusion caused by misoperation or improper route planning. At the same time, it optimizes the operation mode of the transport vehicle and ensures the accuracy of scheduling.

[0103] 8. When there are influencing factors on the selected verified transport vehicle, by reselecting the verified transport vehicle, it can be ensured that a suitable vehicle is found to respond to the ride request in the shortest time possible; this strategy makes full use of transport vehicle resources, avoids idle transport vehicles or scheduling errors caused by individual factors, and improves the flexibility and emergency response capabilities of the entire transportation system; through multiple verifications and screenings, it is ensured that the finally selected transport vehicle has the highest transportation efficiency when the conditions are met.

[0104] 9. By screening out other transport vehicles that will pass through the transfer location before the target location according to their established routes, this method can ensure that staff members who are currently on the verification transport vehicle and need to get off midway can meet their own needs when the verification transport vehicle changes its route to meet the needs of staff members who have issued a ride request at a special location. BRIEF DESCRIPTION OF THE DRAWINGS

[0105] Figure 1 Schematic diagram of the target position of the present invention. DETAILED DESCRIPTION

[0106] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0107] In one embodiment, a method for intelligent management of coal mine data based on big data is provided, comprising:

[0108] When using rubber-tyred trackless vehicles to transport workers within coal mine tunnels, the trackless rubber-tyred vehicles shall be recorded as transport vehicles;

[0109] Reference Figure 1 , set a predetermined route for each transport vehicle;

[0110] The established route is specifically as follows: each transport vehicle travels along an initial fixed route in the mine tunnel; by setting an initial fixed route for each transport vehicle and ensuring that the transport vehicle travels along the established route, traffic chaos can be effectively avoided and smooth flow between transport vehicles can be ensured; this method reduces the risk of traffic congestion caused by route randomness and improves the operating efficiency of the coal mine transportation system; through orderly transport vehicle scheduling, it can ensure that the staff in the mine tunnel are delivered to their destination in a timely manner, while improving the controllability of coal mine transportation and reducing delays caused by operational errors or arbitrariness.

[0111] Control the transport vehicle to move along the established route in the mine tunnel to transport personnel;

[0112] Signal collection points are set at intervals in the mine tunnel, and a base station is used at each signal collection point to collect speed information of transport vehicles passing through the base station; by setting signal collection points in the mine tunnel and using base stations to collect speed information of transport vehicles, the operating status of the transport vehicles can be monitored in real time; by collecting and analyzing the speed information of each transport vehicle, it can help managers quickly judge the traffic flow conditions in the mine tunnel and take timely measures to avoid accidents or congestion; in addition, this real-time data collection provides an accurate basis for subsequent scheduling decisions, and can optimize the scheduling of transport vehicles more flexibly; at the same time, this method of setting information collection points at intervals can transmit the data collected by each base station to the ground data processing center through the line, which can ensure signal transmission and collection in the mine tunnel.

[0113] Reference Figure 1 ,When there is a staff member in a special location who issues a ride request, the screening sequence establishment strategy is executed;

[0114] The special location is specifically: a location that is not passed by the established routes of all transport vehicles, and this location is recorded as a special location;

[0115] The taxi request specifically includes: calling a transport vehicle to the location where the taxi request is currently issued;

[0116] Establish a strategy based on the screening sequence to select a transport vehicle to respond to the ride request;

[0117] The screening sequence establishment strategy includes:

[0118] The time when the ride request is sent is recorded as the request time;

[0119] At the request time, each base station that each transport vehicle passes through is obtained and recorded as the base station passed by each transport vehicle;

[0120] Obtain the speed information recorded by each base station of each transport vehicle, and record it as the route speed of each transport vehicle at each base station;

[0121] For each transport vehicle:

[0122] Obtain the number of base stations passed through and obtain the passing speed of each base station passed through;

[0123] Calculate the sum of all path speeds and divide the sum by the number of path base stations. The result is used as the average speed of the transport vehicle at the request time.

[0124] The screening sequence establishment strategy also includes:

[0125] For each transport vehicle, obtain all routes to a specific location and record them as the planned routes of each transport vehicle;

[0126] Obtain the total distance of each planned route respectively, and record it as the planned distance of each planned route;

[0127] For each planned route:

[0128] Obtain the average speed of the transport vehicles corresponding to the planned route; by calculating the average speed of each transport vehicle at the time of request and combining it with the planned distance, the travel time of each transport vehicle can be accurately predicted; this approach avoids the errors that may be caused by scheduling based solely on distance by accurately calculating the speed and route of each transport vehicle, making scheduling more accurate and ensuring that the transport vehicles can reach the requested location in a timely manner via the optimal path; in addition, this can also be dynamically adjusted according to real-time conditions to improve the operating efficiency of the transportation system.

[0129] Get the planned distance of the planned route;

[0130] Divide the planned distance by the average speed and use the result as the planned time of the planned route;

[0131] A screening sequence is established, and each planned route is entered into the screening sequence in order from shortest to longest according to its corresponding planned time. The introduction of the screening sequence establishment strategy allows for the flexible selection of the most suitable transport vehicle to respond to staff members' taxi requests in special circumstances. This strategy ensures that the transport vehicles in the mine can be quickly dispatched according to real-time conditions through a comprehensive analysis of the path, speed, and impact of each transport vehicle. This not only avoids the inefficiency caused by overly fixed scheduling methods, but also improves the system's response speed in emergency situations. Through multi-angle evaluation, the deployment of personnel and vehicles in the mine is optimized.

[0132] The strategy of establishing a transport vehicle to respond to the ride request based on the screening sequence includes:

[0133] For each planned route:

[0134] Obtain each intersection that the planned route passes through, and record it as the planned intersection of each planned route;

[0135] The intersection is specifically: a mine tunnel intersection formed by the intersection of mine tunnels;

[0136] Get the time when the transport vehicle arrives at each planned intersection when traveling along the planned route, specifically:

[0137] Obtain the distance from the starting point of the planned route to each planned intersection respectively, and divide it by the average speed of the transport vehicle corresponding to the planned route respectively, and use the obtained result as the planned route time corresponding to each planned intersection;

[0138] Obtain the established routes of other transport vehicles other than the transport vehicle corresponding to the planned route, and select the established routes that pass through any planned intersection and record them as intersection routes;

[0139] Obtain the planned intersections that each intersecting route passes through and record them as intersecting intersections;

[0140] Get the average speed of the transport vehicle corresponding to each intersecting route, and obtain the location of the transport vehicle at the requested time. Calculate the distance required to reach the intersection along the established route from that location. Divide this distance by the average speed of the transport vehicle and record the result as the intersection time of the intersecting routes.

[0141] Compare the intersection time with the planned route time one by one. If there is an intersection time that is the same as a planned route time, mark the intersection time;

[0142] Get the number of marked intersection times and record it as the impact number of the planned route.

[0143] The strategy of establishing a transport vehicle to respond to the ride request based on the screening sequence includes:

[0144] Setting a threshold for determining the extent to which the planned route affects other transport vehicles traveling along the established route;

[0145] Obtain the impact quantity of each planned route and compare it with the degree threshold;

[0146] If the number of impacts on the planned route is greater than or equal to the degree threshold, the planned route is deemed to have a serious impact on other transport vehicles and is recorded as an excluded route;

[0147] If the impact count of a planned route is less than the degree threshold, the planned route is deemed to have no impact on other transport vehicles and is recorded as a reserved route. By setting an impact degree threshold, routes that affect the travel of other transport vehicles can be excluded, thus avoiding unnecessary scheduling interference. This method analyzes the impact count of each planned route to ensure that it does not arrive at the same intersection at the same time as transport vehicles traveling along its established routes, thereby avoiding routes that may cause large-scale traffic congestion or delays. This strategy not only reduces traffic conflicts within the mine tunnel, but also can effectively screen the most suitable transport vehicles, ensuring the efficiency and smoothness of transport vehicle scheduling.

[0148] Traversing the planned routes in the screening sequence, removing the planned routes identified as excluded routes from the screening sequence, and recording the new screening sequence as the candidate sequence;

[0149] Based on the candidate sequence, a transport vehicle is selected to respond to the ride request.

[0150] The step of selecting a transport vehicle to respond to the ride request according to the candidate sequence includes:

[0151] S1. In the candidate sequence, select the first planned route according to the order of the elements in the sequence and record it as the verification route;

[0152] S2. Obtain the transport vehicle corresponding to the verification route, which is recorded as the verification transport vehicle;

[0153] S3. Obtain and verify that the established route that the transport vehicle has not passed at the time of the request is recorded as a route not passed;

[0154] S4. Obtain and verify whether there are any staff members on the transport vehicle who get off the vehicle on the route that has not been passed;

[0155] S5. If it does not exist, select the current verification transport vehicle to respond to the ride request, and control the current verification transport vehicle to arrive at the special location according to the verification route;

[0156] S6. When the verification transport vehicle arrives at a special location and receives a request from the staff who issued the ride request, the verification transport vehicle is controlled to select the shortest path to the end point of the verification transport vehicle's predetermined route as the subsequent travel route of the verification transport vehicle; in the process of selecting the verification transport vehicle, by calculating the total distance of various special transportation routes and selecting the shortest path, the travel distance and time of the transport vehicle can be greatly reduced in the case that there are no staff getting off the vehicle in the future; this process ensures the maximum utilization of resources, reduces the time wasted due to unnecessary detours, and improves the overall efficiency of the coal mine transportation system; at the same time, this also reduces the traffic pressure in the mine tunnel, which helps to improve the smooth operation of the entire transportation system.

[0157] S7. If there are staff members on the verification transport vehicle who get off along the route that has not been taken, determine whether the verification transport vehicle's movement along the verification route affects the staff members who get off along the route.

[0158] The determination of whether the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle midway includes:

[0159] S8. Obtain all routes of the verification transport vehicle from the special location back to the established route of the verification transport vehicle, and record them as return routes;

[0160] S9. Combine the verification route with each return route, and record each combined route as a special delivery route;

[0161] S10. Obtain the total distance of each special delivery route;

[0162] S11. Compare the total distances of all special delivery routes;

[0163] S12. Reference Figure 1 , select the special transport route with the shortest total distance and record it as the selected transport route for the verification transport vehicle;

[0164] S13, obtaining and verifying the alighting locations of the staff currently on the transport vehicle, and determining whether the existing alighting locations are all on the selected transport route;

[0165] S14. If both are on the selected transport route, determine that the transport vehicle traveling along the route does not affect the staff who get off the vehicle, and control the transport vehicle to travel along the selected transport route, and receive a ride request from a staff member at a special location during the travel;

[0166] S15. If there is a certain getting-off location that is not on the selected transport route, determine whether the transport vehicle traveling along the verified route affects the staff who get off the vehicle, and obtain the number of affected staff members.

[0167] Obtaining the number of affected staff members includes:

[0168] S16. Obtain the number of existing staff members whose alighting locations are not on the selected transportation route, and use this number as the number of affected staff members;

[0169] S17. If the number of affected staff members is equal to 1, determine whether the affected staff members cannot get off the bus normally, including:

[0170] S18. Obtain the staff member whose alighting location is not on the selected transportation route, and obtain the location of the alighting location of the staff member, which is recorded as the target location;

[0171] S19, obtaining whether the mine road where the target location is located is a one-way lane;

[0172] S20: If the mine road where the target location is located is a one-way lane, determine whether there is a transfer vehicle;

[0173] S21. If the mine tunnel where the target location is located is a two-way U-turn lane, the verification transport vehicle is controlled to move along the selected transportation route, and during the movement, if it receives a taxi request from a staff member at a special location, it will move towards the target location after returning to the established route of the verification transport vehicle, and continue to move along the established route after passing the target location; in the process of judging whether the verification transport vehicle will affect the staff who get off the vehicle midway, by ensuring that the path selected by the transport vehicle can take into account the staff's needs for getting off, the inconvenience of the staff caused by an inappropriate path is avoided; this strategy improves the satisfaction and safety of the staff, and also reduces delays and confusion caused by misoperation or improper route planning; at the same time, it optimizes the operation mode of the transport vehicle and ensures the accuracy of scheduling.

[0174] S22. If the number of affected workers is greater than 1, reselect the verification transport vehicle;

[0175] S23, the reselection and verification of the transport vehicle is specifically:

[0176] S24. Remove the current verification route from the candidate sequence, and select the first planned route in the new candidate sequence according to the order of the elements in the sequence as the new verification route, and execute steps S1-S24 in sequence. When there are influencing factors on the selected verification transport vehicle, reselecting the verification transport vehicle can ensure that a suitable vehicle is found to respond to the ride request in the shortest possible time. This strategy fully utilizes the transport vehicle resources, avoids idle transport vehicles or scheduling errors caused by individual factors, and improves the flexibility and emergency response capabilities of the entire transportation system. Through multiple verifications and screenings, it is ensured that the final selected transport vehicle has the highest transportation efficiency under the conditions that are met.

[0177] The determining whether there is a transfer vehicle includes:

[0178] S25. Obtain the location of the verification transport vehicle at the time of the request, and record the location as the transfer location;

[0179] S26. Obtain established routes of other transport vehicles other than the verification transport vehicle to form an established route set;

[0180] S27. Selecting established routes that sequentially pass through the transfer location and the target location from the established route set to form a set of candidate established routes;

[0181] S28, if the set of candidate routes is empty, the current verification route is removed from the candidate sequence, and in the new candidate sequence, the first planned route is selected as the new verification route according to the order of elements in the sequence, and the steps S1-S28 are sequentially executed;

[0182] S29, if the set of candidate routes is not empty, the route passed by each element in the set of candidate routes before the request time is obtained, and is recorded as the completed route of each element;

[0183] S30, each element in the set of candidate routes is sequentially traversed, and the element passing through the transfer location of the completed route is deleted from the set of candidate routes, and the new set obtained is recorded as the verification set;

[0184] S31, if the verification set is not empty, it is determined that there is a transfer vehicle, and the transfer vehicle is screened;

[0185] S32, if the verification set is empty, it is determined that there is no transfer vehicle, and the current verification route is removed from the candidate sequence, and in the new candidate sequence, the first planned route is selected as the new verification route according to the order of elements in the sequence, and the steps S1-S32 are sequentially executed; By screening other transport vehicles that will pass through the transfer location first and then pass through the target location according to their predetermined routes, this method can ensure that the staff who need to get off the verification transport vehicle in the middle of the journey can meet their own off-boarding needs when the verification transport vehicle changes its route to meet the needs of the staff in the special location who have issued a call for a vehicle.

[0186] When all elements in the candidate sequence are removed and there is no transfer vehicle, another transport vehicle in a non-working state is deployed to transport the staff who have issued a call for a vehicle.

[0187] The screening of the transfer vehicle includes:

[0188] When there is a transfer vehicle, the time for each element in the verification set to arrive at the transfer location is obtained, specifically including:

[0189] The average speed of the transport vehicle corresponding to each element in the verification set is obtained respectively;

[0190] The distance of the transport vehicle corresponding to each element in the verification set from the request time to the transfer location according to the predetermined route is obtained, and the distance is divided by the average speed of the corresponding transport vehicle, and the result is taken as the time for the corresponding transport vehicle to arrive at the transfer location;

[0191] The transport vehicle with the shortest time to arrive at the transfer location is selected, and is recorded as the transfer transport vehicle;

[0192] Workers whose drop-off locations are not on the selected transportation routes will be recorded as affected personnel;

[0193] Control and verify that the transport vehicle enables the affected personnel on board to get off at their current location at the requested time;

[0194] After the affected personnel get off the vehicle, the control and verification vehicle moves along the selected transport route, and during the journey, it receives a request from a staff member at a special location to call for a ride. After the selected transport route is completely passed, the vehicle continues to move along the established route until it reaches the destination of the established route;

[0195] At the same time, the transfer transport vehicle is controlled to pick up the affected persons at the transfer location while traveling along its predetermined route, and transport the affected persons to the target location.

[0196] It should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that includes a list of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or apparatus.

[0197] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as within the scope of protection of the present invention.

Claims

1. A method for intelligent management of coal mine data based on big data, characterized in that: include: When using rubber-tyred trackless vehicles to transport workers within coal mine tunnels, the trackless rubber-tyred vehicles shall be recorded as transport vehicles; Set a predetermined route for each transport vehicle; The predetermined route is specifically as follows: each transport vehicle travels along an initial fixed route in the mine tunnel; Control the transport vehicle to move along the established route in the mine tunnel to transport personnel; Signal collection points are set up at intervals in the mine tunnel, and a base station is used at each signal collection point to collect speed information of transport vehicles passing through the base station; When a staff member places a ride request at a special location, the screening sequence establishment strategy is executed; the special location is specifically a location that is not passed by the established routes of all transport vehicles, and this location is recorded as a special location; The taxi request specifically includes: calling a transport vehicle to the location where the taxi request is currently issued; Establish a strategy based on the screening sequence to select a transport vehicle to respond to the ride request; The screening sequence establishment strategy includes: The time when the ride request is sent is recorded as the request time; At the request time, each base station passed by each transport vehicle is obtained respectively, and recorded as the base station passed by each transport vehicle; the speed information recorded by each base station passed by each transport vehicle is obtained respectively, and recorded as the path speed of each transport vehicle at each base station passed by; For each transport vehicle: Obtain the number of base stations passed through and obtain the passing speed of each base station passed through; Calculate the sum of all path speeds and divide the sum by the number of path base stations. The result is used as the average speed of the transport vehicle at the request time. Obtaining the optional planned routes to the special location and calculating the total distance of each planned route; calculating the planned time of each planned route using the obtained average speed of the transport vehicle, and sorting all planned routes from shortest to longest planned time to establish a screening sequence; For each planned route in the screening sequence, the planned route time is calculated at each planned intersection. For other transport vehicles' planned routes, the arrival time at the same intersection along the planned route is calculated, and any arrival time that is equal to the corresponding planned route time is marked as an intersection mark. The number of marked intersection times is used as the impact number of the planned route, and the impact number is compared with a preset threshold to determine whether to remove it from the sequence. In the candidate sequence after elimination, the transport vehicle corresponding to the first planned route is selected in sequence as the verification transport vehicle: if there are no passengers on the verification transport vehicle who will not be able to get off normally due to deviation from the established route, the verification transport vehicle will be selected to respond to the ride request and controlled to reach the special location along the planned route; when it is met by the staff, the verification transport vehicle is controlled to return along the shortest path to the end point of its established route and continue the established route; if there are passengers on the verification transport vehicle who will be affected, the verification transport vehicle will be skipped and the next candidate vehicle will be verified in sequence.

2. The method for intelligent management of coal mine data based on big data according to claim 1, characterized in that: The screening sequence establishment strategy also includes: For each transport vehicle, obtain all routes to a specific location and record them as the planned routes of each transport vehicle; Obtain the total distance of each planned route respectively, and record it as the planned distance of each planned route; For each planned route: Get the average speed of the transport vehicle corresponding to the planned route; Get the planned distance of the planned route; Divide the planned distance by the average speed and use the result as the planned time of the planned route; Create a screening sequence and enter each planned route into the screening sequence in order from shortest to longest according to the length of its corresponding planned time.

3. The method for intelligent management of coal mine data based on big data according to claim 1, characterized in that: The strategy of establishing a transport vehicle to respond to the ride request based on the screening sequence includes: For each planned route: Obtain each intersection that the planned route passes through, and record it as the planned intersection of each planned route; The intersection is specifically: a mine tunnel intersection formed by the intersection of mine tunnels; Get the time when the transport vehicle arrives at each planned intersection when traveling along the planned route, specifically: Obtain the distance from the starting point of the planned route to each planned intersection respectively, and divide it by the average speed of the transport vehicle corresponding to the planned route respectively, and use the obtained result as the planned route time corresponding to each planned intersection; Obtain the established routes of other transport vehicles other than the transport vehicle corresponding to the planned route, and select the established routes that pass through any planned intersection and record them as intersection routes; Obtain the planned intersections that each intersecting route passes through and record them as intersecting intersections; Get the average speed of the transport vehicle corresponding to each intersecting route, and obtain the location of the transport vehicle at the requested time. Calculate the distance required to reach the intersection along the established route from that location. Divide this distance by the average speed of the transport vehicle and record the result as the intersection time of the intersecting routes. Compare the intersection time with the planned route time one by one. If there is an intersection time that is the same as a planned route time, mark the intersection time; Get the number of marked intersection times and record it as the impact number of the planned route.

4. The method for intelligent management of coal mine data based on big data according to claim 1, characterized in that: The strategy of establishing a transport vehicle to respond to the ride request based on the screening sequence includes: Setting a threshold for determining the extent to which the planned route affects other transport vehicles traveling along the established route; Obtain the impact quantity of each planned route and compare it with the degree threshold; If the number of impacts on the planned route is greater than or equal to the degree threshold, the planned route is deemed to have a serious impact on other transport vehicles and is recorded as an excluded route; If the impact quantity of the planned route is less than the degree threshold, it is determined that the planned route does not affect other transport vehicles and is recorded as a reserved route; Traversing the planned routes in the screening sequence, removing the planned routes identified as excluded routes from the screening sequence, and recording the new screening sequence as the candidate sequence; Based on the candidate sequence, a transport vehicle is selected to respond to the ride request.

5. The method for intelligent management of coal mine data based on big data according to claim 4, characterized in that: The step of selecting a transport vehicle to respond to the ride request according to the candidate sequence includes: S1. In the candidate sequence, select the first planned route according to the order of the elements in the sequence and record it as the verification route; S2. Obtain the transport vehicle corresponding to the verification route, which is recorded as the verification transport vehicle; S3. Obtain and verify that the established route that the transport vehicle has not passed at the time of the request is recorded as a route not passed; S4. Obtain and verify whether there are any staff members on the transport vehicle who get off the vehicle on the route that has not been passed; S5. If it does not exist, select the current verification transport vehicle to respond to the ride request, and control the current verification transport vehicle to arrive at the special location according to the verification route; S6. When the verification transport vehicle arrives at the special location and receives the call from the staff member, the verification transport vehicle is controlled to select a shortest path to the end of the predetermined route of the verification transport vehicle as the subsequent route of the verification transport vehicle; S7. If there are staff members on the verification transport vehicle who get off along the route that has not been taken, determine whether the verification transport vehicle's movement along the verification route affects the staff members who get off along the route.

6. The method for intelligent management of coal mine data based on big data according to claim 5, characterized in that: The determination of whether the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle midway includes: S8. Obtain all routes of the verification transport vehicle from the special location back to the established route of the verification transport vehicle, and record them as return routes; S9. Combine the verification route with each return route, and record each combined route as a special delivery route; S10. Obtain the total distance of each special delivery route; S11. Compare the total distances of all special delivery routes; S12. Select a special transport route with the shortest total distance, and record it as the selected transport route for the verification transport vehicle; S13, obtaining and verifying the alighting locations of the staff currently on the transport vehicle, and determining whether the existing alighting locations are all on the selected transport route; S14. If both are on the selected transport route, determine that the transport vehicle traveling along the route does not affect the staff who get off the vehicle, and control the transport vehicle to travel along the selected transport route, and receive a ride request from a staff member at a special location during the travel; S15. If there is a certain getting-off location that is not on the selected transport route, determine whether the transport vehicle traveling along the verified route affects the staff who get off the vehicle, and obtain the number of affected staff members.

7. The method for intelligent management of coal mine data based on big data according to claim 6, characterized in that: Obtaining the number of affected staff members includes: S16. Obtain the number of existing staff members whose alighting locations are not on the selected transportation route, and use this number as the number of affected staff members; S17. If the number of affected staff members is equal to 1, determine whether the affected staff members cannot get off the bus normally, including: S18. Obtain the staff member whose alighting location is not on the selected transportation route, and obtain the location of the alighting location of the staff member, which is recorded as the target location; S19, obtaining whether the mine road where the target location is located is a one-way lane; S20: If the mine road where the target location is located is a one-way lane, determine whether there is a transfer vehicle; S21. If the mine road where the target location is located is a two-way U-turn lane, control the verification transport vehicle to travel according to the selected transportation route, and receive a vehicle request from a staff member at a special location during the travel. After returning to the established route of the verification transport vehicle, the vehicle travels toward the target location, and after passing the target location, continues to travel according to the established route. S22. If the number of affected workers is greater than 1, reselect the verification transport vehicle; S23, the reselection and verification of the transport vehicle is specifically: S24: Remove the current verification route from the candidate sequence, and select the first planned route in the new candidate sequence according to the order of the elements in the sequence as the new verification route, and execute steps S1-S24 in sequence.

8. The method for intelligent management of coal mine data based on big data according to claim 7, characterized in that: The determining whether there is a transfer vehicle includes: S25. Obtain the location of the verification transport vehicle at the time of the request, and record the location as the transfer location; S26. Obtain established routes of other transport vehicles other than the verification transport vehicle to form an established route set; S27. Selecting established routes that sequentially pass through the transfer location and the target location from the established route set to form a set of candidate established routes; S28. If the set of established routes to be selected is an empty set, the current verification route is removed from the candidate sequence, and the first planned route in the new candidate sequence is selected according to the order of the elements in the sequence as the new verification route, and steps S1 to S28 are executed in sequence; S29. If the set of established routes to be selected is not an empty set, then obtaining the route that each element in the set of established routes to be selected has taken before the request time, and recording it as the completed route of each element; S30, traversing each element in the set of candidate established routes in sequence, deleting the elements whose routes pass through transfer locations from the set of candidate established routes, and recording the resulting new set as the set to be verified; S31. If the set to be verified is not an empty set, it is determined that there is a transfer vehicle, and the transfer transport vehicle is selected; S32. If the set to be verified is an empty set, it is determined that there is no transfer vehicle, and the current verification route is removed from the candidate sequence. In the new candidate sequence, the first planned route is selected according to the order of the elements in the sequence as the new verification route, and steps S1-S32 are executed in sequence. When all elements in the candidate sequence are eliminated and there is no transfer vehicle, another non-working transport vehicle is deployed to control the transport vehicle to transport the staff member who issued the ride request.

9. The method for intelligent management of coal mine data based on big data according to claim 8, characterized in that: The screening transfer transport vehicle comprises: If there is a transfer vehicle, the time when the transport vehicle corresponding to each element in the set to be verified arrives at the transfer location is obtained separately, including: Get the average speed of the transport vehicle corresponding to each element in the set to be verified; Get the distance that the transport vehicle corresponding to each element in the set to be verified has traveled to the transfer location along the established route at the requested time, and divide the distance by the average speed of the corresponding transport vehicle, and use the result as the time when the corresponding transport vehicle arrives at the transfer location; Select the transport vehicle that takes the shortest time to reach the transfer location and record it as the transfer transport vehicle; Workers whose drop-off locations are not on the selected transportation routes will be recorded as affected personnel; Control and verify that the transport vehicle enables the affected personnel on board to get off at their current location at the requested time; After the affected personnel get off the vehicle, the control and verification vehicle moves along the selected transport route, and during the journey, it receives a request from a staff member at a special location to call for a ride. After the selected transport route is completely passed, the vehicle continues to move along the established route until it reaches the destination of the established route; At the same time, the transfer transport vehicle is controlled to pick up the affected persons at the transfer location while traveling along its predetermined route, and transport the affected persons to the target location.

Images