scholarly journals Comparison of some evolutionary algorithms for optimization of the path synthesis problem

2018 ◽  
Author(s):  
Jakub Krzysztof Grabski ◽  
Tomasz Walczak ◽  
Jacek Buśkiewicz ◽  
Martyna Michałowska
Keyword(s):  
Evolutionary Algorithms ◽  
Synthesis Problem ◽  
Path Synthesis

scholarly journals Finding Only Finite Roots to Large Kinematic Synthesis Systems

2017 ◽  
Vol 9 (2) ◽  
Author(s):  
Mark M. Plecnik ◽  
Ronald S. Fearing
Keyword(s):  
Polynomial Systems ◽  
Synthesis Problem ◽  
New Method ◽  
Homotopy Continuation ◽  
Kinematic Synthesis ◽  
Root Finding ◽  
Large Polynomial Systems ◽  
Path Synthesis

In this work, a new method is introduced for solving large polynomial systems for the kinematic synthesis of linkages. The method is designed for solving systems with degrees beyond 100,000, which often are found to possess quantities of finite roots that are orders of magnitude smaller. Current root-finding methods for large polynomial systems discover both finite and infinite roots, although only finite roots have meaning for engineering purposes. Our method demonstrates how all infinite roots can be precluded in order to obtain substantial computational savings. Infinite roots are avoided by generating random linkage dimensions to construct startpoints and start systems for homotopy continuation paths. The method is benchmarked with a four-bar path synthesis problem.

Complete Solution of the Nine-Point Path Synthesis Problem for Four-Bar Linkages

1992 ◽  
Vol 114 (1) ◽  
pp. 153-159 ◽  
Author(s):  
C. W. Wampler ◽  
A. P. Morgan ◽  
A. J. Sommese
Keyword(s):  
Unsolved Problem ◽  
Complete Solution ◽  
Synthesis Problem ◽  
Computer Algorithm ◽  
All Solutions ◽  
Path Synthesis

The problem of finding all four-bar linkages whose coupler curve passes through nine prescribed points has been a longstanding unsolved problem in kinematics. Using a combination of classical elimination, multihomogeneous variables, and numerical polynomial continuation, we show that there are generically 1442 nondegenerate solution along with their Roberts cognates, for a total of 4326 distinct solutions. Moreover, a computer algorithm that computes all solutions for any given nine points has been developed.

Fourier series method for path generation of RCCC mechanism

2011 ◽  
Vol 226 (3) ◽  
pp. 816-827 ◽  
Author(s):  
J W Sun ◽  
D Q Mu ◽  
J K Chu
Keyword(s):  
Fourier Series ◽  
Frequency Domain ◽  
Synthesis Problem ◽  
Mathematical Representation ◽  
Path Generation ◽  
Series Method ◽  
Internal Relation ◽  
Fourier Series Method ◽  
Mathematical Equations ◽  
Path Synthesis

The mathematical representation of the coupler curves of RCCC mechanism is established. The coupler curve of RCCC mechanism is analysed using the Fourier series theory. The internal relation between the coupler curve and the dimensional type of the RCCC mechanism in the frequency domain is discovered. Subsequently, a database comprising millions of basic dimensional types, taking the crank–rocker linkages as an example, is established. Based on the information of prescribed coupler and the database, the best suitable basic dimensional type can be determined by identification. The mathematical equations for calculating actual dimensions of mechanism and positional dimensions of installation are deduced. Thus, the path synthesis problem of RCCC mechanism can be solved by the mathematic equations and the basic dimensional type. The calculation illustration is given later in this article.

A Study on Finding Finite Roots for Kinematic Synthesis

2017 ◽  
Author(s):  
Mark M. Plecnik ◽  
Ronald S. Fearing
Keyword(s):  
Random Process ◽  
Synthesis Problem ◽  
Homotopy Continuation ◽  
Synthesis System ◽  
Expected Number ◽  
Kinematic Synthesis ◽  
Scaling Down ◽  
Path Synthesis ◽  
Number Of Iterations

This study presents new results on a method to solve large kinematic synthesis systems termed Finite Root Generation. The method reduces the number of startpoints used in homotopy continuation to find all the roots of a kinematic synthesis system. For a single execution, many start systems are generated with corresponding startpoints using a random process such that start-points only track to finite roots. Current methods are burdened by computations of roots to infinity. New results include a characterization of scaling for different problem sizes, a technique for scaling down problems using cognate symmetries, and an application for the design of a spined pinch gripper mechanism. We show that the expected number of iterations to perform increases approximately linearly with the quantity of finite roots for a given synthesis problem. An implementation that effectively scales the four-bar path synthesis problem by six using its cognate structure found 100% of roots in an average of 16,546 iterations over ten executions. This marks a roughly six-fold improvement over the basic implementation of the algorithm.

Finding Only Finite Roots to Large Kinematic Synthesis Systems

2016 ◽  
Author(s):  
Mark M. Plecnik ◽  
Ronald S. Fearing
Keyword(s):  
Polynomial Systems ◽  
Synthesis Problem ◽  
New Method ◽  
Homotopy Continuation ◽  
Kinematic Synthesis ◽  
Root Finding ◽  
Large Polynomial Systems ◽  
Path Synthesis

In this work, a new method is introduced for solving large polynomial systems for the kinematic synthesis of linkages. The method is designed for solving systems with degrees beyond 100,000, which often are found to possess a number of finite roots that is orders of magnitude smaller. Current root-finding methods for large polynomial systems discover both finite and infinite roots, although only finite roots have meaning for engineering purposes. Our method demonstrates how all infinite roots can be avoided in order to obtain substantial computational savings. Infinite roots are avoided by generating random linkage dimensions to construct start-points and start-systems for homotopy continuation paths. The method is benchmarked with a four-bar path synthesis problem.

New Iterative Algorithms for Solving the Mixed Antenna Synthesis Problem

2002 ◽  
Vol 58 (9-10) ◽  
pp. 9
Author(s):  
Efim Grigor'evich Zelkin ◽  
Victor Filippovich Kravchenko ◽  
Miklhail Alekseevich Basarab
Keyword(s):  
Iterative Algorithms ◽  
Synthesis Problem ◽  
Antenna Synthesis

Opponent Center-Surround Contrast: Colour to Grey Conversion

2020 ◽  
Vol 2020 (1) ◽  
pp. 105-108
Author(s):  
Ali Alsam
Keyword(s):  
Evolutionary Algorithms ◽  
Three Dimensional ◽  
The State ◽  
Colour Space ◽  
Vision Science ◽  
State Of Art ◽  
Over Time

Vision is the science that informs us about the biological and evolutionary algorithms that our eyes, opticnerves and brains have chosen over time to see. This article is an attempt to solve the problem of colour to grey conversion, by borrowing ideas from vision science. We introduce an algorithm that measures contrast along the opponent colour directions and use the results to combine a three dimensional colour space into a grey. The results indicate that the proposed algorithm competes with the state of art algorithms.

Sign in / Sign up

Export Citation Format

Share Document