Abstract:
This paper concerns the design of parts orienters - the dual to the motion planning problem. Two particular paradigms are considered and their abstractions to the computa...Show MoreMetadata
Abstract:
This paper concerns the design of parts orienters - the dual to the motion planning problem. Two 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.
Date of Conference: 27-29 October 1986
Date Added to IEEE Xplore: 18 July 2008
Print ISBN:0-8186-0740-8
Print ISSN: 0272-5428