Faat procedures for computing fuzzy prozimity meaaurea between a multifingered robot hand and an object to be grasped are presented in this paper. The computation useful in graap planning and in analyzing the local be...
详细信息
In this paper, we present a complete and exact algorithm for planning a geometrically feasible path for a polyhedral subassembly (robot) translating amongst polyhedral obstacles. Our algorithm can be used to determine...
详细信息
In traditional geometric modeling, it is common to assume that models of objects created are complete and correct. Unfortunately in real life robots and other autonomous machines may have only uncertain knowledge of o...
详细信息
A novel approach to inspection is presented based on comparing a volumetric representation of a reference object to a volumetric representation of an actual object iteratively created from sensor data. The use of volu...
详细信息
作者：
S.S. KrishnanA.C. SandersonElectrical
Computer and Systems Engineering Department Center for Advanced Technology in Automation and Robotics Rensselaer Polytechnic Institute Troy NY USA
The feasible path problem is solved for planning a collision-free path to translate an arbitrary polyhedral robot from an initial position to some goal position in a polyhedral environment. The shortest path problem e...
详细信息
The feasible path problem is solved for planning a collision-free path to translate an arbitrary polyhedral robot from an initial position to some goal position in a polyhedral environment. The shortest path problem entails finding the shortest feasible path. The authors present two versions of the window corner (WC) algorithm, which is a novel solution to the problems for the case of single and multistep translational paths for two dimensions, and then summarize the extension to the three-dimensional WC algorithm, for feasible paths. The concept of window corners in the polyhedral cone representation (PCR) is introduced, which reduces the search space. The PCR cones store constraints between boundary elements. The PCO representation has O(m) vertices compared to O(m/sup 2/) in a C-space representation. The WC algorithm was tested and an example from assembly path planning is presented.< >
Cellular neural networks (CNNs) are considered here as cellular analog programmable multidimensional processing arrays with distributed logic and memory. The interconnecting weights between the neighbouring processing...
详细信息
Fast procedures for computing fuzzy proximity measures between a multifingered robot hand and an object to be grasped are presented. T.N. Nguyen and H.E. Stephanou (1990) presented a fuzzy approach for prehension, ide...
详细信息
Fast procedures for computing fuzzy proximity measures between a multifingered robot hand and an object to be grasped are presented. T.N. Nguyen and H.E. Stephanou (1990) presented a fuzzy approach for prehension, identified sources of fuzziness, and proposed a fuzzy algorithm for multifingered prehension. These ideas are extended by assuming fuzziness in the object location and geometric hand configuration, computing information on proximity of the hand and object, analyzing the computational efficiencies, and indicating how geometric information can be used in the process of prehension. The implementation details are outlined. The computation is useful in grasp planning and in analyzing the local behavior of the robot hand in the vicinity of the object.< >
暂无评论