Answers are grounded in this paper and cite their sources.
A workcell composed of a workpiece and several welding robots is considered. We are interested in minimizing the makespan in the workcell. Hence, one needs i) to assign tasks between the robots, ii) to do the sequencing of the tasks for each robot and iii) to compute the fastest collision-free paths between the tasks. Up to now, task assignment and path-planning were always handled separately, the former being a typical Vehicle Routing Problem whereas the later is modelled using an optimal control problem. In this paper, we present a complete algorithm which combines discrete optimization techniques with collision detection and optimal control problems efficiently.
No takes yet. Share an insight, caveat, or question.
Landry et al. (2013) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: