Answers are grounded in this paper and cite their sources.
The problem of the speed of performance (speed, performance) of a group of controlled objects is considered, the initial state of each of which is given, and the final state is selected from a fixed set of possible terminal states (targets). For each object, it is required to assign a target and find the control that ensures that the group simultaneously reaches all the selected targets in the shortest time. Since the speed-optimal controls of individual objects do not solve the problem of group speed, the so-called minimally delayed trajectories are used. A technique for solving the problem is developed, which includes an algorithm for solving the minimax assignment problem and a procedure for using the optimal and minimally delayed trajectories. The problem of the speed of a group of objects, whose planar motion is represented by Markov–Dubins trajectories, is solved.
No takes yet. Share an insight, caveat, or question.
A. S. Bortakovskii (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: