CN117874739A - Information pushing method and system for intelligent manufacturing service - Google Patents
Information pushing method and system for intelligent manufacturing service Download PDFInfo
- Publication number
- CN117874739A CN117874739A CN202410285535.1A CN202410285535A CN117874739A CN 117874739 A CN117874739 A CN 117874739A CN 202410285535 A CN202410285535 A CN 202410285535A CN 117874739 A CN117874739 A CN 117874739A
- Authority
- CN
- China
- Prior art keywords
- execution
- execution end
- instruction
- time period
- sent
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 27
- 238000007726 management method Methods 0.000 claims abstract description 45
- 238000004891 communication Methods 0.000 claims abstract description 26
- 238000012544 monitoring process Methods 0.000 claims description 21
- 230000000875 corresponding effect Effects 0.000 claims description 7
- 238000013439 planning Methods 0.000 claims description 5
- 230000002596 correlated effect Effects 0.000 claims description 3
- 239000000725 suspension Substances 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 9
- 230000003993 interaction Effects 0.000 abstract description 4
- 238000004364 calculation method Methods 0.000 abstract description 3
- 238000011144 upstream manufacturing Methods 0.000 description 12
- 238000004590 computer program Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 9
- 238000012545 processing Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
- 238000013024 troubleshooting Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- General Factory Administration (AREA)
Abstract
The application discloses an information pushing method and system of intelligent manufacturing service, which can guarantee communication between a management end and an execution end through a third party supervision mode even under the conditions of large system scale, large task execution site, numerous execution ends, high interaction complexity degree between the management end and the execution end and frequent communication. The method and the system realize system management through the computer technology based on the specific calculation model. Conditions are provided for further reducing the consumption of supervision and management resources.
Description
Technical Field
The present disclosure relates to the field of computer technologies applicable to computer technologies based on specific computing models, and in particular, to an information pushing method and system for an intelligent manufacturing service.
Background
The development of artificial intelligence technology benefits a plurality of fields and provides great convenience for the production and life of people. Many tasks originally executed by people can be automated by devices and systems on the basis of self-decision.
The end-to-end interactions become the basis for implementing intelligent manufacturing services. However, as the number of terminals increases, there is a possibility that a message cannot be delivered in time due to communication congestion. If a certain end at the upstream fails to receive the message for control in time, the downstream end receives the subsequent instruction, and the continuity of the operation is lost. If the communication abnormality problem at one end at the upstream can be timely detected, the coordination between the upstream and the downstream is facilitated, and the continuous operation is facilitated.
For example, publication (bulletin) number: CN109753774B, patent title: an intelligent manufacturing system (main classification number: G06F 21/31) realizes the effect of reasonably analyzing and judging whether an operator is correct before the operator operates and fills corresponding data based on the design of the system, and avoids the problem of overall statistical data. On one hand, the computer technology based on a specific calculation model can be described to be quite available in the technical field of intelligent manufacturing; on the other hand, it can be stated that the technology mining in this field has a wide range of expansion prospects.
Disclosure of Invention
The embodiment of the application provides an information pushing method and system for intelligent manufacturing service, so as to at least partially solve the technical problems.
The embodiment of the application adopts the following technical scheme:
in a first aspect, an embodiment of the present application provides an information pushing method for an intelligent manufacturing service, where the method includes:
monitoring the positions of the execution ends in the field;
when determining an instruction to be sent, determining a target of the instruction to be sent from the plurality of execution ends as a first execution end;
determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end;
sending a target instruction to the first execution end so that the first execution end executes a task according to the target instruction; the target instruction is obtained based on the instruction to be sent, and the target instruction carries a unique identifier of the second execution end;
sending a monitoring instruction to the second execution end, so that the second execution end monitors whether a first receipt based on the target instruction by the first execution end is received or not in the first appointed time period;
if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or receiving a third receipt obtained by the second execution end based on the first receipt within the first specified time period, and determining that the information pushing is successful.
In an alternative embodiment of the present specification, the method further comprises:
and if the second receipt and the third receipt are not received within the first specified time period, re-determining a second execution end from the execution ends except the first execution end.
In an alternative embodiment of the present specification, the method further comprises:
if the number of times of the second execution end is determined to be greater than a preset number of times threshold value for the first execution end again, determining a third execution end from the execution ends except the first execution end; the third execution end is the execution end with the nearest position on the path after the second specified time period after the current time and the nearest position on the path after the second specified time period after the current time;
re-planning a path for the third execution end, so that the position of the re-planned path after a second designated time period after the current moment is a target position; the target position is a position on its original path after a second specified period of time after the current time; and on the re-planned path, the distance between the current position and the position of the first execution end at the corresponding moment and the position of any moment on a section between the current position and the target position is not more than the distance threshold;
the target instruction is sent to the first execution end again;
and sending the monitoring instruction to the third execution end.
In an alternative embodiment of the present specification, the method further comprises:
if the second receipt and the fourth receipt sent by the third execution end are not received in the second designated time period after the monitoring instruction is sent to the third execution end, sending a task suspension instruction to the first execution end;
and displaying the alarm information aiming at the first execution end.
In an alternative embodiment of the present specification, the method further comprises:
the duration of the second specified time period is greater than the duration of the first specified time period.
In an alternative embodiment of the present specification, the method further comprises:
and the distance threshold value is positively correlated with the distance between the position of the first execution end when determining the instruction to be sent and the end point of the path planned for the first execution end.
In an alternative embodiment of the present specification, the method further comprises:
and short-range communication is adopted between the execution ends.
In a second aspect, an embodiment of the present application further provides an information pushing system of an intelligent manufacturing service, where the system includes:
the management end is configured to: monitoring the positions of the execution ends in the field; when determining an instruction to be sent, determining a target of the instruction to be sent from the plurality of execution ends as a first execution end; determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end; sending a target instruction to the first execution end so that the first execution end executes a task according to the target instruction; the target instruction is obtained based on the instruction to be sent, and the target instruction carries a unique identifier of the second execution end; sending a monitoring instruction to the second execution end, so that the second execution end monitors whether a first receipt based on the target instruction by the first execution end is received or not in the first appointed time period; if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or, if the third receipt obtained by the second execution end based on the first receipt is received in the first specified time period, determining that the information pushing is successful;
the execution end is configured to: and moving in a preset place according to the path planned by the management end so as to execute the task distributed by the management end.
In a third aspect, embodiments of the present application further provide an electronic device, including:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method steps of the first aspect.
In a fourth aspect, embodiments of the present application also provide a computer-readable storage medium storing one or more programs, which when executed by an electronic device comprising a plurality of application programs, cause the electronic device to perform the method steps of the first aspect.
The above-mentioned at least one technical scheme that this application embodiment adopted can reach following beneficial effect:
artificial intelligence techniques are increasingly at the corner of the manufacturing industry.
Through the method and the system in the specification, even under the conditions of large system scale, large task execution place, numerous execution ends, high interaction complexity degree between the management end and the execution end and frequent communication, the communication between the management end and the execution end can be ensured through a third party supervision mode. In the scene of carrying out pipeline cooperation between upstream semantics and downstream, the cooperative and stable progress between the upstream and the downstream can be ensured. The method and the system realize system management through the computer technology based on the specific calculation model. Conditions are provided for further reducing the consumption of supervision and management resources.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute an undue limitation to the application. In the drawings:
fig. 1 is a schematic process diagram of an information pushing method of an intelligent manufacturing service according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
The invention will be described in further detail below with reference to the drawings by means of specific embodiments. Wherein like elements in different embodiments are numbered alike in association. In the following embodiments, numerous specific details are set forth in order to provide a better understanding of the present application. However, one skilled in the art will readily recognize that some of the features may be omitted, or replaced by other elements, materials, or methods in different situations. In some instances, some operations associated with the present application have not been shown or described in the specification to avoid obscuring the core portions of the present application, and may not be necessary for a person skilled in the art to describe in detail the relevant operations based on the description herein and the general knowledge of one skilled in the art.
Furthermore, the described features, operations, or characteristics of the description may be combined in any suitable manner in various embodiments. Also, various steps or acts in the method descriptions may be interchanged or modified in a manner apparent to those of ordinary skill in the art. Thus, the various orders in the description and drawings are for clarity of description of only certain embodiments, and are not meant to be required orders unless otherwise indicated.
The numbering of the components itself, e.g. "first", "second", etc., is used herein merely to distinguish between the described objects and does not have any sequential or technical meaning. The terms "coupled" and "connected," as used herein, are intended to encompass both direct and indirect coupling (coupling), unless otherwise indicated.
The following describes in detail the technical solutions provided by the embodiments of the present application with reference to the accompanying drawings.
As shown in fig. 1, the information push method of the intelligent manufacturing service in the present specification includes the following steps:
s100: and monitoring the positions of the execution ends in the field.
The method in the specification is executed by a management end of an information pushing system of an intelligent manufacturing service, and the information pushing system of the intelligent manufacturing service further comprises a plurality of execution ends. The execution end is configured to: and moving in a preset place according to the path planned by the management end so as to execute the task distributed by the management end.
Illustratively, the system in the present specification may be applied in an intelligent warehouse scenario, where a management end is responsible for management, and an execution end is responsible for handling goods in a warehouse. In this scenario, the site is a warehouse. In the related art, technical means capable of realizing task allocation and path planning for execution are applicable to the present specification, if conditions allow.
In an alternative embodiment, the ground or the space position of the field is further provided with a mark for assisting in positioning, and the execution end photographs the mark and sends the mark to the management end so that the management end knows the position of the mark.
The technical scheme in the specification is suitable for a job scene of upstream and downstream coordination, and after an upstream execution end executes a certain task, a downstream execution end continues to operate based on the result of the upstream execution task. If the upstream execution end fails to execute the task timely or correctly, the downstream is affected, and the cooperation between the upstream and the downstream is further affected.
Under the condition that the system is huge or the communication capability between the ends is insufficient, the situation that the command of the management end (possibly arranged at the cloud) cannot be timely sent to the corresponding execution end possibly exists. At this time, the execution end returns a receipt to the management end in order to confirm that the execution end receives the message. However, if the original communication link between the management end and the execution end is in trouble, the receipt cannot be sent to the management end, and the management end cannot easily perform subsequent task allocation without knowing the movement of the execution end. If the third party intervention auxiliary supervision can be introduced, the problem can be found timely to a certain extent.
S102: when determining an instruction to be sent, determining that an instruction target to be sent is sent from the execution ends as a first execution end.
In the system operation process, the management end coordinates each task according to the service requirement and coordinates the operation condition of each execution end, and then sends an instruction to the execution end from time to time when needed, wherein the instruction is for example "111 # execution end carries the workpiece A to the first position, and the path is bcd". Or, the instruction may be "execution end 222", which pauses the job and returns to the efg standby position. The instruction which is not sent to the execution end is the instruction to be sent. The instructions sent to different execution ends at different moments have a larger probability.
The first execution end is the execution end to which the instruction target to be sent is sent.
S104: and determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end.
The maximum distance in this specification is the maximum value of the distance between the positions of the two execution ends at the same time. The paths of different execution ends are different, so that the distances between the same two execution ends may be different in different moments.
It can be seen that the second execution end determined in this step is an execution end that is not far away from the first execution end in the first specified time period thereafter, which can be approximately understood as a certain "following" phenomenon.
In some cases, the second execution end determined for a certain first execution end may not be unique, and in an optional embodiment of the present specification, each determined second execution end is taken as a pending execution end. And taking the undetermined execution end with the shortest planned path or the shortest work time allocated for the undetermined execution end as the second execution end corresponding to the first execution end.
In an alternative embodiment of the present disclosure, the distance threshold is positively correlated with the distance between the first execution end and the end point of the path planned for the first execution end when determining the instruction to be sent. In the scenario of intelligent warehousing, the first execution end is usually executing the handling operation, and then the end point of the path is mostly a station. The distance from the station is far, which indicates that the instruction to be sent is possibly temporarily adjusted in the middle of movement, and the situation that the second execution end cannot be determined can be effectively avoided by expanding the distance threshold.
S106: and sending the target instruction to the first execution end.
So that the first execution end executes the task according to the target instruction. The target instruction in the specification is obtained based on the instruction to be sent, and the target instruction carries the unique identifier of the second execution end. In an optional embodiment of the present disclosure, the instruction to be sent and the unique identifier of the second execution end may be added at different positions of the message, so that the first execution end parses the message.
The first execution end can communicate with the second execution end after knowing the unique identification of the second execution end.
In an alternative embodiment of the present disclosure, the communication between the executing end and the managing end is different from the communication between the executing ends. The execution end is preferably short-range communication, and a communication mode except short-range communication is adopted between the execution end and the management end. Can help to maintain communication between the execution ends in the event that remote communication is not clear.
S108: and sending the monitoring instruction to the second execution end.
And the second execution end monitors whether a first receipt based on the target instruction is received by the first execution end or not in the first appointed time period.
S110: if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or receiving a third receipt obtained by the second execution end based on the first receipt within the first specified time period, and determining that the information pushing is successful.
The second receipt is sent to the management end by the first execution end, and the management end can receive the second receipt under the condition that a communication link between the first execution end and the management end is smooth.
Even if the communication link between the first execution end and the management end is not smooth, the communication link between the first execution end and the second execution end is smooth, the communication link between the second execution end and the management end is smooth, and the management end can also receive the third receipt. Whether the second receipt or the third receipt is received is managed to indicate that the message targeted for delivery to the first execution has been successfully delivered.
Through the method and the system in the specification, even under the conditions of large system scale, large task execution place, numerous execution ends, high interaction complexity degree between the management end and the execution end and frequent communication, the communication between the management end and the execution end can be ensured through a third party supervision mode. In the scene of carrying out pipeline cooperation between upstream semantics and downstream, the cooperative and stable progress between the upstream and the downstream can be ensured.
In an actual application scenario, there may be a phenomenon that the receipt sent by the second execution end loses the data packet, that is, the communication link between the second execution end and the management end is not smooth, to eliminate this situation, in an alternative embodiment of the present disclosure, if the second receipt and the third receipt are not received within the first specified period of time, the second execution end is redetermined from the execution ends other than the first execution end. Optionally, the newly determined second execution end also needs to meet the second execution end which is not determined last time.
Further, there may be a cause that the re-determined second execution end does not know what is still failing to send the receipt to the management end, in an alternative embodiment of the present disclosure, if the number of times the second execution end is re-determined for the first execution end is greater than a preset number of times threshold (may be an empirical value, alternatively, the number of times threshold is positively related to the length of the path remaining by the first execution end when determining the instruction to be sent), determining a third execution end from the execution ends other than the first execution end; the third execution end is the execution end whose position on the path is closest to the position of the first execution end on the path after the second specified period after the current time. It can be seen that the third execution end is not in a "following" relationship with the first execution end, but is positioned close to the first execution end at the end of the second specified period of time.
And re-planning a path for the third execution end, so that the position of the re-planned path after a second designated time period after the current moment is a target position. The target position is a position on its original path after a second specified period of time after the current time; and on the re-planned path, the distance between the position at any time on a section between the current position and the target position and the position of the first execution end at the corresponding time is not greater than the distance threshold. In the re-planned path, the third execution end will reach the target location, that is, the task of the third execution end itself can be performed, and communication with the first execution end can be maintained, but the third execution end may be somewhat far away compared to the original path. The third execution end can follow the first execution end in a path planning mode.
The target instruction is sent to the first execution end again; and sending the monitoring instruction to the third execution end. Thereafter, the monitoring logic of the third execution end to the first execution end is similar to that of the second execution end, and will not be described herein.
Further, if the second receipt and the fourth receipt sent by the third execution end are not received within the second specified period of time after the monitoring instruction is sent to the third execution end, sending a task suspension instruction to the first execution end. And displaying the alarm information aiming at the first execution end.
Since the logic of the second execution end is determined to be different from that of the third execution end, the same problem of the monitoring logic of the first execution end through the execution end can be effectively avoided, and at the moment, the first execution end can be judged to have the problem indeed.
In an optional embodiment of the present disclosure, the duration of the second designated time period is greater than the duration of the first designated time period, so as to improve the monitoring duration of the third execution end on the first execution end, which is helpful for more accurately troubleshooting the problem of the first execution end. In addition, in the related art, an automatic reset procedure is set for the communication element of the execution end, and time is provided for self-adjustment of the first execution end.
Further, the present specification also provides an information push system for an intelligent manufacturing service, the system comprising:
the management end is configured to: monitoring the positions of the execution ends in the field; when determining an instruction to be sent, determining a target of the instruction to be sent from the plurality of execution ends as a first execution end; determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end; sending a target instruction to the first execution end so that the first execution end executes a task according to the target instruction; the target instruction is obtained based on the instruction to be sent, and the target instruction carries a unique identifier of the second execution end; sending a monitoring instruction to the second execution end, so that the second execution end monitors whether a first receipt based on the target instruction by the first execution end is received or not in the first appointed time period; if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or, if the third receipt obtained by the second execution end based on the first receipt is received in the first specified time period, determining that the information pushing is successful;
the execution end is configured to: and moving in a preset place according to the path planned by the management end so as to execute the task distributed by the management end.
The system can execute the method in any of the foregoing embodiments and achieve the same or similar technical effects, and will not be described herein.
Fig. 2 is a schematic structural diagram of an electronic device according to an embodiment of the present application. Referring to fig. 2, at the hardware level, the electronic device includes a processor, and optionally an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, network interface, and memory may be interconnected by an internal bus, which may be an ISA (Industry Standard Architecture ) bus, a PCI (Peripheral Component Interconnect, peripheral component interconnect standard) bus, or EISA (Extended Industry Standard Architecture ) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 2, but not only one bus or type of bus.
And the memory is used for storing programs. In particular, the program may include program code including computer-operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.
The processor reads the corresponding computer program from the nonvolatile memory to the memory and then runs the computer program to form an information pushing system of the intelligent manufacturing service on a logic level. And the processor is used for executing the program stored in the memory and particularly used for executing the information pushing method of any one of the intelligent manufacturing services.
The information pushing method of the intelligent manufacturing service disclosed in the embodiment shown in fig. 1 of the present application may be applied to a processor or implemented by the processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.
The electronic device may also execute an information pushing method of the intelligent manufacturing service in fig. 1, and implement the functions of the embodiment shown in fig. 1, which is not described herein.
The embodiments of the present application also provide a computer-readable storage medium storing one or more programs, the one or more programs including instructions, which when executed by an electronic device comprising a plurality of application programs, perform any one of the foregoing information push methods of the smart manufacturing service.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create a system for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.
Claims (10)
1. An information pushing method of an intelligent manufacturing service is characterized in that the method is executed by a management end of an information pushing system of the intelligent manufacturing service, the information pushing system of the intelligent manufacturing service further comprises a plurality of execution ends, and the execution ends are configured to: moving in a preset place according to the path planned by the management end so as to execute the task distributed by the management end, wherein the method comprises the following steps:
monitoring the positions of the execution ends in the field;
when determining an instruction to be sent, determining a target of the instruction to be sent from the plurality of execution ends as a first execution end;
determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end;
sending a target instruction to the first execution end so that the first execution end executes a task according to the target instruction; the target instruction is obtained based on the instruction to be sent, and the target instruction carries a unique identifier of the second execution end;
sending a monitoring instruction to the second execution end, so that the second execution end monitors whether a first receipt based on the target instruction by the first execution end is received or not in the first appointed time period;
if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or receiving a third receipt obtained by the second execution end based on the first receipt within the first specified time period, and determining that the information pushing is successful.
2. The method of claim 1, wherein the method further comprises:
and if the second receipt and the third receipt are not received within the first specified time period, re-determining a second execution end from the execution ends except the first execution end.
3. The method of claim 2, wherein the method further comprises:
if the number of times of the second execution end is determined to be greater than a preset number of times threshold value for the first execution end again, determining a third execution end from the execution ends except the first execution end; the third execution end is the execution end with the nearest position on the path after the second specified time period after the current time and the nearest position on the path after the second specified time period after the current time;
re-planning a path for the third execution end, so that the position of the re-planned path after a second designated time period after the current moment is a target position; the target position is a position on its original path after a second specified period of time after the current time; and on the re-planned path, the distance between the current position and the position of the first execution end at the corresponding moment and the position of any moment on a section between the current position and the target position is not more than the distance threshold;
the target instruction is sent to the first execution end again;
and sending the monitoring instruction to the third execution end.
4. A method as claimed in claim 3, wherein the method further comprises:
if the second receipt and the fourth receipt sent by the third execution end are not received in the second designated time period after the monitoring instruction is sent to the third execution end, sending a task suspension instruction to the first execution end;
and displaying the alarm information aiming at the first execution end.
5. A method as claimed in claim 3, wherein the method further comprises:
the duration of the second specified time period is greater than the duration of the first specified time period.
6. The method of claim 1, wherein the method further comprises:
and the distance threshold value is positively correlated with the distance between the position of the first execution end when determining the instruction to be sent and the end point of the path planned for the first execution end.
7. The method of claim 1, wherein the method further comprises:
and short-range communication is adopted between the execution ends.
8. An information pushing system of an intelligent manufacturing service is characterized by comprising a management end and a plurality of execution ends:
the management end is configured to: monitoring the positions of the execution ends in the field; when determining an instruction to be sent, determining a target of the instruction to be sent from the plurality of execution ends as a first execution end; determining that the current moment is closest to the first executing end from executing ends except the first executing end based on the positions of the executing ends in the field, wherein the maximum distance between a path and the path of the first executing end in a first specified time period after the current moment is not greater than a preset distance threshold value as a second executing end; sending a target instruction to the first execution end so that the first execution end executes a task according to the target instruction; the target instruction is obtained based on the instruction to be sent, and the target instruction carries a unique identifier of the second execution end; sending a monitoring instruction to the second execution end, so that the second execution end monitors whether a first receipt based on the target instruction by the first execution end is received or not in the first appointed time period; if a second receipt based on the target instruction sent by the first execution end is received within the first specified time period; or, if the third receipt obtained by the second execution end based on the first receipt is received in the first specified time period, determining that the information pushing is successful;
the execution end is configured to: and moving in a preset place according to the path planned by the management end so as to execute the task distributed by the management end.
9. An electronic device, comprising:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method of any of claims 1 to 7.
10. A computer readable storage medium storing one or more programs, which when executed by an electronic device comprising a plurality of application programs, cause the electronic device to perform the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410285535.1A CN117874739B (en) | 2024-03-13 | 2024-03-13 | Information pushing method and system for intelligent manufacturing service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410285535.1A CN117874739B (en) | 2024-03-13 | 2024-03-13 | Information pushing method and system for intelligent manufacturing service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117874739A true CN117874739A (en) | 2024-04-12 |
| CN117874739B CN117874739B (en) | 2024-05-07 |
Family
ID=90590506
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410285535.1A Active CN117874739B (en) | 2024-03-13 | 2024-03-13 | Information pushing method and system for intelligent manufacturing service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117874739B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103848343A (en) * | 2012-11-29 | 2014-06-11 | 中国科学院沈阳自动化研究所 | Overhead travelling crane movement control method for carrying system with turnout switch |
| CN113156951A (en) * | 2021-04-22 | 2021-07-23 | 深圳优地科技有限公司 | Task transmission method, device, equipment and storage medium |
| US20210252705A1 (en) * | 2018-06-21 | 2021-08-19 | Beijing Geekplus Technology Co., Ltd. | Robot scheduling and robot path control method, server and storage medium |
| CN113301135A (en) * | 2021-05-14 | 2021-08-24 | 涂哲 | Data sharing method |
| CN113696183A (en) * | 2021-09-10 | 2021-11-26 | 深圳优地科技有限公司 | Robot control method based on chain communication, robot and storage medium |
| WO2022063038A1 (en) * | 2020-09-24 | 2022-03-31 | 深圳市海柔创新科技有限公司 | Task processing method, control terminal, robot, warehousing system, and storage medium |
| CN114578812A (en) * | 2022-02-21 | 2022-06-03 | 深圳易可达科技有限公司 | Robot scheduling method, device, controller, system and storage medium |
| WO2023035755A1 (en) * | 2021-09-10 | 2023-03-16 | 北京京东乾石科技有限公司 | Task processing method, apparatus and system for multiple robots, and robot |
-
2024
- 2024-03-13 CN CN202410285535.1A patent/CN117874739B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103848343A (en) * | 2012-11-29 | 2014-06-11 | 中国科学院沈阳自动化研究所 | Overhead travelling crane movement control method for carrying system with turnout switch |
| US20210252705A1 (en) * | 2018-06-21 | 2021-08-19 | Beijing Geekplus Technology Co., Ltd. | Robot scheduling and robot path control method, server and storage medium |
| WO2022063038A1 (en) * | 2020-09-24 | 2022-03-31 | 深圳市海柔创新科技有限公司 | Task processing method, control terminal, robot, warehousing system, and storage medium |
| CN113156951A (en) * | 2021-04-22 | 2021-07-23 | 深圳优地科技有限公司 | Task transmission method, device, equipment and storage medium |
| CN113301135A (en) * | 2021-05-14 | 2021-08-24 | 涂哲 | Data sharing method |
| CN113696183A (en) * | 2021-09-10 | 2021-11-26 | 深圳优地科技有限公司 | Robot control method based on chain communication, robot and storage medium |
| WO2023035755A1 (en) * | 2021-09-10 | 2023-03-16 | 北京京东乾石科技有限公司 | Task processing method, apparatus and system for multiple robots, and robot |
| CN114578812A (en) * | 2022-02-21 | 2022-06-03 | 深圳易可达科技有限公司 | Robot scheduling method, device, controller, system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117874739B (en) | 2024-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103209439B (en) | The method of a kind of data traffic monitoring, device and equipment | |
| CN111844024A (en) | Robot fault processing method and device, intelligent equipment and storage medium | |
| CN105243001B (en) | The abnormality alarming method and device of business object | |
| CN113760559A (en) | Dual-core communication method and electronic equipment | |
| CN117874739B (en) | Information pushing method and system for intelligent manufacturing service | |
| CN112448992A (en) | Edge computing task scheduling method and device | |
| CN105577480A (en) | Monitoring method and device of network connection performances | |
| CN109376020B (en) | Data processing method, device and storage medium under multi-block chain interaction concurrence | |
| CN114692939A (en) | Multi-AGV task scheduling method based on double-layer strategy | |
| CN112416534A (en) | Agent-based task management method and device | |
| CN111756803A (en) | Server-side pushing method, equipment and medium based on block chain technology | |
| CN112558553B (en) | Method and system for executing channel command of multi-channel numerical control system | |
| CN115391051A (en) | Video computing task scheduling method, device and computer readable medium | |
| CN113238855B (en) | Path detection method and device | |
| CN115033927A (en) | Method, device, equipment and medium for detecting data integrity | |
| CN113141267B (en) | Firmware upgrading and information processing method, device and equipment | |
| CN109067611B (en) | Method, device, storage medium and processor for detecting communication state between systems | |
| CN104125600B (en) | The method for recognizing flux of mobile terminal and device | |
| CN111327499A (en) | Method and device for sending message and automobile | |
| CN112214020A (en) | Method and device for establishing task framework and processing tasks of AGV (automatic guided vehicle) scheduling system | |
| CN107908516B (en) | Data display method and device | |
| CN112749158A (en) | Energy system data processing method and device | |
| US20210072735A1 (en) | Conveyor system controller, conveyor system and method of data synchronization | |
| CN108259527B (en) | Proxy-based service processing method and device and network element equipment | |
| CN111354174A (en) | Alarm method, device, server and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |