Optimal-Regularity for Serial Redundant Robots

2017 ◽  
Vol 9 (3) ◽  
Author(s):  
Nir Shvalb ◽  
Tal Grinshpoun ◽  
Oded Medina

A configuration of a mechanical linkage is defined as regular if there exists a subset of actuators with their corresponding Jacobian columns spans the gripper's velocity space. All other configurations are defined in the literature as singular configurations. Consider mechanisms with grippers' velocity space ℝm. We focus our attention on the case where m Jacobian columns of such mechanism span ℝm, while all the rest are linearly dependent. These are obviously an undesirable configuration, although formally they are defined as regular. We define an optimal-regular configuration as such that any subset of m actuators spans an m-dimensional velocity space. Since this densely constraints the work space, a more relaxed definition is needed. We therefore introduce the notion of k-singularity of a redundant mechanism which means that rigidifying k actuators will result in an optimal-regularity. We introduce an efficient algorithm to detect a k-singularity, give some examples for cases where m = 2, 3, and demonstrate our algorithm efficiency.

Author(s):  
Omar Iván TREJOS BURITICÁ

Resumen En el presente artículo se acude a la Programación Funcional para generar una tabla de análisis de primalidad de números en un rango dado a partir del uso de un algoritmo que, por las necesidades del mismo objetivo, tiene características de ser eficiente. Se plantea la fundamentación de dicho algoritmo y además se aprovecha su estructura lógica para resolver el problema propuesto. El propósito de este artículo es mostrar una arista útil de la eficiencia algorítmica teniendo en cuenta las características tecnológicas modernas y los problemas que la matemática provee. Se hace uso del lenguaje de programación Scheme y se aprovechan sus potencialidades para manejo, tamaño y cálculo de datos. Se demuestra que, acudiendo a algoritmos eficientes y a una lógica muy simple, la tecnología computacional moderna puede ser de una inmensa utilidad para resolver problemas matemáticos. Palabras Clave: Algoritmo, eficiencia, matemáticas, números primos, programación funcional   Abstract In this article, we use Functional Programming to generate an analytic table of prime numbers in a specific range using an efficient algorithm. You can find the foundation and we use its logical structure to solve the problem. The proposal of this article is to show the useful face of the applied efficient algorithmic knowing the modern technologies y the math problems. We use Scheme as a programming language and we use its potentialities to manage, to storage and calculate data. We demonstrate that, using efficient algorithms and a simple logic, the computational technologies are very useful solving math problems. Keywords: Algorithm, efficiency, maths, prime numbers, Functional programming


Author(s):  
Anggar Titis Prayitno

ABSTRACT  Traveling Salesman Problem (TSP) is one of combinatorics optimation problem to find the possible shorthest path that can be obtained if a  salesman visit each city exactly once and return to the starting city. The shorthest path searching can be done by Cheapest Insertion Heuristics algorithm and Dynamic Programming. Each algorithm has different efficiency to find shorthest path. Algorithm efficiency is determined based on time complexity. Algorithm wich has the smallest time complexity is the most efficient algorithm. Based on the calculation result, the time complexity of Cheapest Insertion Heuristics algorithm is and Dynamic Programming is .  Therefore, for  Cheapest Insertion Heuristics Algorithm is more efficient algorithm than Dynamic Programming in TSP solving. Keywords : Traveling Salesman Problem, Cheapest Insertion Heuristics  Algorithm, Dynamic Programming, and Algorithm time complexity.


2017 ◽  
Vol 139 (4) ◽  
Author(s):  
Mats Isaksson

A parallel mechanism possesses several advantages compared to a similar-sized serial mechanism, including the potential for higher accuracy and reduced moving mass, the latter enabling increased load capacity and higher acceleration. One of the most important issues affecting a parallel mechanism is the potential of parallel singularities. Such configurations strongly affect the performance of a parallel mechanism, both in the actual singularity and in its vicinity. For example, both the stiffness of a mechanism and the efficiency of the power transmission to the tool platform are related to the closeness to singular configurations. A mechanism with a mobility larger than the mobility of its tool platform is referred to as a kinematically redundant mechanism. It is well known that introducing kinematic redundancy enables a mechanism to avoid singular configurations. In this paper, three novel kinematically redundant planar parallel mechanisms are proposed. All three mechanisms provide planar translations of the tool platform in two degrees-of-freedom, in addition to infinite rotation of the platform around an axis normal to the plane of the translations. The unique feature of the proposed mechanisms is that, with the appropriate inverse kinematics solutions, all configurations in the entire workspace feature optimal singularity avoidance. It is demonstrated how it is sufficient to employ five actuators to achieve this purpose. In addition, it is shown how including more than five actuators significantly reduces the required actuator motions for identical motions of the tool platform, thereby reducing the cycle times for typical applications.


Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

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.


2016 ◽  
Vol 2016 (7) ◽  
pp. 1-6
Author(s):  
Sergey Makov ◽  
Vladimir Frantc ◽  
Viacheslav Voronin ◽  
Igor Shrayfel ◽  
Vadim Dubovskov ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document