Synthesis of Adjustable Linkages for Precise Path Generation Using the Optimal Pivot Adjustment

2008 ◽  
Author(s):  
Hong Zhou ◽  
Thomas Castillo
Keyword(s):  
Optimal Solution ◽  
Path Generation ◽  
Continuous Path ◽  
Global Optimal Solution ◽  
Optimal Adjustment ◽  
Global Optimal ◽  
Set Up ◽  
The One ◽  
Four Bar Linkage ◽  
Synthesis Approach

Regular nonadjustable four-bar linkages can only generate the desired continuous paths approximately. The whole desired continuous path can be generated precisely by an adjustable four-bar linkage with the one-degree-of-freedom adjustment of the pivot location of the driven side link. In this paper, an adjustment R joint is used to adjust the pivot location of the driven side link in the four-bar linkage. A closed-loop 5R linkage is formed by the adjustable four-bar linkage. The linkage feasibility conditions and path generation flexibilities of the adjustable four-bar linkages are analyzed. The synthesis model of the adjustable four-bar linkages is set up based on the required optimal adjustment of the pivot location when the desired continuous path is precisely generated. The global optimal solution is searched by a genetic algorithm in which the involved constraints are handled using the function penalty method. The effectiveness of the synthesis approach proposed in the paper is verified by two demonstrated examples.

Optimal Synthesis of Adjustable Linkages for Precise Continuous Path Generation Using the Optimal Link Length Adjustment

2008 ◽  
Author(s):  
Hong Zhou ◽  
Mohammed Jamal ◽  
Arif Mohammed
Keyword(s):  
Genetic Algorithm ◽  
Penalty Method ◽  
Optimal Solution ◽  
Optimal Synthesis ◽  
Path Generation ◽  
Continuous Path ◽  
Link Length ◽  
Global Optimal Solution ◽  
Global Optimal ◽  
Synthesis Approach

Conventional nonadjustable four-bar linkages can only generate the desired continuous paths approximately. With one link length adjustment, the whole desired continuous path can be generated precisely. In this paper, the length of the driven side link or coupler is adjusted to generate the desired continuous paths precisely. The linkage feasibility conditions and path generation flexibilities of the adjustable four-bar linkages are analyzed. The optimal synthesis model of adjustable four-bar linkages is established based on the required optimal link length adjustment when the desired continuous path is precisely generated. The global optimal solution is searched by a real-valued genetic algorithm in which the involved constraints are handled using the function penalty method. The effectiveness of the optimal synthesis approach proposed in the paper is verified by the demonstrated examples.

Improved ADOPT Algorithm for the Problem of Multi-Robot Communication Failure

2013 ◽  
Vol 427-429 ◽  
pp. 2834-2837
Author(s):  
Bin Ge ◽  
Ling Liu
Keyword(s):  
Optimization Problem ◽  
Optimal Solution ◽  
Global Optimal Solution ◽  
Communication Failure ◽  
Distributed Constraint Optimization ◽  
Global Optimal ◽  
Set Up ◽  
Distributed Constraint Optimization Problem ◽  
Robot Communication ◽  
Multi Robot

DCOP (Distributed Constraint Optimization Problem) is currently the most widely used in multi-robot communication algorithm problem, Adopt algorithm is a kind of algorithm which is relatively perfect; it can transport messages accurately under the harsh environment of communication. It is completely asynchronous algorithm, through analyzing algorithm for local agents to obtain the global optimal solution, in the comparison of each algorithm can see that ADOPT algorithm not only can well solve the problem of communication failure, and the algorithm set up mechanism of terminate detection, it can make the algorithm stops on the optimal solution, and effectively solve the deadlock problem. The text use ADOPT algorithm to analyze how to solve the problem of multi-robot communication failure, and improve the algorithm to take messages more accurately and effectively.

AO-BBO: A Novel Optimization Algorithm and Its Application in Plant Drug Extraction

2019 ◽  
Vol 19 (2) ◽  
pp. 139-145 ◽  
Author(s):  
Bote Lv ◽  
Juan Chen ◽  
Boyan Liu ◽  
Cuiying Dong
Keyword(s):  
Optimization Algorithm ◽  
Learning Strategy ◽  
Optimal Solution ◽  
Population Diversity ◽  
Global Optimal Solution ◽  
Plant Medicine ◽  
Suitability Index ◽  
Sensing Model ◽  
Local Optimal Solution ◽  
Global Optimal

<P>Introduction: It is well-known that the biogeography-based optimization (BBO) algorithm lacks searching power in some circumstances. </P><P> Material & Methods: In order to address this issue, an adaptive opposition-based biogeography-based optimization algorithm (AO-BBO) is proposed. Based on the BBO algorithm and opposite learning strategy, this algorithm chooses different opposite learning probabilities for each individual according to the habitat suitability index (HSI), so as to avoid elite individuals from returning to local optimal solution. Meanwhile, the proposed method is tested in 9 benchmark functions respectively. </P><P> Result: The results show that the improved AO-BBO algorithm can improve the population diversity better and enhance the search ability of the global optimal solution. The global exploration capability, convergence rate and convergence accuracy have been significantly improved. Eventually, the algorithm is applied to the parameter optimization of soft-sensing model in plant medicine extraction rate. Conclusion: The simulation results show that the model obtained by this method has higher prediction accuracy and generalization ability.</P>

scholarly journals Best Proximity Point Results in Complex Valued Metric Spaces

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Binayak S. Choudhury ◽  
Nikhilesh Metiya ◽  
Pranati Maity
Keyword(s):  
Minimum Distance ◽  
Metric Spaces ◽  
Optimal Solution ◽  
Global Optimal Solution ◽  
Complex Valued Metric Space ◽  
Fixed Point Equation ◽  
Point Equation ◽  
Global Optimal ◽  
Metric Function ◽  
Complex Valued

We introduce the concept of proximity points for nonself-mappings between two subsets of a complex valued metric space which is a recently introduced extension of metric spaces obtained by allowing the metric function to assume values from the field of complex numbers. We apply this concept to obtain the minimum distance between two subsets of the complex valued metric spaces. We treat the problem as that of finding the global optimal solution of a fixed point equation although the exact solution does not in general exist. We also define and use the concept of P-property in such spaces. Our results are illustrated with examples.

scholarly journals Prototype Filter Design Based on Channel Estimation for FBMC/OQAM Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Yongjin Liu ◽  
Xihong Chen ◽  
Yu Zhao
Keyword(s):  
Genetic Algorithm ◽  
Channel Estimation ◽  
Optimization Problem ◽  
Filter Design ◽  
Stop Band ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Global Optimal Solution ◽  
Prototype Filter ◽  
Global Optimal

A prototype filter design for FBMC/OQAM systems is proposed in this study. The influence of both the channel estimation and the stop-band energy is taken into account in this method. An efficient preamble structure is proposed to improve the performance of channel estimation and save the frequency spectral efficiency. The reciprocal of the signal-to-interference plus noise ratio (RSINR) is derived to measure the influence of the prototype filter on channel estimation. After that, the process of prototype filter design is formulated as an optimization problem with constraint on the RSINR. To accelerate the convergence and obtain global optimal solution, an improved genetic algorithm is proposed. Especially, the History Network and pruning operator are adopted in this improved genetic algorithm. Simulation results demonstrate the validity and efficiency of the prototype filter designed in this study.

scholarly journals A Shearlets-Based Method for Rain Removal from Single Images

2019 ◽  
Vol 9 (23) ◽  
pp. 5137 ◽  
Author(s):  
Guomin Sun ◽  
Jinsong Leng ◽  
Carlo Cattani
Keyword(s):  
Optimal Solution ◽  
Single Image ◽  
Split Bregman ◽  
Global Optimal Solution ◽  
Rain Removal ◽  
Rain Drops ◽  
Global Optimal ◽  
Removal Model ◽  
Split Bregman Algorithm ◽  
Sparse Priors

This work focuses on the problem of rain removal from a single image. The directional multilevel system, Shearlets, is used to describe the intrinsic directional and structure sparse priors of rain streaks and the background layer. In this paper, a Shearlets-based convex rain removal model is proposed, which involves three sparse regularizers: including the sparse regularizer of rain streaks and two sparse regularizers of the Shearlets transform of background layer in the rain drops’ direction and the Shearlets transform of rain streaks in the perpendicular direction. The split Bregman algorithm is utilized to solve the proposed convex optimization model, which ensures the global optimal solution. Comparison tests with three state-of-the-art methods are implemented on synthetic and real rainy images, which suggests that the proposed method is efficient both in rain removal and details preservation of the background layer.

scholarly journals Hybrid GA-SOCP Approach for Placement and Sizing of Distributed Generators in DC Networks

2020 ◽  
Vol 10 (23) ◽  
pp. 8616 ◽  
Author(s):  
Oscar Danilo Montoya ◽  
Walter Gil-González ◽  
Luis Fernando Grisales-Noreña
Keyword(s):  
Power Flow ◽  
Optimal Power Flow ◽  
Mathematical Optimization ◽  
Optimal Solution ◽  
Distribution Networks ◽  
Optimization Approach ◽  
Global Optimal Solution ◽  
Distributed Generators ◽  
Second Order Cone ◽  
Global Optimal

This research addresses the problem of the optimal location and sizing distributed generators (DGs) in direct current (DC) distribution networks from the combinatorial optimization. It is proposed a master–slave optimization approach in order to solve the problems of placement and location of DGs, respectively. The master stage applies to the classical Chu & Beasley genetic algorithm (GA), while the slave stage resolves a second-order cone programming reformulation of the optimal power flow problem for DC grids. This master–slave approach generates a hybrid optimization approach, named GA-SOCP. The main advantage of optimal dimensioning of DGs via SOCP is that this method makes part of the exact mathematical optimization that guarantees the possibility of finding the global optimal solution due to the solution space’s convex structure, which is a clear improvement regarding classical metaheuristic optimization methodologies. Numerical comparisons with hybrid and exact optimization approaches reported in the literature demonstrate the proposed hybrid GA-SOCP approach’s effectiveness and robustness to achieve the global optimal solution. Two test feeders compose of 21 and 69 nodes that can locate three distributed generators are considered. All of the computational validations have been carried out in the MATLAB software and the CVX tool for convex optimization.

Sign in / Sign up

Export Citation Format

Share Document