Elevator dispatching method and device, electronic equipment and storage medium

Abstract

The invention provides an elevator dispatching method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining the visiting position and visiting time of a target visitor, monitoring the operation data of each elevator, predicting the time length of the target visitor from the visiting position to an elevator waiting layer, and obtaining the elevator dispatching result. The method comprises the steps of predicting the total scheduling duration of each elevator based on operation data of each elevator, comparing the duration of arriving at an elevator waiting layer by a visitor with the total scheduling duration of each elevator, determining a target elevator from each elevator based on a comparison result, determining a locking opening moment according to the visiting moment, the duration of arriving at the elevator waiting layer by the visitor and the total scheduling duration of the target elevator, and locking the target elevator according to the locking opening moment. The stopping floor of the target elevator is locked at the locking opening moment, so that after the target elevator completes the stopping task of the locked stopping floor, the target elevator goes to the elevator waiting floor to carry the target visitor; the elevator waiting time of target visitors can be shortened, the priority service of the target visitors is achieved, and idle waste of elevator resources is avoided.

Description

Technical Field

[0001] This application relates to the technical field of elevator control, and particularly relates to an elevator scheduling method, device, electronic device, and storage medium. Background Art

[0002] Traditional elevator scheduling strategies mainly schedule based on floor requests, aiming to improve elevator operation efficiency and reduce the average waiting time of passengers. However, such "first come, first served" or "nearest response" scheduling strategies lack consideration for personalized services for specific users such as VIP visitors, people with limited mobility, or those in urgent situations, and cannot prioritize responding to their elevator ride demands, which may lead to overly long waiting times for them and affect the service experience.

[0003] Although fixing a specific elevator as a dedicated elevator can provide exclusive services for specific users, this static allocation method easily causes idle and waste of elevator resources. Especially during off-peak hours, the utilization rate of the dedicated elevator significantly decreases, resulting in a decline in the overall operation efficiency of the elevator system. Therefore, how to balance the efficient utilization of elevator resources while ensuring priority services for specific users has become an urgent problem to be solved in the field of elevator scheduling. Summary of the Invention

[0004] In view of the above-mentioned disadvantages of the prior art, this application provides an elevator scheduling method, device, electronic device, and storage medium to solve the technical problem of how to balance the efficient utilization of elevator resources while ensuring priority services for specific users.

[0005] This application provides an elevator scheduling method, which includes: obtaining the arrival location and arrival time of a target visitor, and monitoring the operation data of each elevator; predicting the duration for the target visitor to reach the waiting floor from the arrival location as the visitor arrival waiting floor duration, and predicting the total scheduling duration of each elevator based on the operation data of each elevator; comparing the visitor arrival waiting floor duration with the total scheduling duration of each elevator respectively, determining a target elevator from each elevator based on the comparison result, and determining the locked opening time according to the arrival time, the visitor arrival waiting floor duration, and the total scheduling duration of the target elevator; locking the stop floor of the target elevator at the locked opening time, so that after the target elevator completes the stop task at the locked stop floor, it goes to the waiting floor to pick up the target visitor, where the operation data includes the stop floor.

[0006] In an embodiment of the present application, predicting the duration for the target visitor to reach the elevator waiting floor from the arrival location as the duration for the visitor to reach the elevator waiting floor includes: obtaining the personal information of the target visitor, querying the historical arrival information of the target visitor according to the personal information, and obtaining the historical arrival location of the target visitor and the duration for the target visitor to reach the elevator waiting floor from the historical arrival location based on the historical arrival information; calculating the historical speed of the target visitor according to the distance between the historical arrival location and the location of the elevator waiting floor and the duration for the target visitor to reach the elevator waiting floor from the historical arrival location, where the elevator waiting floor has a corresponding location; calculating the duration for the target visitor to reach the elevator waiting floor from the arrival location according to the distance between the arrival location and the location of the elevator waiting floor and the historical speed of the target visitor as the duration for the visitor to reach the elevator waiting floor.

[0007] In an embodiment of the present application, predicting the total scheduling duration of each elevator based on the operation data of each elevator includes: calculating the distance between the elevator and each stop floor according to the current elevator location of the elevator and the locations of each stop floor, where the operation data further includes the current elevator location, and the stop floor has a corresponding location; calculating the duration for the elevator to reach each stop floor according to the distance between the elevator and each stop floor and the elevator operation speed of the elevator, where the operation data further includes the elevator operation speed; determining the total scheduling duration of the elevator based on the time for the elevator to reach each stop floor.

[0008] In an embodiment of the present application, determining the total scheduling duration of the elevator based on the duration for the elevator to reach each stop floor includes: determining the weight of each stop floor from the weights of each floor, and calculating the total scheduling duration of the elevator according to the duration for the elevator to reach each stop floor and the weight of each stop floor, where the determination method of the weight of each floor includes obtaining the historical operation data of the elevator, and the historical operation data of the elevator includes the historical number of passengers on each floor; performing weight allocation on each floor based on the historical number of passengers on each floor to obtain the weight of each floor.

[0009] In an embodiment of the present application, comparing the duration for the visitor to reach the elevator waiting floor with the total scheduling duration of each elevator respectively, and determining the target elevator from each elevator based on the comparison result includes: taking the elevator with the total scheduling duration less than the duration for the visitor to reach the elevator waiting floor as a candidate elevator; calculating the difference between the duration for the visitor to reach the elevator waiting floor and the total scheduling duration of each candidate elevator as the duration difference corresponding to each candidate elevator; comparing the duration difference corresponding to each candidate elevator with a preset range, and determining the target elevator from the candidate elevators with the duration difference within the preset range.

[0010] In an embodiment of the present application, before going to the waiting floor to pick up the target visitor, the method further includes: obtaining personal information of the target visitor, and performing a reservation query on the target visitor according to the personal information; if there is reservation information of the target visitor, obtaining the floor to be visited from the reservation information, so that the target elevator transports the target visitor to the floor to be visited; if there is no reservation information of the target visitor, querying the historical visited floors of the target visitor according to the personal information, and predicting the floor to be visited based on the historical visited floors, so that the target elevator goes to the waiting floor to transport the target visitor to the floor to be visited.

[0011] In an embodiment of the present application, obtaining the arrival location and arrival time of a target visitor includes: identifying a visitor to be authenticated in a preset area to obtain an identification result of the visitor to be authenticated; matching the identification result of the visitor to be authenticated with a preset visitor information database, and determining the visitor level of the visitor to be authenticated based on the matching result, where the visitor level includes a general level or a member level; if the visitor level of the visitor to be authenticated is the member level, determining the visitor to be authenticated as the target visitor, and respectively using the identification location and identification time of the visitor to be authenticated as the arrival location and arrival time of the target visitor, where the identification location refers to the location of the visitor to be authenticated when the visitor to be authenticated is identified, and the identification time refers to the time when the visitor to be authenticated is identified.

