Recent News
Inaugural School of Engineering Teaching Innovation Fellows selected
February 2, 2024
UNM computer scientist wins NSF CAREER Award to optimize supercomputer performance
February 1, 2024
Hand and Machine Lab’s Experimental Clay Exhibition closing celebration Nov. 17
November 15, 2023
Moses selected as special assistant to the dean for educational initiatives
October 3, 2023
News Archives
Motion Planning for a Class of Planar Closed-Chain Manipulators
March 23, 2006
- Date: Thursday, March 23, 2006
- Time: 11:00 am — 12:15 pm
- Place: Woodward 149
Guanfeng Liu (UNM Faculty Candidate)
Department of Computer Science, Stanford University
We study 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 planning problem can be solved exactly. The worst-case complexity of our algorithm is O(k3N3), where N is the maximum number of links in a leg. Several examples illustrating our method are given. Finally we show the application of our topological method in the study of the global structure of protein conformation space.