A smart elevator dispatching system and method based on number recognition

Abstract

The present invention discloses an intelligent elevator dispatching system and method based on number recognition, wherein the system comprises a plurality of elevators, an elevator control subsystem, an elevator monitoring subsystem and a floor monitoring subsystem; the elevator monitoring subsystem deploys a camera in each elevator to identify the real-time number of people in the elevator, and transmits the data to a server through a gateway and a router; the elevator control subsystem monitors the elevator status in real time through the elevator BA, reports the elevator status data to the server, and receives the server control command through the elevator controller to control the elevator to reach the command floor; the floor monitoring subsystem deploys floor cameras in the waiting area of ​​each floor to identify the real-time number of people in the waiting area of ​​the current floor, and sends the data to the server through the floor gateway; the server performs elevator dispatching control of a plurality of elevators through an elevator dispatching control algorithm according to the elevator up and down states and elevator call requests, thereby effectively improving the elevator full load rate and reducing the elevator stop time.

Description

Technical Field

[0001] The present invention relates to the technical field of elevator control, and in particular to an intelligent elevator dispatching system and method based on number recognition. Background Art

[0002] With the continuous development of electronic technology and the widespread application of various sensors, the intelligent control technology of elevators has also been greatly improved. The elevator dispatching system is a part of the elevator control, which determines which elevator serves which request on which floor. The existing dispatching methods are usually solved based on the current requests in the system. The system can only sense whether there is an up or down request on a certain floor, but it cannot sense the number of up or down requests. With the traditional dispatching method, if the number of requests is not taken into account, passengers will pile up on some floors, which is very common in rush hours and other situations.

[0003] Chinese invention patent CN 113716407 B discloses an adaptive elevator dispatching method and an elevator dispatching system, which divides the elevator waiting area of ​​the floors other than the bottom and top floors into an upward waiting area and a downward waiting area, obtains real-time video data of each waiting area through a camera, detects the number of people waiting for the elevator in the upward waiting area and the downward waiting area of ​​each floor, and determines whether the number of people waiting for the elevator in the upward waiting area and the downward waiting area of ​​each floor is greater than a preset threshold. If it is greater, the priority of the elevator call request corresponding to the waiting area exceeding the preset threshold is increased, and the elevator will give priority to the elevator call request with a high priority. If there is no high priority request, the elevator will operate in normal mode. The elevator dispatching system sets the priority according to the number of people and dispatches the elevator, but it cannot solve the problem of coordinated dispatching of multiple elevators. The dispatching system only detects the number of people in the waiting area, and does not perform comprehensive dispatching in combination with the number of people in the elevator. At the same time, when there are multiple elevators in a building, a more intelligent elevator dispatching method is needed to perform effective intelligent dispatching according to the number of people and needs on each floor. Summary of the invention

[0004] The problem to be solved by the present invention is to provide an intelligent elevator dispatching system and method based on number of people recognition, so that when there are multiple elevators in a building, effective comprehensive intelligent dispatching can be carried out according to the number of people in the waiting area and the number of people in the elevator.

[0005] The present invention adopts the following technical solution: an intelligent elevator dispatching system based on number recognition, comprising: multiple elevators, an elevator control subsystem, an elevator monitoring subsystem, a floor monitoring subsystem, a router, and a server;

[0006] The elevator monitoring subsystem includes: an elevator camera and an elevator camera gateway. The elevator camera is deployed in each elevator, and uses a crowd recognition algorithm to identify and calculate the real-time number of people in the elevator. The elevator data is transmitted to the server through the elevator camera gateway via a router;

[0007] The elevator control subsystem includes: an elevator controller, an elevator BA, and an elevator gateway. The elevator BA monitors the elevator status in real time and reports the current elevator status data to the server through the elevator gateway and the router; the elevator controller receives the control command from the server and controls the elevator to reach the command floor;

