CN109693978B - Intelligent elevator dispatching method and device, computer equipment and storage medium - Google Patents
Intelligent elevator dispatching method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN109693978B CN109693978B CN201910046998.1A CN201910046998A CN109693978B CN 109693978 B CN109693978 B CN 109693978B CN 201910046998 A CN201910046998 A CN 201910046998A CN 109693978 B CN109693978 B CN 109693978B
- Authority
- CN
- China
- Prior art keywords
- elevator
- floor
- dispatchable
- mode
- request
- 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
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/02—Control systems without regulation, i.e. without retroactive action
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
- B66B1/3415—Control system configuration and the data transmission or communication within the control system
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
- B66B1/3476—Load weighing or car passenger counting devices
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mechanical Engineering (AREA)
- Elevator Control (AREA)
Abstract
The invention discloses an intelligent elevator dispatching method and device, computer equipment and a storage medium. Counting the request times corresponding to the riding requests in real time, and if the request times meet a peak scheduling threshold, taking a first elevator to be scheduled in a peak debugging sequence as a schedulable elevator according to the peak scheduling sequence; if the boarding mode is an ascending mode, determining the lowest current floor as an ascending initial stop floor, stopping the dispatchable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode; acquiring the current load of each dispatchable elevator through a gravity sensor; if the current load reaches the maximum load bearing of the dispatchable elevator, the dispatchable elevator is controlled to run upwards according to the ascending stop list, and the second to-be-dispatched elevator in the peak debugging sequence is updated to be the dispatchable elevator, so that elevator resources are fully utilized, user requirements are fully met, and user experience is improved.
Description
Technical Field
The invention relates to the field of intelligent scheduling, in particular to an intelligent elevator scheduling method, an intelligent elevator scheduling device, computer equipment and a storage medium.
Background
In the rush hour of going to and fro of a commercial office building, as the time of staff is concentrated, when taking an elevator, one elevator is overloaded and other elevators are not carried with passengers, so that the elevator resources are not fully utilized. In addition, in the peak period of work, the number of people taking the elevator is concentrated, the situation that the work is late or delayed due to overlong elevator waiting time can occur, inconvenience is brought to daily travel of staff, time is wasted, and meanwhile the experience degree of the staff is not high.
Disclosure of Invention
The embodiment of the invention provides an intelligent elevator dispatching method, an intelligent elevator dispatching device, computer equipment and a storage medium, and aims to solve the problem that elevator resources cannot be fully utilized.
An intelligent elevator dispatching method comprises the following steps:
obtaining a taking request sent by a client, wherein the taking request comprises a taking mode, a current floor and a target floor;
counting the number of times of requests corresponding to the riding requests in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking a first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence;
if the boarding mode is an ascending mode, determining the lowest current floor as an ascending initial stop floor, stopping the schedulable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode;
acquiring the current load of each schedulable elevator through a gravity sensor;
and if the current load reaches the maximum load bearing capacity of the dispatchable elevator, controlling the dispatchable elevator to run upwards according to an ascending stop list, and updating the second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator.
An elevator intelligent dispatching device comprises:
the system comprises a boarding request acquisition module, a transfer module and a transfer module, wherein the boarding request acquisition module is used for acquiring a boarding request sent by a client, and the boarding request comprises a boarding mode, a current floor and a target floor;
the peak dispatching mode judging module is used for counting the number of times of requests corresponding to the riding requests in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking a first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence;
the ascending mode processing module is used for determining the lowest current floor as an ascending initial stop floor if the boarding mode is an ascending mode, stopping the schedulable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode;
the ascending current load obtaining module is used for obtaining the current load of each schedulable elevator through a gravity sensor;
and the ascending operation processing module is used for controlling the dispatchable elevator to operate upwards according to an ascending stop list and updating a second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator if the current load reaches the maximum load bearing capacity of the dispatchable elevator.
Computer equipment comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the above-mentioned elevator intelligent scheduling method when executing the computer program.
A computer-readable storage medium, which stores a computer program that, when executed by a processor, implements the above-described intelligent elevator dispatching method.
According to the elevator intelligent scheduling method, the elevator intelligent scheduling device, the computer equipment and the storage medium, the request times corresponding to the boarding request are counted in real time, and if the request times meet the preset peak scheduling threshold, the first elevator to be scheduled in the peak scheduling sequence is used as the schedulable elevator according to the peak scheduling sequence. And then determining the lowest current floor in the boarding request with the boarding mode being the ascending mode as an ascending initial stop floor, and stopping the dispatchable elevator at the ascending initial stop floor to meet the boarding conditions of all users in the boarding request. Through obtaining the current load of the dispatchable elevator, whether the dispatchable elevator reaches the maximum bearing capacity or not is judged, if the dispatchable elevator reaches the maximum bearing capacity, the dispatchable elevator does not receive other carrying users at the ascending initial stop floor, and continues to run upwards, so that the running safety of the elevator is ensured. In the ascending process, the floors are stopped in sequence according to the current floor and the target floor in the ascending stop list, and the requirements of carrying users are met. When the dispatchable elevator runs upwards, the server can update the dispatchable elevator with the second elevator to be dispatched in the peak dispatching sequence, so that the requirement is provided for the subsequent carrying user, the elevator resource is fully utilized, the user requirement is fully met, and the user experience is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
Fig. 1 is an application view of an intelligent elevator dispatching method in one embodiment of the present invention;
fig. 2 is a flow chart of an intelligent elevator dispatching method in one embodiment of the invention;
FIG. 3 is a detailed flowchart of FIG. 2 before step S10;
FIG. 4 is a detailed flowchart of FIG. 2 after step S50;
FIG. 5 is a detailed flowchart of FIG. 2 after step S80;
fig. 6 is another flow chart of an intelligent elevator dispatching method according to an embodiment of the invention;
fig. 7 is a schematic view of an intelligent elevator dispatching device in one embodiment of the invention;
FIG. 8 is a schematic diagram of a computer device according to an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
The elevator intelligent scheduling method provided by the embodiment of the invention can be applied to the application environment shown in figure 1, wherein the terminal equipment is communicated with the server through a network. The terminal device may be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices. The server may be implemented as a stand-alone server or as a server cluster consisting of a plurality of servers.
In an embodiment, as shown in fig. 2, an intelligent elevator dispatching method is provided, which is described by taking the server in fig. 1 as an example, and includes the following steps:
s10: and obtaining a taking request sent by the client, wherein the taking request comprises a taking mode, a current floor and a target floor.
Wherein, the taking request refers to a request which is sent by a user through a client and needs to take an elevator. Specifically, when the user needs to take the elevator, the user inputs a required taking mode, the current floor where the user is located and a destination floor to which the user wants to go at the client. The boarding mode in this embodiment refers to an operation mode of an elevator when a user boards the elevator, and includes an ascending mode (i.e., a mode in which the elevator travels upward) and a descending mode (i.e., a mode in which the elevator travels downward). The current floor refers to the floor where the user boards the elevator. The destination floor refers to the floor that the user needs to reach to board the elevator.
S20: and counting the number of times of requests corresponding to the hitching request in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking the first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence.
The peak scheduling threshold refers to a preset value for judging whether the number of times of the riding requests reaches the peak scheduling. Peak dispatching refers to a mode of dispatching elevators to meet peak riding requirements after the number of people riding the elevators reaches a certain number. The peak dispatching sequence is used for storing the dispatching sequence of the elevators in the peak dispatching mode.
Specifically, after obtaining a pickup request sent by a client, a server can count the request times of the pickup request in real time, and if the request times meet a preset peak dispatching threshold, a first elevator to be dispatched in a peak dispatching sequence is taken as a dispatchable elevator according to a pre-stored peak dispatching sequence. Wherein an elevator to be dispatched refers to an elevator stored in a peak dispatching sequence waiting to be dispatched. A dispatchable elevator refers to an elevator that is eligible to be dispatched as an elevator to provide a user with a ride in response to a peak dispatch situation.
The server can autonomously judge under what conditions the elevator is dispatched in a peak dispatching mode by comparing the request times with the peak dispatching threshold value without manual intervention. The operation sequence of each elevator is managed by using the peak dispatching sequence, so that the dispatchable elevators can be sequentially obtained by the server according to actual needs and can be effectively managed, and the dispatching efficiency is improved.
S30: and if the boarding mode is an ascending mode, determining the lowest current floor as an ascending initial stop floor, stopping the dispatchable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode.
Specifically, after the judgment on the number of times of requests and the peak dispatching threshold is completed, when the number of times of requests meets the preset peak dispatching threshold, the server judges an achievement mode corresponding to each obtained boarding request, if the boarding mode is an uplink mode, the lowest current floor in the boarding requests is obtained, and then the lowest current floor is determined as an uplink initial stop floor. It is understood that an ascending initial stop floor refers to the floor at which the dispatchable elevator finally stops in the ascending mode. As described above, the current floors in the boarding request corresponding to the ascending method include floors 1, 3, 4, and 6, and in order to satisfy the boarding conditions of all users in the boarding request, it is necessary to use floor 1, which is the lowest current floor in the boarding request, as the initial ascending stop floor, which is the final stop floor.
After the uplink initial stop floor is determined, the server forms an uplink stop list according to the current floor and the target floor in each received boarding request. The ascending stop list is formed according to the current floor and the target floor corresponding to all ascending modes input by a user and is used for recording the list of the floors to which the schedulable elevator needs to stop when ascending. If the users in the uplink mode comprise a user 1, a user 2 and a user 3, the current floor input by the user 1 is 1 floor, and the target floor is 7 floors; the current floor input by the user 2 is 3 floors, and the target floor is 7 floors; and if the current floor input by the user 3 is the floor 1 and the target floor is the floor 13, the uplink stop lists determined according to the current floor and the target floor corresponding to the uplink mode are the floor 1, the floor 3, the floor 7 and the floor 13. And determining an ascending stop list through the current floor and the target floor corresponding to the ascending mode, so that the elevator in the ascending mode stops at the corresponding floors in sequence according to the ascending stop list, and the actual requirements of the user are met.
S40: and acquiring the current load of each dispatchable elevator through a gravity sensor.
Wherein, the current load refers to the load of the dispatchable elevator at the current moment measured by the gravity sensor. In particular, in order to determine whether a dispatchable elevator is overweight, a gravity sensor is installed in each dispatchable elevator for acquiring the current load of the dispatchable elevator. The gravity sensor can acquire the current load of the dispatchable elevator when the dispatchable elevator stops at each floor in the ascending stop list, and sends the current load to the corresponding server, so that the server can conveniently judge whether the dispatchable elevator is full load according to the current load, and the step S50 needs to be executed.
S50: and if the current load reaches the maximum load bearing capacity of the dispatchable elevator, controlling the dispatchable elevator to run upwards according to the ascending stop list, and updating the second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator.
The maximum load refers to the maximum load value set for the safety of the schedulable elevator. Specifically, if the current load reaches the maximum load bearing capacity of the dispatchable elevator, it indicates that the dispatchable elevator cannot take any more users who board the dispatchable elevator. The server controls the dispatchable elevator to upwards run according to the ascending stop list corresponding to the dispatchable elevator, in the process of upwards running, the other floors except the stop floor corresponding to the ascending stop list do not stop to improve the running efficiency, the second to-be-dispatched elevator in the peak dispatching sequence is updated to the dispatchable elevator, and the steps S20 and S50 are repeatedly executed until the riding request of the user is completed, so that the elevator resources are fully utilized, the user requirements are fully met, and the user experience degree is improved.
And for the steps S10-S50, counting the request times corresponding to the riding requests in real time, and if the request times meet a preset peak dispatching threshold, taking the first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence. And then determining the lowest current floor in the boarding request with the boarding mode being the ascending mode as an ascending initial stop floor, and stopping the dispatchable elevator at the ascending initial stop floor to meet the boarding conditions of all users in the boarding request. The current load of the dispatchable elevator is obtained, whether the dispatchable elevator reaches the maximum load is judged, if the dispatchable elevator reaches the maximum load, the dispatchable elevator does not receive other carrying users at the ascending initial stop floor, and the dispatchable elevator continues to run upwards, so that the running safety of the elevator is guaranteed. In the ascending process, the floors are stopped in sequence according to the current floor and the target floor in the ascending stop list, and the requirements of carrying users are met. When the dispatchable elevator runs upwards, the server can update the dispatchable elevator with the second elevator to be dispatched in the peak dispatching sequence, so that the requirement is provided for the subsequent carrying user, the elevator resource is fully utilized, the user requirement is fully met, and the user experience is improved.
In one embodiment, in step S10, before acquiring the pickup request sent by the client, a peak dispatching sequence needs to be acquired in advance to provide a data source for subsequently acquiring the dispatchable elevator. As shown in fig. 3, the intelligent elevator dispatching method further includes the following steps:
s101: and obtaining elevator historical data corresponding to each elevator number based on the elevator numbers.
Specifically, in order to distinguish the elevators, each elevator is numbered, so that each elevator carries a corresponding elevator number. The server can obtain the elevator historical data corresponding to each elevator number according to the elevator numbers. The historical elevator data refers to the historical elevator data of the running conditions of the elevators stored in the database, and comprises the elevator numbers, the historical stopping floors, the stopping times corresponding to the historical stopping floors and the like. The historical data of the elevator is stored in the database, the historical data of the elevator corresponding to the elevator number can be conveniently obtained according to the elevator number, and the historical data of the elevator can be managed.
S102: and counting the number of floor stops corresponding to each elevator number through elevator historical data.
Wherein the number of floor stops refers to the number of stops corresponding to the elevator stop floor. Specifically, after the elevator numbers are determined, elevator historical data corresponding to each elevator number are obtained from a database through the elevator numbers, and the floor stopping times corresponding to each elevator number are obtained through statistics of the floor stopping times corresponding to each elevator number in the elevator historical data. The more the number of floor stops, the higher the frequency of use of the elevator corresponding to the elevator number, and the less the number of floor stops, the lower the frequency of use of the elevator corresponding to the elevator number. And acquiring the number of floor stops corresponding to each elevator number to provide a data source for the subsequent generation of the peak dispatching sequence.
S103: the elevator numbers are sequentially arranged according to the floor stopping times from more to less, the elevator number with the largest stopping time is used as a first elevator, and the elevator number with the smallest stopping time is used as a last elevator, so that a peak dispatching sequence is formed.
Specifically, after the number of floor stops corresponding to each elevator number is obtained, the elevator numbers are sequentially arranged from most to least according to the number of floor stops, the elevator number with the largest number of stop times is used as the first elevator, and the elevator number with the smallest number of stop times is used as the last elevator, so that a peak dispatching sequence is formed. The peak dispatching sequence is obtained according to elevator historical data formed by the number of a certain elevator taken by a user, and the taking habit of the user taking the elevator is better met.
And S101-S103, counting the floor stop times corresponding to each elevator number according to the elevator historical data corresponding to the elevator number, and determining the sequence of the peak dispatching sequence according to the floor stop times, so that the peak dispatching sequence is more in line with the habit of a user to board the elevator.
In one embodiment, in order to maximize the use of the dispatchable elevator and prolong the service life of the dispatchable elevator, the operation mode of the dispatchable elevator in this embodiment is set to preferentially consider the operation in the same direction according to the current operation mode when the dispatchable elevator does not reach the lowest floor (the topmost floor or the bottommost floor) of the building. The up-going mode is preferably considered when the dispatchable elevator does not reach the topmost floor of the building in the up-going process of the dispatchable elevator. When the dispatchable elevator does not reach the lowest floor of the building in the descending process of the dispatchable elevator, the descending mode is preferentially considered. As shown in fig. 4, after controlling the schedulable elevator to move up according to the ascending stop list at step S50, the elevator intelligent electricity degree method further includes the following steps:
s511: and obtaining the current load of each floor in the ascending stop list according to the ascending stop list, and judging whether a new boarding request is received within a preset time period when the dispatchable elevator reaches the highest target floor of the ascending stop list and the current load is 0.
Specifically, after the dispatchable elevator runs upwards, when the dispatchable elevator reaches each floor recorded in the ascending stop list, the gravity sensor acquires the current load of the dispatchable elevator on the floor and uploads the current load to the server. When the dispatchable elevator reaches the highest target floor of the ascending stop list and the current load of the dispatchable elevator is 0, the dispatchable elevator reaches the highest target floor according to the ascending stop list, and the users of the highest target floor all go out of the elevator at the moment, the dispatchable elevator completes the task of upward operation, so that the server can know the operation condition of the dispatchable elevator in time.
After all the users taking the schedulable elevator are delivered by the schedulable elevator according to the uplink stop list, the server judges whether a new taking request is received within a preset time period or not and determines whether the schedulable elevator continues to run upwards or not. The preset time period in this embodiment refers to a preset time period for deciding whether the dispatchable elevator continues to run upwards.
S512: and if a new boarding request is received, the boarding mode in the new boarding request is an ascending mode, and the current floor in the new boarding request is higher than the highest target floor, updating the current floor and the target floor in the new boarding request to an ascending stop list, and re-executing the control schedulable elevator to run upwards according to the ascending stop list.
Specifically, if a new boarding request is received in a preset time period, whether the boarding mode in the new boarding request is an uplink mode needs to be further judged, if the boarding mode is the uplink mode, whether the current floor in the new boarding request is higher than the highest target floor needs to be further determined, if the current floor in the new boarding request is higher than the highest target floor, the current floor and the target floor in the new boarding request are updated into an uplink stop list, and the step of controlling the dispatchable elevator to run upwards according to the uplink stop list is executed again.
For example, the dispatchable elevator stops at 7 floors according to the highest target floor in the uplink stop list, and in a preset time period of 3S, the server acquires a new boarding request, the boarding mode in the boarding request is an uplink mode, the current floor filled by the user is 9 floors, the target floor is 12 floors, the current floor 9 floor in the new boarding request is higher than the highest target floor 7 floor, and the current floor 9 floor and the target floor 12 floor in the new boarding request are updated to the uplink stop list corresponding to the dispatchable elevator, so that the dispatchable elevator runs upwards according to the uplink stop list again.
S513: and if a new boarding request is not received, the boarding mode in the new boarding request is a downlink mode, or the current floor in the new boarding request is lower than the highest target floor, updating the peak dispatching sequence based on the dispatchable elevator.
Specifically, after the dispatchable elevator completes the stop of each floor according to the ascending stop list, no new boarding request is received within a preset time period; or a new boarding request is received within a preset time period, but the boarding mode in the new boarding request is a downlink mode, or the current floor in the new boarding request is lower than the highest target floor, and the schedulable elevator does not execute the corresponding new boarding request. The server will add the dispatchable elevator to the last in the peak dispatching sequence and update the peak dispatching sequence so that the dispatchable elevator becomes the elevator to be dispatched in the new peak dispatching sequence again. At the same time, the server delegates the new ride request to a schedulable elevator in a new peak scheduling sequence, which completes the new ride request. The elevator taking system has the advantages that the taking request of the user is finished, a good experience effect is brought to the user, and the situation that the elevator is not frequently called up and down to cause the shortening of the service life is also protected.
For example, the dispatchable elevator stops at floor 7 according to the highest destination floor in the up-bound parking list, and the server does not receive a new boarding request within the preset time period 3S; or within a preset time period 3S, acquiring two new boarding requests, wherein the boarding mode in the first new boarding request is a downlink mode, the current floor filled by a user is 12 floors, and the target floor is 9 floors; in another new boarding mode ascending mode in the boarding request, the current floor is 6 floors lower than the highest target floor, and the target floor is 9 floors. Since the boarding mode in the first new boarding request is the descending mode, and the current floor in the second new boarding request is the latest target floor, the dispatchable elevator does not execute the corresponding new boarding request, and the server rejoins the dispatchable elevator into the peak dispatching sequence, which is called the last position in the new peak dispatching sequence. At the same time, the server will delegate the new ride request to a schedulable elevator in the new peak scheduling sequence, and the new ride request is completed by the schedulable elevator in the new peak scheduling sequence.
And step 511-step 513, the schedulable elevator completely finishes the boarding request of the user by enabling the schedulable elevator to run upwards and stop according to the ascending stop list. The schedulable elevator is determined to finish the task of the upward operation by judging that the schedulable elevator reaches the highest target floor of the upward parking list and the current load is 0, so that the server can know the operation condition of the schedulable elevator in time. By judging whether a new boarding request is received within a preset time period or not, whether the boarding mode in the new boarding request is an ascending mode or not and whether the current floor in the new boarding request is higher than the highest target floor or not, whether the dispatchable elevator needs to continuously ascend or not is determined, and the dispatchable elevator can continuously ascend only if the three conditions are met simultaneously, so that the frequent upward and downward running of the dispatchable elevator can be avoided, the usability of the dispatchable elevator is damaged, and the service life of the dispatchable elevator is prolonged.
In one embodiment, as shown in fig. 2, after the first elevator to be dispatched in the peak dispatching sequence is taken as the dispatchable elevator in step S20, the intelligent elevator dispatching method further comprises the following steps:
s60: and if the boarding mode is a downlink mode, determining the highest current floor as a downlink initial stop floor, stopping the dispatchable elevator at the downlink initial stop floor, and determining a downlink stop list based on the current floor and the target floor corresponding to the downlink mode.
Wherein the down initial stop floor refers to a floor at which the dispatchable elevator finally stops in the down mode. The descending stop list is formed according to the current floor and the target floor input by the user and is used for recording the list of the floors to which the dispatchable elevator needs to stop when descending.
Specifically, after the first elevator to be dispatched in the peak dispatching sequence is taken as a dispatchable elevator, if the boarding mode is the downlink mode, the highest current floor is determined as a downlink initial stop floor, the dispatchable elevator is stopped at the downlink initial stop floor, and a downlink stop list is determined based on the current floor and the target floor corresponding to the downlink mode. If the current floors in the boarding request corresponding to the downlink method include 17 floors, 12 floors, 8 floors, and 3 floors, in order to satisfy the boarding conditions of all users in the boarding request, it is necessary to use the current floor 17 that is the highest in the boarding request as the final stop floor, i.e., the initial stop floor for the downlink.
S70: and acquiring the current load of each dispatchable elevator through a gravity sensor.
In particular, in order to determine whether a dispatchable elevator is overweight, a gravity sensor is installed in each dispatchable elevator for acquiring the current load of the dispatchable elevator. The gravity sensor can acquire the current load of the dispatchable elevator when the dispatchable elevator stops at each floor in the downstream stop list, and sends the current load to the corresponding server, so that the server can conveniently judge whether the dispatchable elevator is full load according to the current load, and step S80 needs to be executed.
S80: and if the current load reaches the maximum load bearing capacity of the dispatchable elevator, controlling the dispatchable elevator to run downwards according to the descending stop list, and updating the second elevator to be dispatched in the peak dispatching sequence.
Specifically, if the current load reaches the maximum load bearing capacity of the dispatchable elevator, it indicates that the dispatchable elevator cannot take any more users who board the dispatchable elevator. The server controls the dispatchable elevator to downwards run according to the downlink stop list corresponding to the dispatchable elevator, in the downwards running process of the dispatchable elevator, the dispatchable elevator does not stop at other floors except the stop floor corresponding to the downlink stop list so as to improve the running efficiency, the second elevator to be dispatched in the peak dispatching sequence is updated to the dispatchable elevator, the step S20 and the step S60-the step S80 are repeatedly executed until the riding request of the user is completed, elevator resources are fully utilized, the user requirements are fully met, and the user experience degree is improved.
And S60-S80, determining the highest current floor in the boarding request with the downward boarding mode as a downward initial stop floor, stopping the dispatchable elevator at the downward initial stop floor, and meeting the boarding conditions of all users in the boarding request. The current load of the dispatchable elevator is obtained, whether the dispatchable elevator reaches the maximum load is judged, if the dispatchable elevator reaches the maximum load, the dispatchable elevator does not receive other carrying users at the descending initial stop floor, and the dispatchable elevator continues to run downwards, so that the running safety of the elevator is guaranteed. In the descending process, the floors are stopped in sequence according to the current floor and the target floor in the descending stop list, and the requirements of carrying users are met. When the dispatchable elevator runs downwards, the server updates the dispatchable elevator for the second elevator to be dispatched in the peak dispatching sequence, so as to provide requirements for subsequent embarkation users.
In one embodiment, as shown in fig. 5, after controlling the dispatchable elevator to move downward according to the down stop list in step S80, the intelligent elevator dispatching method further includes the following steps:
s81: and obtaining the current load of each floor in the descending stop list according to the descending stop list, and judging whether a new boarding request is received within a preset time period when the dispatchable elevator reaches the lowest target floor of the descending stop list and the current load is 0.
Specifically, after the dispatchable elevator runs downwards, when the dispatchable elevator reaches each floor recorded in the down stop list, the gravity sensor acquires the current load of the dispatchable elevator on the floor and uploads the current load to the server. When the dispatchable elevator reaches the lowest target floor of the downlink stop list and the current load of the dispatchable elevator is 0, the dispatchable elevator reaches the lowest target floor according to the downlink stop list, and the users of the lowest target floor all go out of the elevator at the moment, the dispatchable elevator completes the task of downward running, so that the server can know the running condition of the dispatchable elevator in time and execute the step of judging whether a new boarding request is received within a preset time period.
S82: and if a new boarding request is received, the boarding mode in the new boarding request is a downlink mode, and the current floor in the new boarding request is lower than the lowest target floor, updating the current floor and the target floor in the new boarding request to a downlink stop list, and re-executing the schedulable elevator to run downwards according to the downlink stop list.
Specifically, if a new pickup request is received in a preset time period, it needs to be further determined whether the pickup manner in the new pickup request is a downlink manner, if the pickup manner is the downlink manner, it needs to be further determined whether the current floor in the new pickup request is lower than the lowest target floor, if the current floor in the new pickup request is lower than the lowest target floor, the current floor and the target floor in the new pickup request are updated to a downlink stop list, and the step of controlling the dispatchable elevator to run downwards according to the downlink stop list is executed again.
For example, the dispatchable elevator stops at 12 floors according to the lowest target floor in the downlink stop list, and in a preset time period of 3S, the server acquires a new boarding request, the boarding mode in the boarding request is a downlink mode, the current floor filled by the user is 7 floors, the target floor is 1 floor, and the current floor 7 floor in the new boarding request is lower than the lowest target floor 12 floor, so that the current floor 7 floor and the target floor 1 floor in the new boarding request are updated to the downlink stop list corresponding to the dispatchable elevator, and the dispatchable elevator runs downwards according to the downlink stop list again.
S83: if no new pickup request is received, the pickup mode in the new pickup request is an ascending mode, or the current floor in the new pickup request is higher than the lowest target floor, the peak dispatching sequence is updated based on the dispatchable elevator.
Specifically, after the dispatchable elevator completes the stop of each floor according to the descending stop list, no new boarding request is received within a preset time period; or a new taking request is received within a preset time period, but the taking mode in the new taking request is an ascending mode, or the current floor in the new taking request is higher than the lowest target floor, the schedulable elevator does not execute the corresponding new taking request. The server will add the dispatchable elevator to the last in the peak dispatching sequence and update the peak dispatching sequence so that the dispatchable elevator becomes the elevator to be dispatched in the new peak dispatching sequence again. At the same time, the server delegates the new ride request to a dispatchable elevator in a new peak dispatching sequence, which completes the new ride request. The elevator taking system has the advantages that taking requests of users are completed, good experience effects are brought to the users, and the situation that the elevator is not frequently called up and down to shorten service life is avoided.
For example, the dispatchable elevator stops at floor 7 according to the lowest destination floor in the down stop list, and the server does not receive a new boarding request within the preset time period 3S; or within a preset time period of 3S, two new taking requests are obtained, the taking mode in the first new taking request is an uplink mode, the current floor filled by the user is 9 floors, and the target floor is 12 floors; in another new riding mode downlink mode in the riding request, the current floor is 8 floors higher than the lowest target floor, and the target floor is 2 floors. Since the boarding mode in the first new boarding request is the up-going mode and the current floor in the second new boarding request is higher than the lowest target floor, the schedulable elevator does not execute the corresponding new boarding request, and the server rejoins the schedulable elevator into the peak scheduling sequence, which is called the last position in the new peak scheduling sequence. At the same time, the server will delegate the new ride request to a schedulable elevator in a new peak scheduling sequence, completing the new ride request by the schedulable elevator in the new peak scheduling sequence.
In one embodiment, in order to prevent the user from arriving late to work or delaying to leave work due to too long waiting time of the elevator, as shown in fig. 6, the intelligent elevator dispatching method further includes the following steps:
s91: and counting the number of times of requests corresponding to the stay floors in the stop list, wherein the stop list comprises an uplink stop list or a downlink stop list.
The stop list is formed according to the current floor and the target floor input by the user and is used for recording the list of the floors to be stopped when the schedulable elevator operates. The docking list in this embodiment includes an uplink docking list or a downlink docking list. The stopping floor refers to a floor which needs to stop in addition to the current floor and the target floor of the user in the ascending or descending process of the schedulable elevator. If the current floors in the boarding requests of users A, B and C are 1 floor, 3 floor and 4 floor, respectively, and the corresponding target floors are 5 floors, 7 floors and 12 floors, the stop floors of user a are 3 floors and 4 floors, the stop floors of user B are 4 floors and 5 floors, and the stop floors of user C are 5 floors and 7 floors.
Specifically, after acquiring the pickup request, the server analyzes the current floor and the target floor in the pickup request, determines a stop floor corresponding to each pickup request, and counts the number of times of requests corresponding to the stop floors. Counting the number of requests for the stop floor facilitates the calculation of the stop time of the stop floor in the subsequent steps according to the number of requests for the stop floor.
S92: and obtaining the stay time based on the corresponding request times and unit stay time of the stay floors.
Wherein, the unit stay time refers to the time for each person to enter or exit the elevator according to the actual situation. Specifically, after obtaining the number of times of requests corresponding to the stop floor, the server multiplies the stop floor determined by each pickup request by the number of times of requests corresponding to the stop floor, and obtains the stop time corresponding to each pickup request. If the unit stay time is set to 1S, the current floors in the boarding requests of the users A, B and C are 1 floor, 3 floors and 4 floors respectively, and the corresponding target floors are 5 floors, 7 floors and 12 floors, the stay floors of the user a are 3 floors and 4 floors, the stay floors of the user B are 4 floors and 5 floors, and the stay floors of the user C are 5 floors and 7 floors. The number of times of the requests of the layer 1 obtained by the server is 3, the number of times of the requests of the layer 3 is 1, the number of times of the requests of the layer 4 is 2, the number of times of the requests of the layer 5 is 4, the number of times of the requests of the layer 7 is 1, and the number of times of the requests of the layer 12 is 2, the residence time of the user a is 2S, the residence time of the user B is 0, the residence time of the user C is 2S, the residence time of the user D is 3S, and the residence time of the user E is 3S. For ease of understanding, the following table shows:
s93: and determining the partition floor based on the current floor and the target floor corresponding to the boarding request, and acquiring the operation time according to the partition floor and the unit operation time.
The separation floor refers to a floor which is separated from the current floor and the target floor in the boarding request. If the current floor is 1 floor and the destination floor is 7 floors, the separation floor in the boarding request is 6 floors. The unit running time refers to the time taken by the elevator to ascend or descend one floor. Specifically, after obtaining the boarding request, the server determines the partition floor based on the current floor and the target floor corresponding to the boarding request, and obtains the operation time according to the partition floor and the unit operation time. If the unit operation time is 0.2S, when the separation floor is 6 floors, the corresponding operation time is 1.2S.
S94: and acquiring the expected arrival time according to the residence time and the running time, and sending the expected arrival time to the client.
Specifically, after the residence time and the running time are obtained, the estimated arrival time can be obtained by adding the residence time and the running time, and the estimated arrival time refers to the time when the server user sends a prompt to the client to remind the user of estimating the arrival at the target floor. If the current floor of the user a is 1 floor, the target floor is 5 floors, the intermediate stopping floors are 3 floors and 4 floors, the number of times of requests corresponding to the 3 floors of stopping floors and the 1 floor of stopping floors is 1, and the partition floor of the user a is 4 floors, the estimated arrival time of the user a is 2.8S, and the specific operation is (1 × 1+1 × 1+4 × 0.2 =2.8s). After the estimated arrival time is obtained, the server sends the estimated arrival time to the client corresponding to the riding request, so that the user can predict the time for waiting for the elevator and the arrival of the elevator, and can better plan the travel time of the user.
For steps S91-S94, the stopping time is obtained by counting the number of times of requests and unit stopping time corresponding to the stopping floor in the stopping list, and then the running time is obtained by determining the interval floor and the unit running time, so that the user can predict the time for waiting for the elevator and the elevator to arrive, and can better plan the own travel time.
In the elevator intelligent scheduling method provided by the embodiment, the number of times of requests corresponding to the hitching request is counted in real time, and if the number of times of requests meets a preset peak scheduling threshold, a first elevator to be scheduled in a peak scheduling sequence is taken as a schedulable elevator according to the peak scheduling sequence. And then determining the lowest current floor in the boarding request with the boarding mode as the ascending initial stop floor, and stopping the dispatchable elevator at the ascending initial stop floor. Or determining the highest current floor in the boarding request with the boarding mode being the downlink mode as the downlink initial stop floor, and stopping the dispatchable elevator at the downlink initial stop floor to meet the boarding conditions of all users in the boarding request. The current load of the dispatchable elevator is obtained, whether the dispatchable elevator reaches the maximum load is judged, if the dispatchable elevator reaches the maximum load, the dispatchable elevator does not receive other carrying users at the ascending initial stop floor or the descending initial stop floor, and the dispatchable elevator continues to run upwards or downwards, so that the running safety of the elevator is guaranteed. In the ascending process, stopping in sequence according to the current floor and the target floor in the ascending stop list; in the descending process, the floors are stopped in sequence according to the current floor and the target floor in the descending stop list, and the requirements of carrying users are met. When the dispatchable elevator runs upwards or downwards, the server can update the dispatchable elevator with the second to-be-dispatched elevator in the peak dispatching sequence, so that the requirement is provided for a subsequent carrying user, elevator resources are fully utilized, the user demand is fully met, and the user experience degree is improved.
In order to solve the problem that the user is late to arrive at work or delayed to leave work due to the fact that the user waits for too long time of the elevator, the intelligent scheduling method of the elevator obtains the stay time by counting the number of times of requests corresponding to the stay floors in the stop list and the unit stay time, then obtains the running time by determining the interval floors and the unit running time, enables the user to predict the time of waiting for the arrival of the elevator and the elevator, and better plans the travel time of the user.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In one embodiment, an intelligent elevator dispatching device is provided, and the intelligent elevator dispatching device corresponds to the intelligent elevator dispatching method in the embodiment one to one. As shown in fig. 7, the intelligent elevator dispatching device includes a boarding request acquiring module 10, a peak dispatching mode determining module 20, an uplink mode processing module 30, an uplink current load acquiring module 40, an uplink operation processing module 50, a downlink mode processing module 60, a downlink current load acquiring module 70, and a downlink operation processing module 80. The functional modules are explained in detail as follows:
the pickup request obtaining module 10 is configured to obtain a pickup request sent by a client, where the pickup request includes a pickup mode, a current floor, and a target floor.
And the peak dispatching mode judging module 20 is used for counting the number of times of requests corresponding to the riding requests in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking the first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence.
And the ascending mode processing module 30 is configured to determine the lowest current floor as an ascending initial stop floor if the boarding mode is an ascending mode, stop the schedulable elevator at the ascending initial stop floor, and determine an ascending stop list based on the current floor and the target floor corresponding to the ascending mode.
And the ascending current load acquiring module 40 is used for acquiring the current load of each dispatchable elevator through a gravity sensor.
And the uplink operation processing module 50 is used for controlling the dispatchable elevator to operate upwards according to the uplink stop list if the current load reaches the maximum load bearing of the dispatchable elevator, and updating the second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator.
Further, before the boarding request obtaining module 10, the intelligent elevator dispatching device further comprises an elevator history data obtaining unit, a floor stop number counting unit and a peak dispatching sequence obtaining unit.
And the elevator history data acquisition unit is used for acquiring the elevator history data corresponding to each elevator number based on the elevator numbers.
And the floor stopping times counting unit is used for counting the floor stopping times corresponding to each elevator number through the elevator historical data.
And the peak dispatching sequence acquisition unit is used for sequentially arranging the elevator numbers according to the floor stop times from most to least, taking the elevator number with the most stop times as a first elevator, and taking the elevator number with the least stop times as a last elevator to form a peak dispatching sequence.
Further, after the processing module 50 is operated in the uplink, the intelligent elevator dispatching device further includes a new boarding request acquisition unit, a first processing unit for an uplink new boarding request, and a second processing unit for an uplink new boarding request.
And the ascending new boarding request acquisition unit is used for acquiring the current load of each floor in the ascending stop list according to the ascending stop list, and judging whether a new boarding request is received within a preset time period when the schedulable elevator reaches the highest target floor of the ascending stop list and the current load is 0.
And the ascending new taking request first processing unit is used for updating the current floor and the target floor in the new taking request to an ascending stop list and re-executing control to schedule the elevator to run upwards according to the ascending stop list if the new taking request is received, the taking mode in the new taking request is an ascending mode, and the current floor in the new taking request is higher than the highest target floor.
And the ascending new taking request second processing unit is used for updating the peak dispatching sequence based on the dispatchable elevator if a new taking request is not received, the taking mode in the new taking request is a descending mode, or the current floor in the new taking request is lower than the highest target floor.
Further, after the uplink operation processing module 50, the elevator intelligent dispatching device further includes a downlink mode processing module 60, a downlink current load obtaining module 70 and a downlink operation processing module 80.
And the descending mode processing module 60 is configured to, if the boarding mode is a descending mode, determine the highest current floor as a descending initial stop floor, stop the dispatchable elevator at the descending initial stop floor, and determine a descending stop list based on the current floor and the target floor corresponding to the descending mode.
And a descending current load acquiring module 70 for acquiring the current load of each dispatchable elevator through a gravity sensor.
And the downlink operation processing module 80 is used for controlling the dispatchable elevator to operate downwards according to the downlink stop list if the current load reaches the maximum load bearing capacity of the dispatchable elevator, and updating the second elevator to be dispatched in the peak dispatching sequence.
Further, after the downlink operation processing module 80, the intelligent elevator dispatching device further includes a downlink new boarding request obtaining unit, a downlink new boarding request first processing unit, and a downlink new boarding request second processing unit.
And the downlink new taking request acquisition unit is used for acquiring the current load of each floor in the downlink stop list according to the downlink stop list, and judging whether a new taking request is received within a preset time period or not when the schedulable elevator reaches the lowest target floor of the downlink stop list and the current load is 0.
And the first processing unit of the descending new taking request is used for updating the current floor and the target floor in the new taking request to a descending stop list and re-executing control to dispatch the elevator to run downwards according to the descending stop list if a new taking request is received, the taking mode in the new taking request is a descending mode, and the current floor in the new taking request is lower than the lowest target floor.
And the second processing unit of the downlink new taking request is used for updating the peak dispatching sequence based on the dispatchable elevator if a new taking request is not received, the taking mode in the new taking request is an uplink mode, or the current floor in the new taking request is higher than the lowest target floor.
Further, the intelligent elevator dispatching device also comprises a request number obtaining unit, a stay time obtaining unit, a running time obtaining unit and a predicted arrival time obtaining unit.
And the request frequency acquiring unit is used for counting the request frequency corresponding to the stop floor in the stop list, and the stop list comprises an uplink stop list or a downlink stop list.
And the stay time acquisition unit is used for acquiring the stay time based on the corresponding request times and unit stay time of the stay floors.
And the running time acquisition unit is used for determining the partition floor based on the current floor and the target floor corresponding to the boarding request and acquiring the running time according to the partition floor and the unit running time.
And the estimated arrival time acquisition unit is used for acquiring the estimated arrival time according to the stay time and the running time and sending the estimated arrival time to the client.
For the specific definition of the intelligent elevator dispatching device, reference may be made to the above definition of the intelligent elevator dispatching method, which is not described herein again. The modules in the intelligent elevator dispatching device can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent of a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, and the internal structure thereof may be as shown in fig. 8. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operating system and the computer program to run on the non-volatile storage medium. The database of the computer device is used for storing data involved in the intelligent elevator dispatching method. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement an intelligent elevator dispatching method.
In one embodiment, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the steps S10 to S80 shown in fig. 2 or the steps shown in fig. 3 to 6 are implemented. Alternatively, the processor implements the steps of the elevator intelligent scheduling device when executing the computer program, such as the boarding request acquisition module 10, the peak scheduling mode determination module 20, the uplink mode processing module 30, the uplink current load acquisition module 40, the uplink operation processing module 50, the downlink mode processing module 60, the downlink current load acquisition module 70, and the downlink operation processing module 80 shown in fig. 7. To avoid repetition, further description is omitted.
In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the steps S10-S80 as shown in fig. 2, or the steps shown in fig. 3-6. Alternatively, the computer program is implemented when executed by a processor, such as the boarding request acquisition module 10, the peak scheduling mode determination module 20, the uplink mode processing module 30, the uplink current load acquisition module 40, the uplink operation processing module 50, the downlink mode processing module 60, the downlink current load acquisition module 70, and the downlink operation processing module 80 shown in fig. 7. To avoid repetition, further description is omitted.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct Rambus Dynamic RAM (DRDRAM), and Rambus Dynamic RAM (RDRAM), among others.
It should be clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional units and modules is only used for illustration, and in practical applications, the above function distribution may be performed by different functional units and modules as needed, that is, the internal structure of the apparatus may be divided into different functional units or modules to perform all or part of the above described functions.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (9)
1. An intelligent elevator dispatching method is characterized by comprising the following steps:
obtaining a taking request sent by a client, wherein the taking request comprises a taking mode, a current floor and a target floor;
counting the number of times of requests corresponding to the riding requests in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking a first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence;
if the boarding mode is an ascending mode, determining the lowest current floor as an ascending initial stop floor, stopping the schedulable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode;
acquiring the current load of each schedulable elevator through a gravity sensor;
if the current load reaches the maximum load bearing capacity of the dispatchable elevator, controlling the dispatchable elevator to run upwards according to an uplink stop list, and updating a second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator;
obtaining the current load of each floor in the uplink stop list according to the uplink stop list, and judging whether a new ride request is received within a preset time period when the dispatchable elevator reaches the highest target floor of the uplink stop list and the current load is 0;
if the new taking request is received, the taking mode in the new taking request is an uplink mode, and the current floor in the new taking request is higher than the highest target floor, updating the current floor and the target floor in the new taking request to the uplink stop list, and re-controlling the schedulable elevator to run upwards according to the uplink stop list;
if the new ride request is not received, the ride mode in the new ride request is a downlink mode, or the current floor in the new ride request is lower than the highest destination floor, updating the peak dispatch sequence based on the dispatchable elevator.
2. The intelligent elevator dispatching method of claim 1, wherein prior to obtaining the pick-up request sent by the client, the intelligent elevator dispatching method further comprises:
acquiring elevator historical data corresponding to each elevator number based on the elevator numbers;
counting the number of floor stops corresponding to each elevator number according to the historical elevator data;
and arranging the elevator numbers in sequence from most to least according to the floor stop times, taking the elevator number with the most stop times as a first elevator, and taking the elevator number with the least stop times as a last elevator to form a peak dispatching sequence.
3. The intelligent elevator dispatching method according to claim 1, wherein after said treating the first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator, the intelligent elevator dispatching method further comprises:
if the boarding mode is a downlink mode, determining the highest current floor as a downlink initial stop floor, stopping the schedulable elevator at the downlink initial stop floor, and determining a downlink stop list based on the current floor and the target floor corresponding to the downlink mode;
acquiring the current load of each schedulable elevator through a gravity sensor;
and if the current load reaches the maximum load bearing capacity of the dispatchable elevator, controlling the dispatchable elevator to run downwards according to a downlink stop list, and updating the second elevator to be dispatched in the peak dispatching sequence to be the dispatchable elevator.
4. The intelligent elevator dispatching method according to claim 3, wherein after controlling the dispatchable elevator to move downward according to a down stop list, further comprising:
according to the downlink parking list, the current load of each floor in the downlink parking list is obtained, and when the dispatchable elevator reaches the lowest target floor of the downlink parking list and the current load is 0, whether a new boarding request is received within a preset time period is judged;
if the new boarding request is received, the boarding mode in the new boarding request is a downlink mode, and the current floor in the new boarding request is lower than the lowest target floor, updating the current floor and the target floor in the new boarding request to the downlink stop list, and re-controlling the dispatchable elevator to run downwards according to the downlink stop list;
and if the new boarding request is not received, the boarding mode in the new boarding request is an uplink mode, or the current floor in the new boarding request is higher than the lowest target floor, updating the peak dispatching sequence based on the dispatchable elevator.
5. The intelligent elevator dispatching method according to claim 1 or 3, wherein the intelligent elevator dispatching method further comprises:
counting the number of times of requests corresponding to the stay floors in a stop list, wherein the stop list comprises an uplink stop list or a downlink stop list;
acquiring the stay time based on the corresponding request times and unit stay time of the stay floors;
determining an interval floor based on the current floor and the target floor corresponding to the boarding request, and acquiring operation time according to the interval floor and unit operation time;
and acquiring the estimated arrival time according to the residence time and the running time, and sending the estimated arrival time to the client.
6. An elevator intelligent dispatching device, characterized by comprising:
the system comprises a boarding request acquisition module, a transfer module and a transfer module, wherein the boarding request acquisition module is used for acquiring a boarding request sent by a client, and the boarding request comprises a boarding mode, a current floor and a target floor;
the peak dispatching mode judging module is used for counting the number of times of requests corresponding to the riding requests in real time, and if the number of times of requests meets a preset peak dispatching threshold, taking a first elevator to be dispatched in the peak dispatching sequence as a dispatchable elevator according to the peak dispatching sequence;
the ascending mode processing module is used for determining the lowest current floor as an ascending initial stop floor if the boarding mode is an ascending mode, stopping the schedulable elevator at the ascending initial stop floor, and determining an ascending stop list based on the current floor and the target floor corresponding to the ascending mode;
the ascending current load obtaining module is used for obtaining the current load of each schedulable elevator through a gravity sensor;
the ascending operation processing module is used for controlling the dispatchable elevator to run upwards according to an ascending stop list if the current load reaches the maximum load bearing of the dispatchable elevator, and updating a second elevator to be dispatched in the peak dispatching sequence into the dispatchable elevator;
an uplink new boarding request acquisition unit, configured to acquire a current load of each floor in the uplink stop list according to the uplink stop list, and when the dispatchable elevator reaches a highest target floor of the uplink stop list and the current load is 0, determine whether a new boarding request is received within a preset time period;
the first uplink new boarding request processing unit is used for updating the current floor and the target floor in the new boarding request to the uplink stop list and re-executing the control of the dispatchable elevator to run upwards according to the uplink stop list if the new boarding request is received, the boarding mode in the new boarding request is the uplink mode, and the current floor in the new boarding request is higher than the highest target floor;
and the second processing unit of the ascending new boarding request is used for updating the peak scheduling sequence based on the schedulable elevator if the new boarding request is not received, the boarding mode in the new boarding request is a descending mode, or the current floor in the new boarding request is lower than the highest target floor.
7. The intelligent elevator dispatching device of claim 6, further comprising:
the descending mode processing module is used for determining the highest current floor as a descending initial stop floor if the boarding mode is a descending mode, stopping the schedulable elevator at the descending initial stop floor, and determining a descending stop list based on the current floor and the target floor corresponding to the descending mode;
the descending current load obtaining module is used for obtaining the current load of each schedulable elevator through a gravity sensor;
and the downlink operation processing module is used for controlling the dispatchable elevator to operate downwards according to a downlink stop list if the current load reaches the maximum load bearing of the dispatchable elevator, and updating a second elevator to be dispatched in the peak dispatching sequence to be a dispatchable elevator.
8. Computer arrangement comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor when executing the computer program carries out the steps of the intelligent elevator scheduling method according to any one of claims 1 to 5.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the intelligent elevator scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910046998.1A CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910046998.1A CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109693978A CN109693978A (en) | 2019-04-30 |
CN109693978B true CN109693978B (en) | 2023-04-18 |
Family
ID=66234049
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910046998.1A Active CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109693978B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110817621A (en) * | 2019-11-14 | 2020-02-21 | 深圳市万物云科技有限公司 | Building passenger lift peak dispatching method, device, computer equipment and storage medium |
CN112537704B (en) * | 2020-03-31 | 2022-10-25 | 深圳优地科技有限公司 | Robot elevator taking scheduling method, terminal and computer readable storage medium |
CN113307112B (en) * | 2021-05-26 | 2022-07-12 | 菱王电梯有限公司 | Intelligent building management method, system and computer readable storage medium |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0312730B1 (en) * | 1987-10-20 | 1991-10-23 | Inventio Ag | Group control for lifts with load dependant control of the cabins |
US4782921A (en) * | 1988-03-16 | 1988-11-08 | Westinghouse Electric Corp. | Coincident call optimization in an elevator dispatching system |
JPH08119545A (en) * | 1994-10-28 | 1996-05-14 | Hitachi Ltd | Group supervisory operation control system for elevator |
CN1136528A (en) * | 1995-03-09 | 1996-11-27 | 奥蒂斯电梯公司 | Remote control combined device for lift system |
JPH0912239A (en) * | 1995-06-28 | 1997-01-14 | Hitachi Ltd | Group control device of elevator |
KR100253900B1 (en) * | 1996-10-29 | 2000-04-15 | 다니구찌 이찌로오 | Control device for elevators |
JP4189013B2 (en) * | 2006-10-16 | 2008-12-03 | 株式会社エレベータ研究所 | Elevator control device |
CN106167205B (en) * | 2016-04-05 | 2019-02-12 | 北京小米移动软件有限公司 | Control method, control device, operation method and the intelligent elevator of intelligent elevator |
CN108483152A (en) * | 2018-04-10 | 2018-09-04 | 深圳市零度智控科技有限公司 | Preengage boarding system, implementation method and background server, storage medium |
CN109205407B (en) * | 2018-11-09 | 2022-05-13 | 京东方科技集团股份有限公司 | Elevator riding realization method, terminal and storage medium |
-
2019
- 2019-01-18 CN CN201910046998.1A patent/CN109693978B/en active Active
Also Published As
Publication number | Publication date |
---|---|
CN109693978A (en) | 2019-04-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109693978B (en) | Intelligent elevator dispatching method and device, computer equipment and storage medium | |
CN109205415B (en) | Elevator group control method and device, computer equipment and storage medium | |
KR102548844B1 (en) | Reassignment of elevators for mobile device users | |
CN110723609B (en) | Elevator control method, device, system, computer equipment and storage medium | |
CN110482342B (en) | Robot-based elevator calling method and related equipment | |
CN106744089B (en) | Elevator control method and device | |
WO2004043840A2 (en) | Method for controlling an elevator system and controller for an elevator system | |
CN111377311A (en) | Elevator group control mode intelligent scheduling method and system | |
CN110606414B (en) | Robot elevator taking method and device, computer equipment and storage medium | |
CN114014110B (en) | Elevator operation control method, system, computer device and storage medium | |
CN113830633B (en) | Dispatching system and method for high peak elevator operation | |
EP3106414A1 (en) | User-controlled elevator allocation | |
CN113642959B (en) | Method and device for distributing object distribution tasks, computer equipment and storage medium | |
CN114538224A (en) | Elevator taking expecting method, device, system, robot and medium | |
CN110114292B (en) | Elevator management system and elevator management method | |
CN103677959A (en) | Virtual machine cluster migration method and system based on multicast | |
CN109205414B (en) | High-rise building elevator calling ladder scheduling method and device | |
CN112429607A (en) | Elevator control system, method, apparatus, computer device and storage medium | |
CN114644267B (en) | Group control device and group control method for double-deck elevator | |
CN116354199A (en) | Elevator calling device based on voice interaction and calling control method | |
CN115783915A (en) | Control method, system, equipment and storage medium of building equipment | |
CN113902177A (en) | Task allocation method and system | |
CN114282749A (en) | Robot scheduling method, device, system, electronic equipment and storage medium | |
CN111924673A (en) | Linkage elevator scheduling method, system, computer equipment and storage medium | |
EP3643664A1 (en) | Elevator service request using user device |
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 |