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 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