[0008] The floor monitoring subsystem includes floor cameras and floor gateways, which are deployed in the waiting area of ​​each floor. The floor cameras identify and calculate the real-time number of people in the waiting area of ​​the current floor through a crowd recognition algorithm, and send the waiting area data to the server through the floor gateway.

[0009] Preferably, the people recognition algorithm performs real-time video processing through the camera, including motion detection and face detection, and counts and prompts the entry and exit of faces;

[0010] The motion detection is achieved by calculating and comparing the absolute difference between the grayscales of two consecutive frames of images, performing threshold processing on the difference image, converting the area with larger difference into white, which is regarded as the motion area, and the remaining area into black; using morphological operations to enhance the features of the motion area, and extracting the contours in the image through contour detection to find the moving object.

[0011] The technical solution of the present invention also provides: a smart elevator dispatching method based on number recognition, applied to any of the above elevator dispatching systems, comprising the following steps:

[0012] S1. Collect the real-time number of people in each elevator X through the camera in the elevator i , the number of people waiting in the waiting area of ​​each floor is collected in real time through the cameras on each floor. The number of people waiting on the jth floor is b j ;

[0013] i = 1, 2, ..., n, j = 1, 2, ..., m, n is the number of elevators deployed, m is the total number of floors where the elevators stop;

[0014] S2. Calculate the remaining number of people that each elevator can carry. i :a i =C i -X i , C i Configure the number of passengers per elevator;

[0015] S3. Each elevator feeds back its status to the server through the elevator BA, including: elevator going up, going down, and floor information.

[0016] S4. Based on the up / down status of the elevators and the up / down call requests, the server jointly controls the up / down of multiple elevators through the elevator dispatching control algorithm, calculates the number of people inside the elevator and the number of people waiting on each floor in real time by monitoring the operating status and speed of each elevator, and finds the shortest time for passengers to take the elevator.

[0017] Preferably, for the elevator dispatching control algorithm, assume there are T elevators running, denoted as: T1, T2, T3... The number of people carried by each elevator is denoted as: C1, C2, C3... The number of floors is assumed to be: a,..., h, i, j, k, l,... When there is a call request on the j-th floor and the number of waiting people is b j , with the goal of going up, the server conducts elevator dispatching analysis, including the following sub-steps:

[0018] S4.1. The server determines whether there is an elevator going up that is about to reach the j-th floor. If so, the following controls are carried out:

[0019] S4.1.1. Currently, there is an elevator T2 going up. The number of people inside elevator T2 is C2 and it is full. Then elevator T2 does not stop at the j-th floor and continues to go up directly.

[0020] S4.1.2. Currently, there is an elevator T3 going up. The number of people inside elevator T3 is M, and M < C3. The server sends an elevator dispatching signal to control elevator T3 to go to the j-th floor, and recalculates the number of people N who can take the elevator when elevator T3 reaches the j-th floor. N = C3 - M.

[0021] S4.1.3. If N ≥ b j , then elevator T3 can pick up all b j passengers on the j-th floor. When elevator T3 reaches the j-th floor, all passengers will enter the elevator to complete the upward elevator ride.

[0022] S4.1.4. If b j > N, then elevator T3 can pick up some passengers on the j-th floor, and the remaining number of people is S j , S j = b j - N; when elevator T3 reaches the j-th floor, some passengers will enter the elevator to complete the upward ride. At this time, the number of people waiting on the j-th floor is S j ;

[0023] S4.1.5. Recalculate the number of people S waiting on the j-th floor j , and repeat steps S4.1.1 to S4.1.4 until S j = 0;

[0024] S4.2. The server determines that there is no elevator that is about to reach the j-th floor and going up, and calculates the status and the floor position of each elevator. The specific method is as follows:

[0025] S4.2.1. If the T2 elevator is on the h-th floor, in the downwards state, with the destination floor being the 1st floor, and the number of people M2 inside the T2 elevator being greater than 0, then it directly continues to go downwards;