[0012] In an embodiment of the present application, there is also provided an elevator scheduling device, and the device includes: a user identification module, configured to obtain the arrival location and arrival time of a target visitor; an elevator monitoring module, configured to monitor the operation data of each elevator; an information processing module, configured to predict the duration from the arrival location of the target visitor to the waiting floor as the duration for the visitor to reach the waiting floor, and predict the total scheduling duration of each elevator based on the operation data of each elevator; comparing the duration for the visitor to reach the waiting floor with the total scheduling duration of each elevator respectively, determining a target elevator from each elevator based on the comparison result, and determining a locked opening time according to the arrival time, the duration for the visitor to reach the waiting floor, and the total scheduling duration of the target elevator; an elevator control module, configured to lock the stop floor of the target elevator at the locked opening time, so that after the target elevator completes the stop task at the locked stop floor, it goes to the waiting floor to transport the target visitor, where the operation data includes the stop floor.

[0013] In an embodiment of the present application, an electronic device is further provided. The electronic device includes: one or more processors; a storage device for storing one or more programs, which, when executed by the one or more processors, cause the electronic device to implement the elevator scheduling method as described above.

[0014] In an embodiment of the present application, a computer-readable storage medium is further provided, on which a computer program is stored. When the computer program is executed by a processor of a computer, the computer is caused to execute the elevator scheduling method as described above.

[0015] Advantages of the present invention: The present invention provides an elevator scheduling method, device, electronic device and storage medium. By predicting the time for a target visitor to reach the waiting floor and the total scheduling time of each elevator, and determining the target elevator to carry the target visitor according to the comparison result between the time for the visitor to reach the waiting floor and the total scheduling time of each elevator, accurate elevator scheduling services can be provided for the target visitor, significantly shortening their waiting time. Moreover, by determining the locked opening time and only locking the stopping floor of the target elevator at this moment, rather than occupying elevator resources for a long time, the target elevator can respond to the needs of the target visitor in a timely manner after completing the stopping task at the locked stopping floor. While ensuring priority service for the target visitor, it also avoids idle waste of elevator resources, improves the overall utilization efficiency of the elevator, and takes into account the elevator riding needs of other passengers, achieving global elevator scheduling optimization.

[0016] It should be understood that the above general description and subsequent detailed description are only exemplary and explanatory, and cannot limit the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 is a schematic diagram of the implementation environment of an elevator scheduling method shown in an exemplary embodiment of the present application;

[0018] Figure 2 is a flowchart of an elevator scheduling method shown in an exemplary embodiment of the present application;

[0019] Figure 3 is a working flowchart of elevator scheduling shown in a specific embodiment of the present application;

[0020] Figure 4 is a block diagram of an elevator scheduling device shown in an exemplary embodiment of the present application;

[0021] Figure 5 is a schematic structural diagram of an electronic device shown in an exemplary embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0022] The following describes the implementation manners of the present application through specific specific examples. Those skilled in the art can easily understand other advantages and effects of the present application from the content disclosed in this specification. The present application can also be implemented or applied through other different specific implementation manners. Various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that, without conflict, the following embodiments and the features in the embodiments can be combined with each other.

[0023] It should be noted that the diagrams provided in the following embodiments only illustrate the basic concept of the present application in a schematic manner. Therefore, only the components related to the present application are shown in the diagrams, rather than being drawn according to the number, shape, and size of the components in actual implementation. The type, quantity, and proportion of each component in actual implementation can be arbitrarily changed, and the component layout type may also be more complex.

[0024] It should be noted that in the present application, "first", "second", etc. are only used to distinguish similar objects, and are not used to limit the order or sequence of similar objects. The described "including", "having", etc. are deformed, indicating that the scope covered by the subject of the word excludes the examples shown by the word and is not exclusive.

[0025] It can be understood that the various digital numbers, step numbers, etc. recorded in the present application are used for distinction for the convenience of description, and do not limit the scope of the present application. The size of the labels in the present application does not mean the sequence of execution order. The execution order of each process should be determined by its function and internal logic.

[0026] In the following description, a large number of details are discussed to provide a more thorough explanation of the embodiments of the present application. However, it is obvious to those skilled in the art that the embodiments of the present application can be implemented without these specific details. In other embodiments, well-known structures and devices are shown in the form of block diagrams rather than in detail to avoid making the embodiments of the present application difficult to understand.

[0027] Embodiments of the present application respectively propose an elevator scheduling method, an elevator scheduling device, an electronic device, a computer-readable storage medium, and a computer program product. The following will describe these embodiments in detail.

[0028] Please refer to Figure 1 , Figure 1 which is a schematic diagram of the implementation environment of an elevator scheduling method shown in an exemplary embodiment of the present application.

[0029] As Figure 1As shown, the implementation environment may include a data acquisition device 110, a computer device 120, an elevator monitoring system 130, and an elevator control system 140. Among them, the data acquisition device 110 may be an image acquisition device such as a camera or a camera, or may be a vision system including an image acquisition device and an image processing device. The computer device 120 may be at least one of a microcomputer, an embedded computer, a neural network computer, etc., and no restrictions are imposed here. The data acquisition device 110 can be used to perform image acquisition and image recognition on the target visitor, obtain the arrival location and arrival time of the target visitor and provide them to the computer device 120. It is also possible to use the data acquisition device 110 to perform image acquisition on the target visitor, provide the acquired images to the computer device 120, and have the computer device 120 perform image recognition to obtain the arrival location and arrival time of the target visitor. In addition, the arrival location and arrival time of the target visitor can also be obtained manually and input into the computer device 120, and no restrictions are imposed here either. The elevator monitoring system 130 can be used to monitor the operation data of each elevator and provide the monitored operation data of each elevator to the computer device 120. The computer device 120 processes based on the obtained arrival location and arrival time of the target visitor and the operation data of each elevator, determines the target elevator and the locking opening time, and locks the target elevator at the locking opening time through the elevator control system 140 to control the target elevator to carry the target visitor.

[0030] Schematically, the computer device 120 obtains the arrival location and arrival time of the target visitor through the data acquisition device 110, and monitors the operation data of each elevator through the elevator monitoring system 130; predicts the duration from the arrival location of the target visitor to the waiting floor as the duration for the visitor to reach the waiting floor, and predicts the total scheduling duration of each elevator based on the operation data of each elevator; compares the duration for the visitor to reach the waiting floor with the total scheduling duration of each elevator respectively, determines the target elevator from each elevator based on the comparison result, and determines the locked opening time according to the arrival time, the duration for the visitor to reach the waiting floor, and the total scheduling duration of the target elevator; locks the stopping floor of the target elevator at the locked opening time, so that after the target elevator completes the stopping task at the locked stopping floor, it goes to the waiting floor to pick up the target visitor, where the operation data includes the stopping floor. It can be seen that the technical solution of the embodiment of the present application can provide precise elevator scheduling services for the target visitor and significantly shorten the waiting time by predicting the duration for the target visitor to reach the waiting floor and the total scheduling duration of each elevator, and determining the target elevator to pick up the target visitor according to the comparison result between the duration for the visitor to reach the waiting floor and the total scheduling duration of each elevator. Moreover, by determining the locked opening time and only locking the stopping floor of the target elevator at this time, rather than occupying the elevator resources for a long time, the target elevator can respond to the needs of the target visitor in time after completing the stopping task at the locked stopping floor, ensuring the priority service of the target visitor while avoiding the idle waste of elevator resources, improving the overall utilization efficiency of the elevator, and also taking into account the elevator riding needs of other passengers, realizing the optimization of the global elevator scheduling.

[0031] It should be noted that the elevator scheduling method provided by the embodiment of the present application is generally specifically executed by the data acquisition device 110, the computer device 120, the elevator monitoring system 130, and the elevator control system 140.

[0032] Please refer to Figure 2 , Figure 2 which is a flowchart of an elevator scheduling method shown in an exemplary embodiment of the present application. This elevator scheduling method can be applied to Figure 1 the shown implementation environment, and is specifically executed by the data acquisition device 110, the computer device 120, the elevator monitoring system 130, and the elevator control system 140 in this implementation environment. It should be understood that this elevator scheduling method can also be applicable to other exemplary implementation environments and be specifically executed by devices in other implementation environments. This embodiment does not limit the implementation environment applicable to this elevator scheduling method. As Figure 2 shown, in an exemplary embodiment, this elevator scheduling method at least includes steps S210 to S240, which are introduced in detail as follows:

[0033] Step S210, obtain the arrival location and arrival time of the target visitor, and monitor the operation data of each elevator.

[0034] In an embodiment of the present application, the target visitor may be an ordinary visitor, a VIP visitor, or a reserved visitor, a visitor with limited mobility, a visitor in an emergency situation, etc., without limitation here. When the target visitor arrives at a designated area, such as a garage, a lobby, a park, etc., image acquisition devices such as cameras and cameras installed in the designated area can be used to collect images of the target visitor, and the collected images can be recognized to obtain the location information of the target visitor as the arrival location of the target visitor, and the acquisition time of the images can be used as the arrival time of the target visitor. Or, through parking location recognition, access control information collection, or face recognition technology, the current location of the target visitor can be obtained as the arrival location, and the recognition time of the target visitor can be used as the arrival time. The operating data of each elevator is monitored and recorded in real time through sensors installed in each elevator, where the operating data includes at least one of the current location of the elevator, the floor stay duration, the dispatching response duration, the running direction, the stopping floor, the number of passengers in the elevator, the running speed of the elevator, etc. The floor stay duration refers to the duration of the elevator staying on a certain floor, that is, the duration from the elevator arriving at the floor to leaving the floor. The dispatching response duration refers to the duration from the user pressing a certain floor button to the elevator responding and arriving at the corresponding floor and opening. The stopping floor refers to the floor that the elevator currently responds to and needs to stop at to pick up and drop off passengers in the elevator, including the floor corresponding to the floor button pressed by the passengers in the elevator and the floor corresponding to the elevator call button pressed by the passengers outside the elevator.

[0035] In an embodiment of the present application, obtaining the arrival location and arrival time of the target visitor includes: recognizing the visitor to be authenticated in a preset area to obtain the recognition result of the visitor to be authenticated; matching the recognition result of the visitor to be authenticated with a preset visitor information database, and determining the visitor level of the visitor to be authenticated based on the matching result, where the visitor level includes an ordinary level or a member level; if the visitor level of the visitor to be authenticated is a member level, then the visitor to be authenticated is determined as the target visitor, and the recognition location and recognition time of the visitor to be authenticated are respectively used as the arrival location and arrival time of the target visitor, where the recognition location refers to the location of the visitor to be authenticated when the visitor to be authenticated is recognized, and the recognition time refers to the time when the visitor to be authenticated is recognized.

[0036] In this embodiment, areas around buildings such as garages, lobbies, and campuses can be used as preset areas. When a visitor to be authenticated arrives at the preset area, a face recognition device or a license plate recognition device is used to identify the identity information or license plate information of the visitor to be authenticated as the recognition result. Here, the visitor to be authenticated refers to a visitor who has not been authenticated within the preset area. Personal information and historical access data (historical arrival information) of VIP visitors are pre-stored in the preset visitor information database. Among them, the personal information includes unique personal identification information such as identity information and license plate information. The identity information includes, but is not limited to, face information, ID number, driver's license number, contact information (mobile phone number, telephone number, email address, etc.). The recognition result of the visitor to be authenticated is matched with the personal information of each VIP visitor in the preset visitor information database to authenticate the identity of the visitor to be authenticated. If the matching result is successful, it is determined that the visitor level of the visitor to be authenticated is the membership level, that is, the visitor to be authenticated is a VIP customer. The visitor can be regarded as the target visitor, and the recognition location where the visitor is recognized is used as the arrival location of the target visitor, and the recognition time when the visitor is recognized is used as the arrival time of the target visitor. If the matching result is unsuccessful, it is determined that the visitor level of the visitor to be authenticated is the ordinary level, that is, the visitor to be authenticated is not a VIP customer.

[0037] Schematically, if the visitor level of the visitor to be authenticated is the ordinary level, the physiological characteristics of the visitor to be authenticated can be further identified to determine the group category to which the visitor to be authenticated belongs. The group category includes a normal group or a special group. Among them, the special group includes people with inconvenient movements such as pregnant women, the elderly, and the disabled. If the group category to which the visitor to be authenticated belongs is the special group, the visitor to be authenticated is determined as the target visitor, and the recognition location and recognition time of the visitor to be authenticated are respectively used as the arrival location and arrival time of the target visitor.

[0038] In a specific embodiment of the present application, the operation data of each elevator is monitored, including the following processes:

[0039] 1. Collect elevator operation data

[0040] Data collection: The operation data of the elevator is recorded in real time through sensors installed in the elevator, including but not limited to the current position of the elevator, the floor stay duration, the dispatching response duration, etc.

[0041] Data recording: The collected operation data is recorded in real time and stored in a database or a local storage device to ensure the integrity and continuity of the data.

[0042] 2. Data preprocessing

[0043] Data cleaning: The collected operation data is cleaned to remove invalid data, duplicate data, and abnormal data to ensure the accuracy of subsequent analysis.

[0044] Data formatting: Convert the running data into a unified format to make subsequent analysis and modeling work more convenient. Among them, the formatted data includes all key information of elevator operation, such as floor stay duration, dispatching response duration, timestamp, etc.

[0045] 3. Build an elevator operation monitoring model

[0046] Model design: Use deep learning frameworks such as MindSpore to build an elevator operation monitoring model. Select a network structure suitable for this task, such as the YOLOv5s network, to detect the operation status of the elevator. Design the model to be able to analyze the elevator operation data in real time, identify different operation statuses, such as normal operation, congestion, outage, etc., and predict future operation trends.

[0047] Training script writing: Based on the MindSpore framework and the YOLOv5s network structure, write a training script to configure data input, model structure, loss function, optimizer, etc. for subsequent training.

[0048] 4. Train the elevator operation monitoring model

[0049] Data input: Input the collected elevator operation data (including historical operation data) into the model for training. Among them, the dataset includes information such as floor stay duration, dispatching response duration, operation status labels, etc.

[0050] Training process: Through setting appropriate training parameters such as the number of training epochs, learning rate, batch size, etc., conduct model training, use the AdamW optimizer for optimization, and adopt the cosine annealing strategy to adjust the learning rate to improve model performance.

[0051] Parameter tuning: During the training process, continuously adjust model parameters such as the number of network layers, learning rate, etc., and use methods such as cross-validation to optimize the model effect.

[0052] 5. Model validation and testing

[0053] Validation metrics: After training is completed, through model validation testing, evaluate the performance of the model in elevator operation monitoring. Mainly use object detection-related metrics such as precision, recall, F1 score, etc. for evaluation.

[0054] Performance testing: Test performance metrics such as the response time and accuracy of the model in real-time data streams to ensure that it can operate stably in the actual environment.

[0055] 6. Model tuning and optimization

[0056] Performance Tuning: Based on the validation results of the model, decide whether to perform further tuning. Tuning can include increasing the scale or diversity of the dataset, improving the model's generalization ability, adjusting the network structure or optimizer to further enhance the accuracy and response speed.

[0057] 7. Save and Deploy the Optimal Model

[0058] Save the Optimal Model: When the model reaches the expected performance, save the weights of the optimal model. This model will be used for subsequent elevator operation monitoring, real-time detection of elevator status, and providing decision support.

[0059] Quantization and Deployment: For deployment to actual devices, further quantize the model to reduce computational resource consumption and improve inference efficiency. The quantized model will be deployed to the hardware of the elevator monitoring system to complete the real-time elevator operation monitoring task.

[0060] Real-time Update and Feedback: Deploy the optimized model to the elevator monitoring system and implement real-time feedback. Through the feedback mechanism, the model can be continuously updated according to the actual operation situation to improve the monitoring accuracy and response efficiency.

[0061] In step S220, predict the duration from the arrival location of the target visitor to the waiting floor as the visitor's arrival duration at the waiting floor, and predict the total scheduling duration of each elevator based on the operation data of each elevator.

[0062] In an embodiment of the present application, the duration from the arrival location of the target visitor to the waiting floor can be predicted based on the arrival location. For example: The walking speed of a person and the location of the waiting floor can be set in advance. According to the arrival location and the preset location of the waiting floor, calculate the distance between the arrival location and the waiting floor, and then estimate the visitor's arrival duration at the waiting floor based on the distance between the arrival location and the waiting floor and the preset walking speed. Another example: The location of the waiting floor can be set in advance. According to the arrival location and the preset location of the waiting floor, calculate the distance between the arrival location and the waiting floor, and obtain physiological characteristics such as the height or gender of the target visitor through image recognition. Estimate the walking speed of the target visitor based on the physiological characteristics, and estimate the visitor's arrival duration at the waiting floor based on the distance between the arrival location and the waiting floor and the estimated walking speed. The prediction method of the visitor's arrival duration at the waiting floor is not limited here.

[0063] Based on the elevator running speed and the distance from the current position of the elevator to the stopping floor, the duration for the elevator to complete the stopping task can be predicted. Then, based on the elevator running speed and the distance from the last stopping floor completed by the elevator to the waiting floor, the duration for the elevator to reach the waiting floor from the last stopping floor can be predicted. By combining factors such as the duration for the elevator to complete the stopping task, the duration for the elevator to reach the waiting floor from the last stopping floor, and the floor staying duration, the total scheduling duration of the elevator can be determined. Of course, other methods can also be used to predict the total scheduling duration, and the prediction method for the total scheduling duration is not limited here.

[0064] In an embodiment of the present application, predicting the duration for a target visitor to reach the waiting floor from the arrival position as the visitor arrival waiting floor duration includes: obtaining the personal information of the target visitor, querying the historical arrival information of the target visitor according to the personal information, and obtaining the historical arrival position of the target visitor and the duration for the target visitor to reach the waiting floor from the historical arrival position based on the historical arrival information; calculating the historical speed of the target visitor according to the distance between the historical arrival position and the position of the waiting floor and the duration for the target visitor to reach the waiting floor from the historical arrival position, where the waiting floor has a corresponding position; calculating the duration for the target visitor to reach the waiting floor from the arrival position according to the distance between the arrival position and the position of the waiting floor and the historical speed of the target visitor as the visitor arrival waiting floor duration.

[0065] In this embodiment, the position of the waiting floor can be pre-stored. The identity information of the target visitor can be obtained through face recognition as the personal information, and the historical arrival information of the target visitor, including the historical arrival position and historical arrival time of the target visitor reaching a specified area (or preset area) and the historical time of reaching the waiting floor, can be queried from the database according to the personal information. The duration for the target visitor to reach the waiting floor from the historical arrival position can be calculated according to the historical arrival time and the historical time of reaching the waiting floor, the distance between the historical arrival position and the position of the waiting floor can be calculated according to the historical arrival position and the position of the waiting floor, and then the historical speed of the target visitor can be calculated according to this duration and this distance. Then, the distance between the arrival position and the position of the waiting floor can be calculated according to the arrival position of the current target visitor and the position of the waiting floor, and the visitor arrival waiting floor duration can be calculated according to the distance between the arrival position and the position of the waiting floor and the historical speed.

[0066] In one embodiment of the present application, predicting the total scheduling duration of each elevator based on the operation data of each elevator includes: calculating the distance between the elevator and each stop floor according to the current elevator position of the elevator and the positions of each stop floor, wherein the operation data further includes the current elevator position, and the stop floor has a corresponding position; calculating the duration for the elevator to reach each stop floor according to the distance between the elevator and each stop floor and the elevator operation speed of the elevator, wherein the operation data further includes the elevator operation speed; and determining the total scheduling duration of the elevator based on the duration for the elevator to reach each stop floor.

[0067] In this embodiment, the operation data includes the current elevator position, the stop floor, the elevator operation speed, the floor stay duration, the scheduling response duration, etc. The duration for the elevator to reach each stop floor is also the estimated scheduling response duration for each stop floor. Since the scheduling response duration recorded in the operation data is the actual scheduling response duration corresponding to the floors where the elevator has completed the stop task, and the stop floor is the floor where the elevator currently needs to stop but has not completed the stop task, therefore, it is necessary to predict the scheduling response duration for each stop floor. Taking an elevator as an example, the distance between the elevator and a certain stop floor of the elevator can be calculated according to the current elevator position of the elevator and the position of the stop floor. According to the distance between the elevator and the stop floor and the elevator operation speed of the elevator, and in combination with influencing factors such as the floor stay duration of the stop floor, the duration for the elevator to reach the stop floor, that is, the estimated scheduling response duration for the stop floor, can be calculated. In this way, the duration for the elevator to reach each stop floor can be obtained, and then the total scheduling duration of the elevator can be calculated by comprehensively considering the duration for the elevator to reach each stop floor. The total scheduling duration of each elevator can be predicted through the above method.

[0068] Schematically, the calculation method for the duration for the elevator to reach the stop floor can be as follows:

[0069] t i =d i / v + delay i Equation (1)

[0070] Wherein, t i is the duration for the elevator to reach stop floor i, d i is the distance between the elevator and stop floor i, v is the elevator operation speed, delay i is other influencing factors corresponding to stop floor i, including the floor stay duration, etc., i = 1, 2, 3,..., n, and n is the number of stop floors.

[0071] Other influencing factors corresponding to the stopping floors can be obtained based on the historical data of the stopping floors. For example, for the floor stay duration of the stopping floors, since the floor stay duration recorded in the operation data is the actual floor stay duration corresponding to the floors where the elevator has completed the stopping task, and the stopping floor is the floor where the elevator currently needs to stop but has not completed the stopping task, therefore, it is necessary to predict the floor stay duration of each stopping floor. Schematically, the floor stay duration of the stopping floor can be predicted based on at least one historical floor stay duration of the stopping floor.

[0072] In an embodiment of the present application, based on the time taken for the elevator to reach each stopping floor, the total scheduling duration of the elevator is determined, including: determining the weights of each stopping floor from the weights of each floor, and calculating the total scheduling duration of the elevator according to the time taken for the elevator to reach each stopping floor and the weights of each stopping floor, where the determination method of the weights of each floor includes

[0073] Obtaining the historical operation data of the elevator, where the historical operation data of the elevator includes the historical number of passengers taking the elevator on each floor; and allocating weights to each floor based on the historical number of passengers taking the elevator on each floor to obtain the weights of each floor.

[0074] In this embodiment, the total scheduling duration of the elevator can be calculated through a time calculation algorithm based on linear weights to optimize elevator scheduling and improve the operating efficiency of the elevator. The historical operation data of the elevator can be obtained, and the busyness of different floors can be analyzed based on the historical operation data. For example: the waiting number of people (i.e., the number of passengers taking the elevator) on each floor can be obtained through the elevator monitoring system according to the button pressing situation or passenger information on the floor, including the number of passengers waiting after the elevator arrives at the floor. The waiting number of people on each floor is recorded in real time and updated regularly as the historical number of passengers taking the elevator on each floor to ensure making decisions based on the latest data and improving the accuracy and reliability of scheduling. The historical number of passengers taking the elevator on each floor is used as a reference for the current number of passengers taking the elevator on each floor to analyze the busyness of different floors.

[0075] For busy floors, such as the lobby, main floor, etc., the waiting number of people is usually large, and a higher weight can be given. For example, the allocated weight can be between 1.2 and 2.0; for relatively less used floors, such as technical floors, storage floors, etc., the waiting number of people is usually small, and a lower weight can be given. For example, the allocated weight can be between 0.5 and 1.0.

[0076] In addition, the weight allocation can also be dynamically adjusted. For example: the weights of each floor can be adjusted based on historical data such as historical peak periods and historical floor usage frequencies, making the scheduling more flexible and real-time; the waiting number of people on each current floor can also be obtained, and the weights of each floor are dynamically adjusted based on the waiting number of people on each current floor to ensure that the scheduling plan is always optimized and avoid peak periods or elevator congestion.

[0077] Then, combining the time taken for the elevator to reach each stop floor and the weights of each stop floor, through weighted calculation, the total scheduling time of the elevator is obtained. Schematically, the calculation method of the total scheduling time of the elevator can be as follows:

[0078]

[0079] where, t reaction is the total scheduling time of the elevator, t i is the time taken for the elevator to reach stop floor i, ω i is the weight of stop floor i, i = 1, 2, 3,..., n, and n is the number of stop floors.

[0080] The total scheduling time obtained through weighted calculation reflects the expected value of the minimum moment when the elevator unlocks. Based on this value for elevator scheduling optimization, it can ensure the shortest elevator scheduling response time and improve the scheduling efficiency of the elevator.

[0081] Step S230: Compare the time taken for the visitor to reach the waiting floor with the total scheduling time of each elevator respectively. Based on the comparison results, determine the target elevator from each elevator, and determine the lock opening moment according to the arrival time, the time taken for the visitor to reach the waiting floor, and the total scheduling time of the target elevator.

[0082] In an embodiment of the present application, any elevator with a total scheduling time less than or equal to the time taken for the visitor to reach the waiting floor can be selected as the target elevator, or the elevator with the maximum or minimum total scheduling time can be selected from the elevators with a total scheduling time less than or equal to the time taken for the visitor to reach the waiting floor as the target elevator, and there is no limitation here. Schematically, the determination method of the lock opening moment can be as follows:

[0083] T lock = T arrive -Δt - t reaction Equation (3)

[0084] where, T lock is the lock opening moment, T arrive is the time when the visitor reaches the waiting floor, t reaction is the total scheduling time, and Δt is the preset time margin. The time when the visitor reaches the waiting floor can be obtained based on the arrival time and the time taken for the visitor to reach the waiting floor, such as: the time when the visitor reaches the waiting floor = arrival time + the time taken for the visitor to reach the waiting floor. The preset time margin can be 20s or 15s, or other durations set as needed, and there is no limitation here.

[0085] In an embodiment of the present application, the duration of the visitor's arrival at the waiting floor for the elevator is compared with the total dispatching duration of each elevator respectively, and a target elevator is determined from each elevator based on the comparison result, including: taking the elevator with a total dispatching duration less than the duration of the visitor's arrival at the waiting floor as a candidate elevator; calculating the difference between the duration of the visitor's arrival at the waiting floor and the total dispatching duration of each candidate elevator as the duration difference corresponding to each candidate elevator; comparing the duration differences corresponding to each candidate elevator with a preset range, and determining the target elevator from the candidate elevators with duration differences within the preset range.

[0086] In this embodiment, if there is an elevator with a total dispatching duration less than the duration of the visitor's arrival at the waiting floor, then this elevator is taken as a candidate elevator. If the total dispatching duration of all elevators is greater than or equal to the duration of the visitor's arrival at the waiting floor, then the elevator with the minimum total dispatching duration is taken as the target elevator.

[0087] The preset range can be 15s - 20s, or 20s - 25s, or other duration ranges, which are not limited here. Under the condition that there are candidate elevators, calculate the duration differences corresponding to each candidate elevator to determine the target elevator from the candidate elevators with duration differences within the preset range. Among them, if there is only one candidate elevator with a duration difference within the preset range, then this candidate elevator is taken as the target elevator. If there are at least two candidate elevators with duration differences within the preset range, then select the candidate elevator with the minimum or maximum duration difference from these at least two candidate elevators as the target elevator.

[0088] If the time differences corresponding to all candidate elevators exceed the preset range, then further compare the time differences corresponding to each candidate elevator with the upper limit value and the lower limit value of the preset range respectively. If the time differences corresponding to all candidate elevators are less than the lower limit value, select the candidate elevator with the largest time difference from all candidate elevators as the target elevator. If there is at least one candidate elevator whose corresponding time difference is greater than the upper limit value, then regard this at least one candidate elevator as a to-be-determined elevator; update the operation data of each to-be-determined elevator in real time, and re-predict the total scheduling time of each to-be-determined elevator according to the updated operation data of each to-be-determined elevator; compare the time when the visitor arrives at the waiting floor with the new total scheduling time of each to-be-determined elevator respectively. If there is a to-be-determined elevator whose new total scheduling time is less than the time when the visitor arrives at the waiting floor, then regard this to-be-determined elevator as a secondary candidate elevator. If the new total scheduling time of all to-be-determined elevators is greater than or equal to the time when the visitor arrives at the waiting floor, then regard the to-be-determined elevator with the smallest new total scheduling time as the target elevator. Under the condition that there are secondary candidate elevators, calculate the difference between the time when the visitor arrives at the waiting floor and the new total scheduling time of each secondary candidate elevator respectively as the new time difference corresponding to each secondary candidate elevator. If there is only one secondary candidate elevator whose corresponding new time difference is within the preset range, then regard this secondary candidate elevator as the target elevator. If there are at least two secondary candidate elevators whose corresponding new time differences are within the preset range, then select the secondary candidate elevator with the smallest or largest new time difference from these at least two secondary candidate elevators as the target elevator. If the new time differences corresponding to all secondary candidate elevators exceed the preset range, repeat the above steps until the target elevator is obtained.

[0089] Step S240, lock the stop floor of the target elevator at the locked opening time, so that after the target elevator completes the stop task at the locked stop floor, it goes to the waiting floor to pick up and carry the target visitor.

[0090] In an embodiment of the present application, the operation data includes the stop floor. The stop floor of the target elevator can be locked by the elevator control system at the locked opening time. After locking the stop floor, when a new stop floor appears, for example, a passenger in the target elevator presses a floor other than the stop floor, or a passenger on a floor other than the stop floor presses the elevator call button, the target elevator no longer responds to the new stop floor, but directly goes to the waiting floor to wait and carry the target visitor after completing the stop task at the locked stop floor.

[0091] In some embodiments, when the visitor arrives in front of the elevator door on the waiting floor, the identity of the visitor can be verified through face recognition. If the face recognition result of the visitor matches the personal information of the target visitor, it means the verification is successful, and the elevator door can be controlled to open automatically.

[0092] In one embodiment of the present application, before the target elevator goes to the waiting floor to pick up the target visitor, the method further includes: obtaining the personal information of the target visitor, and performing a reservation query on the target visitor according to the personal information; if there is reservation information of the target visitor, obtaining the floor to be visited from the reservation information, so that the target elevator transports the target visitor to the floor to be visited; if there is no reservation information of the target visitor, querying the historical visited floors of the target visitor according to the personal information, and predicting the floor to be visited based on the historical visited floors, so that the target elevator goes to the waiting floor to transport the target visitor to the floor to be visited.

[0093] In this embodiment, the identity information of the target visitor can be obtained through face recognition as personal information, and whether there is reservation (invitation) information of the target visitor is queried from the database according to the personal information. The reservation information includes information such as visitor identity information, face information, contact information, visit time, visitor, visit floor, and visited company. If there is reservation information of the target visitor, it means that the target visitor has made a reservation, and the visit floor (arrival floor) of the target visitor can be obtained according to the reservation information as the floor to be visited. If there is no reservation information of the target visitor, it means that the target visitor has not made a reservation, and the historical visit record of the target visitor can be queried according to the personal information. Based on the historical visited floors in the historical visit record, the floor to be visited is predicted. For example: if there is only one historical visited floor, the historical visited floor can be directly used as the floor to be visited; if there are at least two historical visited floors, the visit times of the target visitor to each historical visited floor can be counted, and the historical visited floor with the most visit times can be used as the floor to be visited, or the historical visited floor of the target visitor's most recent visit can be used as the floor to be visited.

[0094] After determining the floor to be visited, the target elevator can be controlled by the elevator control system to go to the waiting floor to transport the target visitor to the floor to be visited after completing the docking task at the locked docking floor, which can further improve the elevator riding experience of the target visitor.

[0095] In one embodiment of the present application, the elevator operation strategy can also be dynamically adjusted according to the actual arrival information of the target visitor. For example: after the target visitor arrives at the waiting floor, the actual arrival waiting floor duration of the target visitor can be obtained according to the arrival time of the target visitor and the time when the target visitor arrives at the waiting floor. Based on the actual arrival waiting floor duration, the predicted visitor arrival waiting floor duration is corrected for errors to obtain a correction value, which is used for the prediction of the new visitor arrival waiting floor duration, so as to continuously optimize the prediction ability.

[0096] Please refer to Figure 3 , Figure 3 which is the workflow diagram of elevator dispatching shown in a specific embodiment of the present application.

[0097] As Figure 3As shown in the figure, the workflow of elevator dispatching is as follows:

[0098] 1. After the visitor arrives, the identity information or license plate information of the visitor can be obtained through the face recognition device or license plate recognition device as the visitor arrival information. Among them, if the visitor arrives by car, the license plate information can be obtained through the license plate recognition device in the intelligent parking system; if the visitor arrives on foot, the identity information of the visitor can be obtained through the face recognition device in the intelligent access system;

[0099] 2. The intelligent parking system or intelligent access system pushes the visitor arrival information to the visitor management system. The visitor management system starts the user identity authentication process based on the visitor arrival information and the pre-stored multi-dimensional information. If the visitor is authenticated as a VIP visitor, the reservation (invitation) information of the VIP visitor is obtained. If the VIP visitor has made a reservation (invitation), the arrival floor (the floor to be visited) can be obtained according to the reservation information. If the VIP visitor has not made a reservation (invitation), the arrival floor can be predicted based on the historical visit records.

[0100] 3. Through the camera and the radio frequency receiving device, the current location information or parking location of the VIP visitor is obtained as the arrival location of the VIP visitor, and the acquisition time of the arrival location is used as the arrival time of the VIP visitor. Based on the arrival location and the location of the waiting elevator floor, the speed and distance of the VIP visitor from the arrival location to the waiting elevator floor are predicted, and the duration to reach the waiting elevator floor is estimated.

[0101] 4. According to the real-time operation data and the stopping floors of the elevator, a time calculation algorithm based on linear weights is used to calculate the total dispatching duration of the elevator. Based on the arrival time, the duration for the visitor to reach the waiting elevator floor, and the total dispatching duration, the locked opening time is determined, and the elevator is locked in advance for the VIP visitor without feeling, ensuring the shortest waiting time.

[0102] 5. When the VIP visitor arrives at the elevator door, the identity is verified through the face recognition module. If the match is successful, the elevator door will automatically open and the arrival floor will be lit.

[0103] In this specific embodiment, for the detailed process of elevator dispatching, please refer to the descriptions in the foregoing various embodiments, and details are not described herein again.

[0104] Please refer to Figure 4 , Figure 4 which is a block diagram of an elevator dispatching device shown in an exemplary embodiment of the present application. This device can be applied to Figure 1 the implementation environment shown in the figure. This device can also be applicable to other exemplary implementation environments. The implementation environment applicable to this device is not limited in this embodiment. As Figure 4As shown in the figure, the exemplary elevator scheduling device includes: a user identification module 410, configured to obtain the arrival location and arrival time of a target visitor; an elevator monitoring module 420, configured to monitor the operation data of each elevator; an information processing module 430, configured to predict the duration from the arrival location of the target visitor to the waiting floor as the duration for the visitor to reach the waiting floor, and predict the total scheduling duration of each elevator based on the operation data of each elevator; compare the duration for the visitor to reach the waiting floor with the total scheduling duration of each elevator respectively, determine the target elevator from each elevator based on the comparison result, and determine the locking opening time according to the arrival time, the duration for the visitor to reach the waiting floor, and the total scheduling duration of the target elevator; an elevator control module 440, configured to lock the stopping floor of the target elevator at the locking opening time, so that after the target elevator completes the stopping task at the locked stopping floor, it goes to the waiting floor to pick up and carry the target visitor, where the operation data includes the stopping floor.

[0105] In this embodiment, the user identification module 410 may be a vision system such as a face recognition device, a license plate recognition device, etc., and the elevator monitoring module 420 may be various sensors installed in the elevator; the information processing module 430 may be a computer, a computing cluster, a microcomputer, an embedded computer, a neural network computer, a processor, etc., and the elevator control module 440 may be an elevator control system, which are not limited herein.

[0106] In an embodiment of the present application, the elevator scheduling device further includes: an execution module, configured to execute elevator operation operations to enable the elevator to complete the stopping task; a storage module, configured to store data, including the historical arrival information of the visitor, the reservation information of the visitor, the personal information of VIP visitors, the historical operation data of the elevator, etc.

[0107] In a specific embodiment of the present application, there is also provided an elevator scheduling system, including: a user identification module, configured to identify and verify the identity of the visitor, and real-time locate the visitor's position through the parking position, access control information, and face recognition technology; an elevator status monitoring and feedback module, configured to monitor the operation status of each elevator in real time, and obtain the elevator operation data and scheduling results; a priority calculation module, configured to determine the visitor level to represent the scheduling priority of the visitor; an elevator scheduling decision module, configured to optimize the elevator scheduling strategy through the visitor scheduling priority and the operation data of the elevator, and send an elevator scheduling command to the elevator control system; an elevator control system, configured to control the execution module according to the elevator scheduling command; an execution module, configured to respond to the control of the elevator control system and execute the corresponding elevator operation operations; a storage module, configured to store the historical arrival information of VIP visitors, the historical operation data of the elevator, the elevator scheduling log, and other auxiliary data required for optimizing the scheduling strategy.

[0108] Schematically, the interaction process of each module in the elevator scheduling system may be as follows:

[0109] The user identification module identifies visitors, receives and obtains the visitor arrival information of visitors in real time (i.e., the identification result, including personal information, arrival location, arrival time, etc.) and feeds it back to the elevator dispatching decision module; the elevator dispatching decision module sends a priority calculation request to the priority calculation module and sends a request to obtain the current elevator status to the elevator status monitoring module; the priority calculation module sends a visitor identity authentication request to the user identification module, so that the user identification module responds to the visitor identity authentication request, matches the identification result with the personal information of the pre-stored VIP visitors to authenticate the visitor and returns the visitor identity authentication result, and the priority calculation module determines the visitor level according to the visitor identity authentication result returned by the request, and then obtains the dispatching priority of the visitor and feeds it back to the elevator dispatching decision module; at the same time, the elevator status monitoring and feedback module sends the current operation data of the elevator to the elevator dispatching decision module; the elevator dispatching decision module optimizes the elevator dispatching strategy by obtaining the visitor dispatching priority and the current operation data of the elevator to determine the target elevator and the locked opening time, and sends an elevator dispatching command to the elevator control system; the elevator control system controls the execution module according to the elevator dispatching command, so that the execution module performs the corresponding elevator operation; the elevator status monitoring and feedback module feeds back the dispatching result to the elevator dispatching decision module in real time, so that the elevator dispatching decision module adjusts the elevator dispatching strategy according to the feedback result to ensure the real-time and accuracy of elevator dispatching.

[0110] This elevator dispatching system is an example of an elevator dispatching device. Among them, the elevator status monitoring and feedback module is an example of the elevator monitoring module 420, the priority calculation module and the elevator dispatching decision module constitute an example of the information processing module 430, and the elevator control system is an example of the elevator control module 440.

[0111] It should be noted that the elevator dispatching device provided in the above embodiment and the elevator dispatching method provided in the above embodiment belong to the same concept. The specific ways in which each module and unit perform operations have been described in detail in the method embodiment, and will not be repeated here. In practical applications, the elevator dispatching device provided in the above embodiment can allocate the above functions to different functional modules as needed, that is, divide the internal structure of the device into different functional modules to complete all or part of the functions described above, and this will not be limited here either.

[0112] This embodiment also provides an electronic device, including: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the electronic device realizes the elevator dispatching method provided in each of the above embodiments.

[0113] Please refer toFigure 5 , Figure 5 is a schematic structural diagram of an electronic device shown in an exemplary embodiment of the present application. It should be noted that Figure 5 the electronic device 500 shown is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.

[0114] As Figure 5 shown, the electronic device 500 includes a processor 501, a memory 502, and a communication bus 503; the communication bus 503 is used to connect the processor 501 and the memory 502; the processor 501 is used to execute the computer program stored in the memory 502 to implement the method of one or more of the above embodiments.

[0115] This embodiment also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by the processor of the computer, the computer is enabled to execute the elevator scheduling method as described above. The computer-readable storage medium may be included in the electronic device described in the above embodiments, or may exist alone without being assembled into the electronic device.

[0116] This embodiment also provides a computer program product or a computer program. The computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the elevator scheduling method provided in each of the above embodiments.

[0117] The electronic device provided in this embodiment includes a processor, a memory, a transceiver, and a communication interface. The memory and the communication interface are connected to the processor and the transceiver and complete communication with each other. The memory is used to store a computer program, the communication interface is used for communication, and the processor and the transceiver are used to run the computer program to enable the electronic device to execute each step of the above method.

[0118] In this embodiment, the memory may include a random access memory (Random Access Memory, abbreviated as RAM), and may also include a non-volatile memory, such as at least one disk memory.

[0119] The above-mentioned processor may be a general-purpose processor, including a central processing unit (CPU for short), a network processor (NP for short), etc.; it may also be a digital signal processor (DSP for short), an application specific integrated circuit (ASIC for short), a field-programmable gate array (FPGA for short), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0120] For the computer-readable storage medium in this embodiment, those of ordinary skill in the art can understand that all or part of the steps for implementing the above method embodiments can be completed by hardware related to a computer program. The foregoing computer program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above method embodiments; and the foregoing storage medium includes: various media such as ROM (read-only memory), RAM (random access memory), magnetic disk, or optical disc that can store program codes.

[0121] The above embodiments only exemplarily illustrate the principles and effects of the present application, rather than limiting the present application. Any person familiar with this technology can modify or change the above embodiments without departing from the spirit and scope of the present application. Therefore, all equivalent modifications or changes completed by those with ordinary knowledge in the technical field without departing from the spirit and technical idea disclosed by the present application should still be covered by the claims of the present application.

Claims

1. An elevator scheduling method, characterized in that, The method includes: Obtaining the arrival location and arrival time of a target visitor, and monitoring the operation data of each elevator; Predicting the duration for the target visitor to reach the waiting floor from the arrival location as the visitor arrival waiting floor duration, and predicting the total scheduling duration of each elevator based on the operation data of each elevator; Comparing the visitor arrival waiting floor duration with the total scheduling duration of each elevator respectively, determining a target elevator from each elevator based on the comparison result, and determining a locked opening time according to the arrival time, the visitor arrival waiting floor duration, and the total scheduling duration of the target elevator; Locking the stop floor of the target elevator at the locked opening time, so that after the target elevator completes the stop task at the locked stop floor, it goes to the waiting floor to pick up the target visitor, where the operation data includes the stop floor.

2. The elevator dispatching method according to claim 1, wherein Predicting the duration for the target visitor to reach the waiting floor from the arrival location as the visitor arrival waiting floor duration includes: Obtaining the personal information of the target visitor, querying the historical arrival information of the target visitor according to the personal information, and obtaining the historical arrival location of the target visitor and the duration for the target visitor to reach the waiting floor from the historical arrival location based on the historical arrival information; Calculating the historical speed of the target visitor according to the distance between the historical arrival location and the location of the waiting floor and the duration for the target visitor to reach the waiting floor from the historical arrival location, where the waiting floor has a corresponding location; Calculating the duration for the target visitor to reach the waiting floor from the arrival location according to the distance between the arrival location and the location of the waiting floor and the historical speed of the target visitor as the visitor arrival waiting floor duration.

3. The elevator dispatching method according to claim 1, wherein Predicting the total scheduling duration of each elevator based on the operation data of each elevator includes: Calculating the distance between the elevator and each stop floor according to the current elevator position of the elevator and the positions of each stop floor, where the operation data further includes the current elevator position, and the stop floor has a corresponding location; Calculating the duration for the elevator to reach each stop floor according to the distance between the elevator and each stop floor and the elevator operation speed of the elevator, where the operation data further includes the elevator operation speed; Determining the total scheduling duration of the elevator based on the duration for the elevator to reach each stop floor.

4. The elevator dispatching method according to claim 3, characterized in that, Determining the total scheduling duration of the elevator based on the duration for the elevator to reach each stop floor includes: Determining the weights of each stop floor from the weights of each floor, and calculating the total scheduling duration of the elevator according to the duration for the elevator to reach each stop floor and the weights of each stop floor, where the determination method of the weights of each floor includes Obtaining elevator historical operation data, where the elevator historical operation data includes the historical number of passengers on each floor; Performing weight allocation for each floor based on the historical number of passengers on each floor to obtain the weights of each floor.

5. The elevator scheduling method according to claim 1, characterized in that Comparing the visitor arrival waiting floor duration with the total scheduling duration of each elevator respectively, and determining a target elevator from each elevator based on the comparison result includes: Take the elevator with a total scheduling duration less than the duration of the visitor arriving at the waiting floor as a candidate elevator; Calculate the difference between the duration of the visitor arriving at the waiting floor and the total scheduling duration of each candidate elevator, as the duration difference corresponding to each candidate elevator; Compare the duration differences corresponding to each candidate elevator with a preset range, and determine the target elevator from the candidate elevators whose duration differences are within the preset range.

6. The elevator dispatching method according to any one of claims 1-5, characterized in that, Before going to the waiting floor to pick up the target visitor, the method further includes: Obtain the personal information of the target visitor, and perform a reservation query on the target visitor according to the personal information; If there is reservation information of the target visitor, obtain the floor to be visited from the reservation information, so that the target elevator transports the target visitor to the floor to be visited; If there is no reservation information of the target visitor, query the historical visited floors of the target visitor according to the personal information, and predict the floor to be visited according to the historical visited floors, so that the target elevator goes to the waiting floor to transport the target visitor to the floor to be visited.

7. The elevator dispatching method according to any one of claims 1-5, characterized in that, Obtain the arrival location and arrival time of the target visitor, including: Identify the visitors to be authenticated in a preset area to obtain the identification result of the visitors to be authenticated; Match the identification result of the visitors to be authenticated with a preset visitor information database, and determine the visitor level of the visitors to be authenticated based on the matching result, where the visitor level includes a general level or a member level; If the visitor level of the visitors to be authenticated is the member level, determine the visitors to be authenticated as the target visitor, and use the identification location and identification time of the visitors to be authenticated as the arrival location and arrival time of the target visitor respectively, where the identification location refers to the location where the visitors to be authenticated are identified, and the identification time refers to the time when the visitors to be authenticated are identified.

8. An elevator scheduling device, characterized in that, The device includes: A user identification module, configured to obtain the arrival location and arrival time of the target visitor; An elevator monitoring module, configured to monitor the operation data of each elevator; An information processing module, configured to predict the duration of the target visitor from the arrival location to the waiting floor as the duration of the visitor arriving at the waiting floor, and predict the total scheduling duration of each elevator based on the operation data of each elevator; compare the duration of the visitor arriving at the waiting floor with the total scheduling duration of each elevator respectively, determine the target elevator from each elevator based on the comparison result, and determine the locked opening time according to the arrival time, the duration of the visitor arriving at the waiting floor, and the total scheduling duration of the target elevator; An elevator control module, configured to lock the stopping floor of the target elevator at the locked opening time, so that after the target elevator completes the stopping task at the locked stopping floor, it goes to the waiting floor to transport the target visitor, where the operation data includes the stopping floor.

9. An electronic device, characterized in that, The electronic device includes: One or more processors; A storage device, configured to store one or more programs, which when executed by the one or more processors, cause the electronic device to implement the elevator scheduling method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, A computer program is stored thereon, which, when executed by a processor of a computer, causes the computer to execute the elevator dispatching method according to any one of claims 1-7.

Images