CN113159611A - Elevator dispatching method, device and equipment based on prediction model and storage medium - Google Patents
Elevator dispatching method, device and equipment based on prediction model and storage medium Download PDFInfo
- Publication number
- CN113159611A CN113159611A CN202110495803.9A CN202110495803A CN113159611A CN 113159611 A CN113159611 A CN 113159611A CN 202110495803 A CN202110495803 A CN 202110495803A CN 113159611 A CN113159611 A CN 113159611A
- Authority
- CN
- China
- Prior art keywords
- connection point
- elevator
- task
- information
- 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 37
- 230000033001 locomotion Effects 0.000 claims abstract description 15
- 230000001133 acceleration Effects 0.000 claims description 11
- 238000006073 displacement reaction Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 6
- 238000003032 molecular docking Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005034 decoration Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Abstract
The invention relates to a prediction model-based elevator scheduling method, a prediction model-based elevator scheduling device, an elevator scheduling device and a storage medium, wherein the prediction model-based elevator scheduling method comprises the following steps: acquiring information of a connection point of the elevator on a preset path; determining the time consumed by the preset task on the connection points corresponding to each connection point information to reach the connection points one by one; determining the operation time of the elevator reaching each connection point respectively according to the connection point information and the attribute information of the elevator; and determining and executing the actual running path of the elevator according to the task time consumption and the running time. The elevator scheduling method based on the prediction model combines the operation characteristics of the elevator with the cargo scheduling tasks of the connection points on the preset path, selects the unidirectional operation path of the elevator according to the specific situations of cargo scheduling on a series of connection points, avoids the reciprocating motion of the elevator in a total scheduling task, and effectively improves the scheduling efficiency.
Description
Technical Field
The invention relates to the technical field of intelligent logistics equipment control, in particular to a prediction model-based elevator scheduling method, device, equipment and storage medium.
Background
The elevator is widely applied to the intelligent warehouse logistics scene, particularly to the application scene of a vertical warehouse. In the vertical warehouse scene, the elevator mainly sends commodities or trolleys to the connecting port of another layer from the connecting port of a certain layer, plays the transfer and connection work of containers or carrying tools, and the execution speed of the elevator can directly influence the whole logistics operation efficiency.
At present, the motion control of a mainstream elevator is controlled based on a PLC, the motion minimum instruction of the elevator is from one point location to another point location, and the execution process is not interrupted after the instruction is executed. Generally, an instruction is generated and dispatched by an upper-layer system based on a certain scheduling algorithm according to the task state of a service. The current mainstream scheduling algorithm is mainly calculated according to the service task and the real-time state of the connection port. However, in the process of executing tasks by the elevator, a multi-order task is often involved, the elevator cannot be considered comprehensively, and the next order is scheduled after a certain order is scheduled, and the repetition of the operation path of the elevator is generated in the process, so that the scheduling efficiency is influenced.
Disclosure of Invention
In view of the above, it is necessary to provide a method, an apparatus, a device and a storage medium for elevator scheduling based on a prediction model for addressing at least one of the above-mentioned problems.
In a first aspect, the present application provides a method for scheduling a hoist based on a prediction model, including the following steps:
acquiring information of a connection point of the elevator on a preset path;
determining the time consumed for the preset task on each connection point corresponding to the connection point information to reach the connection point one by one;
determining the operation time of the hoisting machine reaching each connection point respectively according to the connection point information and the attribute information of the hoisting machine;
and determining and executing the actual running path of the hoister according to the task time consumption and the running time length.
In certain implementations of the first aspect, the step of obtaining the information of the connection point of the elevator on the preset path includes:
acquiring task information corresponding to a preset task on each connection point;
and deleting the information of the connection point corresponding to the connection point with the empty task information.
With reference to the first aspect and the foregoing implementation manners, in some implementation manners of the first aspect, the step of determining, one by one, a task time consumed by a preset task on the connection point corresponding to each piece of the connection point information to reach the connection point includes:
determining starting point position information corresponding to the preset task and the movement beat of the preset task;
and determining the time consumed by each preset task to reach the connection point according to the starting point position information and the movement beat.
With reference to the first aspect and the foregoing implementation manners, in some implementation manners of the first aspect, the attribute information of the hoisting machine includes a maximum speed, a maximum acceleration, and a displacement between the hoisting machine and each of the docking points; the step of determining the operation time of the elevator reaching each of the connection points includes:
and determining the running time of the hoister from the initial position to each connection point according to the maximum speed, the maximum acceleration and the displacement.
With reference to the first aspect and the foregoing implementation manners, in some implementation manners of the first aspect, the determining and executing the actual operation path of the elevator includes:
and when the task time of the preset task reaching the connection points is less than or equal to the running time of the hoister reaching each connection point, taking the connection points as the connection points in the actual running path.
In a second aspect, the present application provides a device for dispatching a hoist based on a prediction model, including:
the acquisition module is used for acquiring the information of the connection point of the hoister on a preset path;
the first timing module is used for determining the time consumed by a preset task on each connection point corresponding to the connection point information to reach the connection point one by one;
the second timing module is used for determining the operation time of the hoisting machine reaching each connection point according to the connection point information and the attribute information of the hoisting machine;
and the execution module is used for determining and executing the actual operation path of the hoister according to the task time consumption and the operation duration.
In a third aspect, the present application provides an elevator dispatching device, including:
one or more processors;
a memory;
one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to: the elevator dispatching method based on the prediction model described in the first aspect of the present application is executed.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the method for elevator scheduling based on prediction models described in the first aspect of the present application.
The technical scheme provided by the embodiment of the invention has the following beneficial technical effects:
the elevator scheduling method based on the prediction model combines the operation characteristics of the elevator with the cargo scheduling tasks of the connection points on the preset path, selects the unidirectional operation path of the elevator according to the specific situations of cargo scheduling on a series of connection points, avoids the reciprocating motion of the elevator in a total scheduling task, and effectively improves the scheduling efficiency.
Additional aspects and advantages of the present invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flowchart illustrating a method for elevator scheduling based on a prediction model according to an embodiment of the present invention;
FIG. 2 is a schematic structural framework diagram of a predictive model-based elevator dispatching device according to an embodiment of the present application;
fig. 3 is a schematic structural framework diagram of an elevator dispatching device in an embodiment of the present invention.
Detailed Description
To facilitate an understanding of the invention, the invention will now be described more fully with reference to the accompanying drawings. Possible embodiments of the invention are given in the figures. The invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein by the accompanying drawings. The embodiments described by way of reference to the drawings are illustrative for the purpose of providing a more thorough understanding of the present disclosure and are not to be construed as limiting the present invention. Furthermore, if a detailed description of known technologies is not necessary for illustrating the features of the present invention, such technical details may be omitted.
It will be understood by those skilled in the relevant art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It is to be understood that the term "and/or" as used herein is intended to include all or any and all combinations of one or more of the associated listed items.
The technical solution of the present invention and how to solve the above technical problems will be described in detail with specific examples.
The embodiment of the first aspect of the present application provides a method for dispatching a hoist based on a prediction model, as shown in fig. 1, including the following steps:
s100: and acquiring information of a connection point of the elevator on a preset path. The elevator usually runs in a vertical warehouse for storing goods, the starting point is often the end point of the goods conveying mechanism in the vertical warehouse, the elevator picks up the goods from the goods conveying mechanism and then puts the goods into a vertical warehouse connection point corresponding to the goods order, and then other equipment further stores the goods to a specific position in the connection point. Theoretically, all paths that the elevator can travel belong to preset paths, and the specific setting conditions are different and may be different. The information of the connection point generally includes the coordinate position of the connection point in the vertical warehouse, the storage space allowance of the vertical warehouse where the connection point is located, and the like.
S200: and determining the time consumed by the tasks of the preset tasks to reach the connection points on the connection points corresponding to the information of each connection point one by one. When the elevator runs, the sequence exists, and the elevator can continue to move to the second connection point after the elevator reaches the first connection point and finishes the scheduling task corresponding to the first connection point. When the elevator runs to the first connection point or performs a scheduling task on the first connection point, it is likely that the goods in the vertical warehouse corresponding to the second connection point do not reach the second connection point, and in order to avoid missing or waiting for the goods, it is necessary to first determine a preset task on each connection point, that is, it is time-consuming for the goods to reach the connection point from the storage location. For the connection points with preset tasks, the respective tasks are time-consuming.
S300: and determining the operation time of the elevator reaching each connection point respectively according to the connection point information and the attribute information of the elevator. As above, the operation of the hoisting machine between the access points is sequential, and therefore, the operation time period for determining the arrival of the hoisting machine at each access point needs to be calculated. Optionally, the receiving and releasing time of the elevator at each connection point may be taken into consideration, and when the operating time of the next connection point is calculated, the receiving and releasing time of the elevator at the previous connection point needs to be added, so as to implement more accurate scheduling control. In addition, in this embodiment, in S200 and S300 of the elevator dispatching method provided by the present application, an execution order of S200 before and S300 after is adopted, and actually in other embodiments, the execution orders of the two may be reversed.
S400: and determining and executing the actual running path of the elevator according to the task time consumption and the running time. After calculating the task time consumption of all possible preset tasks in a certain total scheduling task and the operation time of the elevator, screening the total scheduling task according to certain conditions, selecting the connection points which meet the unidirectional operation condition of the elevator, and sequentially operating the elevator according to the position relation among the connection points, namely obtaining the actual operation path of the elevator, wherein the scheduling system of the elevator starts the elevator to execute the scheduling task according to the actual operation path, so that the one-time non-reciprocating scheduling of goods is realized.
The elevator scheduling method based on the prediction model combines the operation characteristics of the elevator with the cargo scheduling tasks of the connection points on the preset path, selects the unidirectional operation path of the elevator according to the specific situations of cargo scheduling on a series of connection points, avoids the reciprocating motion of the elevator in a total scheduling task, and effectively improves the scheduling efficiency.
Optionally, in some implementations of embodiments of the first aspect of the present application, after the step of obtaining information of a connection point of the elevator on a preset path, the method includes: and acquiring task information corresponding to the preset task on each connection point. And deleting the information of the access point corresponding to the access point with empty task information. According to the above description, the elevator may go to a plurality of connection points, but not all the connection points have scheduling tasks, so as to avoid the waste of computing resources and improve the computing efficiency, before computing the running time and the task time consumption, if it is found that the preset task does not exist in the conveying line on a certain connection point, the connection point is filtered.
Optionally, in some implementation manners of the embodiment of the first aspect of the present application, the step of determining, one by one, a task time consumed by the preset task on the connection point corresponding to each piece of connection point information to reach the connection point includes:
and determining starting point position information corresponding to the preset task and the movement beat of the preset task.
And determining the time consumed by each preset task to reach the connection point according to the starting point position information and the movement beat.
The task time consumption corresponding to the preset task at each connection point is actually determined by at least two variable factors, wherein one variable factor is the specific position of the goods corresponding to the preset task in the vertical warehouse, and the other variable factor is the movement beat of the transportation line of the goods in the vertical warehouse, namely the advancing rate of the transportation equipment on the transportation line. In practice, the travel rate is not uniform, but is achieved through a series of acceleration, uniform and deceleration processes. The same applies to the running mode of the hoister. The motion tempo of the preset task is the moving speed of the goods corresponding to the preset task.
Optionally, in some implementations of embodiments of the first aspect of the present application, the attribute information of the hoisting machine includes a maximum speed and a maximum acceleration of the hoisting machine, and displacements between the hoisting machine and each of the connection points;
and determining the running time of the elevator from the initial position to each connection point according to the maximum speed, the maximum acceleration and the displacement. According to the basic knowledge of physics, under the condition that the speed and the acceleration of the moving object are available, the time consumed by the moving object after certain displacement can be obtained, and after the maximum speed and the maximum acceleration of the hoister and the displacement between the hoister and each connection point, the running time consumed by the hoister to reach each connection point can be calculated.
Optionally, in some implementations of embodiments of the first aspect of the present application, the determining and executing steps include:
and when the time consumed by the preset task for reaching the connection point is less than or equal to the running time of the elevator for respectively reaching each connection point, taking the connection point as the connection point in the actual running path. After the running time of the hoister is compared with the time consumed by each preset task to reach the corresponding connecting point, if the task time is less than or equal to the running time, the fact that the goods corresponding to the preset task reach the connecting point before the hoister, the goods from the preset task can be directly loaded after the hoister runs to the connecting point, or the goods on the hoister are unloaded into transportation equipment (usually a transportation box or a four-way shuttle car and the like) corresponding to the preset task. The connection points with the task time consumption longer than the operation time are eliminated, and are not counted into a certain round of total scheduling tasks, so that the condition that the elevator waits for the preset tasks is avoided, and the operation efficiency of the elevator is reduced.
In a second aspect, an embodiment of the present application provides a prediction model-based elevator dispatching device 10, as shown in fig. 2, including an obtaining module 11, a first timing module 12, a second timing module 13, and an executing module 14.
The obtaining module 11 is configured to obtain information of a connection point of the elevator on a preset path. The first timing module 12 is configured to determine task time consumed when a preset task reaches a connection point on the connection point corresponding to each connection point information one by one. The second timing module 13 is configured to determine, according to the information of the connection points and the attribute information of the hoisting machine, an operation time for the hoisting machine to reach each connection point. And the execution module 14 is used for determining and executing the actual operation path of the hoister according to the task time consumption and the operation time length.
Through the elevator dispatching device 10 based on the prediction model, the unidirectional running path of the elevator can be selected according to the specific situations of cargo dispatching on a series of connection points, the elevator is prevented from reciprocating in a total dispatching task, and the dispatching efficiency is effectively improved.
Optionally, after the step of obtaining the information of the connection point of the hoist on the preset path, the obtaining module 11 includes: acquiring task information corresponding to a preset task on each connection point; and deleting the information of the access point corresponding to the access point with empty task information.
Optionally, the step of determining, by the first timing module 12, the task time consumed by the preset task to reach the connection point on the connection point corresponding to each piece of connection point information one by one includes:
determining starting point position information corresponding to a preset task and a motion beat of the preset task;
and determining the time consumed by each preset task to reach the connection point according to the starting point position information and the movement beat.
Optionally, the attribute information of the hoist includes a maximum speed, a maximum acceleration of the hoist, and a displacement between the hoist and each of the docking points. The step of determining the operation duration when the elevator reaches each connection point respectively by the second timing module 13 specifically includes: and determining the running time of the elevator from the initial position to each connection point according to the maximum speed, the maximum acceleration and the displacement.
Optionally, the step of determining and executing the actual operation path of the elevator by the execution module 14 includes:
and when the time consumed by the preset task for reaching the connection point is less than or equal to the running time of the elevator for respectively reaching each connection point, taking the connection point as the connection point in the actual running path.
Based on the same technical concept, an embodiment of a third aspect of the present application provides an elevator dispatching device, including:
one or more processors;
a memory;
one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to: the elevator dispatching method based on the prediction model described in the first aspect of the present application is executed.
Those skilled in the art will appreciate that the elevator dispatching apparatus provided by embodiments of the present invention may be specially designed and manufactured for the required purposes, or may comprise known apparatus found in general purpose computers. These devices have stored therein computer programs that are selectively activated or reconfigured. Such a computer program may be stored in a device (e.g., computer) readable medium or in any type of medium suitable for storing electronic instructions and respectively coupled to a bus.
Compared with the prior art, the method has the following beneficial technical effects: after the elevator dispatching equipment executes the elevator dispatching method based on the prediction model, the unidirectional running path of the elevator can be selected according to the specific situations of cargo dispatching on a series of connection points, the elevator is prevented from reciprocating in a total dispatching task, and the dispatching efficiency is effectively improved.
In an alternative embodiment, the present invention provides a dispatching device for elevator, as shown in fig. 3, the dispatching device 1000 for elevator shown in fig. 3 includes: a processor 1001 and a memory 1003. The processor 1001 and the memory 1003 are electrically coupled, such as by a bus 1002.
The Processor 1001 may be a CPU (Central Processing Unit), a general-purpose Processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field-Programmable Gate Array) or other Programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 1001 may also be a combination of computing functions, e.g., comprising one or more microprocessors, DSPs and microprocessors, and the like.
The Memory 1003 may be a ROM (Read-Only Memory) or other type of static storage device that can store static information and instructions, a RAM (random access Memory) or other type of dynamic storage device that can store information and instructions, an EEPROM (Electrically Erasable Programmable Read-Only Memory), a CD-ROM (Compact Disc Read-Only Memory) or other optical Disc storage, optical Disc storage (including Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), a magnetic Disc storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these.
Optionally, the elevator dispatching apparatus 1000 may further include a transceiver 1004. The transceiver 1004 may be used for reception and transmission of signals. The transceiver 1004 may allow the elevator dispatching device 1000 to communicate wirelessly or wiredly with other devices to exchange data. It should be noted that the transceiver 1004 is not limited to one in practical application.
Optionally, the elevator dispatching apparatus 1000 may further include an input unit 1005. The input unit 1005 may be used to receive input numeric, character, image and/or sound information or to generate key signal inputs related to user settings and function control of the elevator dispatching apparatus 1000. The input unit 1005 may include, but is not limited to, one or more of a touch screen, a physical keyboard, function keys (such as volume control keys, switch keys, etc.), a trackball, a mouse, a joystick, a camera, a microphone, and the like.
Optionally, the elevator dispatching apparatus 1000 may further include an output unit 1006. Output unit 1006 may be used to output or show information processed by processor 1001. The output unit 1006 may include, but is not limited to, one or more of a display device, a speaker, a vibration device, and the like.
While fig. 3 illustrates the elevator dispatching apparatus 1000 having various devices, it is to be understood that not all of the illustrated devices are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
Optionally, the memory 1003 is used for storing application program codes for implementing the present invention, and the processor 1001 controls the execution. The processor 1001 is configured to execute the application program codes stored in the memory 1003, so as to implement any one of the elevator scheduling methods provided by the embodiments of the present invention.
Based on the same inventive concept, an embodiment of a fourth aspect of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the prediction model-based elevator scheduling method described in the first aspect of the present application.
Those of skill in the art will appreciate that the various operations, methods, steps in the processes, acts, or solutions discussed in this application can be interchanged, modified, combined, or eliminated. Further, other steps, measures, or schemes in various operations, methods, or flows that have been discussed in this application can be alternated, altered, rearranged, broken down, combined, or deleted. Further, steps, measures, schemes in the prior art having various operations, methods, procedures disclosed in the present application may also be alternated, modified, rearranged, decomposed, combined, or deleted.
The terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present application, "a plurality" means two or more unless otherwise specified.
It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least a portion of the steps in the flow chart of the figure may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
The foregoing is only a partial embodiment of the present application, and it should be noted that, for those skilled in the art, several modifications and decorations can be made without departing from the principle of the present application, and these modifications and decorations should also be regarded as the protection scope of the present application.
Claims (8)
1. A hoisting machine scheduling method based on a prediction model is characterized by comprising the following steps:
acquiring information of a connection point of the elevator on a preset path;
determining the time consumed for the preset task on each connection point corresponding to the connection point information to reach the connection point one by one;
determining the operation time of the hoisting machine reaching each connection point respectively according to the connection point information and the attribute information of the hoisting machine;
and determining and executing the actual running path of the hoister according to the task time consumption and the running time length.
2. The method for dispatching the elevators as claimed in claim 1, wherein the step of obtaining the information of the contact points of the elevators on the preset path is followed by the steps of:
acquiring task information corresponding to a preset task on each connection point;
and deleting the information of the connection point corresponding to the connection point with the empty task information.
3. The method for dispatching the elevators as defined in claim 1, wherein the step of determining one by one a task time taken for the preset task at the connection point to reach the connection point on the connection point corresponding to each piece of the connection point information comprises:
determining starting point position information corresponding to the preset task and the movement beat of the preset task;
and determining the time consumed by each preset task to reach the connection point according to the starting point position information and the movement beat.
4. The elevator dispatching method as claimed in claim 1, wherein the attribute information of the elevator comprises maximum speed, maximum acceleration and displacement between the elevator and each of the docking points; the step of determining the operation time of the elevator reaching each of the connection points includes:
and determining the running time of the hoister from the initial position to each connection point according to the maximum speed, the maximum acceleration and the displacement.
5. The elevator dispatching method as claimed in claim 1, wherein the step of determining and executing the actual travel path of the elevator comprises:
and when the task time of the preset task reaching the connection points is less than or equal to the running time of the hoister reaching each connection point, taking the connection points as the connection points in the actual running path.
6. A hoist scheduling device based on a prediction model is characterized by comprising:
the acquisition module is used for acquiring the information of the connection point of the hoister on a preset path;
the first timing module is used for determining the time consumed by a preset task on each connection point corresponding to the connection point information to reach the connection point one by one;
the second timing module is used for determining the operation time of the hoisting machine reaching each connection point according to the connection point information and the attribute information of the hoisting machine;
and the execution module is used for determining and executing the actual operation path of the hoister according to the task time consumption and the operation duration.
7. An elevator dispatching apparatus, comprising:
one or more processors;
a memory;
one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to: executing the prediction model based elevator dispatching method according to any one of claims 1-5.
8. A computer-readable storage medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the prediction model-based elevator scheduling method of any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110495803.9A CN113159611A (en) | 2021-05-07 | 2021-05-07 | Elevator dispatching method, device and equipment based on prediction model and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110495803.9A CN113159611A (en) | 2021-05-07 | 2021-05-07 | Elevator dispatching method, device and equipment based on prediction model and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113159611A true CN113159611A (en) | 2021-07-23 |
Family
ID=76873638
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110495803.9A Pending CN113159611A (en) | 2021-05-07 | 2021-05-07 | Elevator dispatching method, device and equipment based on prediction model and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113159611A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113837660A (en) * | 2021-10-21 | 2021-12-24 | 上海欧冶物流股份有限公司 | Driving scheduling method, medium and electronic equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
| US20170185085A1 (en) * | 2015-12-23 | 2017-06-29 | Lior Storfer | Navigating semi-autonomous mobile robots |
| CN108357848A (en) * | 2018-03-15 | 2018-08-03 | 山东大学 | Modeling optimization method based on Multilayer shuttle car automated storage and retrieval system |
| CN108960593A (en) * | 2018-06-20 | 2018-12-07 | 山东大学 | Task ranking optimization method and system based on cross-layer shuttle system |
| CN110414730A (en) * | 2019-07-22 | 2019-11-05 | 北京三快在线科技有限公司 | A kind of method and device of determining logistics distribution strategy |
| CN112415953A (en) * | 2019-08-23 | 2021-02-26 | 北京京东乾石科技有限公司 | Elevator dispatching method and device |
| CN112687115A (en) * | 2021-03-16 | 2021-04-20 | 长沙理工大学 | Method for controlling crossing of road between running path and road section of automatic pedestrian-driven connection vehicle |
-
2021
- 2021-05-07 CN CN202110495803.9A patent/CN113159611A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
| US20170185085A1 (en) * | 2015-12-23 | 2017-06-29 | Lior Storfer | Navigating semi-autonomous mobile robots |
| CN108357848A (en) * | 2018-03-15 | 2018-08-03 | 山东大学 | Modeling optimization method based on Multilayer shuttle car automated storage and retrieval system |
| CN108960593A (en) * | 2018-06-20 | 2018-12-07 | 山东大学 | Task ranking optimization method and system based on cross-layer shuttle system |
| CN110414730A (en) * | 2019-07-22 | 2019-11-05 | 北京三快在线科技有限公司 | A kind of method and device of determining logistics distribution strategy |
| CN112415953A (en) * | 2019-08-23 | 2021-02-26 | 北京京东乾石科技有限公司 | Elevator dispatching method and device |
| CN112687115A (en) * | 2021-03-16 | 2021-04-20 | 长沙理工大学 | Method for controlling crossing of road between running path and road section of automatic pedestrian-driven connection vehicle |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113837660A (en) * | 2021-10-21 | 2021-12-24 | 上海欧冶物流股份有限公司 | Driving scheduling method, medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gajsek et al. | Using maturity model and discrete-event simulation for industry 4.0 implementation | |
| Hamzadayi et al. | Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times | |
| EP3256915B1 (en) | Extending a programmable logic controller with apps | |
| JP2020074099A (en) | Processing apparatus and processing method | |
| KR102251316B1 (en) | Reinforcement learning and simulation based dispatching method within a factory, and an apparatus thereof | |
| CN110489213A (en) | A kind of task processing method and processing unit, computer system | |
| Lei et al. | Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times | |
| CN113159611A (en) | Elevator dispatching method, device and equipment based on prediction model and storage medium | |
| Feng et al. | Cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints | |
| CN116257345A (en) | Deep learning task scheduling method and device | |
| CN113592203A (en) | Intelligent optimization method and system for production operation scheduling of pressure sensor | |
| CN111815032A (en) | Automatic guided vehicle scheduling method and related device thereof | |
| Zhang et al. | A Q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation | |
| CN116957299B (en) | Optimized scheduling method, system, equipment and medium for composite orders of automated warehouse | |
| Zeng et al. | A method integrating simulation and reinforcement learning for operation scheduling in container terminals | |
| CN112415953B (en) | Scheduling method and device of elevator | |
| CN115061436A (en) | Dynamic scheduling method, system, electronic device and computer storage medium | |
| CN111274667B (en) | Cross-scale material computing software integrated computing system and method | |
| CN115908621A (en) | Petri network-based container terminal ship operation rehearsal method and device and readable medium | |
| CN116703047A (en) | Task allocation method, system and medium based on deep reinforcement learning | |
| Ahn et al. | A Branch and Bound Algorithm for Scheduling of Flexible Manufacturing Systems | |
| CN112906081A (en) | Method and device for planning warehouse layout | |
| Batur et al. | Using simulated annealing for flexible robotic cell scheduling | |
| CN113094155A (en) | Task scheduling method and device under Hadoop platform | |
| JP2020030539A (en) | Working vehicle determination device and working vehicle determination method |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210723 |