[0026] S4.2.2. If the T2 elevator is on the h-th floor, in the downwards state, and the destination floor is greater than or equal to the j-th floor, the server sends an elevator dispatching signal to control the T2 elevator to go to the destination floor and then go to the j-th floor after reaching the destination floor. After the T2 elevator reaches the j-th floor, recalculate the number of people that the T2 elevator can accept for boarding, and repeat steps S4.1.3 to S4.1.5;

[0027] S4.2.3. If the T2 elevator is on the h-th floor, in the downwards state, and the destination floor is less than the j-th floor, the server sends an elevator dispatching signal to control the T2 elevator to go to the j-th floor, and calculate the number of people N2 that the T2 elevator can reach the j-th floor to accept for boarding. N2 = C2 - M2, and repeat steps S4.1.3 to S4.1.5;

[0028] S4.3. If the floors where the T elevators are located are different and the up / down states are also different, the server calculates the time taken for each of the T elevators to reach the j-th floor respectively, and sends an elevator dispatching signal to control the elevator with the shortest time taken to go to the j-th floor. The running speed of the elevator is v, and the time t taken for the elevator to pass through the distance s of each floor is t = s / v. The calculation rule for the time taken for the elevator to reach the j-th floor is as follows:

[0029] S4.3.1. If there is an elevator going up, which is on the h-th floor, and the current destination floor is h7, h7 < j, the elevator goes up to the destination floor and then continues to go up to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T1 = (j - h7)t;

[0030] S4.3.2. If there is an elevator going up, which is on the h-th floor, h < j, and the destination floor is h9, h9 > j, control the elevator to first reach h9 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T2 = (h9 - h)t + (h9 - j)t;

[0031] S4.3.3. If there is an elevator going down, which is on the h-th floor, h > j, and the destination floor is h8, h8 > j, control the elevator to first reach h8 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T3 = (h - j)t;

[0032] S4.3.4. If there is an elevator going down, which is on the h-th floor, h > j, and the destination floor is h2, h2 < j, control the elevator to first reach h2 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T4 = (h - h2)t + (j - h2)t;

[0033] S4.3.5. The server calculates T1, T2, T3, and T4 in real time, compares the values, sorts them from small to large, and sends an elevator dispatch signal to the elevator with the shortest time.

[0034] The technical solution of the present invention also provides: an electronic device, comprising:

[0035] one or more processors;

[0036] a storage device having one or more programs stored thereon;

[0037] When the one or more programs are executed by the one or more processors, the one or more processors implement any of the above-mentioned intelligent elevator scheduling methods based on number of people recognition.

[0038] The technical solution of the present invention also provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps in any of the above-mentioned intelligent elevator scheduling methods based on number recognition are implemented.

[0039] Compared with the prior art, the present invention adopts the above technical solution and has the following technical effects:

[0040] The intelligent elevator dispatching system based on number recognition of the present invention performs video processing based on the cameras in the elevator and the waiting area, and counts the number of people in the elevator and the waiting area in real time through motion detection and face detection. According to the remaining number of people that the elevator can carry and the up and down status of the current elevator, multiple elevators are jointly controlled, and the elevator with the same direction as the elevator call request and capable of carrying the largest number of waiting people is given priority, and the elevator with the shortest time is given priority, which effectively improves the full load rate of the elevator and reduces the time consumed by the elevator to stop. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 This is a block diagram of the intelligent elevator dispatching system of the present invention;

[0042] Figure 2 This is the overall structure diagram of the intelligent elevator dispatching system of the present invention;

[0043] Figure 3 This is a schematic diagram of the server connection structure of the intelligent elevator dispatching system of the present invention;

[0044] Figure 4 This is a flow chart of the intelligent elevator dispatching method of the present invention;

[0045] Explanation of symbols in the figure: 1- camera in the elevator, 2- camera gateway in the elevator, 3- elevator controller, 4- elevator BA, 5- elevator gateway, 6- router, 7- floor camera, 8- floor gateway, 9- server. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the application is further elaborated in detail below in conjunction with the accompanying drawings. The described embodiments are only a part of the embodiments involved in the present invention. All non-innovative embodiments of other researchers in the field on this embodiment belong to the protection scope of the present invention. At the same time, for the step numbering in the embodiment of the present invention, it is only set for the convenience of explanation, and the order between the steps is not limited in any way. The execution order of each step in the embodiment can be adaptively adjusted according to the understanding of those skilled in the art.

