Exact-Gradient Optimization Method for Rigid-Body Guidance Synthesis of Planar Mechanisms

2004 ◽  
Author(s):  
Ramon Sancibrian ◽  
Pablo Garcia ◽  
Fernando Viadero ◽  
Alfonso Fernandez
Keyword(s):  
Rigid Body ◽  
Synthesis Method ◽  
Computational Cost ◽  
Optimal Solution ◽  
Optimization Method ◽  
Planar Mechanisms ◽  
Synthesis Conditions ◽  
Kinematic Chains ◽  
Gradient Optimization ◽  
Definition Of

In this paper an approximate kinematic synthesis method is presented with application to rigid-body guidance in planar multibody systems. The problem of finding the optimal dimensions in linkages with rigid-body guidance constraints has been widely studied. Many techniques have been developed and applied to numerous kinematic chains. However, some problems remain without appropriate solution, such as a large number of required poses or low computational cost. The proposed method uses exact-gradient determination to search for an optimal solution. The modelling of the mechanism uses fully Cartesian coordinates and is formulated by means of algebraic constraint equations. Furthermore, the formulation allows the use of a large number of prescribed poses giving high accuracy in the definition of synthesis conditions. Examples are included to illustrate the new approach to some synthesis specifications.

Optimization Method Based on a Mix Strategy

2013 ◽  
Vol 816-817 ◽  
pp. 1154-1157
Author(s):  
Xu Yin ◽  
Ai Min Ji
Keyword(s):  
Optimization Problems ◽  
Optimal Solution ◽  
Optimization Method ◽  
Local Solution ◽  
Collaborative Optimization ◽  
Design Variables ◽  
Gradient Optimization ◽  
Local Optimal Solution ◽  
Optimal Values ◽  
Low Efficiency

To solve problems that exist in optimal design such as falling into local optimal solution easily and low efficiency in collaborative optimization, a new mix strategy optimization method combined design of experiments (DOE) with gradient optimization (GO) was proposed. In order to reduce the effect on the result of optimization made by the designers decision, DOE for preliminary analysis of the function model was used, and the optimal values obtained in DOE stage was taken as the initial values of design variables in GO stage in the new optimization method. The reducer MDO problem was taken as a example to confirm the global degree, efficiency, and accuracy of the method. The results show the optimization method could not only avoid falling into local solution, but also have an obvious superiority in treating the complex collaborative optimization problems.

Optimum Synthesis of Planar Mechanisms for Path Generation Based on a Combined Discrete Fourier Descriptor

2015 ◽  
Vol 7 (4) ◽  
Author(s):  
Wen-Yi Lin
Keyword(s):  
Synthesis Method ◽  
Optimization Method ◽  
Path Generation ◽  
Fourier Descriptor ◽  
Planar Mechanisms ◽  
Two Phase ◽  
Phase Synthesis ◽  
Optimum Synthesis ◽  
Centroid Distance ◽  
The One

A two-phase synthesis method is described, which is capable of solving quite challenging path generation problems. A combined discrete Fourier descriptor (FD) is proposed for shape optimization, and a geometric-based approach is used for the scale–rotation–translation synthesis. The combined discrete FD comprises three shape signatures, i.e., complex coordinates (CCs), centroid distance (CD), and triangular centroid area (TCA), which can capture greater similarity of shape. The genetic algorithm–differential evolution (GA–DE) optimization method is used to solve the optimization problem. The proposed two-phase synthesis method, based on the combined discrete FD, successfully solves the challenging path generation problems with a relatively small number of function evaluations. A more accurate path shape can be obtained using the combined FD than the one-phase synthesis method. The obtained coupler curves approximate the desired paths quite well.

Development of an Optimization Method for Determination of Process Sequences Considering Prismatic Workpieces

1994 ◽  
Author(s):  
Joachim G. Taiber
Keyword(s):  
Process Planning ◽  
Optimal Solution ◽  
Cutting Parameters ◽  
Optimization Method ◽  
Manufacturing Cost ◽  
Tool Paths ◽  
Set Up ◽  
Definition Of ◽  
Optimization Of Cutting Parameters

Abstract In the field of process planning most of the working time is spent for the following activities: machine tool and tool assignment determination of the set-up and process sequence definition of tool paths optimization of cutting parameters The quality how these activities are done influence substantially manufacturing cost that are to be minimized. The more complex a planning task is the more difficult it is for the planner to work out an optimal solution within reasonable time. In this article it will be discussed how process planning of prismatic workpieces considering drilling and milling machining can be optimized by computer assistance.

scholarly journals Multi-Fidelity Local Surrogate Model for Computationally Efficient Microwave Component Design Optimization

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 3023 ◽  
Author(s):  
Yiran Song ◽  
Qingsha S. Cheng ◽  
Slawomir Koziel
Keyword(s):  
Surrogate Model ◽  
Polynomial Interpolation ◽  
Computational Cost ◽  
Optimal Solution ◽  
Wide Band ◽  
Optimization Method ◽  
Local Region ◽  
Optimization Process ◽  
Optimized Design ◽  
Mimo Antenna

In order to minimize the number of evaluations of high-fidelity (“fine”) model in the optimization process, to increase the optimization speed, and to improve optimal solution accuracy, a robust and computational-efficient multi-fidelity local surrogate-model optimization method is proposed. Based on the principle of response surface approximation, the proposed method exploits the multi-fidelity coarse models and polynomial interpolation to construct a series of local surrogate models. In the optimization process, local region modeling and optimization are performed iteratively. A judgment factor is introduced to provide information for local region size update. The last local surrogate model is refined by space mapping techniques to obtain the optimal design with high accuracy. The operation and efficiency of the approach are demonstrated through design of a bandpass filter and a compact ultra-wide-band (UWB) multiple-in multiple-out (MIMO) antenna. The response of the optimized design of the fine model meet the design specification. The proposed method not only has better convergence compared to an existing local surrogate method, but also reduces the computational cost substantially.

Geometric design of planar mechanisms based on virtual guides for manipulation

Robotica ◽  
2015 ◽  
Vol 34 (12) ◽  
pp. 2653-2668 ◽  
Author(s):  
Nina Robson ◽  
Shramana Ghosh
Keyword(s):  
Rigid Body ◽  
Closed Loop ◽  
Normal Direction ◽  
Assistive Technologies ◽  
Paper Briefly ◽  
Planar Mechanisms ◽  
Kinematic Synthesis ◽  
Kinematic Chains ◽  
Moving Body ◽  
Mechanical Linkage

SUMMARYThis paper presents recent results and applications of our planar kinematic synthesis of serial and parallel linkages to guide a rigid body, such that it does not violate normal direction and curvature constraints imposed by contact with objects in the environment. The paper briefly reviews the recently developed theory on transforming contact direction and curvature constraints into conditions on velocity and acceleration of certain points in the moving body to obtain synthesis equations which can, subsequently be solved to find the dimensions of a mechanical linkage. The main contribution of the paper is in demonstrating the applicability of the proposed theory to the kinematic synthesis of both open and closed-loop kinematic linkages. We provide preliminary results on the synthesis of kinematic chains based on novel task specifications that incorporate curvature constraints with a variety of applications, such as passive suspensions for small rovers, assistive technologies, as well as grasping.

Synthesis of Gear-Linkage Mechanisms by Topology Optimization

2018 ◽  
Author(s):  
Neung Hwan Yim ◽  
Seok Won Kang ◽  
Yoon Young Kim
Keyword(s):  
Topology Optimization ◽  
Design Space ◽  
Synthesis Method ◽  
Variable Stiffness ◽  
Optimization Methods ◽  
Optimization Method ◽  
Planar Mechanisms ◽  
Gear Design ◽  
Linkage Design ◽  
Gradient Based

This work is concerned with a new mechanism synthesis method for the simultaneous determination of the type, number and dimension of mechanisms by topology optimization. Earlier topology optimization methods can synthesize linkage mechanisms that consist only of links and joints. The proposed synthesis method is a gradient-based topology optimization method useful for the synthesis of planar mechanisms consisting of linkages and gears. To formulate the topology optimization based method, we propose two superposed design spaces as a ground structure: the linkage and gear design spaces. The gear design space is discretized by newly proposed gear blocks while the linkage design space by rigid blocks. The zero-length springs with variable stiffness are used to control the connectivity of blocks, which in turns determines the configuration of the synthesized mechanism. After the proposed topology-optimization-based synthesis formulation is presented, its effectiveness and validity are checked with various synthesis examples.

Evolutionary Heuristic A* Search: Pathfinding Algorithm with Self-Designed and Optimized Heuristic Function

2019 ◽  
Vol 13 (01) ◽  
pp. 5-23 ◽  
Author(s):  
Ying Fung Yiu ◽  
Jing Du ◽  
Rabi Mahapatra
Keyword(s):  
High Performance ◽  
Search Algorithm ◽  
Computational Cost ◽  
Optimal Solution ◽  
Optimization Method ◽  
Careful Consideration ◽  
Heuristic Function ◽  
Design And Optimization ◽  
Function Design ◽  
Time And Space Complexity

