Dynamic call method, device, medium, elevator controller and system

Abstract

The application discloses a dynamic elevator calling method, device, medium, elevator controller and system. The elevator calling method comprises the following steps: receiving an elevator calling request, and obtaining a selectable elevator list in a task pool; calculating the arrival time of each selectable elevator at the elevator calling floor, and selecting the elevator with the shortest arrival time as a response elevator; during the response process of the response elevator, the reachable time of the response elevator and the reachable time of other selectable elevators are calculated in real time, and it is determined whether the response elevator is the optimal elevator at the current time according to the reachable time; if yes, the current response elevator is maintained; if no, the response elevator is re-distributed. The application is guided by the reachable time of the selectable elevator, the selectable elevator with the shortest arrival time is selected as the response elevator, and the change of the reachable time of the response elevator is monitored in real time during the dispatching process, so that the response elevator is re-distributed when the response elevator cannot arrive at the elevator calling floor in time, thereby reducing the waiting time of the user and improving the user experience.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of elevator control technology, in particular to a dynamic call method, device, medium, elevator controller and system. BACKGROUND

[0002] At present, the functions of elevator controllers of major manufacturers are increasingly perfect, and when a user triggers a call, multiple elevators will not all arrive at the user's floor at the same time, but only one of them will be arranged, thereby improving resource utilization.

[0003] However, the existing scheme, while considering saving resources, has affected the user experience; for example, there are two elevators for 6th floor and 11th floor, when a user calls an elevator at 1st floor, the elevator controller assigns the elevator for 6th floor to pick up the owner, and during the descending process, because of various reasons (such as the owner at 5th floor is moving and the elevator is stuck; or a large number of people enter the elevator and trigger the 2nd, 3rd, 4th and 5th floor buttons), at this time, if the elevator controller still assigns the elevator to go down to pick up the owner at 1st floor, it will bring a very bad waiting experience to the owner. SUMMARY

[0004] The purpose of the present application is to provide a dynamic call method based on an elevator controller, which optimizes the user's elevator riding experience as much as possible while considering saving elevator resources.

[0005] To achieve the above purpose, the present application adopts the following technical scheme:

[0006] The dynamic call method comprises:

[0007] receiving a call request and obtaining a list of selectable elevators in a task pool;

[0008] calculating the time for each selectable elevator to arrive at the called floor, and selecting the elevator with the shortest arrival time as the response elevator;

[0009] During the response process of the response elevator, the reachable time of the response elevator and the reachable time of other selectable elevators are calculated in real time, and it is determined whether the response elevator is the optimal elevator at the current time according to the reachable time, if yes, the current response elevator is maintained, and if no, the response elevator is re-assigned.

[0010] Further, the time for each selectable elevator to arrive at the called floor includes the inter-floor moving time of the elevator and the elevator stay time;

[0011] When the current selectable elevator has no task, the elevator stay time is 0;

[0012] When the currently available elevator has a task, the number of people in the elevator when the currently available elevator completes the current task is predicted. If the number of people in the elevator is 0, the elevator dwell time includes the door opening time, the door open time, and the door closing time. If the number of people in the elevator is greater than or equal to 1, the elevator dwell time includes the door opening time, the expected value of the door open time, and the door closing time. The expected value of the door open time is obtained by statistically analyzing the sample of the time required for people who have not exited the elevator to close the door when multiple people are riding in the elevator.

[0013] Furthermore, when the currently selectable elevator has a task, the number of people exiting the elevator on the task floor when the currently selectable elevator is performing the current task is calculated. If the number of people exiting the elevator exceeds a preset value, the elevator dwell time also includes an additional door open time.

[0014] Furthermore, the system obtains the number of passengers inside the elevator from the car's IPC device; obtains the elevator floor tasks from the facial recognition elevator access control device; and calculates the number of passengers exiting the currently selectable elevator at the task floor.