[0047] In one embodiment of the present invention, a smart elevator dispatching system based on number recognition, such as Figure 1 As shown, it includes: multiple elevators, a floor monitoring subsystem, a router 6 and a server 9, and each elevator includes an elevator control subsystem and an in-elevator monitoring subsystem.

[0048] Furthermore, the in-elevator monitoring subsystem includes: an in-elevator camera 1 and an in-elevator camera gateway 2; the elevator control subsystem includes: an elevator controller 3, an elevator BA4, and an elevator gateway 5; and the floor monitoring subsystem includes: a floor camera 7 and a floor gateway 8.

[0049] Specifically, in this embodiment, Figure 2 As shown, there are 3 elevators, router 6 is a 4G router, and floor gateway 8 is a 4G gateway.

[0050] Furthermore, if Figure 3 As shown, the elevator monitoring subsystem is deployed in each elevator, wherein an elevator camera 1 is deployed inside each elevator for identifying and calculating the real-time number of people in the elevator, and transmitting the elevator number data through the elevator camera gateway 2 and the 4G router to the server 9.

[0051] In the floor monitoring subsystem, floor cameras 7 are deployed in the waiting area of ​​each floor. The floor cameras 7 identify and calculate the real-time number of people in the waiting area of ​​the current floor, and send the data on the number of people in the waiting area to the server 9 through the 4G gateway.

[0052] Preferably, in this embodiment, the elevator camera 1 and the floor camera 7 use a number recognition algorithm to perform corresponding processing based on the face detection results inside the elevator and in the waiting area. If a face is detected, it is recorded. If no face is detected currently but has been detected before, it is considered that a face has moved out, and counting is performed and prompt information is displayed.

[0053] Specifically, the people recognition algorithm can realize real-time video processing through the camera, including motion detection and face detection, and count and prompt the entry and exit of the face. The algorithm detects motion by comparing the grayscale difference between two consecutive frames. This is achieved by calculating the absolute difference (cv2.absdiff) between the two frames, thresholding the difference image (cv2.threshold), converting the area with larger difference (i.e., the moving area) to white and other areas to black. At the same time, morphological operations (such as expansion cv2.dilate) are used to enhance the features of the moving area so that moving objects can be found more easily through contour detection. The cv2.findContours method is used to detect and extract contours in the image, which correspond to moving objects.

[0054] In the elevator control subsystem, the elevator status is monitored in real time through the elevator BA4, and the current elevator status data is reported to the server 9 through the elevator gateway and the 4G router 6; the elevator controller 3 promptly receives and responds to the control instructions of the server 9 to control the elevator to the command floor. Among them, the elevator BA4 can be used to control most elevators on the market.

[0055] When in use, the intelligent elevator system based on the above number recognition performs elevator dispatching, the method is as follows Figure 4 As shown, first calculate the number of people:

[0056] 1. Collect the real-time number of people in each elevator X through the camera inside the elevator i , the number of people waiting in the waiting area of ​​each floor is collected in real time through the cameras on each floor. The number of people waiting on the jth floor is b j ;

[0057] Wherein, i=1,2,...,n, j=1,2,...,m, n is the number of deployed elevators, and m is the total number of floors where the elevators stop.

[0058] 2. Calculate the remaining number of people that each elevator can carry i :a i =C i -X i , C i Configure the number of passengers per elevator.

[0059] 3. Each elevator feeds back elevator status data to the server control center through the elevator BA, including: elevator up, down, and floor information.

[0060] 4. The server controls the dispatch of multiple elevators through the dispatch control algorithm according to the elevator up / down status and up / down elevator call requests.

[0061] Scenario 1: Assume that someone calls the elevator on the 3F floor, and the floor camera obtains the number of people waiting b3, and the destination is down. The server analyzes the elevator status data fed back by each system and performs elevator dispatch control according to the elevator dispatch control algorithm. The specific possibilities include the following:

[0062] 1. If the server cannot detect an elevator that is currently going down, it will randomly send an elevator from the idle elevators to go up. If there is no idle elevator, it will send an elevator after the elevator completes the current up task.

[0063] 2. The server detects that the first elevator is going down, and the number of people that the first elevator can currently carry is a1>b3. The server sends a command to the elevator controller of the first elevator to control the first elevator to go to the third floor to pick up b3 people.

[0064] 3. The server detects that at least the first elevator is going down, and the number of people that the first elevator can currently carry is a1<b j , the server sends a command to the elevator controller of the first elevator, giving priority to controlling the first elevator to go to the third floor to pick up a1 people, and the remaining number of waiting people is b3-a1;

[0065] 4. The server continues to check the elevator status and sends another elevator to pick up the number of people b3-a1.

[0066] Scenario 2: The elevator dispatching control algorithm jointly controls the up / down movement of multiple elevators (a, b, c...), and can monitor the operating status and speed of each elevator. Because the elevator's operating speed v is basically constant, the time t for the elevator to pass each floor distance s is constant. The advantage of the elevator dispatching algorithm is that it can calculate the number of people in the elevator and the number of people waiting on the floor in real time, and find the shortest time for passengers to take the elevator.

[0067] Assume that there are T elevators in operation in a scenario (T1, T2, T3...), the number of people in each elevator is set to C (C1, C2, C3...), the number of floors is assumed to be (...h, i, j, k, l...), when there is an elevator call on the jth floor, the number of people waiting is b j , the target is uplink, the server performs ladder analysis, including the following sub-steps:

[0068] S4.1. The server determines whether there is an elevator that is about to arrive at the jth floor and go up according to the elevator dispatching control algorithm. If so, the server performs the following steps:

[0069] S4.1.1, elevator T2 is going up, and the number of people in elevator T2 is C2, which is full, then elevator T2 does not stop at floor j, and continues to go up directly;

[0070] S4.1.2. For the up elevator No. T3, where the number of people inside elevator T3 is M (M < C3), the server sends an elevator allocation signal to control elevator T3 to go to the j-th floor, and then recalculates the number of people who can board elevator T3 when it reaches the j-th floor. At this time, the number of people who can board elevator T3 is N = C3 - M;

[0071] S4.1.3. If N ≥ b j , then elevator T3 can pick up all b j people on the j-th floor. When elevator T3 reaches the j-th floor, all passengers will enter the elevator to complete the upward ride;

[0072] S4.1.4. If b j > N, then elevator T3 can pick up some people on the j-th floor, and the remaining number of people S j＝ is b j - N. When elevator T3 reaches the j-th floor, some passengers will enter the elevator to complete the upward ride. At this time, the number of people waiting on the j-th floor is S j ;

[0073] S4.1.5. The server recalculates the number of people waiting on the j-th floor S j , and repeats steps S4.1.1 to S4.1.4 until S j = 0.

[0074] S4.2. The server determines that there is no upcoming up elevator reaching the j-th floor according to the elevator allocation control algorithm, and calculates the status and floor position of each elevator as follows:

[0075] S4.2.1. If elevator T2 is on the h-th floor, in the down state, and the destination floor is the 1st floor, and it is calculated that there are people inside elevator T2, then it continues to go down directly;

[0076] S4.2.2. If elevator T2 is on the h-th floor, in the down state, and the destination floor is the j + 1-th floor, the server sends an elevator allocation signal to control elevator T2 to go to the j-th floor, and then recalculates the number of people who can board elevator T2 when it reaches the j-th floor. At this time, the number of people who can board elevator T2 is N2 = C2 - M2, and repeats steps S4.1.3 to S4.1.5;

[0077] S4.2.3. If elevator T2 is on the h-th floor, in the down state, and the destination floor is the j - 1-th floor, the server sends an elevator allocation signal to control elevator T2 to go to the j-th floor, and then recalculates the number of people who can board elevator T2 when it reaches the j-th floor. At this time, the number of people who can board elevator T2 is N2 = C2 - M2, and repeats steps S4.1.3 to S4.1.5;

[0078] S4.3. If the floor positions of the T elevators are h1, k2, i3, j4, i respectively1、 For different floors, the states are also different. Some elevators are going up and some are going down. Then, the elevator with the shortest time used inside T elevators will be calculated, and the elevator dispatch signal will be sent to this elevator. The time calculation rule for reaching the j-th floor is calculated according to the following steps:

[0079] S4.3.1. If there is an elevator going up, located on the h-th floor, and the target floor is h7 (h7 < j), at this time, the elevator needs to go up for a period to reach the j-th floor to pick up passengers. The time used to reach the j-th floor is T 1＝ (j - h7)t;

[0080] S4.3.2. If there is an elevator going up, located on the h-th floor (h < j), and the target floor is h9 (h9 > j), at this time, the elevator needs to first reach h 9, and then come down to the j-th floor to pick up passengers. The time used to reach the j-th floor is T 2＝ (h9 - h)t + (h9 - j)t;

[0081] S4.3.3. If there is an elevator going down, located on the h-th floor (h > j), and the target floor is h8 (h8 > j), at this time, the elevator needs to first reach h 8， and then go down to the j-th floor to pick up passengers. The time used to reach the j-th floor is T 3＝ (h - j)t;

[0082] S4.3.4. If there is an elevator going down, located on the h-th floor (h > j), and the target floor is h2 (h2 < j), at this time, the elevator needs to first reach h2, and then go down to the j-th floor to pick up passengers. The time used to reach the j-th floor is T 4＝ (h - h2)t + (j - h2)t;

[0083] S4.3.5. The system will calculate T1, T2, T3, T in real time 4， Compare the numerical values, sort them in ascending order of the numerical values, and send the optimal value as the elevator dispatch signal.

[0084] In an embodiment of the present invention, an electronic device is further provided, including: one or more processors; a storage device on which one or more programs are stored; when the one or more programs are executed by the one or more processors, the one or more processors implement the intelligent elevator dispatching method based on number recognition described in any of the above embodiments.

[0085] In an embodiment of the present invention, a computer-readable storage medium is further provided, on which a computer program is stored. When the program is executed by a processor, the steps in any of the above embodiments of the intelligent elevator dispatching method based on number recognition are implemented.

[0086] In summary, the intelligent elevator dispatching method based on number recognition of the present invention can simultaneously count the number of people in the elevator and the number of people in the waiting area, and prioritize the dispatching of elevators that are in the same direction as the elevator call request and can carry the largest number of waiting people according to the remaining number of people that the elevator can carry and the current up and down status of the elevator. The dispatching method can also prioritize the elevator that takes the shortest time, thereby increasing the elevator's full load rate and reducing the time spent on elevator stops.

[0087] 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 principle of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A smart elevator dispatching system based on number recognition, characterized in that: include: A plurality of elevators, an elevator control subsystem, an elevator monitoring subsystem, a floor monitoring subsystem, a router (6), and a server (9); The elevator monitoring subsystem comprises: an elevator camera (1) and an elevator camera gateway (2). The elevator camera (1) is deployed in each elevator to identify and calculate the number of people in the elevator in real time, and transmits the elevator data to the server (9) through the elevator camera gateway (2) and a router (6); The elevator control subsystem comprises: an elevator controller (3), an elevator BA (4), and an elevator gateway (5); the elevator BA (4) monitors the elevator status in real time and reports the current elevator status data to the server through the elevator gateway and a router (6); the elevator controller (3) receives a control instruction from a server (9) and controls the elevator to reach the instruction floor; The floor monitoring subsystem is deployed in the waiting area of ​​each floor, and comprises: a floor camera (7) and a floor gateway (8). The floor camera (7) identifies and calculates the real-time number of people in the waiting area of ​​the current floor, and sends the waiting area data to the server (9) through the floor gateway (8).

