Abstract
A system of independent controllable objects is required to "visit" a given family of target sets in finite-dimensional space, in the minimum possible time. To solve this problem, one singles out, for each object, a subfamily of target sets that is to be visited by the object, arranges the selected sets according to visiting time, and adopts a control policy that will optimize the time necessary to tour the sets in that order. An approximate hierarchical solution scheme, using a certain primitive lower-level logic, is proposed. © 1993.
Cite
CITATION STYLE
Korotayeva, L. N., Nazarov, E. M., & Chentsov, A. G. (1993). An assignment problem. Computational Mathematics and Mathematical Physics, 33(4), 443–452. https://doi.org/10.1007/978-3-642-15202-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
