Optimal Mechanism Design for Path Generation and Motions With Reduced Harmonic Content

2004 ◽  
Vol 126 (1) ◽  
pp. 191-196 ◽  
Author(s):  
Zhongfan Yuan ◽  
M. J. Gilmartin ◽  
S. S. Douglas
Keyword(s):  
Optimal Design ◽  
Mechanism Design ◽  
Fuzzy Theory ◽  
Path Generation ◽  
Frequency Bandwidth ◽  
Servo Motor ◽  
Output Link ◽  
Optimal Mechanism ◽  
Harmonic Content ◽  
Hybrid Mechanism

The optimal design of linkage mechanisms for path generation and motions with reduced harmonic content is investigated in this paper. The designs are carried out using a two-objective optimizer based on fuzzy theory. The four-bar mechanism is first optimally designed to follow a specified coupler path with the harmonic content of the output link motion being simultaneously minimized to reduce its oscillating frequency bandwidth. For more complicated paths, a five-bar hybrid mechanism driven by a constant speed motor and a servo motor is also optimally designed. The harmonics in the servo motion are also reduced in the design to improve the dynamic characteristics for the servo motor.

Optimization for Harmonics Reduction and Path Generation of Linkage Mechanisms

2003 ◽  
Vol 03 (03) ◽  
pp. 435-442 ◽  
Author(s):  
Zhongfan Yuan ◽  
Yi Min Wu
Keyword(s):  
Optimal Design ◽  
Dynamic Characteristics ◽  
Fuzzy Theory ◽  
Present Approach ◽  
Constant Speed ◽  
Path Generation ◽  
Servo Motor ◽  
Harmonic Content ◽  
Hybrid Mechanism

The optimal design of linkage mechanisms for path generation and motions with reduced harmonic content is investigated. The designs are carried out using a two-objective optimizer based on the fuzzy theory. As an illustration, the present approach is applied to the optimization of a five-bar hybrid mechanism driven by a constant speed motor and a servo motor. The dynamic characteristics of the servo motor are improved, as the harmonics in the servo motion are reduced.

scholarly journals Average-Case Approximation Ratio of Scheduling without Payments

Algorithmica ◽  
2021 ◽  
Author(s):  
Jie Zhang
Keyword(s):  
Mechanism Design ◽  
Case Analysis ◽  
Theoretical Computer Science ◽  
Approximation Ratio ◽  
Approximation Schemes ◽  
Worst Case Analysis ◽  
Algorithmic Mechanism Design ◽  
Worst Case ◽  
Average Case ◽  
Optimal Mechanism

AbstractApart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and design of approximation schemes of Theoretical Computer Science. For instance, the approximation ratio, which is the canonical measure of evaluating how well an incentive-compatible mechanism approximately optimizes the objective, is defined in the worst-case sense. It compares the performance of the optimal mechanism against the performance of a truthful mechanism, for all possible inputs. In this paper, we take the average-case analysis approach, and tackle one of the primary motivating problems in Algorithmic Mechanism Design—the scheduling problem (Nisan and Ronen, in: Proceedings of the 31st annual ACM symposium on theory of computing (STOC), 1999). One version of this problem, which includes a verification component, is studied by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014). It was shown that the problem has a tight approximation ratio bound of $$(n+1)/2$$ ( n + 1 ) / 2 for the single-task setting, where n is the number of machines. We show, however, when the costs of the machines to executing the task follow any independent and identical distribution, the average-case approximation ratio of the mechanism given by Koutsoupias (Theory Comput Syst 54(3):375–387, 2014) is upper bounded by a constant. This positive result asymptotically separates the average-case ratio from the worst-case ratio. It indicates that the optimal mechanism devised for a worst-case guarantee works well on average.

Optimal Mechanism Design with Enforcement

2021 ◽  
Author(s):  
Petteri Palonen ◽  
Teemu Pekkarinen
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism

Optimal Mechanism Design for Fresh Data Acquisition

2021 ◽  
Author(s):  
Meng Zhang ◽  
Ahmed Arafa ◽  
Ermin Wei ◽  
Randall A. Berry
Keyword(s):  
Data Acquisition ◽  
Mechanism Design ◽  
Optimal Mechanism

Optimal mechanism design of in-pipe cleaning robot

2011 ◽  
Author(s):  
Chang Doo Jung ◽  
Won Jee Chung ◽  
Jin Su Ahn ◽  
Myung Sik Kim ◽  
Gi Soo Shin ◽  
...  
Keyword(s):  
Mechanism Design ◽  
Optimal Mechanism ◽  
Cleaning Robot

Tool path optimal design for slow tool servo turning of complex optical surface

2016 ◽  
Vol 231 (5) ◽  
pp. 825-837 ◽  
Author(s):  
Xu Chen ◽  
Min Kang ◽  
Xingsheng Wang ◽  
Muhammad Hassan ◽  
Jun Yang
Keyword(s):  
Optimal Design ◽  
Tool Path ◽  
Tool Path Generation ◽  
Interpolation Error ◽  
Machining Accuracy ◽  
Calculation Error ◽  
Path Generation ◽  
Optical Surface ◽  
Toric Surface ◽  
Slow Tool Servo

In order to increase the machining accuracy of slow tool servo turning of complex optical surface, the optimal design for tool path was studied. A comprehensive tool path generation strategy was proposed to optimize the tool path for machining complex surfaces. A new algorithm was designed for tool nose radius compensation which had less calculation error. Hermite segment interpolation was analyzed based on integrated multi-axes controller, and a new interpolation method referred to as triangle rotary method was put forward and was compared with the area method and three-point method. The machining simulation indicated that the triangle rotary method was significant in error reduction. The interpolation error of toric surface was reduced to 0.0015 µm from 0.06 µm and sinusoidal array surface’s interpolation error decreases to 0.37 µm from 1.5 µm. Finally, a toric surface was machined using optimum tool path generation method to evaluate the proposed tool path generation method.

Sign in / Sign up

Export Citation Format

Share Document