A Constrained Search Technique for Motion Generator Pivot Location

1987 ◽  
Author(s):  
T. J. Lawley ◽  
R. V. Nambiar ◽  
J. K. Nisbett ◽  
S. Prince ◽  
H. Zarefar
Keyword(s):  
Computer Program ◽  
Complex Number ◽  
Random Search ◽  
Search Technique ◽  
Planar Mechanisms ◽  
Automobile Suspension ◽  
Pass Through ◽  
Motion Generator

Abstract Burmester’s solution to the problem of guiding a body through four precision points has been extended to find planar mechanisms that have their pivots located inside prescribed regions. The complex number formulation has been used to generate the Burmester curves. A random search technique was developed to choose a new set of precision points that lie within user specified limits, in order to find a set of curves that pass through the desired regions. A computer program was written to generate Burmester curves that lie within the desired regions, while maintaining a coupler motion within satisfactory limits. An automobile suspension linkage was successfully designed using this program.

Singular Solutions in Burmester Theory

1973 ◽  
Vol 95 (2) ◽  
pp. 572-576 ◽  
Author(s):  
R. E. Kaufman
Keyword(s):  
Complex Number ◽  
Singular Solutions ◽  
Design Technique ◽  
Planar Mechanisms ◽  
Point Position ◽  
Proper Interpretation ◽  
General Synthesis ◽  
Number Development

A unified complex number development of four position planar finite position theory is presented. This formulation shows that Burmester circlepoint-centerpoint theory specializes to include slider points, concurrency points, poles, and point position reduction by proper interpretation of the trivial roots of the general synthesis equations. Thus a single design technique can be used for the multiposition synthesis of most pin or slider-jointed planar mechanisms. Four position function, path, or motion generating linkages can all be designed in this manner.

Coriolis acceleration analysis of planar mechanisms by complex-number algebra

1982 ◽  
Vol 17 (6) ◽  
pp. 405-414 ◽  
Author(s):  
George N Sandor ◽  
E Raghavacharyulu ◽  
Arthur G Erdman
Keyword(s):  
Complex Number ◽  
Planar Mechanisms ◽  
Coriolis Acceleration ◽  
Acceleration Analysis

An examination of the adaptive random search technique

AIChE Journal ◽  
1976 ◽  
Vol 22 (4) ◽  
pp. 744-750 ◽  
Author(s):  
M. W. Heuckroth ◽  
J. L. Gaddy ◽  
L. D. Gaines
Keyword(s):  
Random Search ◽  
Search Technique ◽  
Adaptive Random Search

A Generalized Approach for the Kinematic Analysis of Planar Mechanisms

1995 ◽  
Vol 209 (4) ◽  
pp. 237-244
Author(s):  
D J A Simpson ◽  
J E L Simmons ◽  
G Moldovean
Keyword(s):  
Computer Program ◽  
Analytical Method ◽  
Building Block ◽  
Kinematic Analysis ◽  
Displacement Velocity ◽  
Planar Mechanisms ◽  
New Approach ◽  
Wide Range ◽  
Complex Mechanisms

This paper describes a new approach to the kinematic analysis of planar mechanisms. The basis of the analytical method is a generic four-bar sub-mechanism which is used as the single building block from which other composite mechanisms may be created. A computer program has been written embodying this method and has been demonstrated to operate successfully providing animated displays of displacement, velocity and acceleration diagrams for a wide range of complex mechanisms.

scholarly journals Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications

1996 ◽  
Vol 5 (3) ◽  
pp. 203-217
Author(s):  
John Gustafson ◽  
Srinivas Aluru
Keyword(s):  
General Theory ◽  
Computer Program ◽  
Complex Number ◽  
Cross Product ◽  
Massively Parallel ◽  
Matrix Product ◽  
Massive Parallelism ◽  
The Way

A number of "tricks" are known that trade multiplications for additions. The term "tricks" reflects the way these methods seem not to proceed from any general theory, but instead jump into existence as recipes that work. The Strassen method for 2 × 2 matrix product with seven multiplications is a well-known example, as is the method for finding a complex number product in three multiplications. We have created a practical computer program for finding such tricks automatically, where massive parallelism makes the combinatorially explosive search tolerable for small problems. One result of this program is a method for cross products of three-vectors that requires only five multiplications.

Rough Terrain Rovers Dynamics Analysis and Optimization

2005 ◽  
Author(s):  
Hadi Tavakoli Nia ◽  
Seyed Hamidreza Alemohammad ◽  
Saeed Bagheri ◽  
Reza Hajiaghaee Khiabani ◽  
Ali Meghdari
Keyword(s):  
Genetic Algorithm ◽  
Software Package ◽  
Random Search ◽  
Nonlinear Problems ◽  
Directional Derivatives ◽  
Rough Terrain ◽  
Dynamics Analysis ◽  
Search Technique ◽  
Dynamical Equations ◽  
New Approach

In this paper a new approach to dynamics optimization of rough terrain rovers is introduced. Since rover wheels traction has a significant role in rover mobility, optimization is based on the minimization of traction at rover wheel-ground interfaces. The method of optimization chosen is Genetic Algorithm (GA) which is a directed random search technique along with the usual optimization based on directional derivatives. GA is a suitable and efficient method of optimization for nonlinear problems. The procedure is applied on a specific rough terrain rover called CEDRA-I Shrimp Rover. Dynamical equations are obtained using Kane’s method. Finally, the results are verified by modeling of the rover in ADAMS® software package.

Order Rectification for Complex Number Based Burmester Curves

1991 ◽  
Vol 113 (3) ◽  
pp. 239-247 ◽  
Author(s):  
T. R. Chase ◽  
W. E. Fang
Keyword(s):  
Complex Number ◽  
Planar Mechanisms

A new solution to the order rectification problem for a driving dyad of planar mechanisms is presented. The method identifies sections of both Burmester curves where the driving link rotates in a single direction when passing through four precision positions in sequence. The new solution describes desirable regions of the curves in terms of the complex number parameters used to generate the curves, providing a complex number equivalent to available pole based order rectification procedures. The new solution is stated in a summary form that is readily codifiable. An example is presented. The theory underlying the new solution is then developed in detail.

Analysis of bio-dynamic model of seated human subject and optimization of the passenger ride comfort for three-wheel vehicle using random search technique

2021 ◽  
Vol 235 (1) ◽  
pp. 106-121
Author(s):  
Rakesh Chandmal Sharma ◽  
Sakshi Sharma ◽  
Sunil Kumar Sharma ◽  
Neeraj Sharma ◽  
Gurpreet Singh
Keyword(s):  
Dynamic Model ◽  
Human Subject ◽  
Present Model ◽  
Ride Comfort ◽  
Random Search ◽  
Linear Optimization ◽  
Search Technique ◽  
Random Surface ◽  
Surface Irregularities ◽  
Iso 2631

Ride comfort is the major concern to the roadway vehicle passengers, travelling in as it affects their health and efficiency to work. In the present study, a 9 DoF model of a three-wheel vehicle is developed with Lagrangian approach to investigate its ride behavior when subjected to random surface irregularities. The irregularities of the track are measured with a three-wheeled setup equipped with profilometer known as opto-coupler. The present model is validated in two ways, first by comparing the vertical-lateral PSD acceleration received from simulation and actual testing and second by comparing vertical seat to head transmissibility obtained from analysis (VSTH) with past reported studies. A 7 DoF bio-dynamic model of the seated human subject is formulated and integrated with the vehicle model, ride comfort of the vehicle and human body segments are assessed based on ISO specifications. Passenger Ride Comfort is optimized through non-linear optimization using Random Search Technique. The modified values of vehicle suspension parameters are presented to obtain optimum passenger comfort based on ISO-2631-1 criteria.

Sign in / Sign up

Export Citation Format

Share Document