[0015] Furthermore, it is determined whether the elevator door of a certain elevator has been open for a set time. If so, the elevator is removed from the list of selectable elevators in the task pool; otherwise, the current list of selectable elevators is maintained.

[0016] If an elevator is removed from the list of available elevators in the task pool, determine whether the elevator is closed and operating normally. If yes, add the elevator to the list of available elevators in the task pool; otherwise, maintain the current list of available elevators.

[0017] Furthermore, it is determined whether the elevator dwell time of a certain elevator exceeds a set value. If so, the elevator is deleted from the list of selectable elevators in the task pool; otherwise, the current list of selectable elevators is maintained.

[0018] If an elevator is removed from the list of available elevators in the task pool, determine whether the elevator is closed and operating normally. If yes, add the elevator to the list of available elevators in the task pool; otherwise, maintain the current list of available elevators.

[0019] Another object of the present invention is to provide a dynamic elevator calling device, comprising:

[0020] The task pool module is used to generate a list of available elevators that can respond to the current elevator call request;

[0021] The scheduling time calculation module is used to calculate the arrival time of each selectable elevator at the calling floor;

[0022] The elevator dispatching module is used to respond to elevator call requests and dispatch the elevator with the shortest arrival time as the responding elevator;

[0023] The monitoring module is used to call the scheduling time calculation module during the elevator scheduling process to monitor whether the responding elevator is the optimal elevator at the current moment. If not, it requests the elevator scheduling module to reassign the responding elevator.

[0024] Another object of the present invention is to provide a computer-readable storage medium comprising one or more program instructions that, when executed, implement the method described above.

[0025] Another object of the present invention is to provide an elevator controller comprising a processor and a memory, the memory storing a computer program which is loaded and executed by the processor to implement the method described above.

[0026] Another object of the present invention is to provide an elevator control system, including an elevator controller and a plurality of elevators, characterized in that: the elevator controller is the elevator controller as described above.

[0027] By adopting the above technical solution, the present invention has the following advantages compared with the prior art:

[0028] This invention is guided by the reachability time of the available elevators, selects the available elevator with the shortest reachability time as the responding elevator, and monitors the change in the reachability time of the responding elevator in real time during the scheduling process. When the responding elevator cannot reach the calling floor in time, the responding elevator is reallocated, thereby reducing the user's waiting time and improving the user experience. Attached Figure Description

[0029] Figure 1 This is a flowchart illustrating the dynamic elevator calling method of the present invention;

[0030] Figure 2 This is a schematic diagram illustrating the process of calculating the arrival time of the selectable elevator at the calling floor according to the present invention;

[0031] Figure 3 This is a schematic diagram illustrating the process of calculating the arrival time of the selectable elevator at the calling floor according to the present invention;

[0032] Figure 4 This is a schematic diagram of the elevator control device of the present invention;

[0033] Figure 5 This is a schematic diagram of the elevator control system of the present invention. Detailed Implementation

[0034] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0035] Example

[0036] Please refer to Figure 1 As shown, this invention discloses a dynamic elevator calling method, which includes:

[0037] Receive elevator call requests and retrieve the list of available elevators from the task pool;

[0038] Calculate the arrival time of each available elevator to the calling floor, and select the elevator with the shortest arrival time as the responding elevator;

[0039] During the response process of the responding elevator, the reachability time of the responding elevator and the reachability time of other optional elevators are calculated in real time. Based on the reachability time, it is determined whether the responding elevator is the optimal elevator at the current moment. If it is, the current responding elevator response is maintained; otherwise, the responding elevator is reassigned.

[0040] The above method is executed through the elevator controller.

[0041] This invention differs from existing technologies that rely on distance-oriented strategies. Instead, it optimizes elevator controller management by focusing on the waiting time after a user issues a call. By calculating the arrival times of all available elevators at the called floor, it selects the fastest elevator as the responding elevator and dispatches it to the floor. Furthermore, after assigning the responding elevator, it continuously compares its actual arrival time with that of other available elevators to confirm its optimal position at that moment. This prevents the responding elevator from experiencing significant changes in its estimated arrival time due to various factors while performing priority tasks or en route to the called floor, and avoids situations where other available elevators are unable to respond, thus preventing excessively long waiting times for users.

