Elevator dispatching method, apparatus, device, and storage medium
By determining the number of people in the elevator waiting area and calculating the scheduling priority, the problem of users not being able to board the elevator due to unreasonable elevator stops was solved, resulting in more efficient elevator scheduling and an optimized elevator experience.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SOUNDAI TECH CO LTD
- Filing Date
- 2023-04-04
- Publication Date
- 2026-06-30
AI Technical Summary
In existing elevator dispatching systems, elevators often stop at locations far from users, causing users to miss their rides and resulting in poor dispatching efficiency.
By determining the current location of each person waiting to take the elevator, the number of people in the waiting area of each elevator is calculated, and the elevator scheduling priority is determined based on this to ensure that elevators with available capacity that meet the transportation conditions stop at the user's floor first.
It improves the efficiency of users taking the elevator, reduces the probability of not being able to take the elevator in time due to the elevator being too far away from the user, and optimizes the user's elevator experience.
Smart Images
Figure CN116443679B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of computer technology, and in particular to an elevator scheduling method, apparatus, device, and storage medium. Background Technology
[0002] Elevators are currently an essential tool for users to move between floors. When a user presses the dispatch button on any floor, an elevator will stop at that floor. Currently, elevator dispatch systems typically dispatch idle elevators or those with the lowest power consumption to that floor. However, this dispatching method has a problem: if the stopped elevator is too far from the user, the user may miss the elevator, resulting in poor dispatching efficiency. Summary of the Invention
[0003] This application provides an elevator scheduling method, apparatus, device, and storage medium. This method ensures intelligent elevator scheduling, reduces the probability of users missing their elevators due to distance, and achieves better scheduling results, thereby improving user efficiency and optimizing the user's elevator experience. The technical solution is as follows:
[0004] On the one hand, an elevator scheduling method is provided, the method comprising:
[0005] Upon receiving an elevator dispatch request for the first floor, determine the current location of each person waiting to take the elevator on the first floor;
[0006] Based on the current location of each person waiting to ride the elevator, determine the number of people waiting in the waiting area of each elevator;
[0007] The scheduling priority of each elevator is determined based on the number of people waiting in each waiting area;
[0008] According to the scheduling priority of each elevator, the elevator with available capacity that meets the transportation conditions will stop at the first floor, where available capacity refers to the number of people that the elevator can currently carry.
[0009] In one possible implementation, the elevator scheduling request includes at least one of an upward elevator scheduling request or a downward elevator scheduling request;
[0010] The process of determining the scheduling priority of each elevator based on the number of people waiting in each waiting area includes:
[0011] If the elevator dispatch request includes the upward elevator dispatch request, the upward dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0012] When the elevator dispatch request includes the down elevator dispatch request, the down dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0013] When the elevator scheduling request includes both the upward elevator scheduling request and the downward elevator scheduling request, the overall scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator; the upward scheduling priority and the downward scheduling priority of each elevator are determined according to the first ratio and the overall scheduling priority of each elevator.
[0014] In one possible implementation, the first ratio includes an estimated ratio corresponding to uplink scheduling and an estimated ratio corresponding to downlink scheduling;
[0015] The determination of the upward and downward scheduling priorities of each elevator according to the first ratio and the comprehensive scheduling priority of each elevator includes:
[0016] The product of the estimated ratio corresponding to the upward scheduling and the comprehensive scheduling priority of each elevator is determined as the upward scheduling priority of each elevator.
[0017] The product of the estimated ratio corresponding to the down-line scheduling and the comprehensive scheduling priority of each elevator is determined as the down-line scheduling priority of each elevator.
[0018] In one possible implementation, the method further includes:
[0019] Obtain the first correspondence between elevator operating time periods and the up and down scheduling ratio;
[0020] In the first correspondence, the uplink and downlink scheduling ratio corresponding to the time period to which the current time belongs is determined to obtain the first ratio.
[0021] In one possible implementation, the elevator scheduling request includes an upward elevator scheduling request and a downward elevator scheduling request, and the scheduling priority includes an upward scheduling priority and a downward scheduling priority;
[0022] The step of scheduling elevators according to their scheduling priority to ensure that available capacity meets transportation requirements and stops them on the first floor includes:
[0023] According to the second ratio, the number of people going up and the number going down are determined from the number of people waiting to take the elevator;
[0024] According to the order of the upward scheduling priority from high to low, elevators with available capacity not less than the number of people going up are scheduled to stop at the first floor;
[0025] Elevators with available capacity no less than the number of passengers traveling downhill are scheduled to stop at the first floor, according to the descending priority order.
[0026] In one possible implementation, the second ratio includes an estimated ratio for the number of people going up and an estimated ratio for the number of people going down.
[0027] The step of determining the number of people going up and the number of people going down from the number of people waiting to take the elevator according to the second ratio includes:
[0028] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going up.
[0029] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going downhill.
[0030] In one possible implementation, the method further includes:
[0031] Obtain the second correspondence between elevator operating time and the ratio of people going up and down;
[0032] In the second correspondence, the ratio of upbound and downbound passengers corresponding to the time period to which the current time belongs is determined to obtain the second ratio.
[0033] In one possible implementation, the elevator's waiting area includes multiple areas;
[0034] The process of determining the scheduling priority of each elevator based on the number of people waiting in each waiting area includes:
[0035] Obtain the initial weight of each waiting area in the multiple waiting areas of each elevator;
[0036] For each elevator, the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area is determined as the area priority of each waiting area in the elevator.
[0037] The sum of the regional priorities of each waiting area in the elevator is determined as the overall scheduling priority of the elevator.
[0038] On the other hand, an elevator dispatching device is provided, the device comprising:
[0039] The location determination module is used to determine the current location of each person waiting to take the elevator on the first floor after receiving an elevator dispatch request for the first floor.
[0040] The number of people determination module is used to determine the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to take the elevator.
[0041] The priority determination module is used to determine the scheduling priority of each elevator based on the number of people waiting in each waiting area;
[0042] The scheduling module is used to schedule elevators with available capacity that meet the transportation conditions to stop at the first floor according to the scheduling priority of each elevator, wherein the available capacity refers to the number of people that the elevator can currently carry.
[0043] In one possible implementation, the elevator scheduling request includes at least one of an upward elevator scheduling request or a downward elevator scheduling request;
[0044] The priority determination module is used for:
[0045] If the elevator dispatch request includes the upward elevator dispatch request, the upward dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0046] When the elevator dispatch request includes the down elevator dispatch request, the down dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0047] When the elevator scheduling request includes both the upward elevator scheduling request and the downward elevator scheduling request, the overall scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator; the upward scheduling priority and the downward scheduling priority of each elevator are determined according to the first ratio and the overall scheduling priority of each elevator.
[0048] In one possible implementation, the first ratio includes an estimated ratio corresponding to uplink scheduling and an estimated ratio corresponding to downlink scheduling;
[0049] The priority determination module is used for:
[0050] The product of the estimated ratio corresponding to the upward scheduling and the comprehensive scheduling priority of each elevator is determined as the upward scheduling priority of each elevator.
[0051] The product of the estimated ratio corresponding to the down-line scheduling and the comprehensive scheduling priority of each elevator is determined as the down-line scheduling priority of each elevator.
[0052] In one possible implementation, the device further includes:
[0053] The acquisition module is used to obtain the first correspondence between the elevator operating time period and the up and down scheduling ratio;
[0054] The ratio determination module is used to determine the uplink and downlink scheduling ratio corresponding to the time period to which the current time belongs in the first correspondence relationship, so as to obtain the first ratio.
[0055] In one possible implementation, the elevator scheduling request includes an upward elevator scheduling request and a downward elevator scheduling request, and the scheduling priority includes an upward scheduling priority and a downward scheduling priority;
[0056] The scheduling module is used for:
[0057] According to the second ratio, the number of people going up and the number going down are determined from the number of people waiting to take the elevator;
[0058] According to the order of the upward scheduling priority from high to low, elevators with available capacity not less than the number of people going up are scheduled to stop at the first floor;
[0059] Elevators with available capacity no less than the number of passengers traveling downhill are scheduled to stop at the first floor, according to the descending priority order.
[0060] In one possible implementation, the second ratio includes an estimated ratio for the number of people going up and an estimated ratio for the number of people going down.
[0061] The scheduling module is used for:
[0062] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going up.
[0063] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going downhill.
[0064] In one possible implementation, the device further includes:
[0065] The acquisition module is used to obtain a second correspondence between the elevator operating time period and the ratio of people going up and down;
[0066] The ratio determination module is used to determine the ratio of upbound and downbound passengers corresponding to the time period to which the current time belongs in the second correspondence relationship, so as to obtain the second ratio.
[0067] In one possible implementation, the elevator's waiting area includes multiple areas;
[0068] The priority determination module is used for:
[0069] Obtain the initial weight of each waiting area in the multiple waiting areas of each elevator;
[0070] For each elevator, the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area is determined as the area priority of each waiting area in the elevator.
[0071] The sum of the regional priorities of each waiting area in the elevator is determined as the overall scheduling priority of the elevator.
[0072] On the other hand, a computer device is provided, the computer device including a processor and a memory, the memory storing at least one computer program, the at least one computer program being loaded and executed by the processor to perform the operations performed by the elevator scheduling method as described above.
[0073] On the other hand, a computer-readable storage medium is provided that stores at least one computer program, which is loaded and executed by a processor to perform the operations performed by the elevator scheduling method as described above.
[0074] In another aspect, a computer program product is provided, comprising a computer program that, when executed by a processor, performs the operations performed by the elevator scheduling method described above.
[0075] This application provides a novel elevator scheduling scheme. This scheme determines elevator scheduling priorities based on the number of people waiting in different elevator waiting areas on a floor. This allows the scheme to schedule elevators with the most waiting passengers to stop at that floor, enabling waiting passengers to board the nearest elevator. In other words, this method ensures intelligent elevator scheduling, reduces the probability of users missing their turn due to elevators being too far away, and achieves better scheduling efficiency, thereby improving user elevator usage and optimizing the user experience. Attached Figure Description
[0076] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0077] Figure 1 This is a schematic diagram illustrating the implementation environment of an elevator scheduling method provided in an embodiment of this application;
[0078] Figure 2 This is a flowchart of an elevator scheduling method provided in an embodiment of this application;
[0079] Figure 3This is a flowchart of another elevator scheduling method provided in the embodiments of this application;
[0080] Figure 4 This is a schematic diagram of a waiting area provided in an embodiment of this application;
[0081] Figure 5 This is a schematic diagram of the structure of an elevator dispatching device provided in an embodiment of this application;
[0082] Figure 6 This is a schematic diagram of another elevator dispatching device provided in an embodiment of this application;
[0083] Figure 7 This is a schematic diagram of the structure of a server provided in an embodiment of this application. Detailed Implementation
[0084] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the implementation methods of this application will be further described in detail below with reference to the accompanying drawings.
[0085] The terms “first,” “second,” “third,” “fourth,” etc., used in this application may be used to describe various concepts, but unless otherwise stated, these concepts are not limited by these terms. These terms are used only to distinguish one concept from another. For example, without departing from the scope of this application, a first scale may be referred to as a second scale, and similarly, a second scale may be referred to as a first scale.
[0086] As used in this application, the terms "at least one," "multiple," "each," and "any" have the following meanings: at least one includes one, two, or more; multiple includes two or more; each refers to each of the corresponding multiple; and any refers to any one of the multiple. For example, multiple waiting areas may include three waiting areas, where each refers to each of the three waiting areas, and any refers to any one of the three waiting areas, such as the first waiting area, the second waiting area, or the third waiting area.
[0087] It should be noted that all information and relationships involved in this application are authorized by the user or by all parties, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of the relevant countries and regions.
[0088] The elevator scheduling method provided in this application can be executed by a computer device. Optionally, the computer device can be a terminal or a server. The terminal can be any type of terminal such as a smartphone, desktop computer, smart wearable device, or image acquisition device. The server can be a single server, a server cluster consisting of several servers, or a cloud computing service center.
[0089] In one possible implementation, the computer device is provided as a terminal and a server. Figure 1 This is a schematic diagram illustrating the implementation environment of an elevator scheduling method provided in this application. See also... Figure 1 The implementation environment includes a terminal 101 and a server 102. The terminal 101 and the server 102 are connected via a wireless or wired network. For example, the terminal 101 is an Internet of Things (IoT) device used to collect images of the floors, and the server 102 is an elevator dispatching system used to dispatch elevators to stop at the corresponding floors.
[0090] For example, terminal 101 is responsible for collecting images of the first floor in real time. In response to receiving an elevator dispatch request for the first floor, server 102 receives the images sent by terminal 101 to server 102 and determines the current location of each person waiting to take the elevator on the first floor based on the images. Then, based on the current location of each person waiting to take the elevator, the number of people waiting in the waiting area of each elevator is determined. Based on the number of people waiting in each waiting area, the dispatch priority of each elevator is determined. Finally, according to the dispatch priority of each elevator, elevators with available capacity that meet the transportation conditions are dispatched to stop on the first floor.
[0091] In other words, IoT devices are used to collect images and send them to the elevator dispatching system. The elevator dispatching system stores the collected images and identifies the current location of each person riding the elevator based on the collected images. Subsequently, the elevator is dispatched to stop on the first floor based on each person's current location.
[0092] Optionally, the elevator dispatching system includes a memory area and a cache area. After receiving images collected by IoT devices, the elevator dispatching system stores the received images in the memory area. When dispatching the elevator, the received images are dispatched to the cache area. Then, the images stored in the cache area are identified to obtain the current position of each person riding the elevator. Subsequently, the elevator is dispatched to stop on the first floor based on the current position of each person.
[0093] Figure 2 This is a flowchart illustrating an elevator scheduling method provided in an embodiment of this application. The method is executed by a computer device, such as an elevator scheduling system. Figure 2 As shown, the method includes:
[0094] 201. Upon receiving an elevator dispatch request for the first floor, the computer equipment determines the current location of each person waiting to take the elevator on the first floor.
[0095] This elevator dispatch request is used to dispatch an elevator to the first floor. The person's current location refers to their position on the first floor.
[0096] In this embodiment of the application, if a person on the first floor needs to take the elevator up or down, an elevator dispatch request is generated by triggering the elevator's up or down button. After receiving the elevator dispatch request, the computer device will perform the following elevator dispatch operation.
[0097] 202. The computer equipment determines the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to ride the elevator.
[0098] The elevator waiting area refers to the area where people waiting to ride the elevator are located; it can also be understood as the area where people located in the elevator waiting area need to take the elevator. For example, the elevator waiting area is pre-set, and the waiting area is a certain range centered on the elevator entrance.
[0099] In this embodiment, after determining the current location of each person waiting to ride the elevator, the computer device determines whether the person intends to take the elevator based on whether their current location is within the waiting area. For example, this embodiment determines the number of people waiting in the waiting area of each elevator by counting the number of people whose current location falls within the elevator's waiting area.
[0100] 203. The computer equipment determines the scheduling priority of each elevator based on the number of people waiting in each waiting area.
[0101] Elevator scheduling priority refers to the order in which elevators stop at the first floor. The higher the scheduling priority, the earlier the elevator stops at the first floor, and vice versa.
[0102] In this embodiment of the application, the more people waiting in the elevator waiting area, the higher the scheduling priority of the elevator, and therefore the earlier the elevator stops at the first floor. Conversely, the fewer people waiting in the elevator waiting area, the lower the scheduling priority of the elevator, and therefore the later the elevator stops at the first floor.
[0103] 204. The computer equipment schedules elevators according to their scheduling priority, and then schedules the elevators whose available capacity meets the transportation conditions to stop on the first floor. Available capacity refers to the number of people that can currently ride in the elevator.
[0104] The condition that available capacity meets transportation requirements means that the available capacity of an elevator is not less than the number of people waiting to take the elevator on the first floor. The available capacity of an elevator refers to the total number of people that can currently ride in at least one elevator. Therefore, the condition that available capacity meets transportation requirements means that the total number of people that can currently ride in at least one elevator is not less than the number of people waiting to take the elevator on the first floor.
[0105] This application provides a novel elevator scheduling scheme. This scheme determines elevator scheduling priorities based on the number of people waiting in different elevator waiting areas on a floor. This allows the scheme to schedule elevators with the most waiting passengers to stop at that floor, enabling waiting passengers to board the nearest elevator. In other words, this method ensures intelligent elevator scheduling, reduces the probability of users missing their turn due to elevators being too far away, and achieves better scheduling efficiency, thereby improving user elevator usage and optimizing the user experience.
[0106] In the above Figure 2 Based on the embodiments shown, the embodiments of this application can also distinguish whether the elevator scheduling request is an upward scheduling request or a downward scheduling request. Accordingly, the elevator scheduling priority is further divided into upward scheduling priority and downward scheduling priority. For details, please refer to the following embodiments.
[0107] Figure 3 This is a flowchart of another elevator scheduling method provided in an embodiment of this application. This method is executed by computer equipment, such as an elevator scheduling system. Figure 3 As shown, the method includes:
[0108] 301. Upon receiving an elevator dispatch request for the first floor, the computer device determines the current location of each person waiting to take the elevator on the first floor.
[0109] In one possible implementation, an elevator button is installed on the first floor. If a user needs to take the elevator, they can send an elevator dispatch request for the first floor to the elevator dispatch system by pressing the button.
[0110] Optionally, the elevator buttons are of two types: an upward elevator button and a downward elevator button. If a user needs to go upstairs, they press the upward elevator button. Upon receiving the upward elevator dispatch request for that first floor, the computer system dispatches an upward elevator for the user to use. If a user needs to go downstairs, they press the downward elevator button. Upon receiving the downward elevator dispatch request for that first floor, the computer system dispatches a downward elevator for the user to use.
[0111] In another possible implementation, in response to receiving an elevator dispatch request for the first floor, the computer device acquires multiple frames of images of the first floor, and uses a first recognition model to detect the positions of the people included in the multiple frames of images to obtain the current position of each person waiting to take the elevator; exemplarily, the first recognition model is trained based on sample images labeled with the current positions of the people. Optionally, the above-mentioned multiple frames of images are obtained by a camera, and this application embodiment does not limit this.
[0112] In another possible implementation, where the aforementioned multi-frame images are infrared images, the computer device detects the current position of each person waiting to take the elevator on the first floor based on the infrared images using a second recognition model; exemplarily, the second recognition model is trained based on sample infrared images labeled with the current positions of the people. Optionally, the aforementioned infrared images are obtained through a thermal sensor or an infrared camera, and this application does not limit this to either.
[0113] It should be noted that both the first and second recognition models are machine learning models, such as convolutional neural networks, and this application does not limit them.
[0114] 302. The computer equipment determines the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to ride the elevator.
[0115] In one possible implementation, the elevator waiting area is a circular area centered on the elevator entrance, or a rectangular area centered on the elevator entrance, or an area of other shapes, which this application does not limit.
[0116] In another possible implementation, each elevator has multiple waiting areas. The computer equipment first determines the multiple waiting areas for each elevator, and then determines the number of people waiting in each waiting area of each elevator based on the current location of each person waiting to ride the elevator.
[0117] Optionally, if the waiting area of the elevator is a circular area centered on the elevator entrance, then the multiple waiting areas of the elevator are circular areas of a preset size. For example, the multiple waiting areas include waiting area 1, waiting area 2, and waiting area 3. Waiting area 1 is a circular area with a radius of 0.5 meters centered on the elevator entrance; waiting area 2 is a circular area 0.5-1 meters away from the elevator entrance; and waiting area 3 is a circular area 1-2 meters away from the elevator entrance.
[0118] Optionally, if the waiting area of the elevator is a rectangular area centered on the elevator entrance, then the multiple waiting areas of the elevator are rectangular areas of a preset size. For example, see... Figure 4 The multiple waiting areas include waiting area A, waiting area B, and waiting area C. Waiting area A is a rectangular area centered on the elevator entrance, with a length of 0.3 meters and a width of 0.2 meters. Waiting area B is a ring-shaped area excluding waiting area A within a rectangular area centered on the elevator entrance, with a length of 0.5 meters and a width of 0.3 meters. Waiting area C is a ring-shaped area excluding waiting areas A and B within a rectangular area centered on the elevator entrance, with a length of 0.8 meters and a width of 0.5 meters.
[0119] 303. When elevator dispatch requests include both upward elevator dispatch requests and downward elevator dispatch requests, the computer equipment determines the overall dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator.
[0120] If the elevator dispatch request includes both an upward elevator dispatch request and a downward elevator dispatch request, it means that there are people waiting to take the elevator on the first floor who need to go up and people who need to go down. Therefore, it is necessary to determine the upward dispatch priority and the downward dispatch priority of the elevator.
[0121] 304. The computer equipment determines the upward scheduling priority and downward scheduling priority of each elevator according to the first ratio and the comprehensive scheduling priority of each elevator.
[0122] Here, the first ratio refers to a pre-set ratio. For example, the computer equipment pre-sets a first correspondence between elevator operating time periods and up / down scheduling ratios. Accordingly, the computer equipment can determine the up / down scheduling ratio corresponding to the time period to which the current moment belongs from the first correspondence, thus obtaining the first ratio. Subsequently, the computer equipment adjusts the overall scheduling priority of the elevators according to the first ratio, obtaining the up / down scheduling priority and the down / up scheduling priority for each elevator.
[0123] In one possible implementation, the first ratio includes an estimated ratio corresponding to upward scheduling and an estimated ratio corresponding to downward scheduling. The product of the estimated ratio corresponding to upward scheduling and the comprehensive scheduling priority of each elevator is determined as the upward scheduling priority of each elevator, and the product of the estimated ratio corresponding to downward scheduling and the comprehensive scheduling priority of each elevator is determined as the downward scheduling priority of each elevator.
[0124] Additionally, the first ratio can also refer to the ratio between the estimated ratio for elevator upward scheduling and the estimated ratio for elevator downward scheduling. For example, if the first ratio is 2:3, then the estimated ratio for elevator upward scheduling indicated by the first ratio is 2 / 5, and the estimated ratio for elevator downward scheduling indicated by the first ratio is 3 / 5. Furthermore, if the overall scheduling priority of the elevator is 0.5, and the first ratio is 2:3, then the upward scheduling priority for the elevator is 0.2, and the downward scheduling priority for the elevator is 0.3.
[0125] In this embodiment, the up and down scheduling ratios differ for different time periods, indicating that the priority ratios for up and down travel also differ. Therefore, it is necessary to determine the first ratio based on the current time to ensure that an appropriate ratio is selected to adjust the overall scheduling priority of the elevators in different time periods. Thus, after determining the time period to which the current time belongs, the up and down scheduling ratio corresponding to the current time period can be determined by querying the first correspondence relationship, and the obtained up and down scheduling ratio is then determined as the first ratio.
[0126] For example, elevator operating hours include morning peak hours, noon peak hours, evening peak hours, and regular hours. The morning peak hours refer to people's commute to work, when more people need to go upstairs; therefore, the upward scheduling ratio should be higher than the downward scheduling ratio. The noon peak hours refer to people's lunch time, and the evening peak hours refer to people's after-get off work time; during these two periods, more people need to go downstairs, so the downward scheduling ratio should be higher than the upward scheduling ratio. Regular hours can be considered periods with low passenger flow, where the upward and downward scheduling ratios are the same.
[0127] In one possible implementation, the elevator waiting areas include multiple areas, and the method for obtaining the overall scheduling priority of the elevator includes the following steps: obtaining the initial weight of each waiting area in the multiple waiting areas of each elevator; for each elevator, multiplying the initial weight of each waiting area in the elevator with the number of people waiting in each waiting area to determine the area priority of each waiting area in the elevator; and summing the area priorities of each waiting area in the elevator to determine the overall scheduling priority of the elevator.
[0128] In this system, the initial weights of each waiting area within the multiple waiting areas of each elevator are pre-set. For example, if each elevator has three waiting areas: Waiting Area 1, Waiting Area 2, and Waiting Area 3, with an initial weight of 0.5 for Waiting Area 1, 0.3 for Waiting Area 2, and 0.2 for Waiting Area 3, and if Waiting Area 1 contains 4 people, Waiting Area 2 contains 2 people, and Waiting Area 3 contains 1 person, then Waiting Area 1 will have a priority of 0.5. 4=2, the region priority of waiting region 2 is 0.3. 2 = 0.6, and the region priority of waiting area 3 is 0.2. 1 = 0.2, so the overall scheduling priority of this elevator is 2 + 0.6 + 0.2 = 2.8.
[0129] 305. The computer equipment determines the number of people going up and down from the number of people waiting to ride the elevator according to the second ratio.
[0130] The second ratio refers to a pre-set ratio used to determine the number of people going up and down in the elevator.
[0131] In this embodiment of the application, the computer device determines the second ratio corresponding to the current moment and determines the number of people waiting to take the elevator on the first floor, so as to obtain the number of people waiting to go up the elevator and the number of people waiting to go down the elevator.
[0132] In one possible implementation, the second ratio includes an estimated ratio for the number of people going up and an estimated ratio for the number of people going down; the product of the number of people waiting to take the elevator and the estimated ratio for the number of people going up is determined as the number of people going up; the product of the number of people waiting to take the elevator and the estimated ratio for the number of people going down is determined as the number of people going down.
[0133] Alternatively, the second ratio can refer to the ratio between the estimated number of people waiting for the elevator to go up on the first floor and the estimated number of people waiting for the elevator to go down. For example, if the second ratio is 3:4, then the estimated number of people waiting for the elevator to go up on the first floor is 3 / 7, and the estimated number of people waiting for the elevator to go down on the first floor is 4 / 7. Furthermore, if there are 14 people waiting for the elevator on the first floor and the second ratio is 3:4, then there are 6 people waiting for the elevator to go up on the first floor and 8 people waiting for the elevator to go down on the first floor.
[0134] Optionally, when determining the second ratio, the computer device first obtains a second correspondence between the elevator operating time period and the ratio of people going up and down; in the second correspondence, it determines the ratio of people going up and down corresponding to the time period to which the current moment belongs, and then obtains the second ratio.
[0135] In this embodiment, the ratio of people going up and down varies across different time periods, indicating that the proportion of people going up and down also differs. Therefore, a second ratio needs to be determined based on the current time to ensure that an appropriate ratio is selected for different time periods to determine the number of people going up and down on the first floor. Thus, after determining the time period to which the current moment belongs, the ratio of people going up and down corresponding to the current time period can be determined by querying the second correspondence, and this ratio is then used as the second ratio.
[0136] For example, elevator operating hours include morning peak hours, midday peak hours, evening peak hours, and regular hours. The morning peak hours refer to people going to work, when more people need to go upstairs, so the proportion of people going up should be higher than the proportion going down. The midday peak hours refer to people's lunch time, and the evening peak hours refer to people's after-get off work time; during these two periods, more people need to go downstairs, so the proportion of people going down should be higher than the proportion going up. Regular hours can be considered periods with low pedestrian traffic, where the proportions of people going up and down are equal.
[0137] It should be noted that the first ratio and the second ratio can be the same ratio, or the first ratio and the second ratio can be different ratios; this application does not limit this.
[0138] 306. The computer equipment shall, in descending order of upward scheduling priority, schedule elevators with available capacity not less than the number of passengers traveling upwards to stop at the first floor; and, in descending order of downward scheduling priority, schedule elevators with available capacity not less than the number of passengers traveling downwards to stop at the first floor.
[0139] In one possible implementation, if the elevator with the highest upward scheduling priority coincides with the elevator with the highest downward scheduling priority, it is determined whether the elevator is currently in an upward or downward state. If the elevator is currently in an upward state, it is scheduled to the first floor to transport passengers needing to go upwards. For downward scheduling, after excluding the elevator from multiple elevators, the elevator with the second highest downward scheduling priority is selected to transport passengers going downwards.
[0140] For example, suppose there are multiple elevators, namely elevator 1, elevator 2, elevator 3, elevator 4, and elevator 5. The five elevators are sorted according to their upward scheduling priority, resulting in elevator 1, elevator 2, elevator 3, elevator 4, and elevator 5. Then, they are sorted according to their downward scheduling priority, resulting in elevator 1, elevator 4, elevator 2, elevator 5, and elevator 3. Since elevator 1 is currently in an upward state, it is dispatched to the first floor to transport people going upwards. Next, elevator 1 is excluded from the list of elevators 1, 2, 3, 4, and 5. The remaining four elevators are then sorted according to their downward scheduling priority, resulting in elevator 4, elevator 2, elevator 5, and elevator 3. Elevator 4 is then dispatched to the first floor to transport people going downwards.
[0141] It should be noted that this embodiment of the application illustrates an elevator scheduling request that includes both upward and downward elevator scheduling requests. In another possible implementation, if the elevator scheduling request includes either an upward or downward elevator scheduling request, steps 304-306 are not executed; instead, steps 203-204 are executed. That is, if the elevator scheduling request includes an upward elevator scheduling request, the upward scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator. If the elevator scheduling request includes a downward elevator scheduling request, the downward scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator. It should be noted that step 203, and the upward and downward scheduling priorities mentioned here, refer to the comprehensive scheduling priority in step 303.
[0142] This application provides a novel elevator scheduling scheme. This scheme determines elevator scheduling priorities based on the number of people waiting in different elevator waiting areas on a floor. This allows the scheme to schedule elevators with the most waiting passengers to stop at that floor, enabling waiting passengers to board the nearest elevator. In other words, this method ensures intelligent elevator scheduling, reduces the probability of users missing their turn due to elevators being too far away, and achieves better scheduling efficiency, thereby improving user elevator usage and optimizing the user experience.
[0143] Furthermore, in the case of simultaneous upward and downward scheduling requests, this application embodiment can adjust the elevator scheduling priority according to the corresponding ratio of upward and downward scheduling, and also determine the number of people who need to go up and the number of people who need to go down. By distinguishing between upward and downward, the accuracy of scheduling elevators for the first floor is improved, thereby optimizing the user's elevator riding experience.
[0144] Furthermore, the embodiments of this application can also adjust the ratio of downhill and uphill scheduling according to time periods. Since the demand for uphill and downhill may vary at different time periods, it ensures that elevators can be accurately scheduled at different times, thereby improving the accuracy of elevator scheduling and optimizing the user's elevator experience.
[0145] Figure 5 This is a structural schematic diagram of an elevator dispatching device provided in an embodiment of this application. Figure 5 As shown, the device includes:
[0146] The location determination module 501 is used to determine the current location of each person waiting to take the elevator on the first floor after receiving an elevator dispatch request for the first floor.
[0147] The number of people determination module 502 is used to determine the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to take the elevator.
[0148] The priority determination module 503 is used to determine the scheduling priority of each elevator based on the number of people waiting in each waiting area;
[0149] The scheduling module 504 is used to schedule elevators with available capacity that meet the transportation conditions to stop at the first floor according to the scheduling priority of each elevator, wherein the available capacity refers to the number of people that the elevator can currently carry.
[0150] In one possible implementation, the elevator scheduling request includes at least one of an upward elevator scheduling request or a downward elevator scheduling request;
[0151] The priority determination module 503 is used for:
[0152] If the elevator dispatch request includes the upward elevator dispatch request, the upward dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0153] When the elevator dispatch request includes the down elevator dispatch request, the down dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
[0154] When the elevator scheduling request includes both the upward elevator scheduling request and the downward elevator scheduling request, the overall scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator; the upward scheduling priority and the downward scheduling priority of each elevator are determined according to the first ratio and the overall scheduling priority of each elevator.
[0155] In one possible implementation, the first ratio includes an estimated ratio corresponding to uplink scheduling and an estimated ratio corresponding to downlink scheduling;
[0156] The priority determination module 503 is used for:
[0157] The product of the estimated ratio corresponding to the upward scheduling and the comprehensive scheduling priority of each elevator is determined as the upward scheduling priority of each elevator.
[0158] The product of the estimated ratio corresponding to the down-line scheduling and the comprehensive scheduling priority of each elevator is determined as the down-line scheduling priority of each elevator.
[0159] In one possible implementation, see Figure 6 The device further includes:
[0160] The acquisition module 505 is used to obtain the first correspondence between the elevator operating time period and the up and down scheduling ratio;
[0161] The ratio determination module 506 is used to determine the uplink and downlink scheduling ratio corresponding to the time period to which the current time belongs in the first correspondence relationship, so as to obtain the first ratio.
[0162] In one possible implementation, the elevator scheduling request includes an upward elevator scheduling request and a downward elevator scheduling request, and the scheduling priority includes an upward scheduling priority and a downward scheduling priority;
[0163] The scheduling module 504 is used for:
[0164] According to the second ratio, the number of people going up and the number going down are determined from the number of people waiting to take the elevator;
[0165] According to the order of the upward scheduling priority from high to low, elevators with available capacity not less than the number of people going up are scheduled to stop at the first floor;
[0166] Elevators with available capacity no less than the number of passengers traveling downhill are scheduled to stop at the first floor, according to the descending priority order.
[0167] In one possible implementation, the second ratio includes an estimated ratio for the number of people going up and an estimated ratio for the number of people going down.
[0168] The scheduling module 504 is used for:
[0169] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going up.
[0170] The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going downhill.
[0171] In one possible implementation, see Figure 6 The device further includes:
[0172] The acquisition module 505 is used to obtain the second correspondence between the elevator operating time period and the ratio of people going up and down;
[0173] The ratio determination module 506 is used to determine the ratio of upbound and downbound passengers corresponding to the time period to which the current time belongs in the second correspondence relationship, so as to obtain the second ratio.
[0174] In one possible implementation, the elevator's waiting area includes multiple areas;
[0175] The priority determination module 503 is used for:
[0176] Obtain the initial weight of each waiting area in the multiple waiting areas of each elevator;
[0177] For each elevator, the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area is determined as the area priority of each waiting area in the elevator.
[0178] The sum of the regional priorities of each waiting area in the elevator is determined as the overall scheduling priority of the elevator.
[0179] It should be noted that the above-mentioned various optional embodiments can be combined in any way to form optional embodiments of this application, and will not be described in detail here.
[0180] It should be noted that the elevator dispatching device provided in the above embodiments is only an example of the division of the above functional modules. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the computer equipment can be divided into different functional modules to complete all or part of the functions described above. In addition, the elevator dispatching device and the elevator dispatching method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process can be found in the method embodiments, which will not be repeated here.
[0181] Optionally, the elevator dispatching system is provided as a server. Figure 7This is a schematic diagram of a server structure provided in an embodiment of this application. The server 700 can vary significantly due to different configurations or performance. It may include one or more Central Processing Units (CPUs) 701 and one or more memories 702. The memories 702 store at least one computer program, which is loaded and executed by the processor 701 to implement the elevator scheduling method provided in the above-described method embodiments. Of course, the server may also have wired or wireless network interfaces, a keyboard, and input / output interfaces for input and output. The server may also include other components for implementing device functions, which will not be elaborated upon here.
[0182] This application also provides a computer-readable storage medium storing at least one computer program, which is loaded and executed by a processor to implement the operations performed by the elevator scheduling method of the above embodiments.
[0183] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the operations performed by the elevator scheduling method of the above embodiments.
[0184] Those skilled in the art will understand that all or part of the steps of the above embodiments can be implemented by hardware or by a program instructing related hardware. The program can be stored in a computer-readable storage medium, such as a read-only memory, a disk, or an optical disk.
[0185] The above description is only an optional embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present application should be included within the protection scope of the present application.
Claims
1. An elevator dispatching method, characterized by, The method includes: Upon receiving an elevator dispatch request for the first floor, determine the current location of each person waiting to take the elevator on the first floor; the elevator dispatch request includes at least one of an upward elevator dispatch request or a downward elevator dispatch request. Based on the current location of each person waiting to ride the elevator, determine the number of people waiting in the waiting area of each elevator; When the elevator scheduling request includes both an upward elevator scheduling request and a downward elevator scheduling request, the overall scheduling priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator, and a first correspondence is obtained between the elevator operating time period and the upward and downward scheduling ratio; in the first correspondence, the upward and downward scheduling ratio corresponding to the time period to which the current time belongs is determined to obtain a first ratio, and the first ratio corresponding to different time periods is different; the first ratio includes the estimated ratio corresponding to the upward scheduling of the elevator and the estimated ratio corresponding to the downward scheduling, or the first ratio refers to the ratio between the estimated ratio corresponding to the upward scheduling of the elevator and the estimated ratio corresponding to the downward scheduling. Based on the first ratio and the comprehensive scheduling priority of each elevator, determine the upward scheduling priority and downward scheduling priority of each elevator; According to the second ratio, the number of people waiting to ride the elevator is determined as the number of people going up and the number of people going down. The second ratio corresponds to the time period to which the current time belongs, and the second ratio is different for different time periods. According to the order of the upward scheduling priority from high to low, elevators with available capacity not less than the number of people going up are scheduled to stop at the first floor; and according to the order of the downward scheduling priority from high to low, elevators with available capacity not less than the number of people going down are scheduled to stop at the first floor, where available capacity refers to the number of people that the elevator can currently carry. In cases where the elevator with the highest upward scheduling priority is the same as the elevator with the highest downward scheduling priority, it is determined whether the elevator is currently in an upward or downward state. If the elevator is currently in an upward state, it is scheduled to the first floor to transport people who need to go up. After excluding the elevator from multiple elevators, the elevator with the second highest downward scheduling priority is selected to transport people going down.
2. The method according to claim 1, characterized in that, The method further includes: If the elevator dispatch request includes the upward elevator dispatch request, the upward dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator. When the elevator dispatch request includes the down elevator dispatch request, the down dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator.
3. The method according to claim 2, characterized in that, The step of determining the upward and downward scheduling priorities of each elevator according to the first ratio and the comprehensive scheduling priority of each elevator includes: The product of the estimated ratio corresponding to the upward scheduling and the comprehensive scheduling priority of each elevator is determined as the upward scheduling priority of each elevator. The product of the estimated ratio corresponding to the down-line scheduling and the comprehensive scheduling priority of each elevator is determined as the down-line scheduling priority of each elevator.
4. The method according to claim 1, characterized in that, The second ratio includes the estimated ratio for the number of people going up and the estimated ratio for the number of people going down; The process of determining the number of people going up and the number going down from the number of people waiting to ride the elevator according to the second ratio includes: The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going up. The number of people waiting to take the elevator is determined by multiplying the estimated proportion of the number of people going downhill.
5. The method according to claim 1 or 4, characterized in that, The method further includes: Obtain the second correspondence between elevator operating time and the ratio of people going up and down; In the second correspondence, the ratio of upbound and downbound passengers corresponding to the time period to which the current time belongs is determined to obtain the second ratio.
6. The method according to claim 1, characterized in that, The elevator waiting area includes multiple areas; The method further includes: Obtain the initial weight of each waiting area in the multiple waiting areas of each elevator; For each elevator, the product of the initial weight of each waiting area in the multiple waiting areas of the elevator and the number of people waiting in each waiting area is determined as the area priority of each waiting area in the multiple waiting areas of the elevator. The sum of the regional priorities of each of the multiple waiting areas of the elevator is determined as the overall scheduling priority of the elevator.
7. An elevator dispatching device, characterized in that, The device includes: The location determination module is used to determine the current location of each person waiting to take the elevator on the first floor after receiving an elevator dispatch request for the first floor; the elevator dispatch request includes at least one of an upward elevator dispatch request or a downward elevator dispatch request; The number of people determination module is used to determine the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to take the elevator. The priority determination module is used to determine the overall scheduling priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator scheduling request includes both the upward elevator scheduling request and the downward elevator scheduling request. The acquisition module is used to acquire a first correspondence between the elevator running time period and the up and down scheduling ratio when the elevator scheduling request includes the up elevator scheduling request and the down elevator scheduling request. The ratio determination module is used to determine the up and down scheduling ratio corresponding to the time period to which the current time belongs in the first correspondence relationship, and obtain a first ratio. The first ratio is different for different time periods. The first ratio includes the estimated ratio corresponding to the up scheduling of the elevator and the estimated ratio corresponding to the down scheduling, or the first ratio refers to the ratio between the estimated ratio corresponding to the up scheduling of the elevator and the estimated ratio corresponding to the down scheduling. The priority determination module is further configured to determine the upward scheduling priority and downward scheduling priority of each elevator according to the first ratio and the comprehensive scheduling priority of each elevator. The scheduling module is used to determine the number of people going up and down from the number of people waiting to take the elevator according to a second ratio, the second ratio corresponding to the time period to which the current time belongs, and the second ratio corresponding to different time periods is different; according to the order of the upward scheduling priority from high to low, scheduling elevators with available capacity not less than the number of people going up to stop at the first floor; and according to the order of the downward scheduling priority from high to low, scheduling elevators with available capacity not less than the number of people going down to stop at the first floor, the available capacity referring to the number of people that the elevator can currently carry; In cases where the elevator with the highest upward scheduling priority is the same as the elevator with the highest downward scheduling priority, it is determined whether the elevator is currently in an upward or downward state. If the elevator is currently in an upward state, it is scheduled to the first floor to transport people who need to go up. After excluding the elevator from multiple elevators, the elevator with the second highest downward scheduling priority is selected to transport people going down.
8. A computer device, characterized in that, The computer device includes a processor and a memory, the memory storing at least one computer program, which is loaded and executed by the processor to perform the operations of the elevator scheduling method as described in any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores at least one computer program, which is loaded and executed by a processor to perform the operations of the elevator scheduling method as described in any one of claims 1 to 6.