Motion planning algorithms for configuration spaces in the higher dimensional case (Q519480)

As mentioned by the author in the abstract, ``the aim of this paper is to give an explicit motion planning algorithm for configuration spaces in the higher dimensional case''. The introduction (Section 1) recalls the definitions of topological complexity (usual and higher ones) as introduced respectively by Farber and Rudyak. Based on the work of \textit{H. Mas-Ku} and \textit{E. Torres-Giese} [Bol. Soc. Mat. Mex., III. Ser. 21, No. 2, 265--274 (2015; Zbl 1330.55014)], ``who gave an explicit motion planning algorithm for configuration spaces \(F(\mathbb R^2; k)\) and \(F(\mathbb R^n; k)\)'', the paper extends their work at the level of higher complexity. Section 2 (Preliminaries) outlines basic properties of the configuration space \(F(\mathbb R^n; k)\). In Section 3 (\(m\)-dimensional motion planners on \(F(\mathbb R^n; k)\)), the author recalls the definition of higher TC, gives a construction of higher motion planners and proves his main theorem (Theorem 3.3), which states that \[ TC_m(F(\mathbb R^n; k)) \leq m(k - 1) + 1. \]