[0042] Specifically, to calculate the time for each selectable elevator to reach the calling floor, two main aspects need to be considered: the inter-floor travel time (moveTime) and the elevator dwell time (retentionTime).

[0043] Since elevators move at a preset speed, their inter-floor travel time is relatively stable and can be calculated based on the number of floors. However, elevator dwell time is more complex, as it depends on the number of passengers currently on the floor and the number of people leaving the floor.

[0044] Under normal circumstances, elevator dwell time = elevator door opening time + door open time + elevator door closing time. However, considering the situation of multiple people riding in the elevator, when someone leaves the elevator, most people will actively press the close button. In this case, the actual door open time (realOpenTime) < the door open time (openTime). Therefore, this invention uses the elevator controller to detect the number of times and the time of action when users actively trigger the close button after each elevator door opening. In this way, the expected value of the current elevator door open time (openTime) can be obtained to reduce errors. When the sample size is large enough, the difference between the expected value and the actual value of the door open time (openTime) will approach 0 seconds, which also compensates for the error in the timing of users manually triggering the close button when calculating the door open time (openTime).

[0045] A flowchart illustrating the process of calculating the arrival time of an optional elevator at the calling floor in this invention is shown below. Figure 2 As shown:

[0046] First, obtain the current elevator's task information and determine whether there are any priority tasks before it responds to the call floor's request; or whether there are any inserted tasks during its movement in response to the call floor's request (e.g., assuming the elevator is on the 6th floor, in the subsequent moments after responding to the call floor's request, whether someone issued a downward call floor between the 5th and 2nd floors). If not, only the inter-floor travel time needs to be calculated, without calculating the elevator's dwell time, i.e., the elevator's dwell time is 0; if so, then calculate the elevator's inter-floor travel time and dwell time on the task floor.

[0047] It should be understood that the elevator's inter-floor travel time is calculated separately after determining whether there is a task. This is because most elevators are not constant-speed elevators. When moving between floors, they basically need to go through a speed change process of stationary-acceleration-constant speed-deceleration-stopping. Therefore, there is a difference in the total inter-floor travel time between the elevator going directly from the Nth floor to the call floor and from the Nth floor stopping at the intermediate task floor and then going to the call floor. The former takes less time, while the latter takes longer due to the more acceleration and deceleration.

[0048] When calculating elevator dwell time, as analyzed previously regarding door open time, if the currently available elevator has a task, the number of people in the elevator after completing the current task is predicted (i.e., the number of people remaining in the elevator after the elevator completes a task on a certain floor and the people leave). If the number of people in the elevator is 0, then the elevator dwell time includes the door opening time, the door open time, and the door closing time, all of which are preset times. If the number of people in the elevator is greater than or equal to 1, then the elevator dwell time includes the door opening time, the expected door open time, and the door closing time. In this case, the expected door open time is not a fixed time, but a mathematical expectation value obtained by collecting, accumulating, and statistically analyzing samples of the time required for the doors to close when multiple people ride in the elevator but have not yet exited.

[0049] To determine the number of people in the elevator when the current task is completed, the elevator controller can monitor and count the number of people in the car in real time through the car IPC device (after the count is completed, it is sent to the elevator controller via the local area network), and trigger the elevator floor task through the facial recognition elevator access control device (the floor permissions of personnel entering the elevator are configured in advance on the community management platform). In this way, relying on the car IPC device and the facial recognition elevator access control device, the elevator controller can know the number of people remaining in the elevator on the task floor.

[0050] In addition, the door open time (openTime) is related to the number of people entering and exiting the elevator. Generally, the door open time of an elevator is sufficient for 8-10 people to enter and exit the elevator. When the number of people exceeds this, the elevator will trigger the door open time again. Therefore, when calculating the time in this invention, the extra door open time (extraOpenTime) also needs to be considered.

