Elevator group management method and elevator group management system

Abstract

The present invention discloses an elevator group management method and an elevator group management system, including: step S1, judging whether there are special users among the elevator users, if there are special users, entering step S2, otherwise entering step S3; step S2, using an optimized allocation strategy to allocate the elevator users and output the allocation results, entering step S4, the optimization goal of the optimized allocation strategy includes minimizing the adverse effects of special users on ordinary users; step S3, using a conventional group allocation strategy to allocate the elevator users and output the allocation results, entering step S4; step S4, controlling the elevator operation according to the allocation results to respond to the elevator requests of the elevator users. The present invention can accurately judge whether the elevator user is a special user, and effectively shorten the mixed riding process of ordinary users and special users when there are special users, thereby minimizing the adverse effects of special users on the elevator riding experience of other elevator users in the same elevator.

Description

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

[0002] The present invention relates to elevator group control technology, and specifically to an elevator group management system and an elevator group management method capable of dealing with elevator users including special users who may affect other users (such as those carrying large items, sitting in wheelchairs or hospital beds, carrying pets, etc.). Background Art

[0003] The elevator group management 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 elevators allocated by the elevator group management system may not have enough remaining space to meet the needs of special passengers, resulting in the special passengers being unable to board the car and the elevators making ineffective stops, 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 the predetermined space information corresponding to the selected visual representation. The elevator group management system allocates an elevator with sufficient space to accommodate the passenger and his belongings in response to his elevator call request, thereby solving the basic problem of passengers carrying large items "getting into the car".

[0005] However, when special 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, which will lead to a poor riding experience for the passengers. Obviously, the focus of the above invention patent is on how to ensure that special passengers can take the elevator smoothly and how to reduce or eliminate the possible impact of special passengers riding the elevator on the elevator transportation efficiency, but it does not consider or involve the riding experience of other passengers riding the elevator with special passengers.

[0006] Therefore, how to ensure the riding experience of other passengers who take the same elevator with the special elevator waiter becomes 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 prior art does not take into account the adverse effects of special users on the riding experience of other users in the same elevator and cannot guarantee the riding experience of other users in the same elevator with the special users.

[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, proceed to step S2, otherwise proceed to step S3;

[0010] Step S2, using an optimized allocation strategy to allocate the elevator waiters and output the allocation result, and then proceeding to step S4, wherein the optimization goal of the optimized allocation strategy includes minimizing the adverse effects of the special users on the ordinary users;

[0011] Step S3, using a conventional group allocation strategy to allocate the elevator waiters and output the allocation result, and then proceed to step S4;

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

[0013] Furthermore, in step S1, the specific steps of determining whether there is a special user are as follows:

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

[0015] Step S12, judging whether the elevator user is a special user based on the characteristic attribute information of the elevator user 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.

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

[0017] Mode 1, obtaining the identity information of the elevator user, and obtaining the characteristic attribute information of the elevator user according to the identity information;

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

[0019] Method 3: For elevator users who are waiting for the elevator, image information of the elevator waiting area of ​​the elevator lobby is obtained, and the image information of the elevator waiting area is analyzed to obtain characteristic attribute information of the elevator waiting person.

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

[0021] Further, the step S2 specifically includes the following steps:

[0022] Step S21, obtaining the current state information of the elevator;

[0023] Step S22, determining an elevator capable of transporting the special elevator candidate and defining it as a special elevator candidate target elevator;

[0024] Step S23, enumerating all possible allocation schemes for the elevator waiter to take the elevator;

[0025] Step S24, establishing an evaluation function with the goal of minimizing the adverse effects of the special user on the ordinary user when the special user and the ordinary user are mixed;

[0026] Step S25, calculating the evaluation results of all allocation schemes according to the evaluation function;

[0027] Step S26, selecting the allocation scheme corresponding to the best evaluation result as the final allocation result and outputting it.

[0028] Furthermore, in step S23, the special elevator waiter only takes the elevator for the special elevator waiter, and the ordinary elevator waiter takes all elevators.

[0029] Furthermore, in step S22, the specific steps of determining the target elevator for the special elevator candidate are as follows:

[0030] Step L1, judging whether the special elevator waiter is a limited resource of the elevator car according to the characteristic attributes of the special elevator waiter, if so, proceeding to step L2, otherwise, all elevators are regarded as special elevator waiter target elevators, proceeding to step L6;

[0031] Step L2, obtaining available resources of the elevator corresponding to the characteristic attributes of the special elevator waiter through analysis based on the current state information of the elevator and the characteristic attributes of the special elevator waiter;

[0032] Step L3, comparing the characteristic attribute value corresponding to the characteristic attribute of the special elevator waiter with the available resources of the elevator;

[0033] Step L4, judging whether the elevator is a target elevator for special elevator waiters according to the comparison result;

[0034] Step L5, determine whether all elevators have been analyzed and determined, if yes, go to step L6, otherwise return to step L2;

[0035] Step L6, enter step S23.

[0036] Further, when the optimization objective of the optimization allocation strategy includes an additional objective in addition to the objective of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, the additional objective and the objective of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed are used to obtain a total evaluation index through weighted summation, and the weight coefficient of the additional objective and the objective of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed is determined based on at least one of the current state information of the elevator, the future state information of the elevator, the current elevator user information, and the future elevator user information.

[0037] Furthermore, the goal of minimizing the adverse effects of special users on ordinary users when they are mixed riding adopts an evaluation function with at least one of the number of mixed riding, mixed riding time, mixed riding moving distance, and mixed riding stop times as characterizing variables.

[0038] Furthermore, the evaluation function is expressed in any of the following ways:

[0039] Method 1: number of people on mixed rides × time of mixed rides;

[0040] Method 2: the number of people in mixed rides × the distance traveled;

[0041] Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients;

[0042] Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

[0043] Alternatively, step S2 specifically includes the following steps:

[0044] Step S21, judging whether the separation and allocation algorithm can be used to allocate the elevator waiters, the separation and allocation algorithm is to allocate special elevator waiters to elevators carrying special elevator passengers and / or empty elevators, and allocate ordinary elevator waiters to elevators not carrying special elevator passengers and / or empty elevators, so that the special users and ordinary users take different elevators respectively. If it is possible, then proceed to step S22, otherwise proceed to step S23;

[0045] Step S22, using a separation allocation algorithm to allocate the elevator waiters, outputting the allocation result, and proceeding to step S4;

[0046] Step S23, use a mixed-ride allocation algorithm to allocate the elevator waiters, output the allocation result, and enter step S4. The mixed-ride allocation algorithm is to allocate the elevator waiters to some or all of the elevators in the elevator group, and allocate at least one ordinary elevator waiter to the elevator carrying special elevator passengers, or allocate at least one special elevator waiter to the elevator carrying ordinary elevator passengers, or allocate at least one ordinary elevator waiter and at least one special elevator waiter to the same elevator.

[0047] Furthermore, in step S21, it is determined whether the separation allocation algorithm can be used to allocate the elevator waiters according to the following method:

[0048] Step S211, determine whether there are elevators that only transport special passengers and / or only transport ordinary passengers and / or empty elevators, if so, proceed to step S212, otherwise proceed to step S23:

[0049] Step S212, determining the current available resources of the elevators that are not carrying special passengers, and calculating the total available resources;

[0050] Step S213, calculating the total occupied resources required by all ordinary elevator waiters to take the elevator;

[0051] Step S214, determining whether the total occupied resources are greater than the total available resources, if so, determining that the separation allocation algorithm cannot be used to allocate the elevator waiters, otherwise proceeding to step S215;

[0052] Step S215, taking elevators that are not assigned with ordinary elevator passengers and are carrying special elevator passengers and / or empty elevators that are not assigned with ordinary elevator passengers as special elevator passenger target elevators;

[0053] Step S216, enumerate all possible combinations of special elevator candidates, use the obtained combinations as elements to construct different sets, each set contains all special elevator candidates and the number of each special elevator candidate is 1, assign all elements in each set to the special elevator candidate target elevator, and establish a corresponding relationship between the elements in each set and the special elevator candidate target elevator;

[0054] Step S217, determine whether there is a set of available resources of the elevator for each element that is less than or equal to the corresponding special elevator candidate object elevator. If so, it is determined that the separation allocation algorithm can be used to allocate the elevator candidate. Otherwise, it is determined that the separation allocation algorithm cannot be used to allocate the elevator candidate.

[0055] Furthermore, in step S22, the steps of using the separation and allocation algorithm to allocate the elevator waiters are as follows:

[0056] Step A1, taking an elevator carrying a special passenger and / or an empty elevator as an elevator for special elevator passengers;

[0057] Step A2, enumerate all possible combinations of special elevator waiters, use the obtained combinations as elements to construct different sets, each set contains all special elevator waiters and the number of each special elevator waiter is 1, assign all elements in each set to the special elevator waiter target elevator, and establish a corresponding relationship between the elements in each set and the special elevator waiter target elevator;

[0058] Step A3, among all sets of which the required resources of each element are less than or equal to the available resources of the corresponding special elevator candidate target elevator, select the set with the largest remaining available resources after the special elevator candidate target elevator is assigned with the special elevator candidate, and form a special elevator candidate allocation plan by using the selected set and the corresponding relationship between the elements in the set and the special elevator candidate target elevator;

[0059] Step A4, treating the elevators that are not carrying special passengers and are not assigned special elevator candidates as ordinary elevator candidates' target elevators;

[0060] Step A5, using a conventional allocation algorithm to allocate ordinary elevator waiters to target elevators for ordinary elevator waiters, and forming an allocation plan for ordinary elevator waiters;

[0061] Step A6: Combining the special elevator waiter allocation plan and the common elevator waiter allocation plan as the final allocation result output.

[0062] Furthermore, the mixed-ride allocation algorithm is any one of a common elevator waiter priority allocation algorithm or a special elevator waiter priority allocation algorithm or a corresponding priority allocation algorithm, wherein:

[0063] The priority allocation algorithm for ordinary elevator waiters is to first allocate the ordinary elevator waiters with a matching number to the elevators without special elevator passengers, and then allocate the remaining ordinary elevator waiters and special elevator waiters to the elevators with special elevator passengers;

[0064] The algorithm for allocating special elevator passengers in priority is to first allocate special elevator passengers of a matching number to the elevators that have already carried special elevator passengers, and then allocate the remaining special elevator passengers and ordinary elevator passengers to the elevators that have not carried special elevator passengers.

[0065] The corresponding priority allocation algorithm is to first allocate a matched number of ordinary elevator waiters to elevators that only carry ordinary passengers and allocate a matched number of special elevator waiters to elevators that already carry special passengers, and then allocate the remaining special elevator waiters to elevators that do not carry special passengers, and allocate the remaining ordinary elevator waiters to empty car elevators and / or elevators that already carry special passengers.

[0066] Furthermore, when there are special elevator waiters and the number of special users is greater than 2, the mixed passenger allocation algorithm selects a special elevator waiter priority allocation algorithm to first allocate the special elevator waiters to the elevator that has special elevator passengers on board.

[0067] Furthermore, when allocating the special elevator waiters to the elevators that already carry the special passengers, they are sorted from few to many according to the number of ordinary passengers carried in the elevators that already carry the special passengers, and according to the sorting results, the elevators that already carry the special passengers are selected from front to back in turn and a matching number of special elevator waiters are allocated to them according to the available resources of the selected elevators.

[0068] Furthermore, when there are special elevator waiters and the number of special users is greater than 2, elevators carrying special elevator passengers and empty elevators are used as special elevator waiter object elevators, all combinations of the special elevator waiters are enumerated, and different sets are constructed using the obtained combinations as elements, each set contains all special elevator waiters and the number of each special elevator waiter is 1, all special elevator waiters in each set are assigned to special elevator waiter object elevators, a correspondence between the elements in each set and the special elevator waiter object elevators is established, and a set that minimizes the number of elevators carrying special users after the special elevator waiter object elevators are assigned special elevator waiters is selected, and the special elevator waiters are assigned according to the correspondence between the elements in the selected set and the special elevator waiter object elevators.

[0069] Furthermore, when the remaining special elevator waiters are assigned to elevators carrying ordinary users or the ordinary elevator waiters and the remaining special elevator waiters are assigned to the same elevator so that ordinary users and special users are mixed, the number of special users in each mixed elevator is roughly equal.

[0070] Furthermore, when ordinary elevator waiters are allocated to an elevator carrying special users, all ordinary elevator waiters in the mixed elevator arrive later than the special users in the same mixed elevator or all arrive earlier than the special users in the same mixed elevator.

[0071] Furthermore, when all the ordinary elevator waiters arrive later than all the special users, they are sorted from near to far according to the distance between their destination floors and the current floor, and the ordinary elevator waiters are allocated to the elevator where the special user with the highest sorting result is located; when all the ordinary elevator waiters arrive earlier than all the special users, they are sorted from near to far according to the distance between their destination floors and the current floor, and ordinary elevator waiters with a matching number are selected from front to back according to the sorting result as mixed ordinary elevator waiters.

[0072] Furthermore, in step S23, when the deployment plan obtained by using the mixed deployment algorithm is not unique and the mixed deployment algorithm assigns the ordinary elevator waiters to the elevator that already carries special elevator passengers, or assigns the special elevator waiters to the elevator that only carries ordinary users, or assigns the ordinary elevator waiters and the special elevator waiters to the same elevator so that ordinary users and special users are mixed, an evaluation function is established with the goal of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, and the evaluation function is used to evaluate all the deployment plans, and the deployment plan corresponding to the best evaluation result is output as the deployment result.

[0073] Furthermore, the evaluation function uses at least one of the number of mixed-ride passengers, mixed-ride time, mixed-ride moving distance, and mixed-ride stop times as a characterization variable.

[0074] Furthermore, the evaluation function is expressed in any of the following ways:

[0075] Method 1: number of people in mixed rides × time of mixed rides;

[0076] Method 2: the number of people in mixed rides × the distance traveled;

[0077] Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients;

[0078] Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

[0079] At the same time, in order to solve the above technical problems, the elevator group management system provided by the present invention includes:

[0080] An information acquisition unit, used to acquire elevator user information;

[0081] A parsing unit, which parses the elevator user information and outputs characteristic attributes of the elevator user and corresponding characteristic attribute values;

[0082] a judging unit, for judging whether the elevator user is a special user according to the characteristic attribute and the characteristic attribute value output by the analyzing unit;

[0083] A selection unit is used to select an execution allocation strategy and output an allocation result. When the judgment unit determines that there is a special user among the elevator users, the selection unit selects an optimized allocation strategy as the execution allocation strategy, otherwise selects a conventional group allocation strategy as the execution allocation strategy; wherein the optimization target of the optimized allocation strategy includes minimizing the adverse effects of the special user on the ordinary users;

[0084] The control unit controls the operation of the elevator according to the allocation result output by the selection unit, and responds to the elevator request of the elevator waiter.

[0085] Furthermore, the elevator user information 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 an elevator user received by an information receiving module.

[0086] Furthermore, the parsing unit comprises:

[0087] A first storage module, used to store all possible characteristic attributes of the elevator user;

[0088] The parsing module judges all possible characteristic attributes one by one according to the source or content of the elevator user information to determine whether the corresponding characteristic attribute value can be obtained from the elevator user information, and finally obtains and outputs the characteristic attributes of the elevator user and the characteristic attribute value corresponding to each characteristic attribute through parsing.

[0089] Furthermore, the judging unit includes:

[0090] A second storage module is used to store preset target feature attribute information, wherein the target feature attribute information includes all feature attributes and feature attribute thresholds corresponding to each of the feature attributes;

[0091] A query module, for searching the corresponding characteristic attribute threshold value from the second storage module according to the characteristic attribute output by the parsing unit;

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

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

[0094] Furthermore, the specific steps of the optimization deployment strategy are as follows:

[0095] Step S1, obtaining the current state information of the elevator;

[0096] Step S2, determining an elevator capable of transporting the special elevator candidate and defining it as a special elevator candidate target elevator;

[0097] Step S3, enumerating all possible allocation schemes for the elevator waiter to take the elevator;

[0098] Step S4, establishing an evaluation function with the goal of minimizing the adverse effects of the special user on the ordinary user when the special user and the ordinary user are mixed;

[0099] Step S5, calculating the evaluation results of all allocation schemes according to the evaluation function;

[0100] Step S6, selecting the allocation scheme corresponding to the best evaluation result as the final allocation result and outputting it.

[0101] Furthermore, the goal of minimizing the adverse effects of special users on ordinary users when they are mixed riding adopts an evaluation function with at least one of the number of mixed riding, mixed riding time, mixed riding moving distance, and mixed riding stop times as characterizing variables.

[0102] Furthermore, the evaluation function is expressed in any of the following ways:

[0103] Method 1: number of people on mixed rides × time of mixed rides;

[0104] Method 2: the number of people in mixed rides × the distance traveled;

[0105] Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients;

[0106] Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

[0107] Alternatively, the specific steps of the optimization deployment strategy are as follows:

[0108] Step S1, judging whether the separation and allocation algorithm can be used to allocate the elevator waiters, the separation and allocation algorithm is to allocate special elevator waiters to elevators carrying special elevator passengers and / or empty elevators, and allocate ordinary elevator waiters to elevators not carrying special elevator passengers and / or empty elevators, so that the special users and ordinary users take different elevators respectively. If it is possible, then go to step S2, otherwise go to step S3;

[0109] Step S2, using a separation allocation algorithm to allocate the elevator waiters and output the allocation result;

[0110] Step S3, using a mixed-ride allocation algorithm to allocate the elevator waiters and output the allocation result, the mixed-ride allocation algorithm is to allocate the elevator waiters to some or all of the elevators in the elevator group, and allocate at least one ordinary elevator waiter to the elevator carrying special elevator passengers, or allocate at least one special elevator waiter to the elevator carrying ordinary elevator passengers, or allocate at least one ordinary elevator waiter and at least one special elevator waiter to the same elevator.

[0111] Furthermore, in step S1, it is determined whether the separation allocation algorithm can be used to allocate the elevator waiters according to the following method:

[0112] Step S11, determine whether there are elevators that only transport special passengers and / or only transport ordinary passengers and / or empty elevators, if so, proceed to step S12, otherwise proceed to step S3:

[0113] Step S12, determining the current available resources of the elevators that are not carrying special passengers, and calculating the total available resources;

[0114] Step S13, calculating the total occupied resources required by all ordinary elevator waiters to take the elevator;

[0115] Step S14, determining whether the total occupied resources are greater than the total available resources, if so, determining that the separation allocation algorithm cannot be used to allocate the elevator waiters, otherwise proceeding to step S15;

[0116] Step S15, taking elevators that are not assigned with ordinary elevator passengers and are carrying special elevator passengers and / or empty elevators that are not assigned with ordinary elevator passengers as special elevator passenger target elevators;

[0117] Step S16, enumerate all possible combinations of special elevator candidates, use the obtained combinations as elements to construct different sets, each set contains all special elevator candidates and the number of each special elevator candidate is 1, assign all elements in each set to the special elevator candidate target elevator, and establish a corresponding relationship between the elements in each set and the special elevator candidate target elevator;

[0118] Step S17, determine whether there is a set of available resources of the elevator for each element that is less than or equal to the corresponding special elevator candidate object elevator. If so, it is determined that the separation allocation algorithm can be used to allocate the elevator candidate. Otherwise, it is determined that the separation allocation algorithm cannot be used to allocate the elevator candidate.

[0119] Furthermore, the steps of using the separation and allocation algorithm to allocate the elevator waiters are as follows:

[0120] Step A1, taking an elevator carrying a special passenger and / or an empty elevator as an elevator for special elevator passengers;

[0121] Step A2, enumerate all possible combinations of special elevator waiters, use the obtained combinations as elements to construct different sets, each set contains all special elevator waiters and the number of each special elevator waiter is 1, assign all elements in each set to the special elevator waiter target elevator, and establish a corresponding relationship between the elements in each set and the special elevator waiter target elevator;

[0122] Step A3, among all sets of which the required resources of each element are less than or equal to the available resources of the corresponding special elevator candidate target elevator, select the set with the largest remaining available resources after the special elevator candidate target elevator is assigned with the special elevator candidate, and form a special elevator candidate allocation plan by using the selected set and the corresponding relationship between the elements in the set and the special elevator candidate target elevator;

[0123] Step A4, treating the elevators that are not carrying special passengers and are not assigned special elevator candidates as ordinary elevator candidates' target elevators;

[0124] Step A5, using a conventional allocation algorithm to allocate ordinary elevator waiters to target elevators for ordinary elevator waiters, and forming an allocation plan for ordinary elevator waiters;

[0125] Step A6: Combining the special elevator waiter allocation plan and the common elevator waiter allocation plan as the final allocation result output.

[0126] Furthermore, the mixed passenger allocation algorithm is any one of a common elevator waiter priority allocation algorithm or a special elevator waiter priority allocation algorithm or a corresponding priority allocation algorithm, wherein:

[0127] The priority allocation algorithm for ordinary elevator waiters is to first allocate the ordinary elevator waiters with a matching number to the elevators without special elevator passengers, and then allocate the remaining ordinary elevator waiters and special elevator waiters to the elevators with special elevator passengers;

[0128] The algorithm for allocating special elevator passengers in priority is to first allocate special elevator passengers of a matching number to the elevators that have already carried special elevator passengers, and then allocate the remaining special elevator passengers and ordinary elevator passengers to the elevators that have not carried special elevator passengers.

[0129] The corresponding priority allocation algorithm is to first allocate a matched number of ordinary elevator waiters to elevators that only carry ordinary passengers and allocate a matched number of special elevator waiters to elevators that already carry special passengers, and then allocate the remaining special elevator waiters to elevators that do not carry special passengers, and allocate the remaining ordinary elevator waiters to empty car elevators and / or elevators that already carry special passengers.

[0130] The present invention can accurately determine whether an elevator user is a special user, and when there is a special user, effectively shorten the mixed riding process of ordinary users and special users, thereby minimizing the adverse effects of special users on the riding experience of other elevator users in the same elevator. BRIEF DESCRIPTION OF THE DRAWINGS

[0131] Figure 1 is an overall flow chart of Embodiment 1 of the elevator group management method of the present invention;

[0132] Figure 2 is a structural block diagram of Embodiment 1 of the elevator group management system of the present invention;

[0133] Figure 3 This is a flow chart of step S2 of embodiment 2 of the elevator group management method of the present invention;

[0134] Figure 4 This is a flowchart of step S22 in step S2 of embodiment 2 of the elevator group management method of the present invention;

[0135] Figure 5 This is a flow chart of step S2 of embodiment 3 of the elevator group management method of the present invention;

[0136] Figure 6 This is a flowchart of step S21 in step S2 of embodiment 3 of the elevator group management method of the present invention;

[0137] Figure 7 This is a flowchart of step S22 in step S2 of embodiment 3 of the elevator group management method of the present invention. DETAILED DESCRIPTION

[0138] 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.

[0139] Embodiment 1

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

[0141] Step S1, determine whether there is a special user among the elevator users, if yes, proceed to step S2, otherwise proceed to step S3;

[0142] Step S2, using an optimized allocation strategy to allocate the elevator waiters and output the allocation result, and then proceeding to step S4, wherein the optimization goal of the optimized allocation strategy includes minimizing the adverse effects of the special users on the ordinary users;

[0143] Step S3, using a conventional group allocation strategy to allocate the elevator waiters and output the allocation result, and then proceed to step S4;

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

[0145] In step S1, the specific steps of determining whether there is a special user are as follows:

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

[0147] For example, when the special user is a user who rides a wheelchair or carries large items, the characteristic attribute of the special user is the elevator space, and the characteristic attribute value corresponding to the characteristic attribute is the space value that the user needs to occupy when completing the elevator ride; when the special user is a user who carries items with irritating odors, the characteristic attribute of the special user is odor, and the characteristic attribute value corresponding to the characteristic attribute is determined based on whether the odor affects human health, the degree of irritation, the degree of volatility, etc. For example, the characteristic attribute value of the odor that affects human health and is volatile is the largest, and the odor that does not affect human health is processed according to the degree of irritation (high, medium, low) and the degree of volatility (high, medium, low) to obtain the characteristic attribute value; when the special user is a user who carries sharp objects, the characteristic attribute of the special user is dangerousness, and the characteristic attribute value corresponding to the characteristic attribute is determined according to the degree of danger of the sharp objects (high, medium, low);

[0148] Step S12, judging whether the elevator user is a special user based on the characteristic attribute information of the elevator user 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.

[0149] The characteristic attribute information of the elevator user is obtained in any of the following ways:

[0150] Mode 1, obtaining the identity information of the elevator user, and obtaining the characteristic attribute information of the elevator user according to the identity information;

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

[0152] Method 3: For elevator users who are waiting for the elevator, image information of the elevator waiting area of ​​the elevator lobby is obtained, and the image information of the elevator waiting area is analyzed to obtain characteristic attribute information of the elevator waiting person.

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

[0154] In addition to the goal of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, when the optimization goal of the optimization allocation strategy also includes other additional goals, the additional goals and the goal of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed are used to obtain a total evaluation index through weighted summation, and the weight coefficient of the additional goal and the goal of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed is determined according to at least one of the current state information of the elevator, the future state information of the elevator, the current elevator user information, and the future elevator user information.

[0155] Specifically, the goal of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed riding is to use an evaluation function with at least one of the mixed riding number, mixed riding time, mixed riding moving distance, and mixed riding stop times as a characterization variable. Preferably, the evaluation function is expressed in any of the following ways:

[0156] Method 1: number of people on mixed rides × time of mixed rides;

[0157] Method 2: the number of people in mixed rides × the distance traveled;

[0158] Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients;

[0159] Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

[0160] An elevator group management system based on the aforementioned elevator group management method, such as Figure 2 As shown, including:

[0161] An information acquisition unit, used to acquire elevator user information;

[0162] A parsing unit, which parses the elevator user information and outputs characteristic attributes of the elevator user and corresponding characteristic attribute values;

[0163] A judging unit, for judging whether the elevator user is a special user according to the characteristic attribute and the characteristic attribute value output by the analyzing unit;

[0164] A selection unit is used to select an execution allocation strategy and output an allocation result. When the judgment unit determines that there is a special user among the elevator users, the selection unit selects an optimized allocation strategy as the execution allocation strategy, otherwise selects a conventional group allocation strategy as the execution allocation strategy; wherein the optimization target of the optimized allocation strategy includes minimizing the adverse effects of the special user on the ordinary users;

[0165] The control unit controls the operation of the elevator according to the allocation result output by the selection unit, and responds to the elevator request of the elevator waiter.

[0166] The elevator user information 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 an elevator user received by an information receiving module.

[0167] Wherein, the parsing unit comprises:

[0168] A first storage module, used to store all possible characteristic attributes of the elevator user;

[0169] The parsing module judges all possible characteristic attributes one by one according to the source or content of the elevator user information to determine whether the corresponding characteristic attribute value can be obtained from the elevator user information, and finally obtains and outputs the characteristic attributes of the elevator user and the characteristic attribute value corresponding to each characteristic attribute through parsing.

[0170] Wherein, the judging unit comprises:

[0171] A second storage module is used to store preset target feature attribute information, wherein the target feature attribute information includes all feature attributes and feature attribute thresholds corresponding to each of the feature attributes;

[0172] A query module, for searching the corresponding characteristic attribute threshold value from the second storage module according to the characteristic attribute output by the analysis unit;

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

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

[0175] This embodiment can accurately determine whether the elevator user is a special user, and in the case of a special user, effectively shorten the mixed riding process of ordinary users and special users, thereby minimizing the adverse effects of special users on the riding experience of other elevator users in the same elevator.

[0176] Embodiment 2

[0177] Based on the first embodiment, this embodiment further illustrates an implementation method of using an optimized allocation strategy to allocate elevator waiters in step S2. Specifically, Figure 3 As shown, the specific steps include:

[0178] Step S21, obtaining the current state information of the elevator;

[0179] Step S22, determining an elevator capable of transporting the special elevator candidate and defining it as a special elevator candidate target elevator;

[0180] Step S23, enumerating all possible allocation schemes for the elevator waiter to take the elevator;

[0181] Step S24, establishing an evaluation function with the goal of minimizing the adverse effects of the special user on the ordinary user when the special user and the ordinary user are mixed;

[0182] Step S25, calculating the evaluation results of all allocation schemes according to the evaluation function;

[0183] Step S26, selecting the allocation scheme corresponding to the best evaluation result as the final allocation result and outputting it.

[0184] Among them, in step S23, the special elevator waiter only takes the elevator for the special elevator waiter, and the ordinary elevator waiter takes all elevators.

[0185] In step S22, the specific steps of determining the elevator for the special elevator candidate are as follows: Figure 4 As shown, including the following:

[0186] Step L1, judging whether the special elevator waiter is a limited resource of the elevator car according to the characteristic attributes of the special elevator waiter, if so, proceeding to step L2, otherwise, all elevators are regarded as special elevator waiter target elevators, proceeding to step L6;

[0187] Step L2, obtaining available resources of the elevator corresponding to the characteristic attributes of the special elevator waiter through analysis based on the current state information of the elevator and the characteristic attributes of the special elevator waiter;

[0188] Step L3, comparing the characteristic attribute value corresponding to the characteristic attribute of the special elevator waiter with the available resources of the elevator;

[0189] Step L4, judging whether the elevator is a target elevator for special elevator waiters according to the comparison result;

[0190] Step L5, determine whether all elevators have been analyzed and determined, if yes, go to step L6, otherwise return to step L2;

[0191] Step L6, enter step S23.

[0192] The elevator group management system of this embodiment has the same structural framework as the elevator group management system of embodiment one, wherein when the judgment unit determines that there are special users among the elevator users, the optimization allocation strategy selected by the selection unit adopts the elevator group management method of this embodiment, as shown above, and will not be repeated here.

[0193] The optimization allocation strategy of this embodiment uses an evaluation function with the purpose of minimizing the adverse effects of special users on ordinary users during mixed riding to calculate and evaluate all possible allocation schemes, thereby selecting the allocation scheme with the best evaluation result to allocate the elevator waiters, so as to minimize the adverse effects of special users on the elevator experience of ordinary users.

[0194] Embodiment 3

[0195] On the basis of the first embodiment, the elevator group management method of this embodiment further illustrates another implementation method of using the optimization allocation strategy to allocate the elevator waiters in step S2. Specifically, Figure 5 As shown, the specific steps include:

[0196] Step S21, judging whether the separation and allocation algorithm can be used to allocate the elevator waiters, the separation and allocation algorithm is to allocate special elevator waiters to elevators carrying special elevator passengers and / or empty elevators, and allocate ordinary elevator waiters to elevators not carrying special elevator passengers and / or empty elevators, so that the special users and ordinary users take different elevators respectively. If it is possible, then proceed to step S22, otherwise proceed to step S23;

[0197] Step S22, using a separation allocation algorithm to allocate the elevator waiters, outputting the allocation result, and proceeding to step S4;

[0198] Step S23, use a mixed-ride allocation algorithm to allocate the elevator waiters, output the allocation result, and enter step S4. The mixed-ride allocation algorithm is to allocate the elevator waiters to some or all of the elevators in the elevator group, and allocate at least one ordinary elevator waiter to the elevator carrying special elevator passengers, or allocate at least one special elevator waiter to the elevator carrying ordinary elevator passengers, or allocate at least one ordinary elevator waiter and at least one special elevator waiter to the same elevator.

[0199] In step S21, Figure 6 As shown, whether the separation allocation algorithm can be used to allocate the elevator waiters is determined according to the following method:

[0200] Step S211, determine whether there are elevators that only transport special passengers and / or only transport ordinary passengers and / or empty elevators, if so, proceed to step S212, otherwise proceed to step S23:

[0201] Step S212, determining the current available resources of the elevators that are not carrying special passengers, and calculating the total available resources;

[0202] Step S213, calculating the total occupied resources required by all ordinary elevator waiters to take the elevator;

[0203] Step S214, determining whether the total occupied resources are greater than the total available resources, if so, determining that the separation allocation algorithm cannot be used to allocate the elevator waiters, otherwise proceeding to step S215;

[0204] Step S215, taking elevators that are not assigned with ordinary elevator passengers and are carrying special elevator passengers and / or empty elevators that are not assigned with ordinary elevator passengers as special elevator passenger target elevators;

[0205] Step S216, enumerate all possible combinations of special elevator candidates, use the obtained combinations as elements to construct different sets, each set contains all special elevator candidates and the number of each special elevator candidate is 1, assign all elements in each set to the special elevator candidate target elevator, and establish a corresponding relationship between the elements in each set and the special elevator candidate target elevator;

[0206] Step S217, determine whether there is a set of available resources of the elevator for each element that is less than or equal to the corresponding special elevator candidate object elevator. If so, it is determined that the separation allocation algorithm can be used to allocate the elevator candidate. Otherwise, it is determined that the separation allocation algorithm cannot be used to allocate the elevator candidate.

[0207] In step S22, Figure 7 As shown in the figure, the steps of allocating the elevator passengers using the separation allocation algorithm are as follows:

[0208] Step A1, taking an elevator carrying a special passenger and / or an empty elevator as an elevator for special elevator passengers;

[0209] Step A2, enumerate all possible combinations of special elevator waiters, use the obtained combinations as elements to construct different sets, each set contains all special elevator waiters and the number of each special elevator waiter is 1, assign all elements in each set to the special elevator waiter target elevator, and establish a corresponding relationship between the elements in each set and the special elevator waiter target elevator;

[0210] Step A3, among all sets of which the required resources of each element are less than or equal to the available resources of the corresponding special elevator candidate target elevator, select the set with the largest remaining available resources after the special elevator candidate target elevator is assigned with the special elevator candidate, and form a special elevator candidate allocation plan by using the selected set and the corresponding relationship between the elements in the set and the special elevator candidate target elevator;

[0211] Step A4, treating the elevators that are not carrying special passengers and are not assigned special elevator candidates as ordinary elevator candidates' target elevators;

[0212] Step A5, using a conventional allocation algorithm to allocate ordinary elevator waiters to target elevators for ordinary elevator waiters, and forming an allocation plan for ordinary elevator waiters;

[0213] Step A6: Combining the special elevator waiter allocation plan and the common elevator waiter allocation plan as the final allocation result output.

[0214] In step S23, the mixed passenger allocation algorithm is any one of a common elevator waiter priority allocation algorithm or a special elevator waiter priority allocation algorithm or a corresponding priority allocation algorithm, wherein:

[0215] The priority allocation algorithm for ordinary elevator waiters is to first allocate the ordinary elevator waiters with a matching number to the elevators without special elevator passengers, and then allocate the remaining ordinary elevator waiters and special elevator waiters to the elevators with special elevator passengers;

[0216] The algorithm for allocating special elevator passengers in priority is to first allocate special elevator passengers of a matching number to the elevators that have already carried special elevator passengers, and then allocate the remaining special elevator passengers and ordinary elevator passengers to the elevators that have not carried special elevator passengers.

[0217] The corresponding priority allocation algorithm is to first allocate a matched number of ordinary elevator waiters to elevators that only carry ordinary passengers and allocate a matched number of special elevator waiters to elevators that already carry special passengers, and then allocate the remaining special elevator waiters to elevators that do not carry special passengers, and allocate the remaining ordinary elevator waiters to empty car elevators and / or elevators that already carry special passengers.

[0218] Among them, when there are special elevator waiters and the number of special users is greater than 2, the mixed passenger allocation algorithm selects the special elevator waiter priority allocation algorithm, and allocates the special elevator waiters to the elevators that have special elevator passengers on board first. Specifically, when allocating the special elevator waiters to the elevators that have special elevator passengers on board, the elevators that have special elevator passengers on board are sorted from small to large according to the number of ordinary elevator passengers on board, and the elevators that have special elevator passengers on board are selected from front to back according to the sorting results, and the special elevator waiters matching the number are allocated to the elevators according to the available resources of the selected elevators.

[0219] Alternatively, when there are special elevator waiters and the number of special users is greater than 2, elevators carrying special elevator passengers and empty elevators are used as special elevator waiter object elevators, all combinations of the special elevator waiters are enumerated, and different sets are constructed using the obtained combinations as elements, each set contains all special elevator waiters and the number of each special elevator waiter is 1, all special elevator waiters in each set are assigned to special elevator waiter object elevators, a correspondence between the elements in each set and the special elevator waiter object elevators is established, and a set that minimizes the number of elevators carrying special users after the special elevator waiter object elevators are assigned special elevator waiters is selected, and the special elevator waiters are assigned according to the correspondence between the elements in the selected set and the special elevator waiter object elevators.

[0220] Furthermore, when the remaining special elevator waiters are assigned to elevators carrying ordinary users or the ordinary elevator waiters and the remaining special elevator waiters are assigned to the same elevator so that ordinary users and special users are mixed, the number of special users in each mixed elevator is roughly equal.

[0221] When ordinary elevator passengers are assigned to an elevator that has already carried special users, all ordinary elevator passengers in the mixed elevator arrive later than the special users in the same mixed elevator or all arrive earlier than the special users in the same mixed elevator.

[0222] When all the ordinary elevator waiters are later than all the special users, the special users are sorted according to the distance from their destination floors to the current floor from near to far, and the ordinary elevator waiters are assigned to the elevator where the special user with the highest sorting result is located;

[0223] When all the ordinary elevator waiters arrive earlier than all the special users, the ordinary elevator waiters are sorted from near to far according to the distance between their destination floors and the current floor, and ordinary elevator waiters with a matching number are selected from front to back as mixed ordinary elevator waiters according to the sorting results.

[0224] In step S23, when the allocation scheme obtained by using the mixed-ride allocation algorithm is not unique and the mixed-ride allocation algorithm allocates the ordinary elevator waiters to the elevator that already carries special elevator passengers, or allocates the special elevator waiters to the elevator that only carries ordinary users, or allocates the ordinary elevator waiters and the special elevator waiters to the same elevator so that ordinary users and special users are mixed, an evaluation function is established with the goal of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, and the evaluation function is used to evaluate all the allocation schemes, and the allocation scheme corresponding to the best evaluation result is output as the allocation result.

[0225] The evaluation function uses at least one of the following variables: the number of mixed passengers, the mixed ride time, the mixed ride moving distance, and the mixed ride stop times. Preferably, any of the following expressions is used:

[0226] Method 1: number of people on mixed rides × time of mixed rides;

[0227] Method 2: the number of people in mixed rides × the distance traveled;

[0228] Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients;

[0229] Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

[0230] The elevator group management system of this embodiment has the same structural framework as the elevator group management system of embodiment one, wherein when the judgment unit determines that there are special users among the elevator users, the optimization allocation strategy selected by the selection unit adopts the elevator group management method of this embodiment, as shown above, and will not be repeated here.

[0231] The optimization allocation strategy of this embodiment gives priority to the separation allocation algorithm, which can completely avoid the mixing of special users and ordinary users. When the separation allocation algorithm cannot be used to allocate the elevator waiters, the mixed allocation algorithm is used, and the mixed allocation algorithm comprehensively considers the situations of the elevator waiters, elevator passengers and the available resources of the elevator, so as to minimize the adverse effects of special users on the elevator experience of ordinary users.

[0232] 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.

[0233] 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, proceed to step S2, otherwise proceed to step S3; Step S2, using an optimized allocation strategy to allocate the elevator waiters and output the allocation result, and then proceeding to step S4, wherein the optimization goal of the optimized allocation strategy includes minimizing the adverse effects of the special users on ordinary users; Step S3, using a conventional group allocation strategy to allocate the elevator waiters and output the allocation result, and then proceed to step S4; Step S4, controlling the elevator to run according to the dispatching result to respond to the elevator request of the elevator waiter; The step S2 specifically includes the following steps: Step S21, judging whether the separation and allocation algorithm can be used to allocate the elevator waiters, the separation and allocation algorithm is to allocate special elevator waiters to elevators carrying special elevator passengers and / or empty elevators, and allocate ordinary elevator waiters to elevators not carrying special elevator passengers and / or empty elevators, so that the special users and ordinary users take different elevators respectively. If it is possible, then proceed to step S22, otherwise proceed to step S23; Step S22, using a separation allocation algorithm to allocate the elevator waiters, outputting the allocation result, and proceeding to step S4; Step S23, using a mixed-ride allocation algorithm to allocate the elevator waiters, outputting the allocation result, and entering step S4, wherein the mixed-ride allocation algorithm allocates the elevator waiters to some or all of the elevators in the elevator group, and allocates at least one ordinary elevator waiter to the elevator carrying special elevator passengers, or allocates at least one special elevator waiter to the elevator carrying ordinary elevator passengers, or allocates at least one ordinary elevator waiter and at least one special elevator waiter to the same elevator; In step S22, the steps of using the separation and allocation algorithm to allocate the elevator waiters are as follows: Step A1, taking an elevator carrying a special passenger and / or an empty elevator as an elevator for special elevator passengers; Step A2, enumerate all possible combinations of special elevator waiters, use the obtained combinations as elements to construct different sets, each set contains all special elevator waiters and the number of each special elevator waiter is 1, assign all elements in each set to the special elevator waiter target elevator, and establish a corresponding relationship between the elements in each set and the special elevator waiter target elevator; Step A3, among all sets of which the required resources of each element are less than or equal to the available resources of the corresponding special elevator candidate target elevator, select the set with the largest remaining available resources after the special elevator candidate target elevator is assigned with the special elevator candidate, and form a special elevator candidate allocation plan by using the selected set and the corresponding relationship between the elements in the set and the special elevator candidate target elevator; Step A4, treating the elevators that are not carrying special passengers and are not assigned special elevator candidates as ordinary elevator candidates' target elevators; Step A5, using a conventional allocation algorithm to allocate ordinary elevator waiters to target elevators for ordinary elevator waiters, and forming an allocation plan for ordinary elevator waiters; Step A6: Combining the special elevator waiter allocation plan and the common elevator waiter allocation plan as the final allocation result output.

2. The elevator group management method according to claim 1, characterized in that: In step S1, the specific steps of determining whether there is a special user are as follows: Step S11, acquiring characteristic attribute information of the elevator user, wherein the characteristic attribute information includes characteristic attributes of the elevator user and corresponding characteristic attribute values; Step S12, judging whether the elevator user is a special user based on the characteristic attribute information of the elevator user 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.

3. The elevator group management method according to claim 2, characterized in that: The method for acquiring the characteristic attribute information of the elevator user is any one of the following: Mode 1, obtaining the identity information of the elevator user, and obtaining the characteristic attribute information of the elevator user according to the identity information; Mode 2, directly obtaining characteristic attribute information of the elevator user according to the received operation information of the elevator user; Method 3: For elevator users who are waiting for the elevator, image information of the elevator waiting area of ​​the elevator lobby is obtained, and the image information of the elevator waiting area is analyzed to obtain characteristic attribute information of the elevator waiting person.

4. The elevator group management method according to claim 3, characterized in that: In method 1, the identity information of the elevator user is obtained by acquiring and identifying the biological characteristics of the elevator user or reading an item carried by the elevator user that stores the identity information of the elevator user.

5. The elevator group management method according to claim 1, characterized in that: When the optimization objective of the optimization allocation strategy includes an additional objective in addition to the objective of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, the additional objective and the objective of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed are used to obtain a total evaluation index through weighted summation, and the weight coefficient of the additional objective and the objective of minimizing the adverse effects of special elevator waiters on ordinary elevator waiters when special elevator waiters and ordinary elevator waiters are mixed is determined according to at least one of the current state information of the elevator, the future state information of the elevator, the current elevator user information, and the future elevator user information.

6. The elevator group management method according to claim 1 or 5, characterized in that: The goal of minimizing the adverse effects of special users on ordinary users when they are mixed riding adopts an evaluation function with at least one of the number of mixed riding, mixed riding time, mixed riding moving distance, and mixed riding stop times as a characterizing variable.

7. The elevator group management method according to claim 6, characterized in that: The evaluation function is expressed in any of the following ways: Method 1: number of people on mixed rides × time of mixed rides; Method 2: the number of people in mixed rides × the distance traveled; Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients; Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

8. The elevator group management method according to claim 1, characterized in that: In step S21, it is determined whether the separation allocation algorithm can be used to allocate the elevator waiters according to the following method: Step S211, determine whether there are elevators that only transport special passengers and / or only transport ordinary passengers and / or empty elevators, if so, proceed to step S212, otherwise proceed to step S23: Step S212, determining the current available resources of the elevators that are not carrying special passengers, and calculating the total available resources; Step S213, calculating the total occupied resources required by all ordinary elevator waiters to take the elevator; Step S214, determining whether the total occupied resources are greater than the total available resources, if so, determining that the separation allocation algorithm cannot be used to allocate the elevator waiters, otherwise proceeding to step S215; Step S215, taking elevators that are not assigned with ordinary elevator passengers and are carrying special elevator passengers and / or empty elevators that are not assigned with ordinary elevator passengers as special elevator passenger target elevators; Step S216, enumerate all possible combinations of special elevator candidates, use the obtained combinations as elements to construct different sets, each set contains all special elevator candidates and the number of each special elevator candidate is 1, assign all elements in each set to the special elevator candidate target elevator, and establish a corresponding relationship between the elements in each set and the special elevator candidate target elevator; Step S217, determine whether there is a set of available resources of the elevator for each element that is less than or equal to the corresponding special elevator candidate object elevator. If so, it is determined that the separation allocation algorithm can be used to allocate the elevator candidate. Otherwise, it is determined that the separation allocation algorithm cannot be used to allocate the elevator candidate.

9. The elevator group management method according to claim 1, characterized in that: The mixed passenger allocation algorithm is any one of a common elevator waiting person priority allocation algorithm or a special elevator waiting person priority allocation algorithm or a corresponding priority allocation algorithm, wherein: The priority allocation algorithm for ordinary elevator waiters is to first allocate the ordinary elevator waiters with a matching number to the elevators without special elevator passengers, and then allocate the remaining ordinary elevator waiters and special elevator waiters to the elevators with special elevator passengers; The algorithm for allocating special elevator passengers in priority is to first allocate special elevator passengers of a matching number to the elevators that have already carried special elevator passengers, and then allocate the remaining special elevator passengers and ordinary elevator passengers to the elevators that have not carried special elevator passengers. The corresponding priority allocation algorithm is to first allocate a matched number of ordinary elevator waiters to elevators that only carry ordinary passengers and allocate a matched number of special elevator waiters to elevators that already carry special passengers, and then allocate the remaining special elevator waiters to elevators that do not carry special passengers, and allocate the remaining ordinary elevator waiters to empty car elevators and / or elevators that already carry special passengers.

10. The elevator group management method according to claim 9, characterized in that: When there are special elevator waiters and the number of special users is greater than 2, the mixed passenger allocation algorithm selects the special elevator waiter priority allocation algorithm to allocate the special elevator waiters to the elevator that has special elevator passengers on board first.

11. The elevator group management method according to claim 10, characterized in that: When allocating the special elevator waiters to the elevators that have already carried the special passengers, they are sorted from few to many according to the number of ordinary passengers carried in the elevators that have already carried the special passengers, and according to the sorting result, the elevators that have already carried the special passengers are selected from front to back in sequence, and a matching number of special elevator waiters are allocated to the selected elevators according to the available resources.

12. The elevator group management method according to claim 9, characterized in that: When there are special elevator waiters and the number of special users is greater than 2, elevators carrying special elevator passengers and empty elevators are used as special elevator waiter object elevators, all combinations of the special elevator waiters are enumerated, and different sets are constructed using the obtained combinations as elements, each set contains all special elevator waiters and the number of each special elevator waiter is 1, all special elevator waiters in each set are assigned to special elevator waiter object elevators, a corresponding relationship between the elements in each set and the special elevator waiter object elevators is established, and a set that minimizes the number of elevators carrying special users after the special elevator waiter object elevators are assigned special elevator waiters is selected, and the special elevator waiters are assigned according to the corresponding relationship between the elements in the selected set and the special elevator waiter object elevators.

13. The elevator group management method according to claim 9, characterized in that: When the remaining special elevator waiters are allocated to elevators carrying ordinary users or the ordinary elevator waiters and the remaining special elevator waiters are allocated to the same elevator so that ordinary users and special users are mixed, the number of special users in each mixed elevator is roughly equal.

14. The elevator group management method according to claim 9, characterized in that: When ordinary elevator waiters are allocated to an elevator that has special users on board, all ordinary elevator waiters in the mixed elevator arrive later than the special users in the same mixed elevator or all arrive earlier than the special users in the same mixed elevator.

15. The elevator group management method according to claim 14, characterized in that: When all the ordinary elevator waiters are later than all the special users, the special users are sorted according to the distance from their destination floors to the current floor from near to far, and the ordinary elevator waiters are assigned to the elevator where the special user with the highest sorting result is located; When all the ordinary elevator waiters arrive earlier than all the special users, the ordinary elevator waiters are sorted from near to far according to the distance between their destination floors and the current floor, and ordinary elevator waiters with a matching number are selected from front to back as mixed ordinary elevator waiters according to the sorting results.

16. The elevator group management method according to any one of claims 9 to 15, characterized in that: In step S23, when the allocation scheme obtained by using the mixed-ride allocation algorithm is not unique and the mixed-ride allocation algorithm allocates the ordinary elevator waiters to the elevator that already carries special elevator passengers, or allocates the special elevator waiters to the elevator that only carries ordinary users, or allocates the ordinary elevator waiters and the special elevator waiters to the same elevator so that ordinary users and special users are mixed, an evaluation function is established with the goal of minimizing the adverse effects of special users on ordinary users when special users and ordinary users are mixed, and the evaluation function is used to evaluate all the allocation schemes, and the allocation scheme corresponding to the best evaluation result is output as the allocation result.

17. The elevator group management method according to claim 16, characterized in that: The evaluation function uses at least one of the number of mixed passengers, mixed ride time, mixed ride moving distance, and mixed ride stop times as a characterizing variable.

18. The elevator group management method according to claim 17, characterized in that: The evaluation function is expressed in any of the following ways: Method 1: number of people on mixed rides × time of mixed rides; Method 2: the number of people in mixed rides × the distance traveled; Method 3: the number of mixed passengers × (α1 × mixed ride time + β1 × mixed ride distance), where α1 and β1 are coefficients; Method 4: α2×mixed ride time+β2×mixed ride moving distance+γ×mixed ride number, where α2, β2 and γ are coefficients.

19. An elevator group management system, characterized in that: include: An information acquisition unit, used to acquire elevator user information; A parsing unit, which parses the elevator user information and outputs characteristic attributes of the elevator user and corresponding characteristic attribute values; a judging unit, for judging whether the elevator user is a special user according to the characteristic attribute and the characteristic attribute value output by the analyzing unit; A selection unit is used to select an execution allocation strategy and output an allocation result. When the judgment unit determines that there is a special user among the elevator users, the selection unit selects an optimized allocation strategy as the execution allocation strategy, otherwise selects a conventional group allocation strategy as the execution allocation strategy; wherein the optimization target of the optimized allocation strategy includes minimizing the adverse effects of the special user on ordinary users; A control unit controls the operation of the elevator according to the allocation result output by the selection unit, and responds to the elevator request of the elevator waiter; The specific steps of the optimization deployment strategy are as follows: Step S1, judging whether the separation and allocation algorithm can be used to allocate the elevator waiters, the separation and allocation algorithm is to allocate special elevator waiters to elevators carrying special elevator passengers and / or empty elevators, and allocate ordinary elevator waiters to elevators not carrying special elevator passengers and / or empty elevators, so that the special users and ordinary users take different elevators respectively. If it is possible, then go to step S2, otherwise go to step S3; Step S2, using a separation allocation algorithm to allocate the elevator waiters and output the allocation result; Step S3, using a mixed-ride allocation algorithm to allocate the elevator waiters and output the allocation result, wherein the mixed-ride allocation algorithm allocates the elevator waiters to some or all of the elevators in the elevator group, and allocates at least one ordinary elevator waiter to the elevator carrying special elevator passengers, or allocates at least one special elevator waiter to the elevator carrying ordinary elevator passengers, or allocates at least one ordinary elevator waiter and at least one special elevator waiter to the same elevator; In step S2, the steps of using the separation and allocation algorithm to allocate the elevator waiters are as follows: Step A1, taking an elevator carrying a special passenger and / or an empty elevator as an elevator for special elevator passengers; Step A2, enumerate all possible combinations of special elevator waiters, use the obtained combinations as elements to construct different sets, each set contains all special elevator waiters and the number of each special elevator waiter is 1, assign all elements in each set to the special elevator waiter target elevator, and establish a corresponding relationship between the elements in each set and the special elevator waiter target elevator; Step A3, among all sets of which the required resources of each element are less than or equal to the available resources of the corresponding special elevator candidate target elevator, select the set with the largest remaining available resources after the special elevator candidate target elevator is assigned with the special elevator candidate, and form a special elevator candidate allocation plan by using the selected set and the corresponding relationship between the elements in the set and the special elevator candidate target elevator; Step A4, treating the elevators that are not carrying special passengers and are not assigned special elevator candidates as ordinary elevator candidates' target elevators; Step A5, using a conventional allocation algorithm to allocate ordinary elevator waiters to target elevators for ordinary elevator waiters, and forming an allocation plan for ordinary elevator waiters; Step A6: Combining the special elevator waiter allocation plan and the common elevator waiter allocation plan as the final allocation result output.

20. The elevator group management system according to claim 19, characterized in that: The elevator user information 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 an elevator user received by an information receiving module.

21. The elevator group management system according to claim 19, characterized in that: The parsing unit comprises: A first storage module, used to store all possible characteristic attributes of the elevator user; The parsing module judges all possible characteristic attributes one by one according to the source or content of the elevator user information to determine whether the corresponding characteristic attribute value can be obtained from the elevator user information, and finally obtains and outputs the characteristic attributes of the elevator user and the characteristic attribute value corresponding to each characteristic attribute through parsing.

22. The elevator group management system according to claim 19, characterized in that: The judging unit comprises: A second storage module is used to store preset target feature attribute information, wherein the target feature attribute information includes all feature attributes and feature attribute thresholds corresponding to each of the feature attributes; A query module, for searching the corresponding characteristic attribute threshold value from the second storage module according to the characteristic attribute output by the parsing unit; A comparison module, for comparing the characteristic attribute value corresponding to the characteristic attribute output by the analysis unit with the characteristic attribute threshold value corresponding to the characteristic attribute found by the query module; A judging module is used to judge whether the elevator user having the characteristic attribute and its characteristic attribute value is a special user according to the comparison result of the comparing module.

23. The elevator group management system according to claim 19, characterized in that: In step S1, it is determined whether the separation allocation algorithm can be used to allocate the elevator waiters according to the following method: Step S11, determine whether there are elevators that only transport special passengers and / or only transport ordinary passengers and / or empty elevators, if so, proceed to step S12, otherwise proceed to step S3: Step S12, determining the current available resources of the elevators that are not carrying special passengers, and calculating the total available resources; Step S13, calculating the total occupied resources required by all ordinary elevator waiters to take the elevator; Step S14, determining whether the total occupied resources are greater than the total available resources, if so, determining that the separation allocation algorithm cannot be used to allocate the elevator waiters, otherwise proceeding to step S15; Step S15, taking elevators that are not assigned with ordinary elevator passengers and are carrying special elevator passengers and / or empty elevators that are not assigned with ordinary elevator passengers as special elevator passenger target elevators; Step S16, enumerate all possible combinations of special elevator candidates, use the obtained combinations as elements to construct different sets, each set contains all special elevator candidates and the number of each special elevator candidate is 1, assign all elements in each set to the special elevator candidate target elevator, and establish a corresponding relationship between the elements in each set and the special elevator candidate target elevator; Step S17, determine whether there is a set of available resources of the elevator for each element that is less than or equal to the corresponding special elevator candidate object elevator. If so, it is determined that the separation allocation algorithm can be used to allocate the elevator candidate. Otherwise, it is determined that the separation allocation algorithm cannot be used to allocate the elevator candidate.

24. The elevator group management system according to claim 19, characterized in that: The mixed passenger allocation algorithm is any one of a common elevator waiting person priority allocation algorithm or a special elevator waiting person priority allocation algorithm or a corresponding priority allocation algorithm, wherein: The priority allocation algorithm for ordinary elevator waiters is to first allocate the ordinary elevator waiters with a matching number to the elevators without special elevator passengers, and then allocate the remaining ordinary elevator waiters and special elevator waiters to the elevators with special elevator passengers; The algorithm for allocating special elevator passengers in priority is to first allocate special elevator passengers of a matching number to the elevators that have already carried special elevator passengers, and then allocate the remaining special elevator passengers and ordinary elevator passengers to the elevators that have not carried special elevator passengers. The corresponding priority allocation algorithm is to first allocate a matched number of ordinary elevator waiters to elevators that only carry ordinary passengers and allocate a matched number of special elevator waiters to elevators that already carry special passengers, and then allocate the remaining special elevator waiters to elevators that do not carry special passengers, and allocate the remaining ordinary elevator waiters to empty car elevators and / or elevators that already carry special passengers.

Images