Construction elevator dispatching method and device, server and storage medium
By setting up multiple lifting wells and rotary sections in the construction elevator, and using dynamic scheduling method, the moving path of the construction elevator is controlled, which solves the problems of long running time and low efficiency of the construction elevator, and achieves more efficient handling tasks.
Patent Information
- Application Number
- CN202510076594.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-01-17
- Publication Date
- 2025-04-15
AI Technical Summary
In the construction of super high-rise buildings, the cyclic scheduling logic of the construction elevator leads to a long running time and a long moving path, which in turn increases the waiting time for the handling task and affects the construction efficiency.
By setting up multiple lifting wells and rotary sections in the construction elevator, a dynamic scheduling method is adopted to determine the target scheduling strategy based on the information of the cage and the location of the target floor, and control the scheduling cage for optimal movement path planning to complete the handling task.
It reduces the movement path and waiting time of construction elevators, and improves the handling efficiency of construction sites.
Smart Images

Figure CN119822180A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of elevator dispatching, and in particular to a construction elevator dispatching method, device, server and storage medium. Background Art
[0002] In a construction site, the task of transporting construction materials is usually accomplished by building a construction elevator. The construction elevator in the related technology mainly adopts a clockwise or counterclockwise cycle scheduling logic, with one side being an upward side for the construction elevator to go upward, and the other side being a downward side for the construction elevator to go downward.
[0003] However, when the construction elevator in the related technology is operating at super-high floors, it must operate according to the cyclic scheduling logic, that is, the construction elevator must go up to the top floor and the rotating section turns to the downward side before it can go down. This causes the operation time of the construction elevator to become longer and the moving path to become longer, thereby increasing the waiting time for the transportation task, seriously affecting the transportation efficiency of the transportation task at the construction site. Summary of the invention
[0004] The purpose of the embodiments of the present invention is to provide a construction elevator scheduling method, device, server and storage medium to solve the technical problems of long operation time and low handling efficiency of construction elevators in related technologies.
[0005] In a first aspect, to achieve the above-mentioned purpose, an embodiment of the present invention provides a construction elevator dispatching method, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to dock, at least one of the multiple parking floors is a rotating node layer, and the rotating node layer is used for the construction elevator to move horizontally to switch to different elevator shafts, the construction elevator includes multiple elevator cages, and the construction elevator dispatching method includes:
[0006] In response to the transport task triggered by the target floor, obtaining the current cage information of each cage;
[0007] Determining a target scheduling strategy according to the elevator cage information and the target floor position information of the target floor;
[0008] Based on the target scheduling strategy, one or more of the plurality of elevator cages are controlled to complete the transport task.
[0009] In an embodiment of the present invention, the cage information includes location information, and the step of determining a target scheduling strategy according to the cage information and the target floor location information of the target floor includes:
[0010] According to the position information of the cage and the target floor position information of the target floor, a cage in the elevator shaft containing only one cage is used as a target cage;
[0011] The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
[0012] In an embodiment of the present invention, the method further includes:
[0013] In the case where each of the elevator shafts contains at least two elevator cages, determining the target elevator shaft containing the least number of elevator cages according to the position information of the elevator cages;
[0014] Determine the target elevator cage closest to the target floor according to the position information of each elevator cage in the target elevator shaft and the target floor position information of the target floor;
[0015] The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
[0016] In an embodiment of the present invention, the method further includes:
[0017] When each of the elevator shafts contains at least two elevator cages and the number of the elevator cages in each of the elevator shafts is the same, according to the position information of the elevator cages and the target floor position information of the target floor, determining the target elevator cage closest to the target floor in the two elevator shafts;
[0018] The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
[0019] In an embodiment of the present invention, the elevator shaft includes a first elevator shaft and a second elevator shaft, and when each of the elevator shafts contains at least two elevator cages and the number of elevator cages in each of the elevator shafts is the same, the step of determining the target elevator cage closest to the target floor according to the position information of the elevator cage and the target floor position information of the target floor comprises:
[0020] When both the first elevator shaft and the second elevator shaft contain at least two elevator cages, and the number of elevator cages in the first elevator shaft and the number of elevator cages in the second elevator shaft are the same, determining the distance between each of the elevator cages in the first elevator shaft and the second elevator shaft and the target floor position information of the target floor;
[0021] In the case that there is no faulty elevator cage in the first elevator shaft and the second elevator shaft, determining the elevator cage closest to the target floor in the first elevator shaft and the second elevator shaft as the target elevator cage;
[0022] In the case where there is a faulty cage in the first elevator shaft, the cage in the second elevator shaft that is closest to the target floor is determined as the target cage.
[0023] In an embodiment of the present invention, the step of controlling one or more of the plurality of elevator cages based on the target scheduling strategy to complete the handling task includes:
[0024] Based on the target scheduling strategy, determine the moving path of the target elevator cage to perform the handling task, and control the target elevator cage to perform the handling task according to the moving path;
[0025] In the case where there is a non-target elevator cage on the moving path, the non-target elevator cage is controlled to move to a floor on the non-moving path and stop.
[0026] In an embodiment of the present invention, the step of controlling the non-target elevator cage to move to a floor on the non-moving path and stop there includes:
[0027] In the case where the non-target cage is located on the ascending path of the target cage, the non-target cage is controlled to move upward to a floor of the non-moving path to stop, or the non-target cage is controlled to move upward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path;
[0028] When the non-target cage is on the descending path of the target cage, the non-target cage is controlled to move downward to the floor of the non-moving path to stop, or the non-target cage is controlled to move downward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path.
[0029] In a second aspect, in order to solve the same technical problem, an embodiment of the present invention provides a construction elevator dispatching device, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to dock, at least one of the multiple parking floors is a rotating node layer, and the rotating node layer is used for the construction elevator to move horizontally to switch to different elevator shafts, the construction elevator includes multiple elevator cages, and the construction elevator dispatching device includes:
[0030] An acquisition module, for acquiring the current cage information of each cage in response to a handling task triggered by a target floor;
[0031] A first determination module is used to determine a target scheduling strategy according to the elevator cage information and the target floor position information of the target floor;
[0032] A control module is used to control one or more of the plurality of elevator cages based on the target scheduling strategy to complete the handling task.
[0033] In a third aspect, in order to solve the same technical problem, an embodiment of the present invention provides a server, characterized in that it includes a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor performs the following steps:
[0034] In response to the transport task triggered by the target floor, obtaining the current cage information of each cage;
[0035] Determining a target scheduling strategy according to the elevator cage information and the target floor position information of the target floor;
[0036] Based on the target scheduling strategy, one or more of the plurality of elevator cages are controlled to complete the transport task.
[0037] In the fourth aspect, in order to solve the same technical problem, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program, wherein when the computer program is running, the device where the computer-readable storage medium is located is controlled to perform the steps in any one of the above-mentioned construction elevator scheduling methods.
[0038] The embodiment of the present invention provides a construction elevator scheduling method, device, server and storage medium. The method obtains the current cage information of each cage, determines the target scheduling strategy according to the cage information and the target floor position information of the target floor, and then controls one or more cages in the multiple cages to complete the handling task based on the target scheduling strategy. The embodiment of the present invention can reduce the moving path of the construction elevator, reduce the waiting time required for the handling task, and improve the handling efficiency of the handling task. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] Figure 1 It is a flow chart of a construction elevator dispatching method provided by an embodiment of the present invention;
[0040] Figure 2 This is a schematic diagram of a scenario for determining a target scheduling strategy provided by an embodiment of the present invention;
[0041] Figure 3 It is a second flow chart of the construction elevator dispatching method provided by an embodiment of the present invention;
[0042] Figure 4 is a schematic diagram of a second scenario for determining a target scheduling strategy provided by an embodiment of the present invention;
[0043] Figure 5 1 is a third flow chart of the construction elevator dispatching method provided by an embodiment of the present invention;
[0044] Figure 6 is a schematic diagram of a third scenario for determining a target scheduling strategy provided by an embodiment of the present invention;
[0045] Figure 7 It is a flow chart of a method for controlling an elevator cage provided by an embodiment of the present invention;
[0046] Figure 8 This is a schematic diagram of controlling a non-target cage to move provided by an embodiment of the present invention;
[0047] Fig. 9 is another schematic diagram of controlling a non-target cage to move provided by an embodiment of the present invention;
[0048] Fig.10 It is a structural schematic diagram of a construction elevator dispatching device provided by an embodiment of the present invention;
[0049] Fig.11 It is a structural diagram of a server provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0050] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0051] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.
[0052] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.
[0053] In a construction site, the task of transporting construction materials is usually accomplished by building a construction elevator. The construction elevator in the related technology mainly adopts a clockwise or counterclockwise cycle scheduling logic, with one side being an upward side for the construction elevator to go upward, and the other side being a downward side for the construction elevator to go downward.
[0054] However, when the construction elevator in the related technology is operating at super-high floors, it must operate according to the cyclic scheduling logic, that is, the construction elevator must go up to the top floor and the rotating section turns to the downward side before it can go down. This causes the operation time of the construction elevator to become longer and the moving path to become longer, thereby increasing the waiting time for the transportation task, seriously affecting the transportation efficiency of the transportation task at the construction site.
[0055] In order to solve the technical problems existing in the related technologies, this embodiment provides a construction elevator dispatching method, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to stop, at least one of the multiple parking floors is a rotating joint layer, the rotating joint layer is used for the construction elevator to move horizontally to switch to different elevator shafts, and the construction elevator includes multiple elevator cages. For details, please refer to Figure 1 , Figure 1 Schematic diagram of a flow chart of a construction elevator dispatching method provided by an embodiment of the present invention. Figure 1 As shown, the construction elevator scheduling method provided by the embodiment of the present invention includes steps 101 to 103, which are specifically as follows:
[0056] Step 101, in response to a transport task triggered by a target floor, obtaining current cage information of each cage.
[0057] In this embodiment, the elevator cage information provided in this embodiment may include position information, and the position information is used to characterize the elevator shaft where each elevator cage is currently located and the floor where each elevator cage is currently parked.
[0058] Step 102, determining a target scheduling strategy based on the elevator cage information and the target floor position information of the target floor.
[0059] Among them, the target floor position information includes the number of floors at which the elevator cage can stop. Therefore, after the target floor position information of the target floor is sent to the elevator cage that performs the transport task, the corresponding elevator cage will automatically move to the target floor for docking to complete the transport task of the target floor.
[0060] In some embodiments, the target scheduling strategy provided by this embodiment is determined based on the cage information of each cage and the target floor location information. Among them, the target scheduling strategy is mainly a control strategy for controlling the movement of each cage. In order to reduce the required moving path of the cage and reduce the time required for the handling task, this embodiment can select the cage with the least moving path to perform the scheduling strategy of the handling task. Specifically, this embodiment can use the A* algorithm to calculate the target cage that is closest to the target floor and can directly reach the target floor, so as to determine the target scheduling strategy for the target cage to perform the handling task, thereby effectively reducing the moving path required for the target cage to move and reducing the handling time required for the handling task, and effectively improving the handling efficiency of the handling task.
[0061] In other embodiments, the step of determining the target scheduling strategy based on the cage information and the target floor position information of the target floor provided in the present embodiment may be: based on the position information of the cage and the target floor position information of the target floor, taking the cage in the elevator shaft containing only one cage as the target cage; and determining the scheduling strategy with the target cage as the execution object of the transport task as the target scheduling strategy.
[0062] Among them, in order to reduce the required moving path of the elevator cage and reduce the time required for the handling task, the present embodiment can select an elevator shaft containing only one elevator cage. By only controlling the elevator cage in the elevator shaft containing only one elevator cage to perform the handling task, it can avoid the need to control other elevator cages to avoid the target elevator cage that performs the handling task, thereby reducing the overall moving path of all elevator cages and improving scheduling efficiency.
[0063] For example, see Figure 2 , Figure 2 is a schematic diagram of a scenario for determining a target scheduling strategy provided by an embodiment of the present invention, such as Figure 2As shown, it is assumed that the construction elevator room has two elevator shafts, and the construction elevator room is equipped with 3 rotating sections: 1st floor, 33rd floor and 70th floor. The target floor is 1st floor, which triggers the handling task. The destination floor of the handling task is 60th floor. At this time, the A* algorithm can be used, and according to the cage information of each cage (cage 1 is on the 5th floor, cage 2 is on the 8th floor, cage 3 is on the 20th floor, cage 4 is on the 39th floor, cage 5 is on the 48th floor, cage 6 is on the 55th floor), the target floor (1st floor) and the destination floor (60th floor), find the cage closest to the target floor (1st floor) and can directly go to the destination floor (60th floor), determine that cage 1 (on the 5th floor) is closest to the target floor (1st floor) and can directly go to the destination floor (60th floor), then determine that the strategy of scheduling cage 1 to perform the handling task (1st floor-60th floor) is the target scheduling strategy, and schedule cage 1 to arrive at the target floor (1st floor) for pre-waiting. When the target floor (1st floor) triggers the start of the transport task instruction, for example, when the construction worker presses the door closing button, the elevator cage 1 will continue to move to the destination floor (60th floor) and send a message indicating that the task has been completed and the destination floor has been reached when it reaches the destination floor (60th floor).
[0064] In one case, when the A* algorithm cannot find a suitable target cage and it is detected that there is no elevator shaft with only one cage, this embodiment can select the strategy with the least cages as the target scheduling strategy. Figure 3 , Figure 3 is a second flow chart of the construction elevator dispatching method provided by an embodiment of the present invention, such as Figure 3 As shown, the construction elevator scheduling method provided in this embodiment may further include steps 201 to 203;
[0065] Step 201, when each of the elevator shafts contains at least two of the elevator cages, determine the target elevator shaft containing the least number of the elevator cages based on the position information of the elevator cages.
[0066] In this embodiment, by selecting the target elevator shafts with the least number, the overall moving paths of all elevator cages can be reduced and the scheduling efficiency can be improved.
[0067] Step 202, determining the target elevator cage closest to the target floor based on the position information of each elevator cage in the target elevator shaft and the target floor position information of the target floor.
[0068] In order to further improve the handling efficiency of the handling task and reduce the waiting time required for the handling task, this embodiment can select the elevator cage closest to the target floor as the target elevator cage, thereby reducing the moving path that the elevator cage needs to move to the target floor and reducing the waiting time required for the handling task.
[0069] Step 203, determining the scheduling strategy that takes the target cage as the execution object of the transport task as the target scheduling strategy.
[0070] After determining the target elevator cage, the scheduling strategy that takes the target elevator cage as the execution object of the transport task can be determined as the target scheduling strategy, so as to schedule the corresponding elevator cage to perform the transport task through the target scheduling strategy, so as to improve the transport efficiency of the transport task and reduce the waiting time required for the transport task.
[0071] For example, see Figure 4 , Figure 4 is a schematic diagram of a second scenario for determining a target scheduling strategy provided by an embodiment of the present invention, such as Figure 4 As shown in the figure, assuming that the target floor is the 1st floor, the destination floor of the transport task is the 60th floor, and the A* algorithm does not find a cage that can directly reach the target floor, that is, both of the current two elevator shafts contain at least two elevator cages. At this time, the target elevator shaft with the least number of elevator cages can be determined based on the elevator shafts where each elevator cage is located, that is, Figure 4 The elevator shaft on the left side (containing only two cages, cage 1 and cage 4), and then search for the target cage closest to the target floor (1st floor) in the target elevator shaft, determine that cage 1 in the target elevator shaft is the nearest target cage, and determine the strategy of scheduling cage 1 to perform the handling task (1st floor to 60th floor) as the target scheduling strategy. Then, the handling task can be assigned to the target cage (cage 1), and the moving path from the target floor to the destination floor (moving path from 1st floor to 60th floor) can be pre-occupied; at the same time, since there is also cage 4 in the target elevator shaft occupying the moving path of the target cage, the target scheduling strategy provided in this embodiment can also include an avoidance strategy for collaboratively scheduling cage 4 to reach the nearest rotating node layer, such as scheduling cage 4 to arrive at Figure 4 The 33rd floor shown in the figure is used to rotate the node layer to switch to the elevator shaft on the other side for avoidance; if the 33rd floor in the elevator shaft on the other side is occupied, the elevator cage 4 is dispatched to move upward to a floor outside the moving path of the target elevator cage to stop for avoidance. The specific number of layer safety intervals can be set in advance according to the actual application scenario, such as 3 floors, 5 floors, etc., and no specific limitation is made here.
[0072] Specifically, the target elevator shaft with the least number of cages may also contain multiple cages that are not used to perform handling tasks. After the target cage is determined, the cages that are not used to perform handling tasks are sequentially scheduled for avoidance according to the avoidance strategy provided in the above embodiment. It should be noted that when facing multiple cages that execute the avoidance strategy, the avoidance strategy can be a strategy of synchronously controlling all cages for avoidance, or a strategy of separately controlling one or more different cages for avoidance, as long as the moving path of the target cage can be avoided, and no specific limitation is made here.
[0073] It should be noted that the target rotating node layer provided in this embodiment is not limited to being set on the bottom and top floors of the construction elevator room, but can also be set on the middle floor of the construction elevator room, or on any floor of the construction elevator room according to actual construction needs, and no specific limitation is made here.
[0074] In some embodiments, there are two elevator shafts each containing at least two elevator cages, and the number of elevator cages in each elevator shaft is the same. In this case, the elevator cage closest to the target floor in the two elevator shafts is selected as the target elevator cage. For details, please refer to Figure 5 , Figure 5 is a third flow chart of the construction elevator dispatching method provided by an embodiment of the present invention, such as Figure 5 As shown, the construction elevator scheduling method provided in this embodiment may also include steps 301 to 302;
[0075] Step 301, when each of the elevator shafts contains at least two elevator cages and the number of elevator cages in each of the elevator shafts is the same, determine the target elevator cage closest to the target floor in the two elevator shafts based on the position information of the elevator cages and the target floor position information of the target floor.
[0076] Among them, this embodiment also has the situation that there is a faulty elevator cage in the elevator shaft. At this time, the elevator cage closest to the target floor in the elevator shaft without the faulty elevator cage is selected as the target elevator cage. Specifically, the elevator shaft provided in this embodiment may include a first elevator shaft and a second elevator shaft, and when each of the elevator shafts contains at least two elevator cages and the number of the elevator cages in each of the elevator shafts is the same, the step of determining the target elevator cage closest to the target floor according to the position information of the elevator cage and the target floor position information of the target floor may specifically be: when the first elevator shaft and the second elevator shaft each contain at least two elevator cages and the number of the elevator cages in the first elevator shaft and the second elevator shaft is the same, the distance between each of the elevator cages in the first elevator shaft and the second elevator shaft and the target floor position information of the target floor is determined; when there is no faulty elevator cage in either the first elevator shaft or the second elevator shaft, the elevator cage closest to the target floor in the first elevator shaft and the second elevator shaft is determined as the target elevator cage; when there is a faulty elevator cage in the first elevator shaft, the elevator cage closest to the target floor in the second elevator shaft is determined as the target elevator cage.
[0077] Step 302, determining the scheduling strategy that takes the target cage as the execution object of the transport task as the target scheduling strategy.
[0078] After determining the target elevator cage, the scheduling strategy that takes the target elevator cage as the execution object of the transport task can be determined as the target scheduling strategy, so as to schedule the corresponding elevator cage to perform the transport task through the target scheduling strategy, so as to improve the transport efficiency of the transport task and reduce the waiting time required for the transport task.
[0079] For example, see Figure 6 , Figure 6 is a schematic diagram of a third scenario of determining a target scheduling strategy provided by an embodiment of the present invention, such as Figure 6 As shown in FIG. 1 , assuming that after receiving the transport task, it is detected that the number of elevator cages in the two elevator shafts is the same, the elevator cage closest to the target floor (1st floor) can be directly searched in the two elevator shafts, such as Figure 6 As shown, it can be concluded that cage 1 in the left elevator shaft is closest to the target floor (1st floor) and is 4 floors away, and cage 2 in the right elevator shaft is closest to the target floor (1st floor) and is 7 floors away, so cage 1 in the left elevator shaft can be determined as the target cage closest to the target floor (1st floor), and the strategy for scheduling cage 1 to perform the handling task (1st floor-60th floor) is determined as the target scheduling strategy. Then, the handling task is assigned to the target cage (cage 1), and the moving path from the target floor to the destination floor (moving path from 1st floor to 60th floor) is pre-occupied, and the avoidance strategy for other cages is determined based on the cage information of other cages, so as to control other cages to avoid the moving path of the target cage through the avoidance strategy, so that the target cage can complete the handling task.
[0080] In addition, when the number of cages contained in the two elevator shafts is the same, there are two cages in the two elevator shafts that are closest to the target floor (1st floor), and the distances between the two cages and the target floor (1st floor) are the same. At this time, according to the preset up and down rules, for example, the left elevator shaft is mainly used for the up movement of cages, and the right elevator shaft is mainly used for the down movement of cages, the cage closest to the target floor (1st floor) in the elevator shaft used for the down movement of cages can be selected as the target cage; or according to the usage of each cage in the current elevator shaft, for example, there are other cages in the elevator shaft that move to the target cage (moving path from 1st floor to 60th floor), or there are other cages that move out of the moving path of the target cage, at this time, the elevator shaft with a small number of cages that need to be actively controlled to avoid cages can be selected as the target elevator shaft, that is, the elevator shaft in which other cages are moving out of the moving path of the target cage as the target elevator shaft, and the cage closest to the target floor (1st floor) in the target elevator shaft can be selected as the target cage. Furthermore, there is a situation where there is a faulty cage in one side of the elevator shaft. In this case, the elevator shaft on the other side without the faulty cage can be directly used as the target elevator shaft, and the cage closest to the target floor (1st floor) in the target elevator shaft can be used as the target cage. After determining the target cage, the strategy of scheduling the target cage to perform the handling task (1st floor to 60th floor) is determined as the target scheduling strategy.
[0081] Step 103: Based on the target scheduling strategy, one or more elevator cages among the plurality of elevator cages are controlled to complete the transport task.
[0082] In this embodiment, since the A* algorithm cannot find a suitable target cage, and it is detected that there is no elevator shaft containing only one cage, that is, the elevator shaft where the determined target cage is located contains multiple cages, and there may be other cages on the path of the target cage to perform the handling task. Therefore, the target scheduling strategy provided in this embodiment can include not only a strategy for controlling the target cage to perform the handling task, but also an avoidance strategy for controlling non-target cages to avoid the moving path of the target cage. For details, please refer to Figure 7 , Figure 7 FIG. 1 is a flow chart of a method for controlling an elevator cage provided by an embodiment of the present invention. Figure 7 As shown, it includes step 401 to step 402;
[0083] Step 401: Based on the target scheduling strategy, determine the moving path of the target elevator cage to perform the transport task, and control the target elevator cage to perform the transport task according to the moving path.
[0084] After determining the target scheduling strategy, it is necessary to determine the moving path of the target elevator cage to perform the handling task, so that the handling task can be completed by controlling the target elevator cage according to the moving path.
[0085] Step 402: When there is a non-target elevator cage on the moving path, control the non-target elevator cage to move to a floor on the non-moving path and stop.
[0086] In this embodiment, the moving path provided by this embodiment may include an upward path and a downward path. Whether in the upward path or the downward path, there may be other non-target cages parked on the moving path. At this time, the target scheduling strategy provided by this embodiment also needs to include a scheduling strategy for controlling the non-target cages on the moving path. Specifically, the step of controlling the non-target cage to move to a floor on the non-moving path provided by this embodiment may be: when the non-target cage is on the ascending path of the target cage, the non-target cage is controlled to move upward to the floor of the non-moving path to park, or the non-target cage is controlled to move upward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path; when the non-target cage is on the descending path of the target cage, the non-target cage is controlled to move downward to the floor of the non-moving path to park, or the non-target cage is controlled to move downward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path.
[0087] In some embodiments, there may be a situation where there are multiple non-target cages parked on the moving path of the target cage. At this time, the present embodiment can control the non-target cages farthest from the target cage, farther from the target cage, and closest to the target cage in turn according to the distance, to move away from the target cage or to the nearest rotating node layer, so as to move to the non-moving path for parking, so as to avoid blocking the movement of the target cage.
[0088] For example, see Figure 8 , Figure 8 is a schematic diagram of controlling a non-target cage to move provided by an embodiment of the present invention, such as Figure 8 As shown, after the target elevator cage pre-occupies the moving path from the target floor to the destination floor (moving path from the 1st floor to the 60th floor), when a non-target elevator cage is detected in the target elevator shaft, as shown in FIG. Figure 8As shown, cage 1 is a cargo cage that performs the handling task, and the moving path of cage 1 is an upward path (moving path from the 1st floor to the 60th floor). Cage 4 (at the 15th floor) and cage 6 (at the 55th floor) exist in the upward path, so cage 4 and cage 6 are determined to be non-target cages, and according to the positions of cage 4 and cage 6, the positions where cage 4 and cage 6 can avoid the upward path of the target cage are found. At this time, the rotating joint layer of the 33rd floor can be found for cage 4 to switch the elevator shaft to avoid the upward path of the target cage, and cage 6 can move upward to floors above the 60th floor, such as the 66th or 70th floor to stop to avoid the upward path of the target cage. It should be noted that if the right elevator shaft of the rotating joint layer of the 33rd floor is occupied, cage 6 can be controlled to go up to the 70th floor and cage 4 can go up to the 65th floor.
[0089] In other embodiments, a non-target cage may already be parked in the elevator shaft on the other side of the target rotating node layer closest to the non-target cage. In this case, the present embodiment may first control the non-target cage parked at the target rotating node layer in the elevator shaft on the other side to move to a floor far away from the target rotating node layer for parking. For example, it may be controlled to move upward or downward, and the corresponding scheduling is performed according to the cage actually parked in the elevator shaft on the other side. As long as the non-target cage on the moving path of the target cage can be ensured to move to the non-moving path for parking, no specific limitation is made here.
[0090] For details, see Fig. 9 , Fig. 9 is another schematic diagram of controlling the movement of a non-target cage provided by an embodiment of the present invention, such as Fig. 9 As shown, assuming that there is a target cage 1 in the left elevator shaft that needs to move up to the 45th floor, and a target cage 5 in the right elevator shaft that needs to move down to the 1st floor, at this time, it is detected that there is a non-target cage 4 on the upward path of the left target cage 1, and it is detected that there are non-target cages 3 and non-target cages 2 on the downward path of the right target cage 5, then the rotating node layer can be found for conversion according to the distance between each non-target cage and the nearest rotating node layer. At this time, it can be determined that cage 3 is closest to the rotating node layer of the 33rd floor, and cage 2 is closest to the rotating node layer of the 1st floor, then cage 3 can be controlled to move to the rotating node layer of the 33rd floor and converted to the elevator shaft on the left, and based on the strategy of avoiding the moving path of the target cage (including the moving path of the target cage 1 and the target cage 5), it can move to the 53rd floor for docking, and then control cage 2 to move down to the rotating node layer of the 1st floor and convert to the elevator shaft on the left for docking; at the same time, based on avoiding the moving path of the target cage (including the moving path of the target cage 1 and the target cage 5), cage 4 is controlled to move up to the 50th floor for docking. In this way, both the target cage 1 and the target cage 5 can complete the corresponding handling tasks.
[0091] It should be noted that if the left elevator shaft of the rotating node layer on the 33rd floor is occupied, cage 2 is controlled to descend to the elevator shaft on the left and move upward to the 5th floor, and then cage 3 is controlled to follow cage 2 to descend to the 1st floor of the left elevator shaft, so as to avoid the moving path of target cage 1 and target cage 5 to perform the corresponding handling tasks, and complete the avoidance operation of the non-target cage.
[0092] At this point, the entire description of the construction elevator scheduling method provided in this embodiment is completed.
[0093] In summary, the construction elevator scheduling method provided by this embodiment is that the construction elevator is arranged in the construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to stop, at least one of the multiple parking floors is a rotating node layer, and the rotating node layer is used for the construction elevator to move horizontally to switch to different elevator shafts. The construction elevator includes multiple cages, and the method includes responding to the handling task triggered by the target floor, obtaining the current cage information of each cage, determining the target scheduling strategy based on the cage information and the target floor position information of the target floor, and controlling one or more cages of the multiple cages based on the target scheduling strategy to complete the handling task. The use of the embodiment of the present invention can reduce the moving path of the construction elevator, reduce the waiting time required for the handling task, and improve the handling efficiency of the handling task.
[0094] According to the method described in the above embodiment, this embodiment will be further described from the perspective of a construction elevator dispatching device. The construction elevator dispatching device can be implemented as an independent entity or integrated into an electronic device, such as a terminal. The terminal may include a mobile phone, a tablet computer, etc.
[0095] In order to solve the same technical problem, this embodiment also provides a construction elevator dispatching device, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to stop, at least one of the multiple parking floors is a rotating joint layer, the rotating joint layer is used for the construction elevator to move horizontally to switch to different elevator shafts, and the construction elevator includes multiple elevator cages. For details, please refer to Fig.10 , Fig.10 is a structural schematic diagram of a construction elevator dispatching device provided by an embodiment of the present invention, such as Fig.10 As shown, the construction elevator dispatching device 500 specifically includes: an acquisition module 501, a first determination module 502 and a control module 503;
[0096] The acquisition module 501 is used to acquire the current cage information of each cage in response to the transport task triggered by the target floor.
[0097] The first determination module 502 is used to determine a target scheduling strategy according to the elevator cage information and the target floor position information of the target floor.
[0098] In this embodiment, the cage information provided in this embodiment may include location information, and the first determination module 502 is specifically used to: based on the location information of the cage and the target floor location information of the target floor, determine the cage in the elevator shaft containing only one cage as the target cage; and determine the scheduling strategy that uses the target cage as the execution object of the transport task as the target scheduling strategy.
[0099] As an optional embodiment, the construction elevator dispatching device 500 provided in this embodiment may further include a second determination module, a third determination module, a fourth determination module and a fifth determination module;
[0100] Wherein, the second determination module is used to determine the target elevator shaft containing the least number of the elevator cages according to the position information of the elevator cages when each of the elevator shafts contains at least two of the elevator cages.
[0101] The third determination module is used to determine the target elevator cage closest to the target floor based on the position information of each elevator cage in the target elevator shaft and the target floor position information of the target floor.
[0102] The fourth determination module is used to determine the scheduling strategy with the target cage as the execution object of the transport task as the target scheduling strategy.
[0103] The fifth determination module is used to determine the target elevator cage closest to the target floor in the two elevator shafts according to the position information of the elevator cage and the target floor position information of the target floor, when each of the elevator shafts contains at least two elevator cages and the number of elevator cages in each of the elevator shafts is the same; and determine the scheduling strategy that takes the target elevator cage as the execution object of the transport task as the target scheduling strategy.
[0104] Specifically, the elevator shaft provided in this embodiment may include a first elevator shaft and a second elevator shaft, and the fifth determination module is specifically used to: when the first elevator shaft and the second elevator shaft both contain at least two elevator cages, and the number of elevator cages contained in the first elevator shaft and the second elevator shaft is the same, determine the distance between each elevator cage in the first elevator shaft and the second elevator shaft and the target floor position information of the target floor; when there is no faulty elevator cage in the first elevator shaft and the second elevator shaft, determine the elevator cage closest to the target floor in the first elevator shaft and the second elevator shaft as the target elevator cage; when there is a faulty elevator cage in the first elevator shaft, determine the elevator cage closest to the target floor in the second elevator shaft as the target elevator cage.
[0105] The control module 503 is used to control one or more of the plurality of elevator cages based on the target scheduling strategy to complete the transport task.
[0106] In this embodiment, the control module 503 provided in this embodiment is specifically used to: determine the moving path of the target elevator cage to perform the transport task based on the target scheduling strategy, and control the target elevator cage to perform the transport task according to the moving path; when there is a non-target elevator cage on the moving path, control the non-target elevator cage to move to the floor on the non-moving path and stop.
[0107] As an optional embodiment, the control module 503 provided in this embodiment is also specifically used for: when the non-target cage is on the ascending path of the target cage, controlling the non-target cage to move upward to the floor of the non-moving path to stop, or controlling the non-target cage to move upward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path; when the non-target cage is on the descending path of the target cage, controlling the non-target cage to move downward to the floor of the non-moving path to stop, or controlling the non-target cage to move downward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path.
[0108] During specific implementation, the above modules and / or units can be implemented as independent entities, or can be arbitrarily combined to be implemented as the same or several entities. The specific implementation of the above modules and / or units can refer to the previous method embodiments. The specific beneficial effects that can be achieved can also refer to the beneficial effects in the previous method embodiments, which will not be repeated here.
[0109] In addition, the embodiment of the present invention further provides a server, such as Fig.11As shown, it shows a schematic diagram of the structure of the server involved in the embodiment of the present invention, specifically:
[0110] The server may include one or more processing core processors 601, one or more computer-readable storage media memories 602, a power supply 603, an input unit 604 and other components. Those skilled in the art will appreciate that Fig.11 The server structure shown in the figure does not constitute a limitation on the server, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently. Among them:
[0111] The processor 601 is the control center of the server, and uses various interfaces and lines to connect various parts of the entire server. By running or executing software programs and / or modules stored in the memory 602, and calling data stored in the memory 602, the processor 601 performs various functions of the server and processes data, thereby monitoring the server as a whole. Optionally, the processor 601 may include one or more processing cores; preferably, the processor 601 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operation storage medium, user interface and application program, etc., and the modem processor mainly processes wireless communication. It is understandable that the above-mentioned modem processor may not be integrated into the processor 601.
[0112] The memory 602 can be used to store software programs and modules. The processor 601 executes various functional applications and data processing by running the software programs and modules stored in the memory 602. The memory 602 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating storage medium, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created according to the use of the server, etc. In addition, the memory 602 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 602 may also include a memory controller to provide the processor 601 with access to the memory 602.
[0113] The server also includes a power supply 603 for supplying power to each component. Preferably, the power supply 603 can be logically connected to the processor 601 through a power management storage medium, so as to manage charging, discharging, power consumption management and other functions through the power management storage medium. The power supply 603 can also include one or more DC or AC power supplies, recharge storage media, power failure detection circuits, power converters or inverters, power status indicators and other arbitrary components.
[0114] The server may further include an input unit 604, which may be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.
[0115] Although not shown, the server may further include a display unit, etc., which will not be described in detail herein. Specifically in this embodiment, the processor 601 in the server will load the executable files corresponding to the processes of one or more application programs into the memory 602 according to the following instructions, and the processor 601 will run the application programs stored in the memory 602, thereby realizing various functions, as follows:
[0116] In response to a handling task triggered by a target floor, current cage information of each cage is obtained; a target scheduling strategy is determined based on the cage information and the target floor position information of the target floor; based on the target scheduling strategy, one or more cages among the multiple cages are controlled to complete the handling task.
[0117] A person of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.
[0118] To this end, an embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored. The computer program is loaded by a processor to execute the steps in any one of the construction elevator scheduling methods provided by the embodiment of the present invention. For example, the computer program can be loaded by a processor to execute the following steps:
[0119] In response to a handling task triggered by a target floor, current cage information of each cage is obtained; a target scheduling strategy is determined based on the cage information and the target floor position information of the target floor; based on the target scheduling strategy, one or more cages among the multiple cages are controlled to complete the handling task.
[0120] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.
[0121] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0122] Since the computer program stored in the computer-readable storage medium can execute the steps in any one of the construction elevator scheduling methods provided in the embodiments of the present invention, the beneficial effects that can be achieved by any one of the construction elevator scheduling methods provided in the embodiments of the present invention can be achieved. Please refer to the previous embodiments for details and will not be repeated here.
[0123] The above is a detailed introduction to a construction elevator scheduling method, device, server and storage medium provided in an embodiment of the present invention. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for technical personnel in this field, according to the idea of the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.
Claims
1. A construction elevator dispatching method, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to stop, at least one of the multiple parking floors is a rotating node layer, the rotating node layer is used for the construction elevator to move horizontally to switch to different elevator shafts, the construction elevator includes multiple elevator cages, characterized in that: The construction elevator dispatching method comprises: In response to a transport task triggered by a target floor, obtaining current cage information of each cage; Determining a target scheduling strategy according to the cage information and the target floor position information of the target floor; Based on the target scheduling strategy, one or more of the plurality of elevator cages are controlled to complete the transport task.
2. The construction elevator dispatching method according to claim 1, characterized in that: The cage information includes location information, and the step of determining a target scheduling strategy according to the cage information and the target floor location information of the target floor includes: According to the position information of the cage and the target floor position information of the target floor, a cage in the elevator shaft containing only one cage is used as a target cage; The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
3. The construction elevator dispatching method according to claim 2, characterized in that: The method further comprises: In the case where each of the elevator shafts contains at least two elevator cages, determining the target elevator shaft containing the least number of elevator cages according to the position information of the elevator cages; Determine the target elevator cage closest to the target floor according to the position information of each elevator cage in the target elevator shaft and the target floor position information of the target floor; The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
4. The construction elevator dispatching method according to claim 2, characterized in that: The method further comprises: When each of the elevator shafts contains at least two elevator cages and the number of the elevator cages in each of the elevator shafts is the same, according to the position information of the elevator cages and the target floor position information of the target floor, determining the target elevator cage closest to the target floor in the two elevator shafts; The scheduling strategy that takes the target cage as the execution object of the transport task is determined as the target scheduling strategy.
5. The construction elevator dispatching method according to claim 4, characterized in that: The elevator shaft includes a first elevator shaft and a second elevator shaft, and when each of the elevator shafts contains at least two elevator cages and the number of elevator cages in each of the elevator shafts is the same, the step of determining the target elevator cage closest to the target floor according to the position information of the elevator cage and the target floor position information of the target floor comprises: When both the first elevator shaft and the second elevator shaft contain at least two elevator cages, and the number of elevator cages in the first elevator shaft and the number of elevator cages in the second elevator shaft are the same, determining the distance between each of the elevator cages in the first elevator shaft and the second elevator shaft and the target floor position information of the target floor; In the case that there is no faulty elevator cage in the first elevator shaft and the second elevator shaft, determining the elevator cage closest to the target floor in the first elevator shaft and the second elevator shaft as the target elevator cage; In the event that there is a faulty cage in the first elevator shaft, the cage in the second elevator shaft that is closest to the target floor is determined as the target cage.
6. The construction elevator dispatching method according to claim 2, characterized in that: The step of controlling one or more of the plurality of elevator cages based on the target scheduling strategy to complete the handling task includes: Based on the target scheduling strategy, determine the moving path of the target elevator cage to perform the handling task, and control the target elevator cage to perform the handling task according to the moving path; In the case where there is a non-target elevator cage on the moving path, the non-target elevator cage is controlled to move to a floor on the non-moving path and stop.
7. The construction elevator dispatching method according to claim 6, characterized in that: The step of controlling the non-target elevator cage to move to a floor on the non-moving path and stop comprises: In the case where the non-target cage is located on the ascending path of the target cage, the non-target cage is controlled to move upward to a floor of the non-moving path to stop, or the non-target cage is controlled to move upward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path; When the non-target cage is on the descending path of the target cage, the non-target cage is controlled to move downward to the floor of the non-moving path to stop, or the non-target cage is controlled to move downward to the nearest rotating node layer to switch to the elevator shaft on the non-moving path.
8. A construction elevator dispatching device, wherein the construction elevator is arranged in a construction elevator room, the construction elevator room has at least two elevator shafts for the construction elevator to ascend and descend, the construction elevator room has multiple parking floors for the construction elevator to stop, at least one of the multiple parking floors is a rotating node layer, the rotating node layer is used for the construction elevator to move horizontally to switch to different elevator shafts, the construction elevator includes multiple elevator cages, characterized in that: The construction elevator dispatching device comprises: An acquisition module, for acquiring the current cage information of each cage in response to a handling task triggered by a target floor; A first determination module is used to determine a target scheduling strategy according to the elevator cage information and the target floor position information of the target floor; A control module is used to control one or more of the plurality of elevator cages based on the target scheduling strategy to complete the handling task.
9. A server, characterized in that: The invention comprises a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor performs the following steps: In response to a transport task triggered by a target floor, obtaining current cage information of each cage; Determining a target scheduling strategy according to the cage information and the target floor position information of the target floor; Based on the target scheduling strategy, one or more of the plurality of elevator cages are controlled to complete the transport task.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein when the computer program is executed, the device where the computer-readable storage medium is located is controlled to execute the steps in the construction elevator scheduling method according to any one of claims 1 to 7.