Elevator Group Management Method

Abstract

The present invention discloses an elevator group management method. When there are special users among the elevator users, the necessary resources required for special elevator waiters among the special users to take the elevator and the available resources of each elevator are determined. According to the necessary resources of the special elevator waiters and the available resources of each elevator, the corresponding relationship between the elevator waiters and the execution elevators and the execution elevators and the elevator waiters is determined, and the execution elevators are controlled to operate in response to the elevator ride requests of the elevator waiters. The present invention comprehensively considers the available resources of the elevators and the necessary resources of the elevator waiters, allocates the elevator waiters accordingly according to different situations, and gives priority to ensuring that ordinary elevator waiters take elevators that do not carry special users and special elevator waiters take elevators that carry special elevator passengers. In addition, the waiting time of the elevator waiters and the transportation efficiency of the elevators are fully considered during the allocation process, thereby effectively reducing the adverse effects of special users on the elevator ride experience of ordinary users in the same car.

Description

[0001] This case is a divisional application of a patent application with an application date of April 15, 2020, application number 202010295007.6, and name “Elevator Group Management Method and Elevator Group Management System”. Technical Field

[0002] The present invention is related to elevator allocation technology, and specifically belongs to an elevator group management method and an elevator group management system for elevator waiting passengers including special elevator waiting passengers (such as those carrying large items, sitting in wheelchairs or beds, carrying pets, etc.). Background Art

[0003] The elevator group control system can respond to passengers' elevator calls by appropriately allocating elevators, thereby improving elevator transportation efficiency and shortening passengers' waiting time. However, when there are special passengers among the waiting passengers, the elevator allocated by the elevator group control system may not have enough remaining space to meet the special passengers' needs, resulting in the special passengers being unable to board the car and the elevator making an ineffective stop, thus causing low elevator transportation efficiency.

[0004] In order to solve the above problems, the passenger interface device in the exemplary elevator destination input system disclosed in Chinese invention patent CN104066667B provides passengers with an interface for selecting a visual representation of their belongings. The controller determines the amount of space required to accommodate the passenger's belongings in the elevator car based on predetermined space information corresponding to the selected visual representation. The elevator group control system allocates an elevator with sufficient space to accommodate the passenger and his belongings to respond to his elevator call request, thereby solving the basic problem of passengers carrying large items "getting into the car".

[0005] However, when special elevator passengers, such as passengers carrying large items, passengers carrying dirt, passengers carrying large pets, passengers in wheelchairs or sickbeds, enter the elevator car to take the elevator, they will more or less cause some discomfort to other passengers riding the elevator with them, thus resulting in a poor riding experience for the passengers. Obviously, the focus of the aforementioned invention patent is on how to ensure that special elevator passengers can take the elevator smoothly and how to reduce or eliminate the possible impact of special elevator passengers on the elevator transportation efficiency, but it does not consider or involve the riding experience of other passengers riding the elevator with special elevator passengers.

[0006] Therefore, how to alleviate or eliminate the adverse effects of special elevator waiters on other passengers taking the elevator has become a problem to be solved. Summary of the invention

[0007] The technical problem to be solved by the present invention is to provide an elevator group management method and an elevator group management system, which can solve the problem that the elevator ride of special elevator waiters has an adverse impact on the elevator ride experience of other passengers taking the elevator with them.

[0008] In order to solve the above problems, the present invention provides an elevator group management method, comprising the following steps:

[0009] Step S1, determine whether there is a special user among the elevator users, if yes, then go to step S2, otherwise allocate all the elevators in the elevator group according to the conventional group allocation algorithm, output the allocation result, and go to step S4;

[0010] Step S2, determining the necessary resources required for the special elevator waiter among the special users to take the elevator and the available resources of each elevator;

[0011] Step S3, determining the correspondence between the elevator candidates and the executing elevators and between the executing elevators and the elevator candidates according to the required resources of the special elevator candidates and the available resources of each elevator, and outputting the dispatching result;

[0012] Step S4, controlling the elevator to run according to the allocation result to respond to the elevator request of the elevator waiter.

[0013] Furthermore, the step S3 further includes the following sub-steps:

[0014] Step S31, judging whether there is an unassigned common elevator candidate and an elevator that can accommodate at least one common elevator candidate and has no special elevator passengers, or an unassigned special elevator candidate and an elevator that can accommodate the unassigned special elevator candidate and has special elevator passengers, if so, proceeding to step S32, otherwise proceeding to step S36;

[0015] Step S32, selecting an unassigned elevator candidate from the elevator candidates;

[0016] Step S33, determining whether the selected elevator waiter is a common elevator waiter, if yes, then proceeding to step S34, otherwise proceeding to step S35;

[0017] Step S34, determining whether there is an elevator that can accommodate at least one ordinary elevator waiter and does not carry any special elevator passengers. If so, assigning the selected ordinary elevator waiter to the elevator that does not carry any special elevator passengers, updating the remaining available resources of each elevator in the elevator group, and returning to step S31; otherwise, proceeding to step S32;

[0018] Step S35, determining whether there is an elevator that can carry the selected special elevator candidate and has carried the special elevator passenger, if so, assigning the selected special elevator candidate to an elevator that can carry the selected special elevator candidate and has carried the special elevator passenger, updating the remaining available resources of each elevator in the elevator group, and returning to step S31, otherwise, proceeding to step S32;

[0019] Step S36, determining whether there are any common elevator waiters who have not been assigned, if yes, proceeding to step S37, otherwise directly proceeding to step S38;

[0020] Step S37, determine whether there is an elevator that can carry at least one ordinary elevator waiter and has carried special elevator passengers. If so, allocate the ordinary elevator waiters that match the number and are not allocated to the elevator that can carry at least one ordinary elevator waiter and has carried special elevator passengers, and then proceed to step S38; otherwise, directly proceed to step S38;

[0021] Step S38, determine whether there are any unassigned special elevator waiters, if yes, go to step S39, otherwise go directly to step S310;

[0022] Step S39, determining whether there is an elevator that can carry at least one unassigned special elevator candidate and no special elevator passengers, if so, assigning a matching number of unassigned special elevator candidates to an elevator that can carry at least one unassigned special elevator candidate and no special elevator passengers, and proceeding to step S310, otherwise, directly proceeding to step S310;

[0023] Step S310, output the blending result and proceed to step S4.

[0024] Furthermore, in step S32, a waiter who has waited the longest time but has not been selected is selected according to the waiting time of all waiters.

[0025] Furthermore, in step S34, step S35, step S37 and step S39, the available resources of the elevators are allocated in descending order.

[0026] Furthermore, the step S3 further includes the following sub-steps:

[0027] Step S31', selecting any special elevator waiters from the special elevator waiters, and listing all combinations;

[0028] Step S32', calculating the necessary resources of all combinations;

[0029] Step S33', allocating the combinations formed by the special elevator waiters according to the required resources of all combinations and the available resources of the elevators to form an allocation plan;

[0030] Step S34', selecting the allocation scheme with the smallest number of elevators taken by the special user from the allocation schemes;

[0031] Step S35', assigning the ordinary elevator waiter to an elevator that does not carry special users;

[0032] Step S36', determining whether there are unassigned ordinary elevator waiters and elevators that can accommodate at least one ordinary elevator waiter after carrying special users. If so, assign the corresponding number of ordinary elevator waiters to each elevator according to the remaining available resources of each elevator, and proceed to step S37'; otherwise, directly proceed to step S37';

[0033] Step S37', output the blending result and proceed to step S4.

[0034] Furthermore, if there are at least two allocation schemes that minimize the number of elevators that the special elevator waiter takes, any of the following methods is adopted in the allocation schemes:

[0035] Method 1: according to the principle of average distribution, the number of special users in each elevator that the special elevator waiters are going to take is the same;

[0036] Method 2: Sort the available resources of the elevators from large to small, select the elevator with the largest available resources one by one, and make the most special elevator waiters take the elevator according to the available resources of the elevator, until the allocation of the special elevator waiters is completed;

[0037] Mode 3, balances the available resources remaining in the elevator after the special elevator waiter takes the elevator.

[0038] Furthermore, in step S36', when allocating ordinary elevator waiters to the elevator taken by the special user, a corresponding number of ordinary elevator waiters who arrive at the destination floor earlier than the special user in the same elevator are selected.

[0039] Furthermore, if there are multiple ordinary elevator waiters who arrive at the destination floor earlier than the special user of the same elevator, the ordinary elevator waiters are sorted from first to last according to the order of arrival at the destination floor, and a corresponding number of ordinary elevator waiters are selected from the ordinary elevator waiters from front to back.

[0040] Furthermore, in step S1, the steps of determining whether there are special elevator waiters are as follows:

[0041] Step S11, acquiring characteristic attribute information of the elevator waiter, wherein the characteristic attribute information includes characteristic attributes of the elevator waiter and corresponding characteristic attribute values;

[0042] Step S12, judging whether the elevator waiter is a special elevator waiter according to the characteristic attribute information of the elevator waiter and preset target characteristic attribute information, wherein the target characteristic attribute information includes all characteristic attributes and characteristic attribute thresholds corresponding to each of the characteristic attributes.

[0043] Furthermore, the characteristic attribute information of the elevator waiter is obtained in any of the following ways:

[0044] Method 1, obtaining the identity information of the elevator waiter, and obtaining the characteristic attribute information of the elevator waiter according to the identity information;

[0045] Mode 2, directly obtaining characteristic attribute information of the elevator waiter according to the received operation information of the elevator waiter;

[0046] Method 3, obtaining image information of the elevator waiting area of ​​the elevator lobby, and analyzing the image information of the elevator waiting area to obtain characteristic attribute information of the elevator waiter.

[0047] Furthermore, in the method 1, the identity information of the elevator waiter is obtained by acquiring and identifying the biological characteristics of the elevator waiter or reading an item carried by the elevator waiter that stores the identity information of the elevator waiter.

[0048] Furthermore, the specific steps of step S2 are as follows:

[0049] Step S21, determining the required resource attributes of the special elevator waiter;

[0050] Step S22, obtaining first relevant information corresponding to the required resource attribute of the special elevator waiter, and calculating and outputting the required resource of the special elevator waiter according to the relationship between the first relevant information and the required resource attribute;

[0051] Step S23, obtaining second relevant information corresponding to the required resource attribute of each elevator, and calculating and outputting the available resources of each elevator according to the relationship between the second relevant information and the required resource attribute.

[0052] Furthermore, for the elevator that the special elevator waiters take, the special elevator waiters or the special elevator waiters and ordinary elevator waiters are prompted with the order of getting on and off the elevator.

[0053] In order to solve the above problems, the present invention also provides an elevator group management system, comprising:

[0054] A judging unit, used for judging whether there is a special user among the elevator users;

[0055] A calculation unit, used for calculating the necessary resources required for the special elevator waiter to take the elevator and the available resources of each elevator;

[0056] A determination unit, used to determine the special elevator candidates and the ordinary elevator candidates to be transported this time and the execution elevators to transport the special elevator candidates and the ordinary elevator candidates;

[0057] The dispatching unit is used to determine the corresponding relationship between the executing elevator and the special elevator waiters and the ordinary elevator waiters and output the elevator dispatching result.

[0058] Furthermore, the judging unit includes:

[0059] An information acquisition module, used to obtain information of elevator users;

[0060] A storage module, used to store a preset feature threshold corresponding to each feature attribute;

[0061] An analysis module analyzes the information of the elevator user and outputs characteristic attributes of the elevator user and characteristic values ​​corresponding to each characteristic attribute;

[0062] A query module, for searching the corresponding feature threshold from the storage module according to the feature attribute output by the analysis module;

[0063] A comparison module, for comparing the feature value corresponding to the feature attribute output by the analysis module with the feature threshold value corresponding to the feature attribute found by the query module;

[0064] A judging module is used to judge whether the elevator user having the characteristic attribute and its characteristic value is a special user according to the comparison result of the comparing module.

[0065] Furthermore, the information of the elevator user is actively collected by the information acquisition unit with the aid of a sensor device or is obtained by the information acquisition unit through input from elevator users received by an information receiving module.