[0051] Therefore, please refer to Figure 3 As shown, in a preferred embodiment, it is further determined whether the number of people in the elevator exceeds a set threshold (8 people) to determine whether the extra door open time (extraOpenTime) should be included. After the elevator doors close, the number of people is monitored and counted in real time by the car IPC device. After the car IPC device completes the count, it sends it to the elevator controller in real time via the local area network. At the same time, the elevator floor task is triggered by facial recognition of the elevator access control device. Relying on the car IPC device and the facial recognition access control device, the elevator controller can know the specific number of people who need to leave the elevator on each floor and calculate the extra door open time (extraOpenTime) in advance.

[0052] It should be understood that although the number of people entering the elevator will affect the extra door's open time, its implementation is costly. While it's possible to deploy IPCs in various corners on each floor outside the elevator to count people, user behavior is unpredictable. For example, if there are five people outside the elevator on a certain floor, they may not actually enter. Therefore, big data analysis of user behavior is needed for prediction, making its implementation cost relatively high (including the cost of IPC equipment outside the elevator, system data collection and analysis costs, etc.). Therefore, this application focuses more on predicting passenger flow and arrival floors within the elevator. This prediction is sufficient to handle high-probability scenarios and meet daily usage needs. The low-probability impact of the number of people entering the elevator is not monitored or controlled due to cost considerations.

[0053] Furthermore, in a special case, there may be temporary visitors among the passengers, namely those who follow people with elevator access into and out of the elevator. For example, two authorized passengers, A and B, enter the elevator on different floors, but several temporary visitors follow them in and out. In this case, this application adopts the following strategy to achieve prediction:

[0054] For visitors, the system requires them to register in the access control management system. Although they are following along and do not scan their faces on the facial recognition elevator access control system, their faces can be recognized by the elevator control IPC. Therefore, for temporary visitors, the access control management system analyzes which floors they have access to, and then compares the access permissions of other users in the elevator to analyze the floors they have reached, predicting the floor they will exit and the number of people exiting the elevator.

[0055] If all visitors have access to the floors accessed by authorized users, then the average value is taken, because their destinations are unpredictable as they haven't used facial recognition. The calculated time is updated after some visitors exit the elevator. Specifically, the number of visitors exiting at their respective authorized floors and the time required for the elevator to complete its task are calculated. After calculating the time required for the elevator to complete the task under various possibilities, the average of these times is taken as the current elevator's reachable time. The calculated time is then updated after some visitors exit the elevator.

[0056] In addition, a low-probability event, or an anomaly, may occur where the visitor is not registered or their permissions do not match (if the registration does not match the permissions, the accompanying person would not normally enter the elevator because the floor they are going to is not the floor they are going to). In this case, the system calculates the average task time for each floor with the required permissions; after the elevator reaches one of the floors and the person has partially left, the system updates the accurate data promptly.

[0057] After the above process, the elevator controller maintains a task pool and dynamically assigns tasks to the elevators with the best current tasks (including elevators with no tasks and elevators with tasks).

[0058] Furthermore, in a more preferred embodiment, when the elevator door's openTime expires (e.g., when moving into an elevator), or the retentionTime expires (scenario: the elevator door is frequently opened for people, or a large number of people enter), the elevator will temporarily not participate in the task allocation in the task pool. It will only participate in the task allocation in the task pool after the elevator door is closed and it is running normally.

[0059] That is, determine whether the elevator door of a certain elevator has been open for a set time. If so, delete the elevator from the list of selectable elevators in the task pool. If not, maintain the current list of selectable elevators. If an elevator is deleted from the list of selectable elevators in the task pool, determine whether the elevator is closed and operating normally. If so, add the elevator to the list of selectable elevators in the task pool. If not, maintain the current list of selectable elevators.

[0060] Furthermore, it is determined whether the dwell time of a certain elevator exceeds a set value. If so, the elevator is deleted from the list of selectable elevators in the task pool; otherwise, the current list of selectable elevators is maintained. If an elevator is deleted from the list of selectable elevators in the task pool, it is determined whether the elevator is closed and operating normally. If so, the elevator is added to the list of selectable elevators in the task pool; otherwise, the current list of selectable elevators is maintained.

[0061] Thus, if the responding elevator cannot reach the calling floor in time due to some reason, and the responding elevator is reassigned, there may be some waste of resources. However, this is a minority compared to the total number of elevator tasks performed throughout the day. Overall, it can effectively reduce the waiting time of users and greatly improve the user experience.

[0062] Please refer to Figure 4 As shown, another objective of the present invention is to provide a dynamic elevator calling device, which includes a task pool module, a scheduling time calculation module, an elevator scheduling module, a monitoring module, and an anomaly identification module.

[0063] The system comprises several modules: a task pool module to generate a list of available elevators that can respond to the current elevator call request; a scheduling time calculation module to calculate the arrival time of each available elevator at the calling floor; an elevator scheduling module to select the elevator with the shortest arrival time as the responding elevator; a monitoring module to call the scheduling time calculation module during elevator scheduling to monitor whether the responding elevator is the optimal elevator at the current moment, and if not, to request the elevator scheduling module to reassign the responding elevator; and an anomaly detection module to respond to abnormal situations (such as elevator door timeout or dwell timeout) by reassigning the responding elevator to the elevator controller.

[0064] For the apparatus embodiments, since they basically correspond to the method embodiments, the relevant parts can be referred to in the description of the method embodiments. The apparatus embodiments described above are merely illustrative. The modules described as separate components may or may not be physically separate, and the components shown as modules may or may not be physical modules. They may be located in one place or distributed across multiple modules. Some or all of the modules can be selected to achieve the purpose of this disclosure according to actual needs. Those skilled in the art can understand and implement this without creative effort.

[0065] Accordingly, another object of the present invention is to provide an elevator controller comprising a processor and a memory, the memory storing a computer program which is loaded and executed by the processor to implement the method described above.

[0066] Accordingly, another object of the present invention is to provide an elevator control system, including an elevator controller and a plurality of elevators, wherein the elevator controller is the elevator controller as described above.

[0067] Accordingly, another object of the present invention is to provide a computer-readable storage medium comprising one or more program instructions that, when executed, implement the method described above.

[0068] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, apparatus, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. Computer-usable storage media include permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to: phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, optical disc read-only memory (CD-ROM), digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0069] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus, and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0070] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0071] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0072] It should be noted that any reference signs placed between parentheses in the claims should not be construed as limiting the claims. The word "comprising" does not exclude the presence of components or steps not listed in the claims. The word "a" or "an" preceding a component does not exclude the presence of a plurality of such components. The invention can be implemented by means of hardware comprising several different components and by means of a suitably programmed computer. In a unit claim enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third, etc., does not indicate any order. These words can be interpreted as names.

[0073] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention.

[0074] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

[0075] In the description of this invention, it should be understood that the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0076] In this invention, unless otherwise explicitly specified and limited, the terms "installation," "connection," "linking," and "fixing," etc., should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral part; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; they can refer to the internal communication of two components or the interaction between two components. Those skilled in the art can understand the specific meaning of the above terms in this invention according to the specific circumstances.

[0077] In this invention, unless otherwise explicitly specified and limited, "above" or "below" the second feature can mean that the first feature is in direct contact with the second feature, or that the first feature is in indirect contact with the second feature through an intermediate medium. Furthermore, "above," "over," and "on top" of the second feature can mean that the first feature is directly above or diagonally above the second feature, or simply that the first feature is at a higher horizontal level than the second feature. "Below," "below," and "under" the second feature can mean that the first feature is directly below or diagonally below the second feature, or simply that the first feature is at a lower horizontal level than the second feature.

[0078] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms should not be construed as necessarily referring to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0079] Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention. Those skilled in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of the present invention.

Claims

1. A dynamic elevator calling method, characterized in that, include: Receive elevator call requests and retrieve the list of available elevators from the task pool; Calculate the arrival time of each available elevator to the calling floor, and select the elevator with the shortest arrival time as the responding elevator; During the response process of the responding elevator, the reachability time of the responding elevator and the reachability time of other optional elevators are calculated in real time. Based on the reachability time, it is determined whether the responding elevator is the optimal elevator at the current moment. If it is, the current responding elevator response is maintained; otherwise, the responding elevator is reassigned. The time for each selectable elevator to reach the calling floor includes the elevator's inter-floor travel time and the elevator's dwell time; When the currently available elevator has no task, the elevator's dwell time is 0. When the currently available elevator has a task, the number of people in the elevator when the currently available elevator completes the current task is predicted. If the number of people in the elevator is 0, the elevator dwell time includes the door opening time, the door open time, and the door closing time. If the number of people in the elevator is greater than or equal to 1, the elevator dwell time includes the door opening time, the expected value of the door open time, and the door closing time. The expected value of the door open time is obtained by statistically analyzing the sample of the time required for the door to close when multiple people ride in the elevator but do not exit. When the currently available elevator has a task, the system calculates the number of passengers exiting the elevator at the task floor while performing the current task. If the number of passengers exiting exceeds a preset value, the elevator dwell time also includes an additional door-open time. When the number of passengers exiting includes temporary visitors, the access control system analyzes which floors they have access to, then compares their access permissions with those of other users in the elevator to analyze the floors they have reached, and predicts their exit floor and the number of passengers exiting from that floor. If the visitors have access to all floors of the authorized users, the system calculates the time required for the elevator to perform the task in various possible scenarios, and takes the average of these times as the current elevator's reachable time. After some visitors exit the elevator, the calculated time is updated.

2. The dynamic elevator calling method as described in claim 1, characterized in that: Obtain the number of passengers inside the elevator from the car's IPC device; obtain the elevator floor task from the facial recognition elevator access control device; calculate the number of passengers exiting the currently selectable elevator at the task floor.

3. The dynamic elevator calling method as described in claim 1, characterized in that: Determine whether the elevator door of a certain elevator has been open for a set time. If so, delete the elevator from the list of available elevators in the task pool; otherwise, maintain the current list of available elevators. If an elevator is removed from the list of available elevators in the task pool, determine whether the elevator is closed and operating normally. If yes, add the elevator to the list of available elevators in the task pool; otherwise, maintain the current list of available elevators.

4. The dynamic elevator calling method as described in claim 1, characterized in that: Determine whether the dwell time of a certain elevator exceeds a set value. If yes, delete the elevator from the list of selectable elevators in the task pool; otherwise, maintain the current list of selectable elevators. If an elevator is removed from the list of available elevators in the task pool, determine whether the elevator is closed and operating normally. If yes, add the elevator to the list of available elevators in the task pool; otherwise, maintain the current list of available elevators.

5. A dynamic elevator calling device, used to perform the dynamic elevator calling method as described in any one of claims 1-4, characterized in that, include: The task pool module is used to generate a list of available elevators that can respond to the current elevator call request; The scheduling time calculation module is used to calculate the arrival time of each selectable elevator at the calling floor; The elevator dispatching module is used to respond to elevator call requests and dispatch the elevator with the shortest arrival time as the responding elevator; The monitoring module is used to call the scheduling time calculation module during the elevator scheduling process to monitor whether the responding elevator is the optimal elevator at the current moment. If not, it requests the elevator scheduling module to reassign the responding elevator.

6. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes one or more program instructions that, when executed, implement the method as described in any one of claims 1-4.

7. An elevator controller, comprising a processor and a memory, characterized in that: The memory stores a computer program, which is loaded and executed by the processor to implement the method as described in any one of claims 1-4.

8. An elevator control system, comprising an elevator controller and several elevators, characterized in that: The elevator controller is the elevator controller as described in claim 7.

Images