This paper concerns the design of parts orienters - the dual to the motion planning problem. Three particular paradigms are considered and their abstractions to the computational domain lead to interesting problems in graph pebbling and function composition on finite sets. Polynomial time algorithms are developed for the abstracted problems.