Coal mine data intelligent management method based on big data

Abstract

The invention relates to the technical field of coal mine data intelligent management, and discloses a coal mine data intelligent management method based on big data, and the method comprises the steps: setting a fixed route for each transport vehicle, and conveying workers according to the route; signal acquisition points are arranged in a mine tunnel, and a base station collects speed information of a transport vehicle; when a worker sends a taxi calling request at a special position, the system screens the most suitable transport vehicle response request through a screening sequence establishment strategy; by calculating the average speed, the planned distance and the influence degree of a transport vehicle, transport vehicle selection is optimized, and path conflicts are avoided; transfer vehicles are introduced when necessary, so that the transportation efficiency is ensured; finally, the scheduling precision and flexibility are improved through real-time data collection and big data analysis, and efficient and safe operation of the mine tunnel transportation system is ensured.

Description

Technical Field

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

[0002] In coal mine operations, especially in the transportation and dispatch management of workers in the mine tunnel, there are usually a series of problems such as low transportation efficiency, unreasonable personnel dispatch, and mine tunnel traffic congestion. Most of the current coal mine transportation systems rely on traditional manual dispatch and simple traffic management methods, which cannot effectively combine the complex geographical environment of the mine tunnel and the dynamic needs of the workers for intelligent dispatch, resulting in low operation efficiency and serious waste of resources. With the advancement of automation and informatization of the coal mine 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 in the coal mine industry.

[0003] Most of the existing coal mine transportation dispatching systems are dispatching models based on fixed routes, which usually only perform simple dispatching based on the scheduled routes and times of the transport vehicles, and lack dynamic dispatching capabilities. This model is prone to traffic conflicts and uneven resource allocation in the complex environment of mine tunnels, especially in the case of urgent needs of workers in intersecting mine tunnels or special locations. Traditional dispatching methods often cannot respond efficiently. In addition, many existing dispatching systems in coal mines do not make full use of various sensors and signal collection points deployed in mine tunnels, and fail to optimize dispatching strategies by real-time monitoring of the speed and position changes of transport vehicles. As a result, the routes or priorities of transport vehicles cannot be adjusted according to actual conditions, resulting in traffic congestion in mine tunnels or untimely pick-up and drop-off of workers.

[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, and when workers in special locations need to use a vehicle, comparing the location information, speed information and established route information of all vehicles, performing data processing on all information, and screening out the vehicle route plan 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 solving 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 rubber-tyred trackless vehicles are used to transport workers in coal mine tunnels, the rubber-tyred trackless vehicles are recorded as transport vehicles;

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

[0009] The predetermined route is specifically: 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 at intervals in the mine tunnel, and a base station is used at each signal collection point to collect speed information of the transport vehicle passing through the base station;

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

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

[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 issued is recorded as the request time;

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

[0019] The speed information recorded by each base station passed by each transport vehicle is obtained respectively, and recorded as the passing speed of each transport vehicle at each passing base station;

[0020] For each transport vehicle:

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

[0022] Calculate the sum of all path speeds, divide the sum by the number of path base stations, and use the result 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 reach a specific location and record them as the planned route of each transport vehicle;

[0025] The total distance of each planned route is obtained respectively and recorded as the planned distance of each planned route;

[0026] For each planned route:

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

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

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

[0030] Create a screening sequence and enter each planned route into the screening sequence in order from short to long according to the length of its corresponding planned time.

[0031] Optionally, the step of establishing a strategy according to the screening sequence to screen a transport vehicle to respond to the ride request includes:

[0032] For each planned route:

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

[0034] The intersection is specifically: a mine road intersection formed by the intersection of mine roads;

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

[0036] The distance from the starting point of the planned route to each planned intersection is obtained respectively, and the distance is divided by the average speed of the transport vehicle corresponding to the planned route respectively, and the obtained result is used as the planned route time corresponding to each planned intersection;

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

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

[0039] Get the average speed of the transport vehicle corresponding to each intersection route, and get the location of the transport vehicle at the requested time, get the distance from the location to the intersection according to the established route, divide it by the average speed of the transport vehicle, and record the result as the intersection time of the intersection route;

[0040] Compare the intersection time with the planned route time one by one, and if there is an intersection time that is the same as a planned route time, mark the intersection time;

[0041] The number of marked intersection times is obtained and recorded as the impact number of the planned route.

[0042] Optionally, the step of establishing a strategy according to the screening sequence to screen a transport vehicle to respond to the ride request includes:

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

[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 a candidate sequence;

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

[0049] Optionally, selecting a transport vehicle to respond to the vehicle request according to the sequence to be selected 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, obtaining a predetermined route that the verification transport vehicle has not passed at the request time, and recording it as a route that has not been passed;

[0053] S4, obtaining and verifying 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 staff member who issued the vehicle call request, the verification transport vehicle is controlled to select a shortest path leading to the end point of the predetermined route of the verification transport vehicle as the subsequent travel route of the verification transport vehicle;

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

[0057] Optionally, the step of determining whether the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle midway includes:

[0058] S8, obtaining all routes of the verification transport vehicle from the special location back to the established route of the verification transport vehicle, and recording them as return routes;

[0059] S9, combining the verification route with each return route respectively, and recording each combined route as a special delivery route;

[0060] S10, obtaining the total distance of each special delivery route;

[0061] S11. comparing the total distances of all special delivery routes;

[0062] S12, selecting a special transport route with the shortest total distance, and recording it as the selected transport route for the verification transport vehicle;

[0063] 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;

[0064] S14, if all are on the selected transport route, determine that the verification transport vehicle travels along the verification route without affecting the staff who get off the vehicle, and control the verification transport vehicle to travel along the selected transport route, and receive a ride request from the staff at the special location during the travel process;

[0065] S15. If there is a certain getting-off location that is not on the selected transportation route, it is determined that the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle, and the number of affected staff is obtained.

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

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

[0068] S17. If the number of affected staff members is equal to 1, determining whether the affected staff members cannot get off the bus normally includes:

[0069] S18, obtaining a staff member whose alighting location is not on the selected transportation route, and obtaining the location of the alighting location of the staff member, which is recorded as the target location;

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

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

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

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

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

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

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

[0077] S25, obtaining the position of the verification transport vehicle at the request time, and recording the position as the transfer position;

[0078] S26, obtaining the 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 to-be-selected 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 sequence to be selected, and in the new sequence to be selected, the first planned route is selected according to the order of the elements in the sequence as the new verification route, and steps S1-S28 are executed in sequence;

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

[0082] S30, traversing each element in the set of established routes to be selected in turn, deleting the elements that complete the route through the transfer location from the set of established routes to be selected, and recording the obtained 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 transport 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, including:

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

[0089] Get the distance that the transport vehicle corresponding to each element in the set to be verified travels to the transfer location along the established route at the request 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 transportation route, and during the journey, the vehicle receives a request from a staff member at a special location to call for a ride. After the selected transportation route is completely passed, the vehicle continues to move along the established route until it reaches the end 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 vehicle travels along 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 the staff in the mine tunnel are delivered to the destination in time, 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 the 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 determine the traffic flow conditions in the mine tunnel and take timely measures to avoid accidents or blockages; 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 arrive at 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.

[0099] 4. The introduction of the screening sequence establishment strategy makes it possible to flexibly select the most suitable transport vehicle to respond to the staff's vehicle request 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, which 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.

[0100] 5. By setting an impact threshold, unnecessary scheduling interference can be avoided by excluding routes that affect the travel of other transport vehicles. This method analyzes the impact of each planned route to ensure that it does not arrive at the same intersection at the same time as those transport vehicles traveling on their 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 out the most suitable transport vehicles, ensuring the efficiency and smoothness of transport vehicle scheduling.

[0101] 6. In the process of verifying the selection of transport vehicles, by calculating the total distance of various special transportation routes and selecting the shortest route, the travel distance and time of the transport vehicles 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.

[0102] 7. In the process of judging and verifying whether the transport vehicle will affect the staff who get off the bus, by ensuring that the route selected by the transport vehicle can take into account the staff's needs for getting off the bus, the inconvenience of the staff caused by inappropriate routes 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.

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

[0104] 9. By screening out other transport vehicles that will first pass the transfer location and then the target location according to their established routes, this method can ensure that the staff who are currently on the verification transport vehicle and need to get off midway can meet their own needs to get off when the verification transport vehicle changes its route to meet the needs of the staff 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 be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. 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 creative work are within the scope of protection of the present invention.

[0107] Embodiment, a method for intelligent management of coal mine data based on big data, comprising:

[0108] When rubber-tyred trackless vehicles are used to transport workers in coal mine tunnels, the rubber-tyred trackless vehicles are 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 the destination in time, 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 the transport vehicles passing the base station; by setting signal collection points in the mine tunnel and using base stations to collect speed information of the 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 management personnel 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 data processing center on the ground 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 position is specifically: a position that is not passed by the established routes of all transport vehicles, and this position is recorded as a special position;

[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 issued is recorded as the request time;

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

[0120] The speed information recorded by each base station passed by each transport vehicle is obtained respectively, and recorded as the passing speed of each transport vehicle at each passing base station;

[0121] For each transport vehicle:

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

[0123] Calculate the sum of all path speeds, divide the sum by the number of path base stations, and use the result 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 reach a specific location and record them as the planned route of each transport vehicle;

[0126] The total distance of each planned route is obtained respectively and recorded as the planned distance of each planned route;

[0127] For each planned route:

[0128] Get 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 only on distance by accurately calculating the speed and route of each transport vehicle, making scheduling more accurate and ensuring that the transport vehicles can arrive at 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] Establish a screening sequence, and enter each planned route into the screening sequence in order from short to long 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 the staff's taxi request 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, which not only avoids the inefficiency caused by an overly fixed dispatching method, 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 step of establishing a strategy based on the screening sequence to screen a transport vehicle to respond to the ride request includes:

[0133] For each planned route:

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

[0135] The intersection is specifically: a mine road intersection formed by the intersection of mine roads;

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

[0137] The distance from the starting point of the planned route to each planned intersection is obtained respectively, and the distance is divided by the average speed of the transport vehicle corresponding to the planned route respectively, and the obtained result is used 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 passing 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 intersection route, and get the location of the transport vehicle at the requested time, get the distance from the location to the intersection according to the established route, divide it by the average speed of the transport vehicle, and record the result as the intersection time of the intersection route;

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

[0142] The number of marked intersection times is obtained and recorded as the impact number of the planned route.

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

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

[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 number 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; by setting the impact degree threshold, those routes that affect the travel of other transport vehicles can be excluded, thereby avoiding unnecessary scheduling interference; this method analyzes the impact number of each planned route to ensure that it will not arrive at the same intersection at the same time as those transport vehicles traveling along their 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 efficiently screen out 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 a candidate sequence;

[0149] According to 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 vehicle 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, obtaining a predetermined route that the verification transport vehicle has not passed at the request time, and recording it as a route that has not been passed;

[0154] S4, obtaining and verifying 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 a staff member who has issued a vehicle call, the verification transport vehicle is controlled to select a shortest path to the end point of the verification transport vehicle's established 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 members 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 on the route that has not been passed, determine whether the verification transport vehicle moving along the verification route affects the staff members who get off on 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, obtaining all routes of the verification transport vehicle from the special location back to the established route of the verification transport vehicle, and recording them as return routes;

[0160] S9, combining the verification route with each return route respectively, and recording each combined route as a special delivery route;

[0161] S10, obtaining the total distance of each special delivery route;

[0162] S11. comparing 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 all are on the selected transport route, determine that the verification transport vehicle travels along the verification route without affecting the staff who get off the vehicle, and control the verification transport vehicle to travel along the selected transport route, and receive a ride request from the staff at the special location during the travel process;

[0166] S15. If there is a certain getting-off location that is not on the selected transportation route, it is determined that the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle, and the number of affected staff is obtained.

[0167] The obtaining of 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 it as the number of affected staff members;

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

[0170] S18, obtaining a staff member whose alighting location is not on the selected transportation route, and obtaining 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 road;

[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, it receives a vehicle call from a staff member at a special location. After returning to the established route of the verification transport vehicle, it moves toward the target location, and after passing the target location, it continues to move along the established route. In the process of judging whether the verification transport vehicle will affect the staff who get off the vehicle, by ensuring that the route selected by the transport vehicle can take into account the staff's needs to get off the vehicle, the inconvenience of the staff caused by inappropriate routes 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 staff members is greater than 1, reselect the verification vehicle;

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

[0176] S24, remove the current verification route from the candidate sequence, and in the new candidate sequence, select the first planned route as the new verification route according to the order of the elements in the sequence, and execute steps S1-S24 in sequence. When there are influencing factors in the selected verification transport vehicle, by reselecting the verification vehicle, it can be ensured that a suitable vehicle is found in the shortest time to respond to the taxi request; this strategy makes full use of the transport vehicle resources, avoids the idleness of the transport vehicle or scheduling errors caused by individual factors, and improves the flexibility and emergency handling 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 when the conditions are met.

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

[0178] S25, obtaining the position of the verification transport vehicle at the request time, and recording the position as the transfer position;

[0179] S26, obtaining the 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 to-be-selected established routes;

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

[0182] S29. If the set of established routes to be selected is not an empty set, then the route that each element in the set of established routes to be selected has passed before the request time is obtained, and recorded as the completed route of each element;

[0183] S30, traversing each element in the set of established routes to be selected in turn, deleting the elements that complete the route through the transfer location from the set of established routes to be selected, and recording the obtained new set as the set to be verified;

[0184] 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;

[0185] 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; by screening out other transport vehicles that will first pass the transfer location and then the target location according to their established routes, this method can ensure that the staff who are currently on the verification transport vehicle and need to get off midway can meet their own needs to get off when the verification transport vehicle changes its route to meet the needs of the staff who are at a special location and send a ride request.

[0186] 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.

[0187] The screening transfer transport vehicle comprises:

[0188] 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, including:

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

[0190] Get the distance that the transport vehicle corresponding to each element in the set to be verified travels to the transfer location along the established route at the request 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;

[0191] Select the transport vehicle that takes the shortest time to reach the transfer location and record it 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 transportation route, and during the journey, the vehicle receives a request from a staff member at a special location to call for a ride. After the selected transportation route is completely passed, the vehicle continues to move along the established route until it reaches the end 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 article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[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 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 rubber-tyred trackless vehicles are used to transport workers in coal mine tunnels, the rubber-tyred trackless vehicles are recorded as transport vehicles; Set a predetermined route for each transport vehicle; The predetermined route is specifically: 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 at intervals in the mine tunnel, and a base station is used at each signal collection point to collect speed information of the transport vehicle passing through the base station; When there is a staff member at a special location who issues a ride request, the screening sequence establishment strategy is executed; The special position is specifically: a position that is not passed by the established routes of all transport vehicles, and this position is recorded as a special position; 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 issued is recorded as the request time; At the request time, each base station that each transport vehicle passes through 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 passing speed of each transport vehicle at each passing base station; For each transport vehicle: Obtain the number of base stations passed, and obtain the passing speed of each base station passed; Calculate the sum of all path speeds, divide the sum by the number of path base stations, and use the result as the average speed of the transport vehicle at the request time.

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 reach a specific location and record them as the planned route 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 short to long 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 step of establishing a strategy based on the screening sequence to screen a transport vehicle to respond to the ride request includes: For each planned route: Obtain each intersection that the planned route passes through, and record them as the planned intersection of each planned route; The intersection is specifically: a mine road intersection formed by the intersection of mine roads; Get the time when the transport vehicle arrives at each planned intersection when traveling along the planned route, specifically: The distance from the starting point of the planned route to each planned intersection is obtained respectively, and the distance is divided by the average speed of the transport vehicle corresponding to the planned route respectively, and the obtained result is used 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 passing 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 intersection route, and get the location of the transport vehicle at the requested time, get the distance from the location to the intersection according to the established route, divide it by the average speed of the transport vehicle, and record the result as the intersection time of the intersection route; Compare the intersection time with the planned route time one by one, and if there is an intersection time that is the same as a planned route time, mark the intersection time; The number of marked intersection times is obtained and recorded 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 step of establishing a strategy based on the screening sequence to screen a transport vehicle to respond to the ride request includes: Setting a threshold for determining the extent to which the planned route affects other transport vehicles travelling along the established routes; 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 a candidate sequence; According to 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 vehicle 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, obtaining a predetermined route that the verification transport vehicle has not passed at the request time, and recording it as a route that has not been passed; S4, obtaining and verifying 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 staff member who issued the vehicle call request, the verification transport vehicle is controlled to select a shortest path leading to the end point of the predetermined route of the verification transport vehicle as the subsequent travel route of the verification transport vehicle; S7. If there are staff members on the verification transport vehicle who get off on the route that has not been passed, determine whether the verification transport vehicle moving along the verification route affects the staff members who get off on 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, obtaining all routes of the verification transport vehicle from the special location back to the established route of the verification transport vehicle, and recording them as return routes; S9, combining the verification route with each return route respectively, and recording each combined route as a special delivery route; S10, obtaining the total distance of each special delivery route; S11. comparing the total distances of all special delivery routes; S12, selecting a special transport route with the shortest total distance, and recording 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 all are on the selected transport route, determine that the verification transport vehicle travels along the verification route without affecting the staff who get off the vehicle, and control the verification transport vehicle to travel along the selected transport route, and receive a ride request from the staff at the special location during the travel process; S15. If there is a certain getting-off location that is not on the selected transportation route, it is determined that the verification transport vehicle traveling along the verification route affects the staff who get off the vehicle, and the number of affected staff is obtained.

7. The method for intelligent management of coal mine data based on big data according to claim 6, characterized in that: The obtaining of 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 it as the number of affected staff members; S17. If the number of affected staff members is equal to 1, determining whether the affected staff members cannot get off the bus normally includes: S18, obtaining a staff member whose alighting location is not on the selected transportation route, and obtaining 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 road; 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-turnable lane, the verification transport vehicle is controlled to travel according to the selected transportation route, and during the travel, the verification transport vehicle receives a vehicle call request from a staff member at a special location, and after returning to the established route of the verification transport vehicle, the verification transport vehicle travels to the target location, and after passing the target location, the verification transport vehicle continues to travel according to the established route; S22. If the number of affected staff members is greater than 1, reselect the verification vehicle; S23, the reselection of the verification vehicle is specifically: S24, remove the current verification route from the candidate sequence, and in the new candidate sequence, select the first planned route 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 comprises: S25, obtaining the position of the verification transport vehicle at the request time, and recording the position as the transfer position; S26, obtaining the 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 to-be-selected established routes; S28. If the set of established routes to be selected is an empty set, the current verification route is removed from the sequence to be selected, and in the new sequence to be selected, the first planned route is selected according to the order of the elements in the sequence as the new verification route, and steps S1-S28 are executed in sequence; S29. If the set of established routes to be selected is not an empty set, then the route that each element in the set of established routes to be selected has passed before the request time is obtained, and recorded as the completed route of each element; S30, traversing each element in the set of established routes to be selected in turn, deleting the elements that complete the route through the transfer location from the set of established routes to be selected, and recording the obtained 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 respectively, including: Get the average speed of the transport vehicle corresponding to each element in the set to be verified respectively; Get the distance that the transport vehicle corresponding to each element in the set to be verified travels to the transfer location along the established route at the request 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 transportation route, and during the journey, the vehicle receives a request from a staff member at a special location to call for a ride. After the selected transportation route is completely passed, the vehicle continues to move along the established route until it reaches the end 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