An efficient algorithm for the dynamic control of robots in the cartesian space

1987 ◽  
Author(s):  
W. Khalil ◽  
C. Chevallereau
Keyword(s):  
Efficient Algorithm ◽  
Dynamic Control ◽  
Cartesian Space

A Unified Algorithm for Analysis and Simulation of Planar Four-Bar Motions Defined With R- and P-Joints

2015 ◽  
Vol 7 (1) ◽  
Author(s):  
Xiangyun Li ◽  
Xin Ge ◽  
Anurag Purwar ◽  
Q. J. Ge
Keyword(s):  
Linkage Analysis ◽  
Least Squares ◽  
Efficient Algorithm ◽  
Image Space ◽  
Cartesian Space ◽  
Closure Equation ◽  
Unified Algorithm ◽  
Generalized Manifolds ◽  
Four Bar Linkage ◽  
Best Fit

This paper presents a single, unified, and efficient algorithm for animating the coupler motions of all four-bar mechanisms formed with revolute (R) and prismatic (P) joints. This is achieved without having to formulate and solve the loop closure equation for each type of four-bar linkages separately. Recently, we developed a unified algorithm for synthesizing various four-bar linkages by mapping planar displacements from Cartesian space to the image space using planar quaternions. Given a set of image points that represent planar displacements, the problem of synthesizing a planar four-bar linkage is reduced to finding a pencil of generalized manifolds (or G-manifolds) that best fit the image points in the least squares sense. In this paper, we show that the same unified formulation for linkage synthesis leads to a unified algorithm for linkage analysis and simulation as well. Both the unified synthesis and analysis algorithms have been implemented on Apple's iOS platform.

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Dynamic control of photonic crystal nanocavities for photon manipulation

2014 ◽  
Vol 1 ◽  
pp. 356-359
Author(s):  
Yoshinori Tanaka ◽  
Takashi Asano ◽  
Susumu Noda
Keyword(s):  
Photonic Crystal ◽  
Dynamic Control

Energy efficient algorithm for lookup-tables on mobile devices

2016 ◽  
Vol 2016 (7) ◽  
pp. 1-6
Author(s):  
Sergey Makov ◽  
Vladimir Frantc ◽  
Viacheslav Voronin ◽  
Igor Shrayfel ◽  
Vadim Dubovskov ◽  
...  
Keyword(s):  
Mobile Devices ◽  
Efficient Algorithm ◽  
Energy Efficient ◽  
Lookup Tables

Computational Fluid Dynamic Control

1989 ◽  
Author(s):  
Tom T. Hartley ◽  
Alex DeAbreu-Garcia
Keyword(s):  
Computational Fluid Dynamic ◽  
Fluid Dynamic ◽  
Dynamic Control
Sign in / Sign up

Export Citation Format

Share Document