CN111768106B - Elevator resource allocation method, system, electronic equipment and storage medium - Google Patents
Elevator resource allocation method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111768106B CN111768106B CN202010616605.9A CN202010616605A CN111768106B CN 111768106 B CN111768106 B CN 111768106B CN 202010616605 A CN202010616605 A CN 202010616605A CN 111768106 B CN111768106 B CN 111768106B
- Authority
- CN
- China
- Prior art keywords
- elevator
- user
- elevators
- state
- waiting time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B50/00—Energy efficient technologies in elevators, escalators and moving walkways, e.g. energy saving or recuperation technologies
Abstract
The disclosure provides an elevator resource allocation method, an elevator resource allocation system, electronic equipment and a storage medium, wherein the method comprises the following steps: receiving user request information; acquiring elevator state information of all elevators at the position of a user; and allocating elevator resources to the user based on the user request information and the elevator status information of all elevators. According to the embodiment of the disclosure, reasonable elevator resources are allocated to the user according to the user demands and the elevator state, and the problems that the waiting time of the generated elevator is too long, the elevator taking experience is poor and the like in the areas such as travel peaks of the user can be at least solved.
Description
Technical Field
The present disclosure relates to the field of communication technology, and in particular, to an elevator resource allocation method, an elevator resource allocation system, an electronic device, and a computer readable storage medium.
Background
With the rapid development of economy, elevators have become standard configurations of residences, markets and office buildings, but due to the intensive growth of population and the gradual diversification of travel demands of people, the cured hardware resources of an elevator system cannot meet the riding demands of people, and particularly for the population, areas with high peaks and the like exist, so that the timeliness and automation of the elevators have become the current problems to be solved urgently.
Disclosure of Invention
The present disclosure provides an elevator resource allocation method, system, electronic device and storage medium to solve at least the above problems.
According to an aspect of the embodiments of the present disclosure, there is provided an elevator resource allocation method, including:
receiving user request information;
acquiring elevator state information of all elevators at the position of a user; the method comprises the steps of,
and allocating elevator resources for the user based on the user request information and the elevator status information of all elevators.
In one embodiment, the user request information includes a current layer number of the user and a target layer number of the user; the elevator state information comprises the current floor number of an elevator, the target floor number of the elevator, an elevator state and elevator operation parameters, wherein the elevator state comprises an idle state and a running state, and the elevator operation parameters comprise stop times, single-layer operation required duration, single-time waiting duration and single-time average waiting duration.
In one embodiment, allocating elevator resources to a user based on the user request information and the elevator status information of all elevators comprises:
judging whether the elevator states of all the elevators are idle states or not;
if the elevator states of all the elevators are idle states, respectively calculating the difference between the current layer number of each idle state elevator and the current layer number of the user to obtain a first calculation result;
and selecting the idle state elevator with the smallest difference value from all the idle state elevators based on the first calculation result, and distributing elevator resources for users.
In one embodiment, after determining whether the elevator states of all elevators are idle, further comprising:
if the elevator states of all the elevators are running states, continuously judging whether the elevators with the number of floors where the disabled user is currently located exist in the elevators in all the running states;
if the elevator with the current layer number of the deactivated user exists, continuously judging whether the number of the elevator with the current layer number of the deactivated user is more than one;
if the number of the elevators at the current floor of the stopped user is more than one, respectively calculating the waiting time required by each power failure elevator to reach the current floor of the user based on the current floor of each stopped elevator and the elevator operation parameters, and obtaining a second calculation result;
and selecting the power-off ladder with the shortest waiting time required for reaching the current layer of the user from all the power-off ladders based on the second calculation result, and distributing elevator resources for the user.
In one embodiment, after determining whether there is an elevator in which the disabled user is currently located in the traveling state elevators, the method further includes:
if the elevator with the current floor of the stopped user does not exist, respectively calculating the waiting time required by each traveling elevator to reach the current floor of the user based on the current floor of each traveling elevator, the target floor of the elevator and the operation parameters of the elevator, and obtaining a third calculation result;
and selecting the running state elevator with the shortest waiting time required for reaching the current layer of the user from all the running state elevators based on the third calculation result, and distributing elevator resources for the user.
In one embodiment, after obtaining the third calculation result, the method further includes:
respectively judging whether the waiting time required by each running state elevator to reach the current layer number of the user exceeds a first preset threshold value or not;
if the waiting time required by all running state elevators to reach the current layer number of the user exceeds a first preset threshold value, the step of selecting the running state elevator with the shortest waiting time required by the user to reach the current layer number of the user from all running state elevators to allocate elevator resources for the user is jumped out, and an early warning prompt is sent out.
In one embodiment, after determining whether the elevator states of all elevators are idle, further comprising:
if the idle elevator and the running elevator exist in all the elevators, continuously judging whether the elevators with the number of floors where the disabled user is currently located exist in all the running elevators;
if the elevator with the current layer number of the deactivated user exists, continuously judging whether the number of the elevator with the current layer number of the deactivated user is more than one;
if the number of the elevators of the floor where the stopped user is currently located is more than one, continuously judging whether the same-direction power-off ladders exist in the power-off ladders in the same direction as the elevator riding direction of the user;
if the same-direction power-off elevator with the same elevator taking direction as the user exists, calculating waiting time required by each idle elevator and each same-direction power-off elevator to reach the current layer number of the user, and obtaining a fourth calculation result;
based on the fourth calculation result, selecting an idle state elevator and a power-off elevator with the shortest waiting time required for reaching the current layer of the user from all idle state elevators and power-off elevators with the same direction respectively;
judging whether the difference value between the waiting time required by the selected idle-state elevator and the waiting time required by the same-direction power failure elevator to reach the current layer number of the user is smaller than a second preset threshold value or not;
and if the waiting time is smaller than a second preset threshold value, selecting the idle state elevator with the shortest waiting time required for reaching the current layer number of the user to allocate elevator resources for the user.
According to another aspect of the disclosed embodiments, there is provided an elevator resource allocation system, comprising:
a request receiving module configured to receive user request information;
the state acquisition module is used for acquiring elevator state information of all elevators at the position of the user; the method comprises the steps of,
an elevator allocation module arranged to allocate elevator resources to a user based on said user request information and elevator status information of all elevators.
According to a third aspect of embodiments of the present disclosure, there is provided an electronic device, comprising: the elevator resource allocation method comprises a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the elevator resource allocation method.
According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the elevator resource allocation method.
The technical scheme provided by the embodiment of the disclosure can comprise the following beneficial effects:
according to the elevator resource allocation method provided by the embodiment of the disclosure, the elevator resource is allocated to the user based on the user request information and the elevator state information of all elevators at the position of the user by receiving the user request information and acquiring the elevator state information of all elevators at the position of the user. According to the embodiment of the disclosure, reasonable elevator resources are allocated to the user according to the user demands and the elevator state, and the problems that the waiting time of the generated elevator is too long, the elevator taking experience is poor and the like in the areas such as travel peaks of the user can be at least solved.
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the disclosure. The objectives and other advantages of the disclosure will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosed embodiments and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain, without limitation, the disclosed embodiments.
Fig. 1 is a schematic flow chart of an elevator resource allocation method provided in an embodiment of the disclosure;
fig. 2 is a schematic flow chart of an elevator resource allocation method according to another embodiment of the disclosure;
fig. 3 is a schematic flow chart of an elevator resource allocation method according to still another embodiment of the present disclosure;
fig. 4 is a schematic flow chart of an elevator resource allocation method according to another embodiment of the disclosure;
fig. 5 is a schematic structural diagram of an elevator resource allocation system according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the following detailed description of the specific embodiments of the present disclosure will be given with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the disclosure, are not intended to limit the disclosure.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and the above-described figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order; moreover, embodiments of the present disclosure and features of embodiments may be arbitrarily combined with each other without conflict.
In the following description, suffixes such as "module", "component", or "unit" for representing elements are used only for facilitating the description of the present disclosure, and are not of specific significance per se. Thus, "module," "component," or "unit" may be used in combination.
The current ladder control technology is relatively solidified, and generally cannot actively perform bidirectional analysis and dynamic allocation on a target area/person/object, so that the requirements of increasingly complex riding scenes on timeliness and intellectualization cannot be met.
Therefore, the embodiment of the disclosure provides an intelligent elevator resource allocation method, which is based on single user request multi-response, can receive riding request information of users, combines elevator operation parameters and operation states, performs differentiated response on the user requests according to agreed resource allocation rules, allocates proper elevator resources for the user requests, is particularly suitable for large-scale office or home scenes with dense population, shortage of resources and peak use, can effectively reduce waiting time, improves elevator use efficiency and resource allocation rationality, and builds intelligent and efficient intelligent home and intelligent city systems by assistance.
Referring to fig. 1, fig. 1 is a flowchart of an elevator resource allocation method according to an embodiment of the disclosure, where the method includes steps S101 to S103.
In step S101, user request information is received.
Specifically, when a user needs to take an elevator, user request information is sent to an elevator resource distribution system, and the elevator resource distribution system receives the user request information, wherein the user request information comprises the current layer number U of the user cur And user target layer number U tar In practical application, the user can use his mobile terminal to send user request to the elevator resource allocation systemIt should be noted that, the user request information may not be limited to the current layer number of the user and the target layer number of the user, but may also include other request information of the user, for example, a time when the user desires to reach the target layer number.
In step S102, elevator status information of all elevators at the location of the user is acquired.
All elevators at the location of the user can be all elevators at the locations of an office building, a mall and the like where the user is located.
Specifically, the elevator resource allocation system acquires elevator status information of all elevators under the current system management in real time, wherein the elevator status information comprises the current floor number E of the elevators cur Elevator target layer number E tar Elevator state E sta And elevator operating parameters, wherein the elevator status includes an idle status and a traveling status, and the elevator operating parameters include a number of stops W sum Length of time R required for single layer operation ave Duration of single wait T wait Average waiting time length T of single time ave 。
It can be appreciated that the user's current layer number U cur Means the floor number of the user when the user sends the request, the floor number U is within the effective range of elevator operation tar The target floor number in the user request is within the effective range of elevator operation; elevator current layer number E cur Refers to the current floor of the elevator, possibly the stopping floor or the running path floor, and the target floor E of the elevator tar The elevator can comprise a first target layer number and a second target layer number which respectively represent a first stopping target layer number and a second stopping target layer number in the current existing task of the elevator; elevator state E sta The elevator mainly comprises an idle state and a driving state, wherein the elevator is in an idle state when the elevator is stationary and a task is not to be executed currently, the driving state can be divided into two types, one of the two types is a state that no person is currently in the elevator but the elevator is in task response driving, the elevator is in an idle driving state, and the elevator is in a busy state when someone in the elevator is in driving; number of stops W of elevator sum Refers to the number of times the elevator needs to stop, including the number of times the elevator is internally designated to stop, and the number of times the elevator is externally responded to or is to respond toThe number of times of stopping the task and the length R required by single-layer operation ave The time required by the elevator to pass through a single floor is obtained by the running speed of the elevator and the floor spacing, and is generally constant. Duration of one-time wait T wait Refers to the duration of waiting, typically real-time duration, required for a single stop of the elevator to restart. Average duration of single waiting T ave The average value calculated according to the historical stopping waiting time of the elevator can be averaged according to the appointed times or time intervals, and differential value is obtained according to different scenes. Taking the peak time average waiting period (peak time waiting period is generally longer than the regular time waiting period) as early as 7 to 9 points and as late as five to seven points.
It should be noted that, for an elevator in a driving state, the elevator may be further divided into an empty driving elevator (on task) and a busy elevator (busy), when the target floor number of the elevator includes a first target floor number and a second target floor number, for the empty driving elevator, the target floor number is the first two floor numbers of the external task that has been responded currently, and for the busy elevator, the target floor number may be the specified stopping floor number of the external task that has been responded currently or the user in the elevator, and the first two positions may be taken in the combination of the two.
In step S103, elevator resources are allocated to the user based on the user request information and the elevator status information of all elevators.
Compared with the solidification of the elevator control technology in the related art, key operation is usually carried out on the floor where the elevator is located through a user, then the elevator is waited for, when the elevator demand is large, the waiting time of the user is longer, when the elevator quantity is more or dispersedly open, the user can not quickly reach the elevator taking position, the user can not know which elevator can save more elevator taking time before going up the elevator, and the like.
Referring to fig. 2, fig. 2 is a schematic flow chart of an elevator resource allocation method according to another embodiment of the present disclosure, and based on the previous embodiment, the present embodiment further divides step S103 into steps S201-S207, and the allocation of elevator resources is implemented by analyzing the idle state or the driving state of the elevator, so as to improve the elevator resource allocation efficiency. In particular, the method comprises the steps of,
in step S201, it is determined whether or not the elevator states of all the elevators are idle, and if they are idle, step S202 is executed, and if they are traveling, step S204 is executed.
In step S202, the difference between the current layer number of each idle-state elevator and the current layer number of the user is calculated, so as to obtain a first calculation result.
In step S203, based on the first calculation result, the idle state elevator with the smallest difference value is selected from all the idle state elevators to allocate elevator resources for the user.
It will be appreciated that when there is only one elevator and in an idle state, the elevator is allocated directly to the user, and in response to a user request, the above steps are performed when there is more than one elevator and all are idle, taking E cur -U cur An elevator with a smaller difference value is selected in response to the request.
In step S204, it is determined whether there is an elevator in the number of floors where the disabled user is currently located in each traveling state elevator, if so, step S205 is executed, otherwise, the flow is ended.
In step S205, it is determined whether the number of elevators in the floor where the disabled user is currently located is more than one, if more than one elevator is located, step S206 is executed, if there is only one parked elevator, the flow is ended, the parked elevator is selected to directly allocate elevator resources to the user, and a new parking task is added to the elevator in response to the user demand.
Wherein the driving state elevator can be an empty or busy elevator. Specifically, when the user is on the destination floor U tar When the user is at floor U, the user is at the floor U to stop cur Is currently emptyIf the elevator is going or busy, but there is no floor for a stop task, the request is allocated directly to the elevator, and a new stop task is added to the elevator.
In step S206, the waiting time required for each stopped elevator to reach the current floor of the user is calculated based on the current floor of each stopped elevator and the elevator operation parameters, and a second calculation result is obtained.
In this embodiment, the arrival U of each elevator is calculated cur Required waiting time (E cur -U cur )*R ave +W sum *T ave Where W is sum To arrive at U cur The number of warp stops required before. And comparing the waiting time required by each elevator, and selecting the smallest response to the request. The time advantage is not obvious and the number of preferred stops is small.
In some embodiments, to further ensure efficient allocation of elevators, no allocation is made for elevators that are busy and the number of floors to be parked or the personnel load has reached a threshold. For other elevators to be selected, calculating the respective required waiting time length = stopping time length + driving time length = stopping times W of the existing tasks sum *T ave +(E cur -U cur )*R ave . R herein ave The elevator driving speed and the floor distance are calculated. And sequencing all the standby power cut ladders according to the standby time length, selecting the shortest standby time, and responding to the request. Meanwhile, the maximum waiting time can be set for scenes such as peak time, dense areas and the like. At this time, it is necessary to determine first that the waiting time required by the parked elevator=the parking time+the traveling time=the number of times W of parking the existing task sum *T ave +(E cur -U cur )*R ave T here ave The peak time period or the corresponding average waiting time of the dense area can be taken according to the situation. For which the required waiting period exceeds the waiting period threshold, the allocation may be temporarily discontinued.
In step S207, based on the second calculation result, the powered down elevator with the shortest waiting time required for reaching the current floor of the user is selected from all the powered down elevators to allocate elevator resources for the user.
Referring to fig. 3, fig. 3 is a schematic flow chart of an elevator resource allocation method according to another embodiment of the present disclosure, and based on the above embodiment, the present embodiment further provides an elevator allocation scheme in which each elevator is not stopped when only the elevator is running, specifically, after determining whether there is an elevator with the current floor number of the stopped user in each running state elevator (step S204), the method further includes:
in step S301, if there is no elevator with the current floor where the stopped user is located, calculating the waiting time required for each traveling elevator to reach the current floor where the user is located based on the current floor where the elevator is located in each traveling state, the target floor of the elevator and the operation parameters of the elevator, so as to obtain a third calculation result;
in step S302, based on the third calculation result, a running state elevator with the shortest waiting time required for reaching the current floor of the user is selected from all running state elevators to allocate elevator resources for the user.
Further, in order to avoid that the user waits for the elevator too long, and occupies too much time resources of the user, the embodiment further includes step S303 and step S304 after obtaining the third calculation result (i.e. step S301).
In step S303, it is respectively determined whether the waiting time required for each running state elevator to reach the current floor of the user exceeds a first preset threshold;
in step S304, if the waiting time required for all the running state elevators to reach the current floor of the user exceeds the first preset threshold, the step of selecting the running state elevator with the shortest waiting time required for reaching the current floor of the user from all the running state elevators to allocate elevator resources for the user is skipped, an early warning prompt is sent and the flow is ended, otherwise, step S302 is executed.
Specifically, when all elevators are in a traveling state, and the traveling route does not pass through U cur . The elevator that is full is first excluded. For the remaining elevators, the respective required waiting time period (arrival U cur Required duration + arrival U tar Required length) = (E cur -U cur )*R ave +(U tar -U cur )*R ave +W sum *T ave . And comparing the required waiting time length of each elevator with a first preset threshold value, and when the required waiting time lengths of all elevators exceed the first preset threshold value, not allocating elevator resources to users and sending out early warning prompts so that the users reasonably utilize the time. Further, when the time advantage is not obvious (for example, less than 3 s), the elevator with fewer stopping times is preferentially selected for resource allocation, so that the influence on the existing task is reduced, and the use balance of the elevator is improved.
It should be noted that, in the setting of the values of the first preset threshold and the second preset threshold in this embodiment, those skilled in the art may combine the actual situation of the elevator and the actual situation that the user waits for the elevator to perform the adaptive setting, which is not described herein.
Referring to fig. 4, fig. 4 is a schematic flow chart of an elevator resource allocation method according to still another embodiment of the present disclosure, where, based on the above embodiment, the present embodiment further considers that there is more than one stopped elevator in all elevators in the case that there is both an idle elevator and a traveling elevator, specifically, after determining whether the elevator states of all elevators are idle (i.e. step 201), steps S401-S406 are further included.
In step S401, if there are both idle elevators and traveling elevators in all elevators, then continuing to determine whether there are elevators in the traveling elevators in which the disabled user is currently located, if yes, executing step S402, otherwise, ending the flow;
in step S402, it is continuously determined whether the number of elevators in the floor where the parked user is currently located is more than one, if there is more than one parked elevator, step S403 is executed, and when there is only one parked elevator, the flow is ended and the parked elevator is directly allocated to the user.
In step S403, it is continuously determined whether there is a power outage elevator in the same direction as the user 'S elevator taking direction in each power outage elevator, if there is a power outage elevator in the same direction as the user' S elevator taking direction in the same direction, step S404 is executed, otherwise, the flow is ended, the required waiting time of each elevator is calculated, and the elevator with the shortest time is selected as the assigned elevator.
In step S404, calculating waiting time required for each idle elevator and each power failure elevator to reach the current layer of the user, so as to obtain a fourth calculation result;
in step S405, based on the fourth calculation result, an idle state elevator and a power-off elevator with the shortest waiting time required for reaching the current floor of the user are selected from all idle state elevators and all power-off elevators in the same direction respectively;
in step S406, it is determined whether the difference between the waiting times required for the selected idle-state elevators and the waiting times required for the same-direction power-off elevators to reach the current floor of the user is smaller than a second preset threshold, if so, step S407 is executed, otherwise, the flow is ended, and the elevator with the shortest waiting time is selected from all the elevators (including idle elevators and traveling elevators), and the user is responded to the requirement, and elevator resources are allocated to the user.
In step S407, the idle elevator with the shortest waiting time required for reaching the current layer of the user is selected to allocate elevator resources for the user, and the process is ended.
In this embodiment, when the elevator is abnormal or the single-floor waiting times out (i.e., the required waiting period T wait -T ave Exceeding a first preset threshold), if the elevator fails or pauses, selecting the next elevator earlier in the sorting to be allocated, and if no elevator is available, canceling the response and reallocating.
Based on the same technical concept, the embodiments of the present disclosure correspondingly also provide an elevator resource allocation system, as shown in fig. 5, which includes a request receiving module 51, a status acquiring module 52, and an elevator allocation module 53, wherein,
the request receiving module 51 is configured to receive user request information;
the state acquisition module 52 is configured to acquire elevator state information of all elevators at the location of the user; the method comprises the steps of,
the elevator allocation module 53 is arranged to allocate elevator resources to the user based on the user request information and the elevator status information of all elevators.
Further, the user request information comprises the current layer number of the user and the target layer number of the user; the elevator state information comprises the current floor number of an elevator, the target floor number of the elevator, an elevator state and elevator operation parameters, wherein the elevator state comprises an idle state and a running state, and the elevator operation parameters comprise stop times, single-layer operation required duration, single-time waiting duration and single-time average waiting duration.
Further, the elevator allocation module 53 comprises:
a judging unit configured to judge whether or not the elevator states of all the elevators are idle states;
the calculating unit is used for calculating the difference between the current layer number of each elevator in the idle state and the current layer number of the user when the judging unit judges that the elevator state information of all elevators is in the idle state, so as to obtain a first calculation result;
and a selection allocation unit configured to select an idle state elevator with the smallest difference value from all the idle state elevators to allocate elevator resources to the user based on the first calculation result.
Further, the judging unit is further configured to continuously judge whether the elevators in each driving state exist in the number of floors where the disabled user is currently located or not when judging that all the elevators are in the driving state;
the judging unit is further configured to continuously judge whether the number of the elevators with the number of the floors where the deactivated user is currently located is more than one when judging that the elevators with the number of the floors where the deactivated user is currently located exist;
the calculating unit is further configured to calculate waiting time required for each stopped elevator to reach the current layer of the user based on the current layer of each stopped elevator and elevator operation parameters when the judging unit judges that the number of the elevators of the current layer of the stopped user is more than one, so as to obtain a second calculation result;
the selection allocation unit is further configured to select, based on the second calculation result, a powered down elevator with the shortest waiting time required for reaching the current layer of the user from all powered down elevators, and allocate elevator resources to the user.
Further, the calculating unit is further configured to calculate waiting time required for each traveling elevator to reach the current floor of the user based on the current floor of each traveling elevator, the target floor of the elevator and the operation parameters of the elevator when the judging unit judges that the elevator with the current floor of the disabled user does not exist, so as to obtain a third calculation result;
the selection allocation unit is further configured to select, based on the third calculation result, a running state elevator with the shortest waiting time required for reaching the current floor of the user from all running state elevators, and allocate elevator resources to the user.
Further, the judging unit is further configured to respectively judge whether the waiting time required by each running state elevator to reach the current layer number of the user exceeds a first preset threshold value;
and the early warning unit is arranged to jump out of the steps of selecting the running state elevator with the shortest waiting time required for reaching the current layer number of the user from all the running state elevators to allocate elevator resources for the user when the judging unit judges that the running state elevators exceed the first preset threshold value, and send out early warning prompt.
Further, the judging unit is further configured to continuously judge whether the elevator of the number of floors where the disabled user is currently located exists in each running state elevator when judging that the idle state elevator and the running state elevator exist in all elevators;
the judging unit is further configured to continuously judge whether the number of the elevators with the number of the floors where the deactivated user is currently located is more than one when judging that the elevators with the number of the floors where the deactivated user is currently located exist;
the judging unit is further arranged to continuously judge whether the same-direction power-off ladder with the same riding direction as the user exists in each power-off ladder or not when judging that more than one power-off elevator exists;
the calculating unit is further configured to calculate waiting time required for each idle elevator and each power-off elevator to reach the current layer number of the user when the judging unit judges that the power-off elevator in the same direction as the elevator riding direction of the user exists, so as to obtain a fourth calculation result;
the elevator allocation module further comprises:
the second selection unit is arranged to select the idle state elevator and the same-direction power-off elevator with the shortest waiting time required for reaching the current layer number of the user from all the idle state elevators and all the same-direction power-off elevators respectively based on the fourth calculation result;
judging whether the difference value between the waiting time required by the selected idle-state elevator and the waiting time required by the same-direction power failure elevator to reach the current layer number of the user is smaller than a second preset threshold value or not;
the selection allocation unit is further configured to select, when the judgment unit judges that the number of floors where the user is currently located is smaller than a second preset threshold, an idle-state elevator with the shortest waiting time required for reaching the user to allocate elevator resources for the user.
Based on the same technical concept, the embodiment of the present disclosure correspondingly further provides an electronic device, as shown in fig. 6, where the electronic device includes: comprises a memory 61 and a processor 62, wherein the memory 61 stores a computer program, and the processor 62 executes the elevator resource allocation method when the processor 62 runs the computer program stored in the memory 61.
Based on the same technical concept, the embodiments of the present disclosure correspondingly also provide a computer-readable storage medium, on which a computer program is stored, which when being executed by a processor, the processor executes the elevator resource allocation method.
In summary, the method, the system, the electronic device and the storage medium for allocating elevator resources provided by the embodiments of the present disclosure receive user request information, acquire elevator status information of all elevators, and then allocate elevator resources to users based on the user request information and the elevator status information of all elevators. According to the embodiment of the disclosure, reasonable elevator resources are allocated to the user according to the user demands and the elevator state, and the problems that the waiting time of the generated elevator is too long, the elevator taking experience is poor and the like in the areas such as travel peaks of the user can be at least solved.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present disclosure, and not for limiting the same; although the present disclosure has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present disclosure.
Claims (8)
1. An elevator resource allocation method, comprising:
receiving user request information;
acquiring elevator state information of all elevators at the position of a user; the method comprises the steps of,
allocating elevator resources for the user based on the user request information and the elevator status information of all elevators;
the user request information comprises the current layer number of the user and the target layer number of the user;
the elevator state information comprises the current floor number of an elevator, the target floor number of the elevator, an elevator state and elevator operation parameters, wherein the elevator state comprises an idle state and a running state, and the elevator operation parameters comprise the stop times, the time required by single-layer operation, the time of single waiting and the time of single average waiting;
allocating elevator resources to the user based on the user request information and the elevator status information of all elevators, comprising:
judging whether the elevator states of all the elevators are idle states or not;
if the idle elevator and the running elevator exist in all the elevators, continuously judging whether the elevators with the number of floors where the disabled user is currently located exist in all the running elevators;
if the elevator with the current layer number of the deactivated user exists, continuously judging whether the number of the elevator with the current layer number of the deactivated user is more than one;
if the number of the elevators of the floor where the stopped user is currently located is more than one, continuously judging whether the same-direction power-off ladders exist in the power-off ladders in the same direction as the elevator riding direction of the user;
if the same-direction power-off elevator with the same elevator taking direction as the user exists, calculating waiting time required by each idle elevator and each same-direction power-off elevator to reach the current layer number of the user, and obtaining a fourth calculation result;
based on the fourth calculation result, selecting an idle state elevator and a power-off elevator with the shortest waiting time required for reaching the current layer of the user from all idle state elevators and power-off elevators with the same direction respectively;
judging whether the difference value between the waiting time required by the selected idle-state elevator and the waiting time required by the same-direction power failure elevator to reach the current layer number of the user is smaller than a second preset threshold value or not;
and if the waiting time is smaller than a second preset threshold value, selecting the idle state elevator with the shortest waiting time required for reaching the current layer number of the user to allocate elevator resources for the user.
2. The method according to claim 1, characterized in that after determining whether the elevator states of all elevators are idle states, further comprising:
if the elevator states of all the elevators are idle states, respectively calculating the difference between the current layer number of each idle state elevator and the current layer number of the user to obtain a first calculation result;
and selecting the idle state elevator with the smallest difference value from all the idle state elevators based on the first calculation result, and distributing elevator resources for users.
3. The method according to claim 1, characterized in that after determining whether the elevator states of all elevators are idle states, further comprising:
if the elevator states of all the elevators are running states, continuously judging whether the elevators with the number of floors where the disabled user is currently located exist in the elevators in all the running states;
if the elevator with the current layer number of the deactivated user exists, continuously judging whether the number of the elevator with the current layer number of the deactivated user is more than one;
if the number of the elevators at the current floor of the stopped user is more than one, respectively calculating the waiting time required by each power failure elevator to reach the current floor of the user based on the current floor of each stopped elevator and the elevator operation parameters, and obtaining a second calculation result;
and selecting the power-off ladder with the shortest waiting time required for reaching the current layer of the user from all the power-off ladders based on the second calculation result, and distributing elevator resources for the user.
4. A method according to claim 3, characterized in that after determining whether there is an elevator of the floor number where the deactivated user is currently located in each travel state elevator, it further comprises:
if the elevator with the current floor of the stopped user does not exist, respectively calculating the waiting time required by each traveling elevator to reach the current floor of the user based on the current floor of each traveling elevator, the target floor of the elevator and the operation parameters of the elevator, and obtaining a third calculation result;
and selecting the running state elevator with the shortest waiting time required for reaching the current layer of the user from all the running state elevators based on the third calculation result, and distributing elevator resources for the user.
5. The method of claim 4, further comprising, after obtaining the third calculation result:
respectively judging whether the waiting time required by each running state elevator to reach the current layer number of the user exceeds a first preset threshold value or not;
if the waiting time required by all running state elevators to reach the current layer number of the user exceeds a first preset threshold value, the step of selecting the running state elevator with the shortest waiting time required by the user to reach the current layer number of the user from all running state elevators to allocate elevator resources for the user is jumped out, and an early warning prompt is sent out.
6. An elevator resource allocation system, comprising:
a request receiving module configured to receive user request information;
the state acquisition module is used for acquiring elevator state information of all elevators at the position of the user; the method comprises the steps of,
an elevator allocation module arranged to allocate elevator resources to a user based on the user request information and the elevator status information of all elevators;
the user request information comprises the current layer number of the user and the target layer number of the user;
the elevator state information comprises the current floor number of an elevator, the target floor number of the elevator, an elevator state and elevator operation parameters, wherein the elevator state comprises an idle state and a running state, and the elevator operation parameters comprise the stop times, the time required by single-layer operation, the time of single waiting and the time of single average waiting;
the elevator allocation module comprises:
a judging unit configured to judge whether or not the elevator states of all the elevators are idle states;
the judging unit is further arranged to continuously judge whether the elevators in each running state exist in the number of floors where the disabled user is currently located when judging that the elevators in all the running states exist in both the idle state elevators and the running state elevators;
the judging unit is further configured to continuously judge whether the number of the elevators with the number of the floors where the deactivated user is currently located is more than one when judging that the elevators with the number of the floors where the deactivated user is currently located exist;
the judging unit is further arranged to continuously judge whether the same-direction power-off ladders exist in each power-off ladder in the same direction as the riding direction of the user when judging that the number of the elevators of the current layer of the power-off user is more than one;
the calculating unit is used for calculating waiting time required by each idle elevator and each power-off elevator in the same direction to reach the current layer number of the user when the judging unit judges that the power-off elevator in the same direction as the user takes the elevator exists, so as to obtain a fourth calculating result;
the selection unit is used for respectively selecting the idle state elevator and the same-direction power-off elevator with the shortest waiting time required by the user to reach the current layer number from all the idle state elevators and all the same-direction power-off elevators based on the fourth calculation result;
the judging unit is further configured to judge whether the difference between the waiting time required by the idle-state elevator and the waiting time required by the same-direction power-off elevator selected by the selecting unit to reach the current layer number of the user is smaller than a second preset threshold value; the method comprises the steps of,
and the selection and allocation unit is used for selecting the idle-state elevator with the shortest waiting time required for reaching the current layer number of the user to allocate elevator resources for the user when the judgment unit judges that the number of the layers of the user is smaller than the second preset threshold value.
7. An electronic device, comprising: comprising a memory and a processor, the memory having stored therein a computer program which, when executed by the processor, performs the elevator resource allocation method according to any one of claims 1 to 5.
8. A computer-readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, performs the elevator resource allocation method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010616605.9A CN111768106B (en) | 2020-06-30 | 2020-06-30 | Elevator resource allocation method, system, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010616605.9A CN111768106B (en) | 2020-06-30 | 2020-06-30 | Elevator resource allocation method, system, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111768106A CN111768106A (en) | 2020-10-13 |
| CN111768106B true CN111768106B (en) | 2023-06-16 |
Family
ID=72724307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010616605.9A Active CN111768106B (en) | 2020-06-30 | 2020-06-30 | Elevator resource allocation method, system, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111768106B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112777436B (en) * | 2021-01-28 | 2023-05-05 | 上海有个机器人有限公司 | Robot calling method, device, terminal and storage medium |
| CN116975394B (en) * | 2023-09-22 | 2023-12-19 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107176509A (en) * | 2017-04-20 | 2017-09-19 | 安徽瑞隆机电设备有限公司 | A kind of remote preset elevator position system |
| CN110127467A (en) * | 2019-04-02 | 2019-08-16 | 日立楼宇技术（广州）有限公司 | Elevator control method, device, system and storage medium |
| CN111302171A (en) * | 2020-05-11 | 2020-06-19 | 季华实验室 | Elevator dispatching method, device, electronic equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SG134995A1 (en) * | 2002-11-06 | 2007-09-28 | Inventio Ag | Method of and device for controlling a lift installation with zonal control |
| US9317110B2 (en) * | 2007-05-29 | 2016-04-19 | Cfph, Llc | Game with hand motion control |
-
2020
- 2020-06-30 CN CN202010616605.9A patent/CN111768106B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107176509A (en) * | 2017-04-20 | 2017-09-19 | 安徽瑞隆机电设备有限公司 | A kind of remote preset elevator position system |
| CN110127467A (en) * | 2019-04-02 | 2019-08-16 | 日立楼宇技术（广州）有限公司 | Elevator control method, device, system and storage medium |
| CN111302171A (en) * | 2020-05-11 | 2020-06-19 | 季华实验室 | Elevator dispatching method, device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111768106A (en) | 2020-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10683189B2 (en) | Contextual awareness-based elevator management | |
| CN111768106B (en) | Elevator resource allocation method, system, electronic equipment and storage medium | |
| KR100615351B1 (en) | Server, mobile communication system, positional information managing method, radio base station, mobile station, method for calling in mobile communication system, and mobile communication method | |
| CN112269641B (en) | Scheduling method, scheduling device, electronic equipment and storage medium | |
| CN1042130A (en) | Elevator multiple control device | |
| JP5951421B2 (en) | Elevator group management system | |
| WO2019111359A1 (en) | Group management control device and group management control method | |
| CN111776896B (en) | Elevator dispatching method and device | |
| WO2022206323A1 (en) | Scheduling method and apparatus, and electronic device and storage medium | |
| CN115277598A (en) | Computing resource scheduling method and device and computer readable storage medium | |
| CN117394511A (en) | Elevator standby electricity distribution method and related device | |
| CN114644267B (en) | Group control device and group control method for double-deck elevator | |
| CN114330974A (en) | Robot scheduling method and device, electronic equipment and storage medium | |
| CN114104883A (en) | Central elevator dispatching method and device | |
| CN115495239A (en) | Test resource multiplexing method and device, storage medium and computer equipment | |
| CN113044684B (en) | Delivery device allocation method and device, electronic device and computer readable medium | |
| CN115237548A (en) | Multi-machine cooperation equipment scheduling method and device, electronic equipment and storage medium | |
| CN117185063B (en) | Elevator dispatching method, device, equipment and computer storage medium | |
| JPS6054225B2 (en) | Elevator suspension management device | |
| JPH0114149B2 (en) | ||
| CN111327663A (en) | Bastion machine distribution method and equipment | |
| JP2005231881A (en) | Group management controller for elevator | |
| CN115402888B (en) | Group management control device for elevator and group management control method for elevator | |
| CN112434860B (en) | Traffic connection method, device, computer equipment and storage medium | |
| CN116974762A (en) | Method and system for scheduling and managing server resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |