CN116443679A - Elevator dispatching method, device, equipment and storage medium - Google Patents
Elevator dispatching method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN116443679A CN116443679A CN202310355976.XA CN202310355976A CN116443679A CN 116443679 A CN116443679 A CN 116443679A CN 202310355976 A CN202310355976 A CN 202310355976A CN 116443679 A CN116443679 A CN 116443679A
- Authority
- CN
- China
- Prior art keywords
- elevator
- waiting
- dispatching
- priority
- determining
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000004590 computer program Methods 0.000 claims description 12
- 230000001174 ascending effect Effects 0.000 claims description 11
- 230000015654 memory Effects 0.000 claims description 7
- 230000000694 effects Effects 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000004044 response Effects 0.000 description 3
- 230000001960 triggered effect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 206010027336 Menstruation delayed Diseases 0.000 description 1
- 238000013527 convolutional neural network Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
- B66B1/06—Control systems without regulation, i.e. without retroactive action electric
-
- 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
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/216—Energy consumption
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/222—Taking into account the number of passengers present in the elevator car to be allocated
-
- 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)
- Elevator Control (AREA)
Abstract
The embodiment of the application discloses an elevator dispatching method, an elevator dispatching device, elevator dispatching equipment and an elevator dispatching storage medium, and belongs to the technical field of computers. The method comprises the following steps: after receiving an elevator dispatching request for a first floor, the computer equipment determines the current position of each person waiting for taking an elevator in the first floor; determining a waiting person number located in a waiting area of each elevator based on a current position of each person waiting to take the elevator; determining a scheduling priority of each elevator based on the number of people waiting in each waiting area; according to the dispatch priority of each elevator, the elevator with dispatch available capacity meeting the transportation condition is parked at the first floor, wherein the available capacity refers to the number of people currently available to take the elevator. The method ensures the intelligence of elevator dispatching, reduces the occurrence probability that the user cannot get away from the elevator because the parked elevator is far away from the user, has better dispatching effect, further improves the efficiency of the user for taking the elevator, and optimizes the elevator taking experience of the user.
Description
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to an elevator dispatching method, device, equipment and storage medium.
Background
Elevators are currently an important tool for users to go up and down a floor, and after a user triggers a dispatch button for dispatching an elevator at any floor, the user stops at that floor. Currently, when dispatching elevators, elevator dispatching systems generally dispatch either an idle elevator or an elevator with minimal power consumption to the floor for stopping. However, this scheduling method has a problem that the user cannot get the same as the elevator, because the stopped elevator is far away from the user, and the scheduling effect is poor.
Disclosure of Invention
The embodiment of the application provides an elevator dispatching method, device, equipment and storage medium, the method ensures the intelligence of elevator dispatching, reduces the occurrence probability that a user cannot get away from the elevator because the parked elevator is far away from the user, has a better dispatching effect, further improves the efficiency of taking the elevator by the user, and optimizes the elevator taking experience of the user. The technical scheme is as follows:
in one aspect, there is provided an elevator scheduling method, the method comprising:
after receiving an elevator dispatching request for a first floor, determining a current position of each person waiting for taking an elevator in the first floor;
determining a waiting person number located in a waiting area of each elevator based on a current position of each person waiting to take the elevator;
Determining a scheduling priority of each elevator based on the number of people waiting in each waiting area;
and according to the dispatching priority of each elevator, dispatching the elevator with the available capacity meeting the transportation condition to stop at the first floor, wherein the available capacity refers to the number of people currently taking the elevator.
In one possible implementation, the elevator dispatch request includes at least one of an up elevator dispatch request or a down elevator dispatch request;
the method for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area comprises the following steps:
determining an uplink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the uplink elevator dispatch request;
determining a downlink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the downlink elevator dispatch request;
determining a comprehensive dispatching priority of each elevator based on the number of waiting people in a waiting area of each elevator under the condition that the elevator dispatching request comprises the uplink elevator dispatching request and the downlink elevator dispatching request; and determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator.
In a possible implementation manner, the first proportion includes an estimated proportion corresponding to uplink scheduling and an estimated proportion corresponding to downlink scheduling;
the determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator comprises the following steps:
determining the product of the estimated proportion corresponding to the uplink scheduling and the comprehensive scheduling priority of each elevator as the uplink scheduling priority of each elevator;
and determining the product of the estimated proportion corresponding to the downlink scheduling and the comprehensive scheduling priority of each elevator as the downlink scheduling priority of each elevator.
In one possible implementation, the method further includes:
acquiring a first corresponding relation between an elevator operation time period and an uplink and downlink scheduling proportion;
and determining uplink and downlink scheduling proportion corresponding to a time period to which the current moment belongs in the first corresponding relation to obtain the first proportion.
In one possible implementation, the elevator dispatching request includes an uplink elevator dispatching request and a downlink elevator dispatching request, and the dispatching priority includes an uplink dispatching priority and a downlink dispatching priority;
According to the dispatching priority of each elevator, the elevator with dispatching available capacity meeting the transportation condition stops at the first floor, and the method comprises the following steps:
according to the second proportion, determining the number of pedestrians and the number of descending people in the waiting people waiting for taking the elevator;
according to the ascending dispatching priority from high to low, dispatching the elevators with the available capacity not lower than the pedestrian number to stop at the first floor;
and dispatching the elevators with the available capacity not lower than the number of pedestrians to stop at the first floor according to the descending dispatching priority from high to low.
In one possible implementation, the second proportion includes an estimated proportion corresponding to the number of pedestrians above and an estimated proportion corresponding to the number of pedestrians below;
the step of determining the number of pedestrians and the number of pedestrians in the waiting number of the waiting elevator according to the second proportion comprises the following steps:
determining the product of the estimated proportion of the number of waiting persons waiting for taking the elevator and the number of pedestrians as the number of upward persons;
and determining the product of the estimated ratio of the number of waiting persons waiting for taking the elevator to the number of descending persons as the number of descending persons.
In one possible implementation, the method further includes:
Acquiring a second corresponding relation between the running time period of the elevator and the ratio of the number of pedestrians on the elevator to the number of pedestrians on the elevator;
and in the second corresponding relation, determining the ratio of the number of pedestrians to the number of pedestrians corresponding to the time period to which the current moment belongs, and obtaining the second ratio.
In one possible implementation, the waiting area of the elevator comprises a plurality of;
the method for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area comprises the following steps:
acquiring initial weights of each waiting area in a plurality of waiting areas of each elevator;
for each elevator, determining the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area as the area priority of each waiting area in the elevator;
and determining the sum of the zone priorities of each waiting zone in the elevator as the dispatching priority of the elevator.
In another aspect, there is provided an elevator dispatching apparatus, the apparatus comprising:
the system comprises a position determining module, a first elevator dispatching module and a second elevator dispatching module, wherein the position determining module is used for determining the current position of each person waiting for taking an elevator in a first floor after receiving an elevator dispatching request aiming at the first floor;
the system comprises a people number determining module, a people number detecting module and a people number detecting module, wherein the people number determining module is used for determining the number of waiting people in a waiting area of each elevator based on the current position of each person waiting for taking the elevator;
The priority determining module is used for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area;
and the dispatching module is used for dispatching the elevators with the available capacity meeting the transportation conditions to stop at the first floor according to the dispatching priority of each elevator, wherein the available capacity refers to the number of people currently taking the elevator.
In one possible implementation, the elevator dispatch request includes at least one of an up elevator dispatch request or a down elevator dispatch request;
the priority determining module is configured to:
determining an uplink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the uplink elevator dispatch request;
determining a downlink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the downlink elevator dispatch request;
determining a comprehensive dispatching priority of each elevator based on the number of waiting people in a waiting area of each elevator under the condition that the elevator dispatching request comprises the uplink elevator dispatching request and the downlink elevator dispatching request; and determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator.
In a possible implementation manner, the first proportion includes an estimated proportion corresponding to uplink scheduling and an estimated proportion corresponding to downlink scheduling;
the priority determining module is configured to:
determining the product of the estimated proportion corresponding to the uplink scheduling and the comprehensive scheduling priority of each elevator as the uplink scheduling priority of each elevator;
and determining the product of the estimated proportion corresponding to the downlink scheduling and the comprehensive scheduling priority of each elevator as the downlink scheduling priority of each elevator.
In one possible implementation, the apparatus further includes:
the acquisition module is used for acquiring a first corresponding relation between the elevator operation time period and the uplink and downlink scheduling proportion;
and the proportion determining module is used for determining uplink and downlink scheduling proportions corresponding to the time period to which the current moment belongs in the first corresponding relation to obtain the first proportion.
In one possible implementation, the elevator dispatching request includes an uplink elevator dispatching request and a downlink elevator dispatching request, and the dispatching priority includes an uplink dispatching priority and a downlink dispatching priority;
the scheduling module is used for:
according to the second proportion, determining the number of pedestrians and the number of descending people in the waiting people waiting for taking the elevator;
According to the ascending dispatching priority from high to low, dispatching the elevators with the available capacity not lower than the pedestrian number to stop at the first floor;
and dispatching the elevators with the available capacity not lower than the number of pedestrians to stop at the first floor according to the descending dispatching priority from high to low.
In one possible implementation, the second proportion includes an estimated proportion corresponding to the number of pedestrians above and an estimated proportion corresponding to the number of pedestrians below;
the scheduling module is used for:
determining the product of the estimated proportion of the number of waiting persons waiting for taking the elevator and the number of pedestrians as the number of upward persons;
and determining the product of the estimated ratio of the number of waiting persons waiting for taking the elevator to the number of descending persons as the number of descending persons.
In one possible implementation, the apparatus further includes:
the acquisition module is used for acquiring a second corresponding relation between the elevator running time period and the ratio of the number of pedestrians on the elevator to the number of pedestrians on the elevator;
and the proportion determining module is used for determining the proportion of the number of pedestrians, corresponding to the time period to which the current moment belongs, in the second corresponding relation to obtain the second proportion.
In one possible implementation, the waiting area of the elevator comprises a plurality of;
The priority determining module is configured to:
acquiring initial weights of each waiting area in a plurality of waiting areas of each elevator;
for each elevator, determining the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area as the area priority of each waiting area in the elevator;
and determining the sum of the zone priorities of each waiting zone in the elevator as the dispatching priority of the elevator.
In another aspect, a computer device is provided that includes a processor and a memory having at least one computer program stored therein, the at least one computer program being loaded and executed by the processor to implement the operations performed by the elevator dispatching method as described in the above aspects.
In another aspect, there is provided a computer readable storage medium having stored therein at least one computer program loaded and executed by a processor to implement the operations performed by the elevator dispatching method of the above aspect.
In yet another aspect, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the operations performed by the elevator dispatching method as described in the above aspect.
The utility model provides a new elevator dispatch scheme, this scheme can confirm the dispatch priority of elevator according to the number of people in the waiting area of different elevators in the floor, and then can dispatch the elevator that waits for the personnel quantity as far as possible and stop at this floor for waiting to take the elevator nearby. In other words, the method ensures the intelligence of elevator dispatching, reduces the occurrence probability that the user gets short of the elevator because the parked elevator is far away from the user, has better dispatching effect, further improves the efficiency of the user for taking the elevator, and optimizes the elevator taking experience of the user.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of an elevator dispatching method provided in an embodiment of the present application, which relates to an implementation environment;
fig. 2 is a flowchart of an elevator dispatching method provided in an embodiment of the present application;
Fig. 3 is a flow chart of another elevator dispatching method provided by an embodiment of the present application;
FIG. 4 is a schematic diagram of a waiting area provided by an embodiment of the present application;
fig. 5 is a schematic structural view of an elevator dispatching apparatus provided in an embodiment of the present application;
fig. 6 is a schematic structural view of another elevator dispatching apparatus provided in an embodiment of the present application;
fig. 7 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
The terms "first," "second," "third," "fourth," and the like as used herein may be used to describe various concepts, but are not limited by these terms unless otherwise specified. These terms are only used to distinguish one concept from another. For example, a first ratio may be referred to as a second ratio, and similarly, a second ratio may be referred to as a first ratio, without departing from the scope of the present application.
The terms "at least one," "a plurality," "each," "any one," as used herein, include one, two or more, a plurality includes two or more, and each refers to each of a corresponding plurality, any one referring to any one of the plurality. For example, the plurality of waiting areas includes 3 waiting areas, and each refers to each of the 3 waiting areas, and any one refers to any one of the 3 waiting areas, such as the first waiting area, or the second waiting area, or the third waiting area.
It should be noted that, the information and the corresponding relation related to the application are authorized by the user or fully authorized by each party, and the collection, the use and the processing of the related data need to comply with the related laws and regulations and standards of the related country and region.
The elevator dispatching method provided by the embodiment of the application can be executed by computer equipment. Optionally, the computer device is a terminal or a server. The terminal is any type of terminal such as an intelligent mobile phone, a desktop computer, an intelligent wearable device or an image acquisition device. The server is a server, or a server cluster formed by a plurality of servers, or a cloud computing service center.
In one possible implementation, the computer device is provided as a terminal and a server. Fig. 1 is a schematic diagram of an implementation environment related to an elevator dispatching method provided in an embodiment of the present application. Referring to fig. 1, the implementation environment includes a terminal 101 and a server 102. The terminal 101 and the server 102 are connected by a wireless or wired network. Illustratively, the terminal 101 is an internet of things device for collecting images of floors, and the server 102 is an elevator dispatching system for dispatching elevators to stop at the corresponding floors.
Illustratively, the terminal 101 is responsible for acquiring images of a first floor in real time, the server 102 receives images sent by the terminal 101 to the server 102 in response to receiving an elevator dispatch request for the first floor, and determines the current location of each person waiting to take an elevator in the first floor based on the images; then, determining the number of waiting persons in the waiting area of each elevator based on the current position of each person waiting to take the elevator; determining a scheduling priority of each elevator based on the number of people waiting in each waiting area; finally, the elevator whose dispatch availability meets the transport conditions is parked at the first floor according to the dispatch priority of each elevator.
In other words, the internet of things device is used for collecting images, the collected images are sent to the elevator dispatching system, the elevator dispatching system stores the collected images, the current position of each person taking the elevator is obtained according to the collected images, and then the elevator is dispatched to be parked on the first floor based on the current position of each person.
Optionally, the elevator dispatching system includes a memory area and a buffer area, after the elevator dispatching system receives the images collected by the internet of things device, the received images are stored in the memory area, and when the elevator dispatching is performed, the received images are dispatched to the buffer area, then the images stored in the buffer area are identified, so that the current position of each person taking the elevator is obtained, and then the elevator is dispatched to be parked at the first floor based on the current position of each person.
Fig. 2 is a flowchart of an elevator dispatching method provided in an embodiment of the present application. The method is performed by a computer device, such as by an elevator dispatching system, as shown in fig. 2, the method comprising:
201. upon receiving an elevator dispatch request for a first floor, a computer device determines a current location of each person waiting to ride an elevator in the first floor.
Wherein the elevator dispatch request is for dispatching an elevator for the first floor. The current location of a person refers to the location of the person in the first floor.
In this embodiment of the present application, if a person located on the first floor needs to go upstairs or downstairs with an elevator, an elevator dispatching request is triggered and generated by triggering an up button or a down button of the elevator, and after receiving the elevator dispatching request, the computer device performs an elevator dispatching operation described below.
202. The computer device determines the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to ride the elevator.
The waiting area of an elevator refers to the area where the person waiting for taking the elevator is located, and it is also understood that the person located in the waiting area of the elevator needs to carry the elevator. The waiting area of the elevator is illustratively preset, and the waiting area of the elevator is within a certain range centered on the elevator hoistway.
In the embodiment of the application, after the computer equipment determines the current position of each person waiting for taking the elevator, whether the person has willingness to bear the elevator is determined according to whether the current position of the person is located in the waiting area. Illustratively, embodiments of the present application determine the number of people waiting in the waiting area of each elevator by counting the number of people whose current location falls within the waiting area of the elevator.
203. The computer device determines a dispatch priority for each elevator based on the number of people waiting in each waiting area.
The dispatching priority of the elevators refers to the sequence of the elevators stopping at the first floor, the higher the dispatching priority of the elevators is, the earlier the sequence of the elevators stopping at the first floor is, and the lower the dispatching priority of the elevators is, the later the sequence of the elevators stopping at the first floor is.
In the embodiment of the application, the more waiting people in the waiting area of the elevator, the higher the dispatching priority of the elevator, so that the order of the elevator stopping at the first floor is the front, and the fewer the waiting people in the waiting area of the elevator, the lower the dispatching priority of the elevator, so that the order of the elevator stopping at the first floor is the rear.
204. The computer device schedules the elevators whose available capacity, which is the number of people currently available to the elevator, to meet the transportation conditions, to stop at the first floor according to the scheduling priority of each elevator.
Wherein, the available capacity meets the transportation condition means that: the available capacity of the elevator is not less than the waiting number of the first floor waiting for taking the elevator. The available capacity of an elevator means: total number of people currently available to at least one elevator. Thus, the available capacity meeting the transportation conditions means: the total number of currently available passengers in at least one elevator is not less than the number of passengers waiting for an elevator on the first floor.
The utility model provides a new elevator dispatch scheme, this scheme can confirm the dispatch priority of elevator according to the number of people in the waiting area of different elevators in the floor, and then can dispatch the elevator that waits for the personnel quantity as far as possible and stop at this floor for waiting to take the elevator nearby. In other words, the method ensures the intelligence of elevator dispatching, reduces the occurrence probability that the user gets short of the elevator because the parked elevator is far away from the user, has better dispatching effect, further improves the efficiency of the user for taking the elevator, and optimizes the elevator taking experience of the user.
On the basis of the embodiment shown in fig. 2, the embodiment of the application can also distinguish whether the elevator dispatching request is an uplink dispatching request or a downlink dispatching request, and correspondingly, the dispatching priority of the elevator is further divided into an uplink dispatching priority and a downlink dispatching priority of the elevator, and the specific process is as follows.
Fig. 3 is a flowchart of another elevator dispatching method provided in an embodiment of the present application, the method being performed by a computer device, such as an elevator dispatching system, as shown in fig. 3, the method comprising:
301. the computer device determines a current location of each person waiting to ride an elevator in the first floor in response to receiving an elevator dispatch request for the first floor.
In one possible implementation, the first floor is provided with an elevator button, and if the user needs to take an elevator, the user can send an elevator dispatching request for the first floor to the elevator dispatching system by triggering the elevator button.
Alternatively, the elevator keys are of two types, one type being an up elevator key and the other type being a down elevator key. If the user needs to take the elevator to go upstairs, an ascending elevator button is triggered, and after receiving an ascending elevator dispatching request aiming at the first floor, the computer equipment dispatches the ascending elevator so that the user takes the ascending elevator to go upstairs. If the user needs to take the elevator down the floor, a down elevator button is triggered, and the computer equipment dispatches the down elevator after receiving a down elevator dispatching request aiming at the first floor so as to take the user down the floor.
In another possible implementation manner, in response to receiving an elevator dispatching request for a first floor, the computer device acquires multiple frames of images of the first floor, and performs position detection on people included in the multiple frames of images through a first identification model to obtain the current position of each person waiting to take an elevator; the first recognition model is illustratively trained based on a sample image labeled with the current location of the person. Optionally, the multi-frame image is obtained by shooting with a camera, which is not limited in the embodiment of the present application.
In another possible implementation, in the case that the above-mentioned multi-frame image is an infrared image, the computer device detects, based on the infrared image, the current position of each person waiting to ride the elevator in the first floor by means of the second recognition model; the second recognition model is illustratively trained based on a sample infrared image labeled with the current location of the person. Alternatively, the infrared image is obtained by a thermal sensor or an infrared camera, which is not limited in this application.
It should be noted that, the first recognition model and the second recognition model are both machine learning models, such as convolutional neural networks, which are not limited in this application.
302. The computer device determines the number of people waiting in the waiting area of each elevator based on the current location of each person waiting to ride the elevator.
In one possible implementation, the waiting area of the elevator is a circular area centered on the elevator entrance of the elevator, or the waiting area of the elevator is a rectangular area centered on the elevator entrance of the elevator, or the waiting area of the elevator is an area of another shape, which is not limited in this application.
In another possible implementation, the waiting area of each elevator comprises a plurality, and the computer device first determines the plurality of waiting areas of each elevator and then determines the number of people waiting in each waiting area of each elevator based on the current location of each person waiting to take the elevator.
Alternatively, if the waiting area of the elevator is a circular area centered on the elevator entrance of the elevator, the plurality of waiting areas of the elevator are circular areas of a preset size. For example, the plurality of waiting areas includes a waiting area 1, a waiting area 2, and a waiting area 3, wherein the waiting area 1 is a circular area centered on an elevator entrance of an elevator and having a radius of 0.5 meters, the waiting area 2 is a circular area centered on the elevator entrance of the elevator and spaced from the center by 0.5-1 meter, and the waiting area 3 is a circular area centered on the elevator entrance of the elevator and spaced from the center by 1-2 meters.
Alternatively, if the waiting area of the elevator is a rectangular area centered on the elevator entrance of the elevator, the plurality of waiting areas of the elevator are rectangular areas of a preset size. For example, referring to fig. 4, the plurality of waiting areas includes a waiting area a, a waiting area B and a waiting area C, the waiting area a being a rectangular area centered on an elevator entrance of an elevator, having a length of 0.3 meters and a width of 0.2 meters, the waiting area B being an annular area other than the waiting area a in a rectangular area centered on an elevator entrance of an elevator, having a length of 0.5 meters and a width of 0.3 meters, the waiting area C being an annular area other than the waiting area a and the waiting area B in a rectangular area centered on an elevator entrance, having a length of 0.8 meters and a width of 0.5 meters.
303. In the case where the elevator dispatch request includes an up elevator dispatch request and a down elevator dispatch request, the computer device determines a comprehensive dispatch priority for each elevator based on the number of people waiting in the waiting area for each elevator.
If the elevator dispatching request includes an uplink elevator dispatching request and a downlink elevator dispatching request, it is indicated that the personnel waiting for taking the elevator in the first floor have personnel who need to go upstairs and personnel who need to go downstairs, so that the uplink dispatching priority and the downlink dispatching priority of the elevator need to be determined.
304. The computer equipment determines the uplink dispatching priority and the downlink dispatching priority of each elevator according to the first proportion and the comprehensive dispatching priority of each elevator.
Wherein the first ratio refers to a preset ratio. For example, the computer device presets a first correspondence between the elevator operation time period and the uplink and downlink scheduling ratio. Correspondingly, in the first corresponding relation, the computer equipment can determine the uplink and downlink scheduling proportion corresponding to the time period to which the current moment belongs, so as to obtain the first proportion. And then, the computer equipment adjusts the comprehensive dispatching priority of the elevators according to the first proportion to obtain the uplink dispatching priority and the downlink dispatching priority of each elevator.
In one possible implementation manner, the first proportion includes an estimated proportion corresponding to the uplink schedule and an estimated proportion corresponding to the downlink schedule, a product of the estimated proportion corresponding to the uplink schedule and a comprehensive scheduling priority of each elevator is determined as an uplink scheduling priority of each elevator, and a product of the estimated proportion corresponding to the downlink schedule and the comprehensive scheduling priority of each elevator is determined as a downlink scheduling priority of each elevator.
The first ratio may also be a ratio between an estimated ratio corresponding to the uplink schedule of the elevator and an estimated ratio corresponding to the downlink schedule. For example, if the first ratio is 2:3, the estimated ratio of the uplink scheduling of the elevator indicated by the first ratio is 2/5, and the estimated ratio of the downlink scheduling of the elevator indicated by the first ratio is 3/5. In addition, if the comprehensive dispatching priority of the elevator is 0.5 and the first ratio is 2:3, the corresponding uplink dispatching priority of the elevator is 0.2, and the corresponding downlink dispatching priority of the elevator is 0.3.
In the embodiment of the application, the uplink and downlink scheduling ratios corresponding to different time periods are different, which also means that the uplink and downlink priority ratios of different time periods are different, so that the first ratio needs to be determined according to the current moment to ensure that the comprehensive scheduling priority of the elevator is adjusted by selecting the proper ratio in different time periods. Therefore, after determining the time period to which the current time belongs, the uplink and downlink scheduling proportion corresponding to the time period to which the current time belongs can be determined by querying the first correspondence, and the obtained uplink and downlink scheduling proportion is further determined as the first proportion.
For example, the elevator operation time period includes an early peak time period, a noon peak time period, a late peak time period and a regular time period, wherein the early peak time period refers to a person working hours, and more persons need to go upstairs, so that the uplink scheduling proportion is higher than the downlink scheduling proportion. The noon peak time period refers to the dining time of the personnel, the evening peak time period refers to the working time of the personnel, and more personnel are needed to go downstairs in the two time periods, so that the downlink scheduling proportion is higher than the uplink scheduling proportion. And the conventional time period can be regarded as a time period with small personnel flow, and the uplink scheduling proportion and the downlink scheduling proportion are the same.
In one possible implementation, the waiting area of the elevator comprises a plurality of waiting areas, and the way of obtaining the comprehensive dispatching priority of the elevator comprises the following steps: the method comprises the steps of obtaining initial weights of each waiting area in a plurality of waiting areas of each elevator, determining the product of the initial weights of each waiting area in the elevator and the number of people waiting in each waiting area as the area priority of each waiting area in the elevator, and determining the sum of the area priorities of each waiting area in the elevator as the comprehensive dispatching priority of the elevator.
Wherein the initial weight of each waiting area in the plurality of waiting areas of each elevator is preset. For example, each elevator includes 3 waiting areas, namely, a waiting area 1, a waiting area 2 and a waiting area 3, the initial weight of the waiting area 1 is 0.5, the initial weight of the waiting area 2 is 0.3, the initial weight of the waiting area 3 is 0.2, if the waiting area 1 includes 4 persons, the waiting area 2 includes 2 persons and the waiting area 3 includes 1 person, the area priority of the waiting area 1 is 0.5x4=2, the area priority of the waiting area 2 is 0.3x2=0.6, the area priority of the waiting area 3 is 0.2x1=0.2, and the scheduling priority of the elevator is 2+0.6+0.2=2.8.
305. The computer device determines the number of pedestrians and the number of descending persons among the waiting persons waiting to ride the elevator according to the second ratio.
The second proportion is a preset proportion, and the number of the upward people and the number of the downward people of the elevator are determined through the second proportion.
In the embodiment of the application, the computer equipment determines the second proportion corresponding to the current moment, and determines the number of people waiting for taking the elevator in the first floor, so as to obtain the number of people going upwards to the elevator waiting for going upstairs and the number of people going downwards to the elevator waiting for going downstairs.
In one possible implementation, the second proportion includes an estimated proportion corresponding to the number of pedestrians above and an estimated proportion corresponding to the number of pedestrians below; determining the product of the estimated proportion of the number of waiting people waiting for taking the elevator and the number of pedestrians as the number of upward people; and determining the product of the estimated ratio of the number of waiting persons waiting for taking the elevator to the number of descending persons as the number of descending persons.
In addition, the second ratio may also refer to a ratio between an estimated ratio corresponding to the number of pedestrians waiting for an elevator and an estimated ratio corresponding to the number of pedestrians waiting for an elevator in the first floor. For example, if the second ratio is 3:4, the estimated ratio corresponding to the number of pedestrians on the elevator indicated by the second ratio is 3/7, and the estimated ratio corresponding to the number of pedestrians on the elevator indicated by the second ratio is 4/7. If the number of people waiting for taking the elevator in the first floor is 14, and the second ratio is 3:4, the number of people waiting for taking the elevator in the first floor is 6, and the number of people waiting for taking the elevator in the first floor is 8.
Optionally, when determining the second ratio, the computer device first obtains a second corresponding relation between the elevator running time period and the ratio of the number of pedestrians on the elevator running time period to the number of pedestrians on the elevator running time period; and in the second corresponding relation, determining the ratio of the number of pedestrians to the pedestrian corresponding to the time period to which the current moment belongs, and further obtaining a second ratio.
In this embodiment of the present application, the ratio of the numbers of pedestrians up to down corresponding to different time periods is different, which may also indicate that the ratio of the numbers of people up to down to the numbers of people up to down in different time periods is also different, so that the second ratio needs to be determined according to the current time, so as to ensure that the appropriate ratio is selected in different time periods to determine the number of people up to down to the first floor. Therefore, after the time period to which the current time belongs is determined, the ratio of the number of pedestrians to the number of pedestrians corresponding to the time period to which the current time belongs can be determined by querying the second correspondence, and the obtained ratio of the number of pedestrians to the number of pedestrians is further determined as the second ratio.
For example, the elevator operation period includes an early peak period, a peak at noon period, a peak at late period, and a regular period, wherein the early peak period refers to a time when people go to work, and more people need to go upstairs, so that the ratio of the number of pedestrians is higher than the ratio of the number of pedestrians. The noon peak time period refers to the dining time of the personnel, the evening peak time period refers to the working time of the personnel, and more personnel are needed to go downstairs in the two time periods, so that the ratio of the number of pedestrians is higher than that of the pedestrians. Whereas the regular time period may be regarded as a time period in which the flow of people is small, the ratio of the number of pedestrians is the same as the ratio of the number of pedestrians.
The first ratio and the second ratio may be the same ratio, or the first ratio and the second ratio may be different ratios, which is not limited in this application.
306. The computer equipment schedules elevators with available carrying capacity not lower than the number of the upward people according to the order of the upward scheduling priority from high to low, and stops at the first floor; and scheduling the elevators with the available capacity not lower than the number of people descending according to the descending scheduling priority from high to low, and stopping at the first floor.
In one possible implementation, if the elevator with the highest uplink dispatching priority is consistent with the elevator with the highest downlink dispatching priority, determining whether the elevator is currently in an uplink state or a downlink state, and if the elevator is currently in the uplink state, dispatching the elevator to the first floor to transport personnel needing to be uplink. For the down dispatch, after the elevator is eliminated from the plurality of elevators, the elevator with the highest down dispatch priority is selected for transporting down personnel.
For example, assuming that there are a plurality of elevators, namely, elevator 1, elevator 2, elevator 3, elevator 4 and elevator 5, respectively, 5 elevators are ordered according to the ascending dispatch priority, the ordered elevators are elevator 1, elevator 2, elevator 3, elevator 4 and elevator 5, 5 elevators are ordered according to the descending dispatch priority, and elevator 1 is in the ascending state, elevator 1 to the first floor is dispatched for transporting ascending personnel, elevator 1 is excluded from elevator 1, elevator 2, elevator 3, elevator 4 and elevator 5, and the remaining 4 elevators are ordered according to the descending dispatch priority, to obtain elevator 4, elevator 2, elevator 5 and elevator 3, elevator 4 to the first floor is dispatched for transporting descending personnel.
In the embodiment of the present application, the elevator scheduling request includes an uplink elevator scheduling request and a downlink elevator scheduling request. In yet another possible implementation, if the elevator dispatch request comprises an up elevator dispatch request or a down elevator dispatch request, steps 304-306 described above are not performed, but steps 203-204 described above are performed. That is, when the elevator dispatch request includes an uplink elevator dispatch request, the uplink dispatch priority of each elevator is determined based on the number of people waiting in the waiting area of each elevator. In the case where the elevator dispatch request includes a downlink elevator dispatch request, a downlink dispatch priority for each elevator is determined based on the number of people waiting in the waiting area for each elevator. Note that, in step 203, the uplink scheduling priority and the downlink scheduling priority refer to the integrated scheduling priority in step 303.
The utility model provides a new elevator dispatch scheme, this scheme can confirm the dispatch priority of elevator according to the number of people in the waiting area of different elevators in the floor, and then can dispatch the elevator that waits for the personnel quantity as far as possible and stop at this floor for waiting to take the elevator nearby. In other words, the method ensures the intelligence of elevator dispatching, reduces the occurrence probability that the user gets short of the elevator because the parked elevator is far away from the user, has better dispatching effect, further improves the efficiency of the user for taking the elevator, and optimizes the elevator taking experience of the user.
In addition, in the case that the uplink scheduling request and the downlink scheduling request exist at the same time, the scheduling priority of the elevator can be adjusted according to the corresponding proportion of the uplink scheduling and the downlink scheduling, the number of people needing uplink and the number of people needing downlink can be determined, the accuracy of scheduling the elevator for the first floor is improved by distinguishing the uplink from the downlink, and further elevator riding experience of a user is optimized.
In addition, the embodiment of the application can also adjust the corresponding proportion of the downlink scheduling and the uplink scheduling according to the time period, and because the fact that the uplink and downlink demand amounts of different time periods are possibly different is considered, the elevator can be accurately scheduled at different times, the accuracy of elevator scheduling is improved, and the elevator taking experience of a user is further optimized.
Fig. 5 is a schematic structural view of an elevator dispatching apparatus according to an embodiment of the present application. As shown in fig. 5, the apparatus includes:
a location determination module 501 for determining a current location of each person waiting to take an elevator in a first floor after receiving an elevator dispatch request for the first floor;
a person number determination module 502 for determining the number of waiting persons located in the waiting area of each elevator based on the current position of each person waiting to take the elevator;
A priority determining module 503, configured to determine a dispatch priority of each elevator based on the number of waiting people in each waiting area;
a dispatching module 504, configured to dispatch, according to the dispatching priority of each elevator, that an elevator with available capacity satisfying a transportation condition is parked at the first floor, where the available capacity is the number of people currently available for taking the elevator.
In one possible implementation, the elevator dispatch request includes at least one of an up elevator dispatch request or a down elevator dispatch request;
the priority determining module 503 is configured to:
determining an uplink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the uplink elevator dispatch request;
determining a downlink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the downlink elevator dispatch request;
determining a comprehensive dispatching priority of each elevator based on the number of waiting people in a waiting area of each elevator under the condition that the elevator dispatching request comprises the uplink elevator dispatching request and the downlink elevator dispatching request; and determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator.
In a possible implementation manner, the first proportion includes an estimated proportion corresponding to uplink scheduling and an estimated proportion corresponding to downlink scheduling;
the priority determining module 503 is configured to:
determining the product of the estimated proportion corresponding to the uplink scheduling and the comprehensive scheduling priority of each elevator as the uplink scheduling priority of each elevator;
and determining the product of the estimated proportion corresponding to the downlink scheduling and the comprehensive scheduling priority of each elevator as the downlink scheduling priority of each elevator.
In one possible implementation, referring to fig. 6, the apparatus further includes:
an obtaining module 505, configured to obtain a first correspondence between an elevator operation time period and an uplink/downlink scheduling ratio;
the proportion determining module 506 is configured to determine, in the first correspondence, an uplink-downlink scheduling proportion corresponding to a time period to which the current time belongs, and obtain the first proportion.
In one possible implementation, the elevator dispatching request includes an uplink elevator dispatching request and a downlink elevator dispatching request, and the dispatching priority includes an uplink dispatching priority and a downlink dispatching priority;
the scheduling module 504 is configured to:
According to the second proportion, determining the number of pedestrians and the number of descending people in the waiting people waiting for taking the elevator;
according to the ascending dispatching priority from high to low, dispatching the elevators with the available capacity not lower than the pedestrian number to stop at the first floor;
and dispatching the elevators with the available capacity not lower than the number of pedestrians to stop at the first floor according to the descending dispatching priority from high to low.
In one possible implementation, the second proportion includes an estimated proportion corresponding to the number of pedestrians above and an estimated proportion corresponding to the number of pedestrians below;
the scheduling module 504 is configured to:
determining the product of the estimated proportion of the number of waiting persons waiting for taking the elevator and the number of pedestrians as the number of upward persons;
and determining the product of the estimated ratio of the number of waiting persons waiting for taking the elevator to the number of descending persons as the number of descending persons.
In one possible implementation, referring to fig. 6, the apparatus further includes:
an obtaining module 505, configured to obtain a second correspondence between an elevator operation time period and a ratio of the number of pedestrians up and down;
the proportion determining module 506 is configured to determine, in the second correspondence, a proportion of the number of pedestrians corresponding to a time period to which the current time belongs, and obtain the second proportion.
In one possible implementation, the waiting area of the elevator comprises a plurality of;
the priority determining module 503 is configured to:
acquiring initial weights of each waiting area in a plurality of waiting areas of each elevator;
for each elevator, determining the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area as the area priority of each waiting area in the elevator;
and determining the sum of the zone priorities of each waiting zone in the elevator as the dispatching priority of the elevator.
It should be noted that, the foregoing various optional embodiments may be combined arbitrarily to form an optional embodiment of the present application, which is not described herein in detail.
It should be noted that: in the elevator dispatching device provided in the above embodiment, only the division of the above functional modules is used for illustration, and in practical application, the above functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the computer device is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the elevator dispatching device and the elevator dispatching method provided in the foregoing embodiments belong to the same concept, and specific implementation processes of the elevator dispatching device and the elevator dispatching method are detailed in the method embodiments, and are not repeated here.
Optionally, the elevator dispatching system is provided as a server. Fig. 7 is a schematic structural diagram of a server provided in an embodiment of the present application, where the server 700 may have a relatively large difference due to different configurations or performances, and may include one or more processors (Central Processing Units, CPU) 701 and one or more memories 702, where at least one computer program is stored in the memories 702, and the at least one computer program is loaded and executed by the processors 701 to implement the elevator dispatching method provided in the above method embodiments. Of course, the server may also have a wired or wireless network interface, a keyboard, an input/output interface, and other components for implementing the functions of the device, which are not described herein.
The present application also provides a computer readable storage medium having stored therein at least one computer program loaded and executed by a processor to implement the operations performed by the elevator dispatching method of the above embodiments.
The present application also provides a computer program product comprising a computer program which, when executed by a processor, implements the operations performed by the elevator dispatching method of the above embodiments.
Those of ordinary skill in the art will appreciate that all or a portion of the steps implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the above storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the embodiments is merely an optional embodiment and is not intended to limit the embodiments, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application are intended to be included in the scope of the present application.
Claims (11)
1. An elevator dispatching method, characterized in that the method comprises:
after receiving an elevator dispatching request for a first floor, determining a current position of each person waiting for taking an elevator in the first floor;
determining a waiting person number located in a waiting area of each elevator based on a current position of each person waiting to take the elevator;
determining a scheduling priority of each elevator based on the number of people waiting in each waiting area;
and according to the dispatching priority of each elevator, dispatching the elevator with the available capacity meeting the transportation condition to stop at the first floor, wherein the available capacity refers to the number of people currently taking the elevator.
2. The method of claim 1, wherein the elevator dispatch request comprises at least one of an up elevator dispatch request or a down elevator dispatch request;
the method for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area comprises the following steps:
determining an uplink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the uplink elevator dispatch request;
determining a downlink dispatch priority of each elevator based on the number of people waiting in the waiting area of each elevator when the elevator dispatch request includes the downlink elevator dispatch request;
determining a comprehensive dispatching priority of each elevator based on the number of waiting people in a waiting area of each elevator under the condition that the elevator dispatching request comprises the uplink elevator dispatching request and the downlink elevator dispatching request; and determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator.
3. The method of claim 2, wherein the first ratio comprises an estimated ratio corresponding to an uplink schedule and an estimated ratio corresponding to a downlink schedule;
The determining the uplink scheduling priority and the downlink scheduling priority of each elevator according to the first proportion and the comprehensive scheduling priority of each elevator comprises the following steps:
determining the product of the estimated proportion corresponding to the uplink scheduling and the comprehensive scheduling priority of each elevator as the uplink scheduling priority of each elevator;
and determining the product of the estimated proportion corresponding to the downlink scheduling and the comprehensive scheduling priority of each elevator as the downlink scheduling priority of each elevator.
4. A method according to claim 2 or 3, characterized in that the method further comprises:
acquiring a first corresponding relation between an elevator operation time period and an uplink and downlink scheduling proportion;
and determining uplink and downlink scheduling proportion corresponding to a time period to which the current moment belongs in the first corresponding relation to obtain the first proportion.
5. The method of claim 1, wherein the elevator dispatch request comprises an uplink elevator dispatch request and a downlink elevator dispatch request, the dispatch priority comprising an uplink dispatch priority and a downlink dispatch priority;
according to the dispatching priority of each elevator, the elevator with dispatching available capacity meeting the transportation condition stops at the first floor, and the method comprises the following steps:
According to the second proportion, determining the number of pedestrians and the number of descending people in the waiting people waiting for taking the elevator;
according to the ascending dispatching priority from high to low, dispatching the elevators with the available capacity not lower than the pedestrian number to stop at the first floor;
and dispatching the elevators with the available capacity not lower than the number of pedestrians to stop at the first floor according to the descending dispatching priority from high to low.
6. The method of claim 5, wherein the second ratio comprises an estimated ratio corresponding to the number of pedestrians above and an estimated ratio corresponding to the number of pedestrians below;
the step of determining the number of pedestrians and the number of pedestrians in the waiting number of the waiting elevator according to the second proportion comprises the following steps:
determining the product of the estimated proportion of the number of waiting persons waiting for taking the elevator and the number of pedestrians as the number of upward persons;
and determining the product of the estimated ratio of the number of waiting persons waiting for taking the elevator to the number of descending persons as the number of descending persons.
7. The method according to claim 5 or 6, characterized in that the method further comprises:
acquiring a second corresponding relation between the running time period of the elevator and the ratio of the number of pedestrians on the elevator to the number of pedestrians on the elevator;
And in the second corresponding relation, determining the ratio of the number of pedestrians to the number of pedestrians corresponding to the time period to which the current moment belongs, and obtaining the second ratio.
8. The method according to claim 1, characterized in that the waiting area of the elevator comprises a plurality of;
the method for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area comprises the following steps:
acquiring initial weights of each waiting area in a plurality of waiting areas of each elevator;
for each elevator, determining the product of the initial weight of each waiting area in the elevator and the number of people waiting in each waiting area as the area priority of each waiting area in the elevator;
and determining the sum of the zone priorities of each waiting zone in the elevator as the dispatching priority of the elevator.
9. An elevator dispatching apparatus, the apparatus comprising:
the system comprises a position determining module, a first elevator dispatching module and a second elevator dispatching module, wherein the position determining module is used for determining the current position of each person waiting for taking an elevator in a first floor after receiving an elevator dispatching request aiming at the first floor;
the system comprises a people number determining module, a people number detecting module and a people number detecting module, wherein the people number determining module is used for determining the number of waiting people in a waiting area of each elevator based on the current position of each person waiting for taking the elevator;
The priority determining module is used for determining the dispatching priority of each elevator based on the number of waiting people in each waiting area;
and the dispatching module is used for dispatching the elevators with the available capacity meeting the transportation conditions to stop at the first floor according to the dispatching priority of each elevator, wherein the available capacity refers to the number of people currently taking the elevator.
10. A computer device, characterized in that it comprises a processor and a memory in which at least one computer program is stored, which is loaded and executed by the processor to carry out the operations performed by the elevator dispatching method of any one of claims 1 to 8.
11. A computer readable storage medium, characterized in that at least one computer program is stored in the computer readable storage medium, which is loaded and executed by a processor to realize the operations performed by the elevator dispatching method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310355976.XA CN116443679A (en) | 2023-04-04 | 2023-04-04 | Elevator dispatching method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310355976.XA CN116443679A (en) | 2023-04-04 | 2023-04-04 | Elevator dispatching method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116443679A true CN116443679A (en) | 2023-07-18 |
Family
ID=87133100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310355976.XA Pending CN116443679A (en) | 2023-04-04 | 2023-04-04 | Elevator dispatching method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116443679A (en) |
-
2023
- 2023-04-04 CN CN202310355976.XA patent/CN116443679A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105584910B (en) | The method and system of scheduling elevator cars in group elevator system | |
| CN109693980B (en) | Elevator dispatching method, device and system | |
| CN106875066B (en) | Vehicle travel behavior prediction method, device, server and storage medium | |
| CN110861983B (en) | Elevator operation control method and device | |
| CN104760851B (en) | For managing the method and device of elevator | |
| WO2019033729A1 (en) | Systems and methods for dispatching vehicles | |
| CN106657203B (en) | Dynamic resource management system and method thereof | |
| CN111612327B (en) | Scheduling method, system, machine readable medium and equipment | |
| CN110654946A (en) | Community elevator dispatching method and system based on artificial intelligence | |
| KR102504273B1 (en) | DRT request information clustering method for allocating DRT cars and system thereof | |
| CN106415620A (en) | Device and method providing traffic forecasts for elevator systems | |
| Cheng et al. | A queueing-theoretic framework for vehicle dispatching in dynamic car-hailing | |
| CN116013059A (en) | Scheduling method and device for operating vehicle, electronic equipment and storage medium | |
| CN116090942A (en) | Multi-scene robot distribution method and system based on Internet of things | |
| CN111847152A (en) | Robot elevator taking determination method and device, electronic equipment and medium | |
| CN113911862B (en) | Intelligent building elevator state query and elevator taking reservation system | |
| Chou et al. | Improving elevator dynamic control policies based on energy and demand visibility | |
| CN116443679A (en) | Elevator dispatching method, device, equipment and storage medium | |
| CN111931128A (en) | Elevator configuration method, system, equipment and storage medium based on Bernoulli model | |
| JP6103652B2 (en) | Service content proposal system, service content proposal device, service content proposal method, and program | |
| CN115402890A (en) | Elevator dispatching method, device, electronic equipment and medium | |
| CN115783915A (en) | Control method, system, equipment and storage medium of building equipment | |
| CN114492951A (en) | Resource allocation method, device and equipment based on passenger flow prediction | |
| CN113935565A (en) | Automatic distribution method and device of public transport means based on user requirements | |
| CN108628667A (en) | A kind of heuristic dynamic task scheduling system and its implementation based on multiple attribute decision making (MADM) |
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 |