The performance and efficiency of A* search algorithm heavily depends on the quality of the heuristic function. Therefore, designing an optimal heuristic function becomes the primary goal of developing a search algorithm for specific domains in artificial intelligence. However, it is difficult to design a well-constructed heuristic function without careful consideration and trial-and-error, especially for complex pathfinding problems. The complexity of a heuristic function increases and becomes unmanageable to design when an increasing number of parameters are involved. Existing approaches often avoid complex heuristic function design: they either trade-off the accuracy for faster computation or taking advantage of the parallelism for better performance. The objective of this paper is to reduce the difficulty of complex heuristic function design for A* search algorithm. We aim to design an algorithm that can be automatically optimized to achieve rapid search with high accuracy and low computational cost. In this paper, we present a novel design and optimization method for a Multi-Weighted-Heuristics function (MWH) named Evolutionary Heuristic A* search (EHA*) to: (1) minimize the effort on heuristic function design via Genetic Algorithm (GA), (2) optimize the performance of A* search and its variants including but not limited to WA* and MHA*, and (3) guarantee the completeness and optimality. EHA* algorithm enables high performance searches and significantly simplifies the processing of heuristic design. We apply EHA* to multiple grid-based pathfinding benchmarks to evaluate the performance. Our experiment result shows that EHA* (1) is capable of choosing an accurate heuristic function that provides an optimal solution, (2) can identify and eliminate inefficient heuristics, (3) is able to automatically design multi-heuristics function, and (4) minimizes both the time and space complexity.

On the Optimal Precoder Design for Energy-Efficient and Secure MIMO Systems

2017 ◽  
Vol 3 (1) ◽  
pp. 1
Author(s):  
Tung T. Vu ◽  
Ha Hoang Kha
Keyword(s):  
Energy Efficiency ◽  
Mimo Systems ◽  
Search Algorithm ◽  
Multiple Input Multiple Output ◽  
Research Work ◽  
Computational Cost ◽  
Optimal Solution ◽  
Secrecy Rate ◽  
Highly Nonlinear ◽  
Precoder Design

In this research work, we investigate precoder designs to maximize the energy efficiency (EE) of secure multiple-input multiple-output (MIMO) systems in the presence of an eavesdropper. In general, the secure energy efficiency maximization (SEEM) problem is highly nonlinear and nonconvex and hard to be solved directly. To overcome this difficulty, we employ a branch-and-reduce-and-bound (BRB) approach to obtain the globally optimal solution. Since it is observed that the BRB algorithm suffers from highly computational cost, its globally optimal solution is importantly served as a benchmark for the performance evaluation of the suboptimal algorithms. Additionally, we also develop a low-complexity approach using the well-known zero-forcing (ZF) technique to cancel the wiretapped signal, making the design problem more amenable. Using the ZF based method, we transform the SEEM problem to a concave-convex fractional one which can be solved by applying the combination of the Dinkelbach and bisection search algorithm. Simulation results show that the ZF-based method can converge fast and obtain a sub-optimal EE performance which is closed to the optimal EE performance of the BRB method. The ZF based scheme also shows its advantages in terms of the energy efficiency in comparison with the conventional secrecy rate maximization precoder design.

AUTOMATED SYNTHESIS OF BROADBAND MATCHING AND FILTERING DEVICES

2018 ◽  
pp. 48-52
Author(s):  
S. V. Popov ◽  
G. N. Devyatkov
Keyword(s):  
Transmission Lines ◽  
Synthesis Method ◽  
Optimal Solution ◽  
Complex Problem ◽  
Matching Problem ◽  
Engineering Product ◽  
Second Stage ◽  
Automated Method ◽  
Broadband Matching ◽  
Element Base

When designing radioelectronic devices, that are included in the composition of various systems, it is important to solve broadband matching problem and filtering problem. However, usually these problems are separated and not considered together. Moreover, the synthesis of filters does not take into account the behavior of impedances of the generator and the load in the stopbands. The solution of the complex problem is actual, since it allows expanding the functionality of the device, which can greatly simplify the construction of the radio engineering product. It should be noted that in the known literature solution of this problem in such a formulation is not considered. The aim of the work is to develop a synthesis method and algorithm of broadband devices that connect arbitrary immitances of the generator and the load, and these devices should perform simultaneously functions of both matching and filtering in reactive lumped electric element base and in distributed electric element base, limited only by transmission lines with T-waves. In this paper, a two-stage automated method of synthesis presented here stage allows at the first to adequately find a good initial solution to the posed problem (determining structure and parameters of the broadband matching and filtering quadrupole), in the second stage this approach allows to find the optimal solution to the complex problem, taking into account the constraints on physical and circuit realizability. In this work, the synthesis of broadband matching and filtering devices in lumped and distributed electrical element basis is carried out, and these devices connect complex impedances of the source and the load. The characteristics of the devices obtained after the synthesis show that the solution of the complex problem of matching and filtering gives a significant improvement in filtering properties with small losses in the level of transmitted power.

Sign in / Sign up

Export Citation Format

Share Document