2. The intelligent elevator dispatching system based on number recognition according to claim 1 is characterized in that: The elevator camera (1) is connected to the elevator camera gateway (2), collects images inside the elevator, calculates the real-time number of people inside the elevator through a number recognition algorithm, and caches the collected data through the elevator camera gateway (2); The floor camera (7) is connected to the floor gateway (8) to collect images of the waiting areas on each floor, calculate the real-time number of people in the waiting area through a number recognition algorithm, and cache and transmit the waiting area data through the floor gateway (8) in the elevator.

3. The intelligent elevator dispatching system based on number recognition according to claim 2 is characterized in that: The people recognition algorithm performs real-time video processing through the camera, including motion detection and face detection, and counts and prompts the entry and exit of faces; The motion detection is achieved by calculating and comparing the absolute difference between the grayscales of two consecutive frames of images, performing threshold processing on the difference image, converting the area with larger difference into white, which is regarded as the motion area, and the remaining area into black; using morphological operations to enhance the features of the motion area, and extracting the contours in the image through contour detection to find the moving object.

4. The intelligent elevator dispatching system based on number recognition according to claim 1 is characterized in that: The elevator BA (4) is connected to the elevator controller (3) and the elevator gateway (5) and is used for real-time monitoring and collecting elevator status data, including: elevator up, elevator down, and current floor.

5. The intelligent elevator dispatching system based on number recognition according to claim 4 is characterized in that: The elevator controller (3) is connected to the elevator internal control panel and the elevator BA (4), registers the current floor of the elevator and the floor on which the elevator internal control panel is pressed, receives control instructions sent by the server (9), and controls the elevator to reach the instruction floor according to the instructions.

6. The intelligent elevator dispatching system based on number recognition according to claim 1 is characterized in that: The elevator gateway (5), floor gateway (8) and server (9) are connected to the router (6) via wired or wireless means to centrally send and receive data within the elevator, floor waiting area data, and server control data.

7. A smart elevator dispatching method based on number recognition, applied to the elevator dispatching system according to any one of claims 1 to 6, characterized in that: The steps include: S1. Collect the real-time number of people in each elevator X through the camera in the elevator i , the number of people waiting in the waiting area of ​​each floor is collected in real time through the cameras on each floor. The number of people waiting on the jth floor is b j ; i = 1, 2, ..., n, j = 1, 2, ..., m, n is the number of elevators deployed, m is the total number of floors where the elevators stop; S2. Calculate the remaining number of people that each elevator can carry. i :a i =C i -X i , C i Configure the number of passengers per elevator; S3, each elevator feeds back the elevator status to the server through the elevator BA, including: elevator up, elevator down and current floor information; S4. The server jointly controls the up / down operation of multiple elevators through the elevator dispatching control algorithm according to the up / down states of the elevators and the up / down elevator call requests, and calculates the number of people inside the elevator and the number of people waiting on each floor in real time by monitoring the operation status and speed of each elevator, so as to find the shortest time for passengers to take the elevator.

8. The intelligent elevator dispatching method based on number recognition according to claim 7 is characterized in that: In step S4, the elevator dispatching control algorithm assumes that there are T elevators in operation, denoted as: T1, T2, T3..., the number of people loaded in each elevator is: C1, C2, C3..., the number of floors is assumed to be: a,..., h, i, j, k, l,..., when there is an elevator call request on the jth floor, the number of people waiting is b j , the target is uplink, the server performs ladder analysis, including the following sub-steps: S4.

1. The server determines whether there is an upward elevator that is about to reach the j-th floor. If so, the following controls are performed: S4.1.

1. Currently, there is an upward elevator numbered T2, and the number of people inside the T2 elevator is C2, which is full. Then, the T2 elevator does not stop at the j-th floor and directly continues to go up. S4.1.

2. Currently, there is an upward elevator numbered T3, and the number of people inside the T3 elevator is M, where M < C3. The server sends an elevator dispatching signal to control the T3 elevator to go to the j-th floor, and then recalculates the number of people N who can take the elevator when the T3 elevator reaches the j-th floor. N = C3 - M. S4.1.

3. If N≥b j , then elevator T3 can lift b on the j floor j All passengers are picked up, and when the T3 elevator reaches the jth floor, all passengers will enter the elevator to complete the upward ride; S4.1.4, if b j >N, then elevator T3 can take away some passengers on floor j, and the remaining number is S j , S j =b j -N; When the T3 elevator reaches the j floor, some passengers enter the elevator to complete the upward journey. At this time, the number of people waiting on the j floor is S j ; S4.1.

5. Recalculate the number of people waiting on the jth floor S j Repeat steps S4.1.1 to S4.1.4 until S j =0; S4.

2. The server determines that there is no upward elevator that is about to reach the j-th floor, and calculates the status and floor position of each elevator. The specific method is as follows: S4.2.

1. If the T2 elevator is on the h-th floor, in the downward state, and the target floor is the 1st floor, and the number of people M2 inside the T2 elevator is greater than 0, then it directly continues to go down. S4.2.

2. If the T2 elevator is on the h-th floor, in the downward state, and the target floor is greater than or equal to the j-th floor, the server sends an elevator dispatching signal to control the T2 elevator to go to the target floor and then to the j-th floor after reaching the target floor. After the T2 elevator reaches the j-th floor, recalculate the number of people who can take the elevator in the T2 elevator, and repeat steps S4.1.3 to S4.1.

5. S4.2.

3. If the T2 elevator is on the h-th floor, in the downward state, and the target floor is less than the j-th floor, the server sends an elevator dispatching signal to control the T2 elevator to go to the j-th floor, and calculate the number of people N2 who can reach the j-th floor to take the elevator. N2 = C2 - M2, and repeat steps S4.1.3 to S4.1.

5. S4.

3. If the floors where the T elevators are located are different and their up / down states are also different, the server calculates the time taken for each of the T elevators to reach the j-th floor respectively, and sends an elevator dispatching signal to control the elevator with the shortest time taken to go to the j-th floor. The running speed of the elevator is v, and the time t taken for the elevator to pass through the distance s of each floor is t = s / v. The calculation rule for the time taken for the elevator to reach the j-th floor is as follows: S4.3.

1. If there is an elevator going up and it is on the h-th floor, and the current target floor is h7, where h7 < j, the elevator goes up to the target floor and then continues to go up to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T1 = (j - h7)t. S4.3.

2. If there is an elevator going up and it is on the h-th floor, where h < j, and the target floor is h9, where h9 > j, control the elevator to first reach h9 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T2 = (h9 - h)t + (h9 - j)t. S4.3.

3. If there is an elevator going down and it is on the h-th floor, where h > j, and the target floor is h8, where h8 > j, control the elevator to first reach h8 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T3 = (h - j)t. S4.3.

4. If the elevator is going down and is on the h-th floor where h > j, and the destination floor is h2 where h2 < j, control the elevator to first reach h2 and then go down to the j-th floor to pick up passengers. The time taken to reach the j-th floor is T4 = (h - h2)t + (j - h2)t; S4.3.

5. The server calculates T1, T2, T3, and T4 in real time, compares the numerical values, sorts them in ascending order, and sends an elevator dispatching signal to the elevator with the shortest time used.

9. An electronic device, characterized in that: Including: One or more processors; A storage device storing one or more programs thereon; When the one or more programs are executed by the one or more processors, the one or more processors implement the method for intelligent elevator dispatching based on number recognition as described in any one of claims 7 to 8.

10. A computer-readable storage medium, characterized in that: Storing a computer program thereon, and when the program is executed by a processor, implementing the steps in the method for intelligent elevator dispatching based on number recognition as described in any one of claims 7 to 8.

Images