Answers are grounded in this paper and cite their sources.
The paper reports studies on the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect) and then fixing the “feet” to the ground. The result is a planar parallel manipulator with k - 1 independent closed loops. A topological analysis is used to understand the global structure of the configuration space so that the planning problem can be solved exactly. The worst-case complexity of the algorithm is O(k 3 N 3 ), where N is the maximum number of links in a leg. Examples illustrating the method are given.
No takes yet. Share an insight, caveat, or question.
Shvalb et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: