Abstract

The article presents a generalized algorithm for allocation of tasks in a collaborative robotic system with minimizing the time of their execution (an algorithm of assigning the performers to work within the technological process), as well as the results of modeling the developed algorithm. The maximum value among the sums of the edge weights for the longest path from the source of the graph to its drain is used as the execution time of the technological process that needs to be minimized.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.