A remote real-time monitoring and control method for smart factories based on industrial Internet

Abstract

The present invention relates to the field of smart factory control technology, and discloses a remote real-time monitoring and control method for smart factories based on the industrial Internet. First, an ant colony algorithm is used to establish a shortest path table between various devices in a factory. Based on the shortest path table, when the factory receives an order, according to the equipment resources required in the order, when there are equipment resources in the factory that meet the order requirements, the ant colony algorithm will be used to arrange appropriate equipment to process the order. At the same time, the smart factory will establish a TDMA time allocation table in real time according to the number of equipment in the current workshop, and communicate with the equipment in the workshop at different times through the TDMA time allocation table; in the process of arranging equipment to process the order, the smart factory will regularly access the equipment in the order based on the TDMA time allocation table to ensure remote real-time monitoring and control of order production.

Description

Technical Field

[0001] The present invention relates to the field of smart factory control technology, and specifically to a remote real-time monitoring and control method for a smart factory based on the industrial Internet. Background Art

[0002] How the Industrial Internet can use the Internet as a separate control network is one of the current development directions of the Industrial Internet and one of the research hotspots in the field of industrial control.

[0003] With the continuous development of the Internet, industrial enterprises and scientific research institutions have begun to develop networked equipment monitoring systems from an application perspective to solve the current situation where production information cannot be integrated and shared in the local area network. The essence and core of the industrial Internet is to closely connect and integrate equipment, production lines, factories, suppliers, products and customers through the industrial Internet platform, which can help the manufacturing industry extend the industrial chain and form cross-equipment, cross-system, cross-factory and cross-regional interconnection, thereby improving efficiency and promoting the intelligence of the entire manufacturing service system.

[0004] In the process of promoting the intelligence of the entire manufacturing service system, the smart factory is an important component unit and the basic implementation organization of enterprise production. Since there are various large-scale equipment in the factory, it needs to be managed through various equipment. However, the cost of manual management is high and the delay in discovering abnormalities is large, so it is necessary to monitor and manage the equipment through the Internet. Summary of the invention

[0005] 1. Technical issues to be resolved

[0006] In view of the shortcomings of the existing technology, the present invention provides a remote real-time monitoring and control method for smart factories based on the industrial Internet, which has the advantages of real-time performance and solves the problem of equipment monitoring and control in smart factories.

[0007] (II) Technical solution

[0008] In order to solve the technical problem of equipment monitoring and control in the above-mentioned smart factory, the present invention provides the following technical solution: a remote real-time monitoring and control method for a smart factory based on the industrial Internet, comprising the following steps:

[0009] S1. Classify each device in the factory according to its function, and the same type of devices share one node;

[0010] S2. Establish the shortest path table between various device nodes based on the ant colony algorithm;

[0011] S3. When the factory detects that an order has arrived, it will allocate idle equipment resources that meet the order based on the equipment resources required for the current order, the idle equipment resources in the current factory, and the shortest path table between various equipment nodes;

[0012] S4. After allocating equipment resources based on the order, the factory will monitor the production status of the order in real time during the production process of the user order;

[0013] S5. When an abnormal situation is detected during the production process of an order, the factory will handle the abnormal situation;

[0014] Preferably, the steps of establishing the shortest path table between various types of device nodes based on the ant colony algorithm are as follows:

[0015] S21, set the current factory has n types of equipment, c i =(x i ,y i )i=1,2,3...n;

[0016] Among them, c i 、c j represents the adjacent i-th and j-th equipment in the factory, (x i ,y i )、(x j ,y j ) represents the node coordinates of two adjacent types of equipment;

[0017] The same type of equipment in a factory is usually placed in the same area. Each area is set as a node, and the distance between two adjacent types of equipment is the distance between the node coordinates of the two types of equipment.

[0018] S22, the distance between the i-th type of equipment and the j-th type of equipment can be expressed as:

[0019]

[0020] S23. Set a taboo table for each ant to record the devices it has walked through. The first position in the taboo table is the device where the ant is located at the initial moment. When all devices are added to the taboo table, it means that the ant has walked through all devices and completed a tour. Set T ij (t) is device c i and device c j The amount of pheromone between , at the initial moment, is:

[0021] T ij (0) = c

[0022] Where c is a constant;

[0023] S24, assume that in the time period (t, t+n) all ants complete a tour, then at time t+n device c i and device c j The pheromone content between can be expressed as:

[0024] Pheromone content iteration formula:

[0025] T ij (t+n)=(1-ρ)·T ij (t)+ΔT ij

[0026] Where ρ represents the volatility coefficient of pheromone between the time periods (t, t+n), then (1-ρ) represents the remaining amount of pheromone, and the volatility coefficient ranges from (0, 1);

[0027] ΔT ij It represents the sum of the pheromone contents released by all ants on the connection path between device i and device j during the time period (t, t+n). It is calculated as follows:

[0028]

[0029] ΔT ij k Indicates that the kth ant is released on device c in this tour i and device c j The pheromone content between is calculated as follows:

[0030]

[0031] Among them, Q is a positive constant, L K represents the path that ant k takes during its tour;

[0032] At time t, ant k from device c i The probability of transfer to other devices can be calculated as follows:

[0033] The formula for calculating the transition probability is:

[0034]

[0035] Among them, η i，j is a heuristic factor calculated as: represents the expected degree of ant transfer from device i to device j, J k (i) indicates that in device c i The set of devices that ant k can choose to transfer to, s represents the set J k (i) is a type of device node in the figure; α is the pheromone importance factor, β is the heuristic function importance factor;

[0036] S25, randomly placing each ant at a different starting point, and for each ant k (k=1, 2, ..., m), determining the next device to be visited according to the transfer probability calculation formula, until all ants have visited all types of devices, that is, a set of paths has been constructed;

[0037] S26. Calculate the length L of the path that each ant passes through K , update the pheromone concentration on each device path according to the pheromone content iteration formula, and at the same time, record the shortest path in the current number of tours;

[0038] S27, constructing a shortest path table according to the shortest path set recorded for each device to start a round trip;

[0039] Preferably, the device resources required for the current order, the idle device resources in the current factory, and the shortest path table between various types of device nodes are used to allocate device resources, including the following steps:

[0040] S31. Search in the factory according to the type of equipment required by the order and the required quantity of each type of equipment;

[0041] S32. When the number of idle equipment in the factory does not meet the order demand, the order is put into a waiting queue and the change of the number of idle equipment in the current factory is retrieved in real time. When the number of idle equipment in the factory meets the order demand, the factory will arrange the corresponding equipment to process the order based on the ant colony algorithm;

[0042] Preferably, the factory arranges corresponding equipment to process the order based on the ant colony algorithm, including the following steps:

[0043] S331, set that there are n types of equipment in the current factory, set p types of equipment required for the current order, p<n;

[0044] S332. It is known that the shortest path of each node obtained based on the ant colony algorithm is unique, p < n, and the shortest path between p types of devices is obtained according to the shortest path table;

[0045] S333. After the factory arranges equipment to process the order based on the ant colony algorithm, the factory will monitor the production status of the order in real time;

[0046] Furthermore, based on the shortest path between p types of equipment, the number of various types of idle equipment resources that meet the order in the factory is traversed. When there are multiple idle equipment resources of a certain type of equipment that meet the order requirements, the multiple idle equipment resources of this type are selected for allocation according to the distance algorithm;

[0047] Assume that e=v means the number of equipment resources of type e required in the order is v, d' (e，g)Indicates the path distance between the coordinates of a single device in the e-th category of resources in the order and the node g of the next adjacent category of devices;

[0048] If e is a type of equipment corresponding to a non-last process in order production,

[0049] When the number of idle equipment resources of type e in the factory is greater than v, choose The shortest v idle equipment resources of the e-th type of equipment participate in order production; i represents the i-th device in the e-th class of idle devices; i = 1, 2, 3, ..., w, w is greater than v;

[0050] Path distance formula:

[0051]

[0052] When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production; Indicates the coordinates of the i-th device in the e-th class of idle devices.

[0053] If the eth is a type of equipment corresponding to the last process in the order production,

[0054] When the number of idle equipment resources of the eth category in the factory is greater than v, v idle equipment resources of the eth category are randomly selected to participate in order production;

[0055] When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production;

[0056] Preferably, the factory will monitor the production status of the order in real time, including the following steps:

[0057] S41. First, a base station is set for each workshop in the factory, and the transmission nodes of all equipment in the workshop communicate directly with the central node of the base station;

[0058] S42, assuming that there are M transmission nodes in the current workshop, presetting the transmission time of each node, and establishing a corresponding TDMA time allocation table based on the nodes in the workshop;

[0059] S43, the factory workshop will monitor and control the equipment nodes according to the established TDMA time allocation table;

[0060] Preferably, the factory workshop monitors the device nodes according to the established TDMA time allocation table, including the following steps:

[0061] S431, the time for the base station central node to visit all nodes in the order of the TDMA time allocation table is set as a node cycle;

[0062] S432, the base station broadcasts the generated TDMA time allocation table to each node, and the base station center periodically visits each node in the workshop based on the node cycle;

[0063] S433, the device node enters the receiving state according to the generated TDMA time allocation table, and if a wake-up packet is received, it proceeds to S434, otherwise it proceeds to S435;

[0064] S434, the corresponding node is not in sleep mode, collects data and transmits the collected data to the base station center;

[0065] S435, the corresponding node is in sleep mode, there is no data transmission, and the node enters sleep mode until the end of this cycle;

[0066] S436. The factory workshop will wake up the corresponding equipment according to the received order and based on the TDMA time allocation table, and regularly monitor the awakened equipment based on the TDMA time allocation table.

[0067] Preferably, periodically monitoring the awakened devices based on the TDMA time allocation table comprises the following steps:

[0068] After the base station center in the factory workshop wakes up the device, when accessing the device node in the next cycle, the device node will transmit the current production status of the device to the base station center;

[0069] During the periodic monitoring process of the base station center, if an abnormal condition occurs in a device node, the abnormal condition will be immediately uploaded to the base station center for processing;

[0070] Preferably, the base station center handles the abnormal condition of the equipment including the following steps:

[0071] Based on the TDMA time allocation table, the base station center is always in working state and continuously communicates with nodes of various devices;

[0072] S51. When an abnormal condition occurs in a node of a certain type of equipment, the node of the equipment will urgently occupy the signal transmission line, which will cause continuous data collision with the ongoing communication between the base station and other nodes;

[0073] S52, when the base station detects a collision, it interrupts these continuous collisions in the name of an emergency command, pauses and records the currently communicating nodes, receives data from the device nodes that issue the emergency status, and arranges personnel to handle the abnormal device nodes;

[0074] S53. After the emergency event is handled, the base station will relocate to the node where it was previously paused, and continue to communicate with the node that normally occupies the transmission line at that time.

[0075] Preferably, the factory workshop also regulates the device nodes based on the establishment of the TDMA time allocation table, and the regulation includes:

[0076] The base station center will periodically check the availability of device nodes according to the established TDMA time allocation table;

[0077] When a device node is detected to be lost, the base station center will report the lost device node information and remove the device node from the TDMA time allocation table;

[0078] When a new node needs to be added, the base station center will connect to the new node and insert the device node into the allocated TDMA time allocation table;

[0079] After executing a cycle based on the current TDMA time allocation table, the base station center will update the TDMA time allocation table according to the increase or decrease of equipment in the current cycle.

[0080] (III) Beneficial effects

[0081] Compared with the prior art, the present invention provides a remote real-time monitoring and control method for a smart factory based on the industrial Internet, which has the following beneficial effects:

[0082] 1. The invention establishes the shortest path table between various equipments by using the ant colony algorithm and the interaction between various nodes in the factory, records the routes of the ants by setting a taboo table for each ant, calculates the length of the path passed by each ant, updates the pheromone concentration on the path of each equipment according to the pheromone iteration formula, and finds the shortest path in the number of iterations through continuous iteration.

[0083] 2. The invention determines whether the order is satisfied by processing the order received by the factory, and arranges suitable equipment to complete the order based on the shortest path obtained by the ant colony algorithm for satisfied orders.

[0084] 3. The invention periodically visits each device in the factory, establishes a TDMA time allocation table based on the access order of each device, and strictly accesses the devices according to the TDMA time allocation table, ensuring that only one device communicates with the base station center in the factory at the same time, thereby improving the independence and security of each device.

[0085] 4. The invention realizes the monitoring of abnormal conditions of equipment by performing collision detection in the transmission line. When an abnormal condition occurs in a node of a certain type of equipment, the device node will urgently occupy the signal transmission line, which will cause continuous data collisions with the ongoing communication between the base station and other nodes. When the base station center detects data collision, it means that the device node has an abnormality, which improves the latency of device abnormality detection. BRIEF DESCRIPTION OF THE DRAWINGS

[0086] Figure 1 Schematic diagram of the equipment control process of the smart factory based on the ant colony algorithm of the present invention

[0087] Figure 2 It is a schematic diagram of the equipment monitoring process based on the TDMA allocation table in the smart factory of the present invention. DETAILED DESCRIPTION

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

[0089] This embodiment discloses a remote real-time monitoring and control method for a smart factory based on the industrial Internet, comprising the following steps:

[0090] S1. Classify each device in the factory according to its function, and the same type of devices share one node;

[0091] For example, various equipment for stamping workpieces are classified into one category, various equipment for grinding workpieces are classified into one category, various equipment for cleaning workpieces are classified into one category, and so on.

[0092] S2. Establish the shortest path table between various device nodes based on the ant colony algorithm;

[0093] S3. When the factory detects that an order has arrived, it will allocate idle equipment resources that meet the order based on the equipment resources required for the current order, the idle equipment resources in the current factory, and the shortest path table between various equipment nodes;

[0094] S4. After allocating equipment resources based on the order, the factory will monitor the production status of the order in real time during the production process of the user order;

[0095] S5. When an abnormal situation is detected during the production process of an order, the factory will handle the abnormal situation;

[0096] Preferably, the steps of establishing the shortest path table between various types of device nodes based on the ant colony algorithm are as follows:

[0097] S21, set the current factory has n types of equipment, c i =(x i ,y i )i=1,2,3...n;c j =(x j ,y j )j=1,2,3...n;

[0098] Among them, c i 、c j represents the adjacent i-th and j-th equipment in the factory, (x i ,y i )、(x j ,y j ) represents the node coordinates of two adjacent types of equipment;

[0099] The same type of equipment in a factory is usually placed in the same area. Each area is set as a node, and the distance between two adjacent types of equipment is the distance between the node coordinates of the two types of equipment.

[0100] Furthermore, each region has an entrance and exit, and the coordinates of the nodes are the coordinates of the entrance and exit of the region;

[0101] S22, the distance between the i-th type of equipment and the j-th type of equipment can be expressed as:

[0102]

[0103] S23. Set a taboo table for each ant to record the devices it has walked through. The first position in the taboo table is the device where the ant is located at the initial moment. When all devices are added to the taboo table, it means that the ant has walked through all devices and completed a tour. Set T ij (t) is device c i and device c j The amount of pheromone between , at the initial moment, is:

[0104] T ij (0) = c

[0105] Where c is a constant;

[0106] S24, assume that in the time period (t, t+n) all ants complete a tour, then at time t+n device c i and device c j The pheromone content between can be expressed as:

[0107] Pheromone content iteration formula:

[0108] T ij (t+n)=(1-ρ)·T ij (t)+ΔT ij

[0109] Where ρ represents the volatility coefficient of pheromone between the time periods (t, t+n), then (1-ρ) represents the remaining amount of pheromone, and the volatility coefficient ranges from (0, 1);

[0110] ΔT ij It represents the sum of the pheromone contents released by all ants on the connection path between device i and device j during the time period (t, t+n). It is calculated as follows:

[0111]

[0112] ΔT ij k Indicates that the kth ant is released on device c in this tour i and device c j The pheromone content between is calculated as follows:

[0113]

[0114] Among them, Q is a positive constant, L K represents the path that ant k takes during its tour;

[0115] At time t, ant k from device c i The probability of transfer to other devices can be calculated as follows:

[0116] The formula for calculating the transition probability is:

[0117]

[0118] Among them, η i，j is a heuristic factor calculated as: represents the expected degree of ant transfer from device i to device j, J k (i) indicates that in device c i The set of devices that ant k can choose to transfer to, s represents the set J k (i) is a type of device node in the figure; α is the pheromone importance factor, β is the heuristic function importance factor;

[0119] S25, randomly placing each ant at a different starting point, and for each ant k (k=1, 2, ..., m), determining the next device to be visited according to the transfer probability calculation formula, until all ants have visited all types of devices, that is, a set of paths has been constructed;

[0120] S26. Calculate the length L of the path that each ant passes through K , update the pheromone concentration on each device path according to the pheromone content iteration formula, and at the same time, record the shortest path in the current number of tours;

[0121] S27, constructing a shortest path table according to the shortest path set recorded for each device to start a round trip;

[0122] Preferably, the device resources required for the current order, the idle device resources in the current factory, and the shortest path table between various types of device nodes are used to allocate device resources, including the following steps:

[0123] S31. Search in the factory according to the type of equipment required by the order and the required quantity of each type of equipment;

[0124] S32. When the number of idle equipment in the factory does not meet the order demand, the order is put into a waiting queue and the change of the number of idle equipment in the current factory is retrieved in real time. When the number of idle equipment in the factory meets the order demand, the factory will arrange the corresponding equipment to process the order based on the ant colony algorithm;

[0125] Preferably, the factory arranges corresponding equipment to process the order based on the ant colony algorithm, including the following steps:

[0126] S331, set that there are n types of equipment in the current factory, set p types of equipment required for the current order, p<n;

[0127] S332. It is known that the shortest path of each node obtained based on the ant colony algorithm is unique, p < n, and the shortest path between p types of devices is obtained according to the shortest path table;

[0128] S333. After the factory arranges equipment to process the order based on the ant colony algorithm, the factory will monitor the production status of the order in real time;

[0129] Furthermore, based on the shortest path between p types of equipment, the number of various types of idle equipment resources that meet the order in the factory is traversed. When there are multiple idle equipment resources of a certain type of equipment that meet the order requirements, the multiple idle equipment resources of this type are selected for allocation according to the distance algorithm;

[0130] Assume that e=v means the number of equipment resources of type e required in the order is v, d' (e，g) Indicates the path distance between the coordinates of a single device in the e-th category of resources in the order and the node g of the next adjacent category of devices;

[0131] If e is a type of equipment corresponding to a non-last process in order production,

[0132] When the number of idle equipment resources of type e in the factory is greater than v, select d' (e，g) The shortest v idle equipment resources of the e-th type of equipment participate in order production; i represents the i-th device in the e-th class of idle devices; i = 1, 2, 3, ..., w, w is greater than v;

[0133] Path distance formula:

[0134]

[0135] When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production; Indicates the coordinates of the i-th device in the e-th class of idle devices.

[0136] If the eth is a type of equipment corresponding to the last process in the order production,

[0137] When the number of idle equipment resources of the eth category in the factory is greater than v, v idle equipment resources of the eth category are randomly selected to participate in order production;

[0138] When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production;

[0139] Preferably, the factory will monitor the production status of the order in real time, including the following steps:

[0140] S41. First, a base station is set for each workshop in the factory, and the transmission nodes of all equipment in the workshop communicate directly with the central node of the base station;

[0141] S42, assuming that there are M transmission nodes in the current workshop, presetting the transmission time of each node, and establishing a corresponding TDMA time allocation table based on the nodes in the workshop;

[0142] S43, the factory workshop will monitor and control the equipment nodes according to the established TDMA time allocation table;

[0143] Preferably, the factory workshop monitors the device nodes according to the established TDMA time allocation table, including the following steps:

[0144] S431, the time for the base station central node to visit all nodes in the order of the TDMA time allocation table is set as a node cycle;

[0145] S432, the base station broadcasts the generated TDMA time allocation table to each node, and the base station center periodically visits each node in the workshop based on the node cycle;

[0146] S433, the device node enters the receiving state according to the generated TDMA time allocation table, and if a wake-up packet is received, it proceeds to S434, otherwise it proceeds to S435;

[0147] S434, the corresponding node is not in sleep mode, collects data and transmits the collected data to the base station center;

[0148] S435, the corresponding node is in sleep mode, there is no data transmission, and the node enters sleep mode until the end of this cycle;

[0149] S436. The factory workshop wakes up the corresponding equipment according to the received order and based on the TDMA time allocation table, and regularly monitors the awakened equipment based on the TDMA time allocation table;

[0150] Preferably, periodically monitoring the awakened devices based on the TDMA time allocation table comprises the following steps:

[0151] After the base station center in the factory workshop wakes up the device, when accessing the device node in the next cycle, the device node will transmit the current production status of the device to the base station center;

[0152] During the periodic monitoring process of the base station center, if an abnormal condition occurs in a device node, the abnormal condition will be immediately uploaded to the base station center for processing;

[0153] Preferably, the base station center handles the abnormal condition of the equipment including the following steps:

[0154] Based on the TDMA time allocation table, the base station center is always in working state and continuously communicates with nodes of various devices;

[0155] S51. When an abnormal condition occurs in a node of a certain type of equipment, the node of the equipment will urgently occupy the signal transmission line, which will cause continuous data collision with the ongoing communication between the base station and other nodes;

[0156] S52, when the base station detects a collision, it interrupts these continuous collisions in the name of an emergency command, pauses and records the currently communicating nodes, receives data from the device nodes that issue the emergency status, and arranges personnel to handle the abnormal device nodes;

[0157] S53. After the emergency event is handled, the base station will relocate to the node where it was previously paused, and continue to communicate with the node that normally occupies the transmission line at that time.

[0158] Preferably, the factory workshop also regulates the device nodes based on the establishment of the TDMA time allocation table, and the regulation includes:

[0159] The base station center will periodically check the availability of device nodes according to the established TDMA time allocation table;

[0160] When a device node is detected to be lost, the base station center will report the lost device node information and remove the device node from the TDMA time allocation table;

[0161] When a new node needs to be added, the base station center will connect to the new node and insert the device node into the allocated TDMA time allocation table;

[0162] After executing a cycle based on the current TDMA time allocation table, the base station center will update the TDMA time allocation table according to the increase or decrease of equipment in the current cycle.

[0163] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A remote real-time monitoring and control method for a smart factory based on the industrial Internet, characterized in that: The following steps are involved: S1. Classify each device in the factory according to its function, and the same type of devices share one node; S2. Establish the shortest path table between various device nodes based on the ant colony algorithm; S3. When the factory detects that an order has arrived, it will allocate idle equipment resources that meet the order based on the equipment resources required for the current order, the idle equipment resources in the current factory, and the shortest path table between various equipment nodes; S4. After allocating equipment resources based on the order, the factory will monitor the production status of the order in real time during the production process of the user order; S5. When an abnormal situation is detected during the production process of an order, the factory will handle the abnormal situation; The device resources required for the current order, the idle device resources in the current factory, and the shortest path table between various device nodes are used to allocate device resources, including the following steps: S31. Search in the factory according to the type of equipment required by the order and the required quantity of each type of equipment; S32. When the number of idle equipment in the factory does not meet the order demand, the order is put into a waiting queue and the change of the number of idle equipment in the current factory is retrieved in real time. When the number of idle equipment in the factory meets the order demand, the factory will arrange the corresponding equipment to process the order based on the ant colony algorithm; The factory will arrange corresponding equipment to process the order based on the ant colony algorithm, including the following steps: S331, set the current factory to have n types of equipment, set the current order to have p types of equipment, p < n; S332. It is known that the shortest path of each node obtained based on the ant colony algorithm is unique, p < n, and the shortest path between p types of devices is obtained according to the shortest path table; S333. After the factory arranges equipment to process the order based on the ant colony algorithm, the factory will monitor the production status of the order in real time; Based on the shortest path between p-type devices, the number of various idle device resources in the factory that meet the order is traversed. When there are multiple idle device resources of a certain type of equipment that meet the order requirements, the multiple idle device resources of this type are allocated according to the distance algorithm; Assume that e=v means the number of equipment resources of type e required in the order is v, d' (e，g) Indicates the path distance between the coordinates of a single device in the e-th category of resources in the order and the node g of the next adjacent category of devices; If e is a type of equipment corresponding to a non-last process in order production, When the number of idle equipment resources of type e in the factory is greater than v, choose The shortest v idle equipment resources of the e-th type of equipment participate in order production; i represents the i-th device in the e-th class of idle devices; i = 1, 2, 3, ..., w, w is greater than v; Path distance formula: When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production; Indicates the coordinates of the i-th device in the e-th class of idle devices; If the eth is a type of equipment corresponding to the last process in the order production, When the number of idle equipment resources of the eth category in the factory is greater than v, v idle equipment resources of the eth category are randomly selected to participate in order production; When the number of idle equipment resources of the eth category in the factory is equal to v, all the idle equipment resources of the eth category are involved in order production.

2. According to the method of remote real-time monitoring and control of a smart factory based on industrial Internet according to claim 1, it is characterized by: The steps of establishing the shortest path table between various device nodes based on the ant colony algorithm are as follows: S21, set the current factory has n types of equipment, c i =(x i ,y i )i=1,2,3...n; Among them, c i 、c j represents the adjacent i-th and j-th equipment in the factory, (x i ,y i )、(x j ,y j ) represents the node coordinates of two adjacent types of equipment; S22, device c i and device c j The distance between can be expressed as: S23. Set a taboo table for each ant to record the devices it has walked through. The first position in the taboo table is the device where the ant is located at the initial moment. When all devices are added to the taboo table, it means that the ant has walked through all devices and completed a tour. Set T ij (t) is device c i and device c j The amount of pheromone between , at the initial moment, is: T ij (0)=c Where c is a constant; S24, assume that in the time period (t, t+n) all ants complete a tour, then at time t+n device c i and device c j The pheromone content between can be expressed as: Pheromone content iteration formula: T ij (t+n)=(1-ρ)·T ij (t)+ΔT ij Where ρ represents the volatility coefficient of pheromone between the time periods (t, t+n), then (1-ρ) represents the remaining amount of pheromone, and the volatility coefficient ranges from (0, 1); ΔT ij It represents the sum of the pheromone contents released by all ants on the connection path between device i and device j during the time period (t, t+n). It is calculated as follows: ΔT ij k Indicates that the kth ant is released on device c in this tour i and device c j The pheromone content between is calculated as follows: Among them, Q is a positive constant, L K represents the path that ant k takes during its tour; At time t, ant k from device c i The probability of transfer to other devices can be calculated as follows: The formula for calculating the transition probability is: Among them, η i，j is a heuristic factor calculated as: represents the expected degree of ant transfer from device i to device j, J k (i) indicates that in device c i The set of devices that ant k can choose to transfer to, s represents the set J k (i) is a type of device node in the figure; α is the pheromone importance factor, β is the heuristic function importance factor; S25, randomly placing each ant at a different starting point, and for each ant k (k=1, 2, ..., m), determining the next device to be visited according to the transfer probability calculation formula, until all ants have visited all types of devices, that is, a set of paths has been constructed; S26. Calculate the length L of the path that each ant passes through K , update the pheromone concentration on each device path according to the pheromone content iteration formula, and at the same time, record the shortest path in the current number of tours; S27, constructing a shortest path table based on the shortest path set recorded for each device to start a round trip.

3. According to the method of remote real-time monitoring and control of a smart factory based on industrial Internet according to claim 1, it is characterized in that: The factory will monitor the production status of the order in real time, including the following steps: S41. First, a base station is set for each workshop in the factory, and the transmission nodes of all equipment in the workshop communicate directly with the central node of the base station; S42, assuming that there are M transmission nodes in the current workshop, presetting the transmission time of each node, and establishing a corresponding TDMA time allocation table based on the nodes in the workshop; S43. The factory workshop will monitor and control the equipment nodes according to the established TDMA time allocation table.

4. According to the method of remote real-time monitoring and control of a smart factory based on industrial Internet according to claim 3, it is characterized in that: The factory workshop will monitor the device nodes according to the established TDMA time allocation table, including the following steps: S431, the time for the base station central node to visit all nodes in the order of the TDMA time allocation table is set as a node cycle; S432, the base station broadcasts the generated TDMA time allocation table to each node, and the base station center periodically visits each node in the workshop based on the node cycle; S433, the device node enters the receiving state according to the generated TDMA time allocation table, and if a wake-up packet is received, it proceeds to S434, otherwise it proceeds to S435; S434, the corresponding node is not in sleep mode, collects data and transmits the collected data to the base station center; S435, the corresponding node is in sleep mode, there is no data transmission, and the node enters sleep mode until the end of this cycle; S436. The factory workshop will wake up the corresponding equipment according to the received order and based on the TDMA time allocation table, and regularly monitor the awakened equipment based on the TDMA time allocation table.

5. According to the method of remote real-time monitoring and control of a smart factory based on the industrial Internet according to claim 4, it is characterized in that: The periodic monitoring of the awakened device based on the TDMA time allocation table comprises the following steps: After the base station center in the factory workshop wakes up the device, when accessing the device node in the next cycle, the device node will transmit the current production status of the device to the base station center; During the periodic monitoring process of the base station center, if an abnormal condition occurs in a device node, the abnormal condition will be uploaded to the base station center for processing.

6. According to the method of remote real-time monitoring and control of a smart factory based on the industrial Internet according to claim 5, it is characterized in that: The factory will handle the abnormal situation by the following steps: Based on the TDMA time allocation table, the base station center is always in working state and continuously communicates with nodes of various devices; S51. When an abnormal condition occurs in a node of a certain type of equipment, the node of the equipment will urgently occupy the signal transmission line, which will cause continuous data collision with the ongoing communication between the base station and other nodes; S52, when the base station detects a collision, it interrupts these continuous collisions in the name of an emergency command, pauses and records the currently communicating nodes, receives data from the device nodes that issue the emergency status, and arranges personnel to handle the abnormal device nodes; S53. After the emergency event is handled, the base station will relocate to the node where it was previously paused, and continue to communicate with the node that normally occupies the transmission line at that time.

7. An application for implementing the method as constructed in any one of claims 1 to 6, characterized in that: Realize remote real-time monitoring and control of smart factories.

Images