Scheduling method, system and equipment between vehicles, medium and product
By obtaining information about the full barrel of the roving machine and the empty barrel of the roving machine in the cotton mill, determining the vehicle status and queuing to perform the scheduling tasks, the problems of high labor intensity and low scheduling efficiency caused by manual transportation in the scheduling tube conveying process are solved. It realizes efficient automation of the tampon conveying system and effective utilization of resources.
Patent Information
- Application Number
- CN202411303651.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-19
- Publication Date
- 2025-01-03
AI Technical Summary
In cotton mills, the process of conveying cotton cylinders relies on manual transportation, resulting in high labor intensity and high labor costs, and the scheduling efficiency of AGV trolleys is low and resource waste is serious.
By obtaining the full barrel information of the roving machine and the empty barrel information of the roving machine, determining the operating status of the vehicle, queuing up to process the scheduling tasks in the busy state, and executing the scheduling tasks after the vehicle is idle, generating scheduling instructions to execute the delivery task, and passing through the mother car and the child The wireless communication of the vehicle realizes efficient conveying of the tampon cylinder.
The transportation efficiency of tampon tubes is improved, the waste of scheduling resources is avoided, and the automation and efficiency of tampon tube transportation system is realized.
Smart Images
Figure CN119250428A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of vehicle dispatching, and in particular to a method, system, device, medium and product for dispatching vehicles. Background Art
[0002] In the process of conveying sliver cans between the drawing frame process and the roving frame process in a cotton spinning mill, the conveying of sliver cans is entirely dependent on manual transportation, which has disadvantages such as high labor intensity and high labor costs.
[0003] As an effective means of contemporary logistics processing automation and a key equipment of flexible manufacturing systems, logistics transportation systems with AGV (Automated Guided Vehicle) and other intelligent transportation vehicles as the core have been increasingly widely used. Based on this, in order to solve the above-mentioned problems, AGV vehicles are generally used for strip can transportation. However, in the actual application process of cotton spinning mills, there is a lack of reasonable scheduling of AGV vehicles, resulting in low transportation efficiency and waste of AGV vehicle scheduling resources. Summary of the invention
[0004] In order to solve the above-mentioned problems existing in the prior art, the present application provides a method, system, device, medium and product for scheduling between vehicles.
[0005] To achieve the above objectives, this application provides the following solutions:
[0006] In a first aspect, the present application provides a method for dispatching vehicles, which is applied to a sliver can conveying system; the method for dispatching vehicles comprises:
[0007] Obtaining a scheduling task; the scheduling task includes full bobbin information of a draw frame and empty bobbin information of a roving frame;
[0008] Determining an operating state of a vehicle; the vehicle is used to load sliver cans;
[0009] When the running state of the vehicle is a busy state, the scheduling tasks are queued to obtain a task queue;
[0010] Returning to the step of determining the running status of the vehicle, until it is determined that there is a vehicle whose running status is an idle state, the scheduling tasks in the task queue are executed in sequence;
[0011] When the running state of the vehicle is an idle state, a scheduling instruction is generated, and the vehicle performs the scheduling task based on the scheduling instruction.
[0012] Optionally, executing the scheduled tasks in the task queue in sequence specifically includes:
[0013] Real-time detection of the number of sliver cans in the transport area; the transport area is an area at the drawing frame position for placing empty sliver cans or an area at the roving frame position for placing full sliver cans;
[0014] When the number of the sliver cans reaches the set number, the current scheduling task is exited and the next scheduling task in the task queue is executed.
[0015] In a second aspect, the present application provides a dispatching system between vehicles, and the dispatching system between vehicles is applied to a sliver can conveying system; the sliver can conveying system includes a mother vehicle and a child vehicle; the dispatching system between vehicles includes:
[0016] The first controller is used to obtain the scheduling task and determine the running state of the mother car. When the running state of the mother car is an idle state, the mother car control instruction is generated. When the running state of the mother car is a busy state, the scheduling task is queued to obtain a task queue; the scheduling task includes the full bobbin information of the drawing frame and the empty bobbin information of the roving frame;
[0017] a second controller, communicating wirelessly with the first controller, for generating a child vehicle control instruction based on the mother vehicle control instruction;
[0018] The third controller communicates wirelessly with the second controller and is used to dispatch the sub-vehicle based on the sub-vehicle control instruction to perform the dispatching task.
[0019] Optionally, the first controller, the second controller and the third controller are all programmable logic controllers.
[0020] Optionally, the second controller is implanted in the mother vehicle.
[0021] Optionally, the third controller is implanted in the sub-vehicle.
[0022] In a third aspect, the present application provides a computer device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-mentioned scheduling method between vehicles.
[0023] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-mentioned scheduling method between vehicles.
[0024] In a fifth aspect, the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the above-mentioned scheduling method between vehicles.
[0025] According to the specific embodiments provided in this application, this application discloses the following technical effects:
[0026] The present application provides a method, system, device, medium and product for scheduling vehicles between vehicles, which can improve the transportation efficiency by scheduling vehicles by determining the running status of the vehicles. Moreover, when the running status of the vehicle is busy, the scheduling tasks are queued to obtain a task queue, and the vehicles are scheduled to perform the scheduling tasks according to the task queue, which can effectively avoid the problem of wasting scheduling resources. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0028] Figure 1 This is a flow chart of a method for dispatching vehicles in one embodiment of the present application;
[0029] Figure 2 A schematic diagram of functional modules of a scheduling system between vehicles provided in one embodiment of the present application;
[0030] Figure 3 A flowchart for implementing vehicle dispatching in a dispatching system between vehicles provided in one embodiment of the present application;
[0031] Figure 4 A schematic diagram of the structure of a computer device provided in one embodiment of the present application. DETAILED DESCRIPTION
[0032] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0033] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below in conjunction with the accompanying drawings and specific implementation methods.
[0034] The method for dispatching vehicles provided in the embodiment of the present application can be applied to the process of conveying sliver tubes between the drawing frame process and the roving frame process in a cotton spinning mill. Figure 2As shown, a method for scheduling between vehicles is provided, and the method is executed by a computer device, and specifically can be executed by a computer device such as a terminal or a server alone, or can be executed by a terminal and a server together. In the embodiment of the present application, the method is applied to a programmable logic controller (PLC) as an example for explanation, and includes the following steps 101 to 104. Among them:
[0035] Step 100: Obtaining a scheduling task; the scheduling task includes full bobbin information of a draw frame and empty bobbin information of a roving frame;
[0036] Step 101: Determine the operating status of the vehicle; the vehicle is used to load sliver cans;
[0037] Step 102: When the running state of the vehicle is busy, the scheduling tasks are queued to obtain a task queue;
[0038] Step 103: Return to step 101 and execute the scheduling tasks in the task queue in sequence until it is determined that there is a vehicle in an idle state;
[0039] Step 104: When the running state of the vehicle is an idle state, a dispatch instruction is generated, and the vehicle performs a dispatch task based on the dispatch instruction.
[0040] In another exemplary embodiment of the present application, in order to execute the scheduling task more accurately, the process of sequentially executing the scheduling tasks in the task queue in this embodiment may include:
[0041] (1) Real-time detection of the number of sliver cans in a transport area; the transport area is an area at the drawing frame position for placing empty sliver cans or an area at the roving frame position for placing full sliver cans;
[0042] (2) When the number of sliver cans reaches the set number, exit the current scheduling task and execute the next scheduling task in the task queue.
[0043] In summary, the vehicle scheduling method provided by the present application can improve the transportation efficiency by scheduling the vehicles by determining the running status of the vehicles. Moreover, when the running status of the vehicles is busy, the scheduling tasks are queued to obtain a task queue, and the vehicles are scheduled to perform the scheduling tasks according to the task queue, which can effectively avoid the problem of wasting scheduling resources.
[0044] Based on the same inventive concept, the embodiment of the present application also provides a vehicle dispatching system for implementing the vehicle dispatching method involved above. The system is applied to a sliver can conveying system, which includes a mother vehicle and a child vehicle. In this embodiment, the implementation scheme for solving the problem provided by the vehicle dispatching system is similar to the implementation scheme recorded in the above method, so the specific limitations in the one or more vehicle dispatching system embodiments provided below can refer to the limitations of the vehicle dispatching method above, and will not be repeated here.
[0045] In an exemplary embodiment, Figure 2 As shown, a scheduling system between vehicles is provided, including:
[0046] The first controller 200 is used to obtain the scheduling task and determine the operation state of the mother car. When the operation state of the mother car is idle, the mother car control instruction is generated. When the operation state of the mother car is busy, the scheduling task is queued to obtain the task queue. The scheduling task includes the full bobbin information of the drawing frame and the empty bobbin information of the roving frame.
[0047] The second controller 201 communicates wirelessly with the first controller and is used to generate a child vehicle control instruction based on the mother vehicle control instruction;
[0048] The third controller 202 communicates wirelessly with the second controller and is used to dispatch the sub-vehicle based on the sub-vehicle control instruction to perform the dispatch task.
[0049] In another exemplary embodiment of the present application, in order to further reduce system cost, the first controller, the second controller and the third controller used in the present application are all programmable logic controllers.
[0050] In another exemplary embodiment of the present application, in order to improve the control accuracy, the second controller can be implanted in the mother vehicle and the third controller can be implanted in the child vehicle.
[0051] In another exemplary embodiment of the present application, the scheduling process of the mother vehicle and the sub-workshop is described by taking the application of the scheduling system between vehicles provided in the present application to the cotton sliver tube conveying system provided in the Chinese patent application with application number 2024110803 as an example. Figure 3 As shown, the scheduling process includes:
[0052] When the empty bobbin conveyor of the draw frame has an empty position, the empty bobbin preparation channel of the roving has a bobbin, the full bobbin conveyor of the draw frame is full and ready, the full bobbin preparation channel of the roving is not full, the empty bobbin channel has no bobbin or the full bobbin channel is full, the mother car generates a command to determine whether to take or release the empty full bobbin.
[0053] If empty cylinders are to be taken, the mother car sends a command to the mother-child car and the empty cylinder car. The empty cylinder car takes the empty cylinder and places it in the cache position, and the mother-child car goes to the empty cylinder cache position to take the empty cylinder and put it in the mother car;
[0054] The mother car carries the mother and child car to the empty tube conveyor belt of the draw frame; after the mother and child car carries the empty tube and places it on the empty tube conveyor belt of the draw frame, the mother and child car returns to the mother car.
[0055] If full bobbins are to be picked up or placed, the mother car sends a command to the mother-child car and the full bobbin car. The mother-child car goes to the full bobbin conveyor belt of the drawing frame to pick up full bobbins, and the mother car takes the mother-child car to the full bobbin preparation channel of the roving frame. The mother-child car carries the full bobbin and places it in the full bobbin preparation channel, and the mother-child car returns to the mother car.
[0056] The full barrel car takes and places the full barrels in the full barrel channels.
[0057] Furthermore, in the process of taking and emptying full bobbins, the sub-carriages are switched. After the roving frame completes the manual cotton joining, the mother car sends the mother and sub-carriages to the new empty bobbin channel. After the mother car sends the mother and sub-carriages, the mother car receives the full bobbin, and the sub-carriages are put on the mother car. The mother car receives the full bobbin, the sub-carriages complete the transportation task, and the names of all sub-carriages are redefined. Among them, the mother and sub-carriage becomes an empty bobbin car, the full bobbin car becomes a mother and sub-carriage, and the empty bobbin car becomes a full bobbin car.
[0058] In an exemplary embodiment, a computer device is provided. The computer device may be a server or a terminal. The internal structure diagram thereof may be as follows: Figure 4 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store vehicle scheduling data. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a scheduling method between vehicles is implemented.
[0059] Those skilled in the art will understand that Figure 4The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components. In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program.
[0060] In an exemplary embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.
[0061] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.
[0062] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.
[0063] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM may be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).
[0064] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but is not limited thereto.
[0065] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0066] This article uses specific examples to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application. At the same time, for those skilled in the art, according to the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.
Claims
1. A method for dispatching vehicles, characterized in that: The dispatching method between vehicles is applied to a sliver can conveying system; the dispatching method between vehicles includes: Obtaining a scheduling task; the scheduling task includes full bobbin information of a draw frame and empty bobbin information of a roving frame; Determining an operating state of a vehicle; the vehicle is used to load sliver cans; When the running state of the vehicle is a busy state, the scheduling tasks are queued to obtain a task queue; Returning to the step of determining the running status of the vehicle, until it is determined that there is a vehicle whose running status is an idle state, the scheduling tasks in the task queue are executed in sequence; When the running state of the vehicle is an idle state, a scheduling instruction is generated, and the vehicle performs the scheduling task based on the scheduling instruction.
2. The method for dispatching vehicles according to claim 1, characterized in that: Execute the scheduled tasks in the task queue in sequence, specifically including: Real-time detection of the number of sliver cans in the transport area; the transport area is an area at the drawing frame position for placing empty sliver cans or an area at the roving frame position for placing full sliver cans; When the number of the sliver cans reaches the set number, the current scheduling task is exited and the next scheduling task in the task queue is executed.
3. A dispatching system between vehicles, characterized in that: The dispatching system between vehicles is applied to the sliver can conveying system; the sliver can conveying system includes a mother vehicle and a child vehicle; the dispatching system between vehicles includes: The first controller is used to obtain the scheduling task and determine the running state of the mother car. When the running state of the mother car is an idle state, the mother car control instruction is generated. When the running state of the mother car is a busy state, the scheduling task is queued to obtain a task queue; the scheduling task includes the full bobbin information of the drawing frame and the empty bobbin information of the roving frame; a second controller, communicating wirelessly with the first controller, for generating a child vehicle control instruction based on the mother vehicle control instruction; The third controller communicates wirelessly with the second controller and is used to dispatch the sub-vehicle based on the sub-vehicle control instruction to perform the dispatching task.
4. The vehicle dispatching system according to claim 3, characterized in that: The first controller, the second controller and the third controller are all programmable logic controllers.
5. The vehicle dispatching system according to claim 3, characterized in that: The second controller is implanted in the mother vehicle.
6. The vehicle dispatching system according to claim 3, characterized in that: The third controller is embedded in the sub-vehicle.
7. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the scheduling method between vehicles according to any one of claims 1 and 2.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the scheduling method between vehicles described in any one of claims 1 and 2 is implemented.
9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the scheduling method between vehicles described in any one of claims 1 and 2 is implemented.