[0066] The present invention comprehensively considers the available resources of the elevator and the necessary resources of the elevator waiters waiting to take the elevator, and allocates the elevator waiters accordingly according to different situations, giving priority to ensuring that ordinary elevator waiters take the elevator without special users and special elevator waiters take the elevator with special passengers, and fully considers the waiting time of the elevator waiters and the transportation efficiency of the elevator during the allocation process, thereby effectively reducing the adverse effects of special users on the elevator experience of ordinary users in the same elevator car. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] Figure 1 This is a schematic diagram of the control strategy of the first embodiment of the present invention;

[0068] Figure 2 This is a flow chart of step S3 of the first embodiment of the present invention;

[0069] Figure 3 This is a flow chart of step S3 of the second embodiment of the present invention;

[0070] Figure 4 A framework diagram of the elevator group management system of the present invention;

[0071] Figure 5 It is a composition framework diagram of the judgment unit of the elevator group management system of the present invention. DETAILED DESCRIPTION

[0072] The following describes the implementation of the present invention through specific specific embodiments in conjunction with the accompanying drawings, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. In the following description, specific details are set forth to facilitate a full understanding of the present invention, but the present invention can also be implemented or applied through other different specific embodiments, and the various details in this specification can also be based on different viewpoints and applications. Those skilled in the art can make various similar generalizations and substitutions without departing from the spirit of the present invention.

[0073] Embodiment 1

[0074] In this embodiment, the elevator group management method is as follows: Figure 1 As shown, the following steps are included:

[0075] Step S1, determine whether there is a special user among the elevator users, if yes, then go to step S2, otherwise allocate all the elevators in the elevator group according to the conventional group allocation algorithm, output the allocation result, and go to step S4;

[0076] Step S2, determining the necessary resources required for the special elevator waiter among the special users to take the elevator and the available resources of each elevator;

[0077] Step S3, determining the correspondence between the elevator candidates and the executing elevators and between the executing elevators and the elevator candidates according to the required resources of the special elevator candidates and the available resources of each elevator, and outputting the dispatching result;

[0078] Step S4, controlling the elevator to run according to the allocation result to respond to the elevator request of the elevator waiter.

[0079] Furthermore, if Figure 2 As shown, step S3 includes the following sub-steps:

[0080] Step S31, judging whether there is an unassigned common elevator candidate and an elevator that can accommodate at least one common elevator candidate and has no special elevator passengers, or an unassigned special elevator candidate and an elevator that can accommodate the unassigned special elevator candidate and has special elevator passengers, if so, proceeding to step S32, otherwise proceeding to step S36;

[0081] Step S32, selecting an unassigned elevator candidate from the elevator candidates;

[0082] Step S33, determining whether the selected elevator waiter is a common elevator waiter, if yes, then proceeding to step S34, otherwise proceeding to step S35;

[0083] Step S34, determining whether there is an elevator that can accommodate at least one ordinary elevator waiter and does not carry any special elevator passengers. If so, assigning the selected ordinary elevator waiter to the elevator that does not carry any special elevator passengers, updating the remaining available resources of each elevator in the elevator group, and returning to step S31; otherwise, proceeding to step S32;

[0084] Step S35, determining whether there is an elevator that can carry the selected special elevator candidate and has carried the special elevator passenger, if so, assigning the selected special elevator candidate to an elevator that can carry the selected special elevator candidate and has carried the special elevator passenger, updating the remaining available resources of each elevator in the elevator group, and returning to step S31, otherwise, proceeding to step S32;

[0085] Step S36, determining whether there are any common elevator waiters who have not been assigned, if yes, proceeding to step S37, otherwise directly proceeding to step S38;

[0086] Step S37, determine whether there is an elevator that can carry at least one ordinary elevator waiter and has carried special elevator passengers. If so, allocate the ordinary elevator waiters that match the number and are not allocated to the elevator that can carry at least one ordinary elevator waiter and has carried special elevator passengers, and then proceed to step S38; otherwise, directly proceed to step S38;

[0087] Step S38, determine whether there are any unassigned special elevator waiters, if yes, go to step S39, otherwise go directly to step S310;

[0088] Step S39, determining whether there is an elevator that can carry at least one unassigned special elevator candidate and no special elevator passengers, if so, assigning a matching number of unassigned special elevator candidates to an elevator that can carry at least one unassigned special elevator candidate and no special elevator passengers, and proceeding to step S310, otherwise, directly proceeding to step S310;

[0089] Step S310, output the blending result and proceed to step S4.

[0090] In step S32, a waiter who has waited the longest time but has not been selected is selected according to the waiting time of all waiters.

[0091] In step S34, step S35, step S37 and step S39, the available resources of the elevators are allocated in descending order.

[0092] Among them, in step S1, the steps of judging whether there are special elevator waiters are as follows:

[0093] Step S11, acquiring characteristic attribute information of the elevator waiter, wherein the characteristic attribute information includes characteristic attributes of the elevator waiter and corresponding characteristic attribute values;

[0094] Step S12, judging whether the elevator waiter is a special elevator waiter according to the characteristic attribute information of the elevator waiter and preset target characteristic attribute information, wherein the target characteristic attribute information includes all characteristic attributes and characteristic attribute thresholds corresponding to each of the characteristic attributes.

[0095] In step S11, the characteristic attribute information of the elevator waiter is obtained in any of the following ways:

[0096] Method 1, obtaining the identity information of the elevator waiter, and obtaining the characteristic attribute information of the elevator waiter according to the identity information;

[0097] Mode 2, directly obtaining characteristic attribute information of the elevator waiter according to the received operation information of the elevator waiter;

[0098] Method 3, obtaining image information of the elevator waiting area of ​​the elevator lobby, and analyzing the image information of the elevator waiting area to obtain characteristic attribute information of the elevator waiter.

[0099] In the first mode, the identity information of the elevator waiter is obtained by acquiring and identifying the biological characteristics of the elevator waiter or reading an item carried by the elevator waiter that stores the identity information of the elevator waiter.

[0100] The specific steps of step S2 are as follows:

[0101] Step S21, determining the required resource attributes of the special elevator waiter;

[0102] Step S22, obtaining first relevant information corresponding to the required resource attribute of the special elevator waiter, and calculating and outputting the required resource of the special elevator waiter according to the relationship between the first relevant information and the required resource attribute;

[0103] Step S23, obtaining second relevant information corresponding to the required resource attribute of each elevator, and calculating and outputting the available resources of each elevator according to the relationship between the second relevant information and the required resource attribute.

[0104] Furthermore, for the elevator that the special elevator waiters take, the special elevator waiters or the special elevator waiters and ordinary elevator waiters are prompted with the order of getting on and off the elevator.

[0105] An elevator group management system based on the above elevator group management method, such as Figure 4 As shown, including:

[0106] A judging unit, used for judging whether there is a special user among the elevator users;

[0107] A calculation unit, used for calculating the necessary resources required for the special elevator waiter to take the elevator and the available resources of each elevator;

[0108] A determination unit, used to determine the special elevator candidates and the ordinary elevator candidates to be transported this time and the execution elevators to transport the special elevator candidates and the ordinary elevator candidates;

[0109] The dispatching unit is used to determine the corresponding relationship between the executing elevator and the special elevator waiters and the ordinary elevator waiters and output the elevator dispatching result.

[0110] Wherein, the judging unit is as follows: Figure 5 As shown, including:

[0111] An information acquisition module, used to obtain information of elevator users;

[0112] A storage module, used to store a preset feature threshold corresponding to each feature attribute;

[0113] An analysis module analyzes the information of the elevator user and outputs characteristic attributes of the elevator user and characteristic values ​​corresponding to each characteristic attribute;

[0114] A query module, for searching the corresponding feature threshold from the storage module according to the feature attribute output by the analysis module;

[0115] A comparison module, for comparing the feature value corresponding to the feature attribute output by the analysis module with the feature threshold value corresponding to the feature attribute found by the query module;

[0116] A judging module is used to judge whether the elevator user having the characteristic attribute and its characteristic value is a special user according to the comparison result of the comparing module.

[0117] The information of the elevator user is actively collected by the information acquisition unit with the aid of a sensor device or is obtained by the information acquisition unit through input from elevator users received by an information receiving module.

[0118] In this embodiment, priority is given to the elevator waiters based on the available resources of the elevator and the required resources of the elevator waiters waiting to take the elevator, and the waiting time of the elevator waiters and the transportation efficiency of the elevator are fully considered during the allocation process to ensure that ordinary elevator waiters have priority in taking elevators without special users and special elevator waiters have priority in taking elevators with special passengers, thereby effectively reducing the adverse effects of special users on the elevator experience of ordinary users in the same elevator car.

[0119] Embodiment 2

[0120] The principle of this embodiment is similar to that of the first embodiment, except that the manner in which special elevator waiters are assigned to elevators carrying special elevator passengers is different.

[0121] Specifically, Figure 3 As shown, step S3 further includes the following sub-steps:

[0122] Step S31', selecting any special elevator waiters from the special elevator waiters, and listing all combinations;

[0123] Step S32', calculating the necessary resources of all combinations;

[0124] Step S33', allocating the combinations formed by the special elevator waiters according to the required resources of all combinations and the available resources of the elevators to form an allocation plan;

[0125] Step S34', selecting the allocation scheme with the smallest number of elevators taken by the special user from the allocation schemes;

[0126] Step S35', assigning the ordinary elevator waiter to an elevator that does not carry special users;

[0127] Step S36', determining whether there are unassigned ordinary elevator waiters and elevators that can accommodate at least one ordinary elevator waiter after carrying special users. If so, assign the corresponding number of ordinary elevator waiters to each elevator according to the remaining available resources of each elevator, and proceed to step S37'; otherwise, directly proceed to step S37';

[0128] Step S37', output the blending result and proceed to step S4.

[0129] Furthermore, if there are at least two allocation schemes that minimize the number of elevators that the special elevator waiter takes, any of the following methods is adopted in the allocation schemes:

[0130] Method 1: according to the principle of average distribution, the number of special users in each elevator that the special elevator waiters are going to take is the same;

[0131] Method 2: Sort the available resources of the elevators from large to small, select the elevator with the largest available resources one by one, and make the most special elevator waiters take the elevator according to the available resources of the elevator, until the allocation of the special elevator waiters is completed;

[0132] Mode 3, balances the available resources remaining in the elevator after the special elevator waiter takes the elevator.

[0133] In step S36', when allocating ordinary elevator waiters to the elevator taken by the special user, a corresponding number of ordinary elevator waiters who arrive at the destination floor earlier than the special user of the same elevator are selected.

[0134] Preferably, if there are multiple ordinary elevator waiters who arrive at the destination floor earlier than the special user of the same elevator, the ordinary elevator waiters are sorted from first to last according to the order of arrival at the destination floor, and a corresponding number of ordinary elevator waiters are selected from them from front to back.

[0135] It should be noted that, in the present invention, elevator waiters refer to passengers waiting for the elevator in the waiting area of ​​the elevator lobby, including special elevator waiters and ordinary elevator waiters, among which special elevator waiters refer to elevator waiters whose riding experience will be adversely affected by other passengers taking the elevator with them, such as those carrying large items, riding in wheelchairs or beds, carrying pets, etc.; elevator passengers refer to passengers who are already in the elevator before this deployment, including special elevator passengers and ordinary elevator passengers, among which special elevator passengers refer to passengers who have an adverse effect on the elevator experience of other passengers taking the elevator with them; elevator users are the combination of elevator waiters and elevator passengers.

[0136] The present invention is described in detail above through specific embodiments, which are only preferred embodiments of the present invention, and the present invention is not limited to the above embodiments. Without departing from the principle of the present invention, equivalent substitutions and improvements made by those skilled in the art should be regarded as within the technical scope protected by the present invention.

Claims

1. An elevator group management method, characterized in that: The steps include: Step S1, determine whether there is a special user among the elevator users, if yes, then go to step S2, otherwise allocate all the elevators in the elevator group according to the conventional group allocation algorithm, output the allocation result, and go to step S4; Step S2, determining the necessary resources required for the special elevator waiter among the special users to take the elevator and the available resources of each elevator; Step S3, determining the correspondence between the elevator candidates and the executing elevators and between the executing elevators and the elevator candidates according to the required resources of the special elevator candidates and the available resources of each elevator, and outputting the dispatching result; Step S4, controlling the elevator to run according to the allocation result to respond to the elevator request of the elevator waiter; Wherein, the step S3 further includes the following sub-steps: Step S31, selecting any special elevator waiters from the special elevator waiters, and listing all combinations; Step S32, calculating the necessary resources of all combinations; Step S33, allocating the combinations formed by the special elevator waiters according to the required resources of all combinations and the available resources of the elevators to form an allocation plan; Step S34, selecting from the allocation plans the allocation plan with the smallest number of elevators for the special user to take; Step S35, assigning ordinary elevator users to elevators that do not carry special users; Step S36, determining whether there are unassigned ordinary elevator waiters and elevators that can accommodate at least one ordinary elevator waiter after carrying special users. If so, assigning a corresponding number of ordinary elevator waiters to each elevator according to the remaining available resources of each elevator, and proceeding to step S37; otherwise, directly proceeding to step S37; Step S37, output the blending result and go to step S4.

2. The elevator group management method according to claim 1, characterized in that: If there are at least two allocation schemes that minimize the number of elevators that the special elevator waiter can take, then the allocation is performed in any of the following ways: Method 1: according to the principle of average distribution, the number of special users in each elevator that the special elevator waiters are going to take is the same; Method 2: Sort the available resources of the elevators from large to small, select the elevator with the largest available resources one by one, and make the most special elevator waiters take the elevator according to the available resources of the elevator, until the allocation of the special elevator waiters is completed; Mode 3, balances the available resources remaining in the elevator after the special elevator waiter takes the elevator.

3. The elevator group management method according to claim 1, characterized in that: In step S36, when allocating ordinary elevator waiters to the elevator for the special user, a corresponding number of ordinary elevator waiters who arrive at the destination floor earlier than the special user of the same elevator are selected.

4. The elevator group management method according to claim 3, characterized in that: If there are multiple ordinary elevator waiters who arrive at the destination floor earlier than the special user of the same elevator, the ordinary elevator waiters are sorted from first to last according to the order of arrival at the destination floor, and a corresponding number of ordinary elevator waiters are selected from them from front to back.

5. The elevator group management method according to claim 1, characterized in that: In step S1, the steps of determining whether there are special elevator waiters are as follows: Step S11, acquiring characteristic attribute information of the elevator waiter, wherein the characteristic attribute information includes characteristic attributes of the elevator waiter and corresponding characteristic attribute values; Step S12, judging whether the elevator waiter is a special elevator waiter according to the characteristic attribute information of the elevator waiter and preset target characteristic attribute information, wherein the target characteristic attribute information includes all characteristic attributes and characteristic attribute thresholds corresponding to each of the characteristic attributes.

6. The elevator group management method according to claim 5, characterized in that: The characteristic attribute information of the elevator waiter is obtained in any of the following ways: Method 1, obtaining the identity information of the elevator waiter, and obtaining the characteristic attribute information of the elevator waiter according to the identity information; Mode 2, directly obtaining characteristic attribute information of the elevator waiter according to the received operation information of the elevator waiter; Method 3, obtaining image information of the elevator waiting area of ​​the elevator lobby, and analyzing the image information of the elevator waiting area to obtain characteristic attribute information of the elevator waiter.

7. The elevator group management method according to claim 6, characterized in that: In the first mode, the identity information of the elevator waiter is obtained by acquiring and identifying the biological characteristics of the elevator waiter or reading an item carried by the elevator waiter that stores the identity information of the elevator waiter.

8. The elevator group management method according to claim 1, characterized in that: The specific steps of step S2 are as follows: Step S21, determining the required resource attributes of the special elevator waiter; Step S22, obtaining first relevant information corresponding to the required resource attribute of the special elevator waiter, and calculating and outputting the required resource of the special elevator waiter according to the relationship between the first relevant information and the required resource attribute; Step S23, obtaining second relevant information corresponding to the required resource attribute of each elevator, and calculating and outputting the available resources of each elevator according to the relationship between the second relevant information and the required resource attribute.

9. The elevator group management method according to claim 1, characterized in that: For elevators carrying special elevator waiters, the special elevator waiters or special elevator waiters and ordinary elevator waiters are prompted with the order of getting on and off the elevator.

Images