Worst-case optimal noncausal motion planning for residual vibration reduction

Author(s):  
Aurelio Piazzi ◽  
Antonio Visioli
2004 ◽  
Vol 127 (4) ◽  
pp. 307-314 ◽  
Author(s):  
Jason Lawrence ◽  
William Singhose ◽  
Keith Hekman

Fast and accurate point-to-point motion is a common operation for industrial machines, but vibration will frequently corrupt such motion. This paper develops commands that can move machines without vibration, even in the presence of Coulomb friction. Previous studies have shown that input shaping can be used on linear systems to produce point-to-point motion with no residual vibration. This paper extends command-shaping theory to nonlinear systems, specifically systems with Coulomb friction. This idea is applied to a PD-controlled mass with Coulomb friction to ground. The theoretical developments are experimentally verified on a solder cell machine. The results show that the new commands allow the proportional gain to be increased, resulting in reduced rise time, settling time, and steady-state error.


1998 ◽  
Vol 41 (4) ◽  
pp. 852-859
Author(s):  
Kazuyuki HANAHARA ◽  
Yoshihiko SUGIYAMA ◽  
Masao TANAKA

2010 ◽  
Vol 20 (03) ◽  
pp. 255-283 ◽  
Author(s):  
YOAV GABRIELY ◽  
ELON RIMON

This paper classifies common mobile robot on-line motion planning problems according to their competitive complexity. The competitiveness of an on-line algorithm measures its worst case performance relative to the optimal off-line solution to the problem. Competitiveness usually means constant relative performance. This paper generalizes competitiveness to any functional relationship between on-line performance and optimal off-line solution. The constants in the functional relationship must be scalable and may depend only upon on-line information. Given an on-line task, its competitive complexity class is a pair of lower and upper bounds on the competitive performance of all on-line algorithms for the task, such that the two bounds satisfy the same functional relationship. The paper classifies the following on-line motion planning problems into competitive classes: area coverage, navigation to a target, and on-line search for an optimal path. In particular, it is shown that navigation to a target whose position is either apriori known or recognized upon arrival belongs to a quadratic competitive complexity class. The hardest on-line problem involves navigation in unknown variable traversibility environments. Under certain restriction on traversibility, this last problem belongs to an exponential competitive complexity class.


1994 ◽  
Vol 116 (2) ◽  
pp. 654-659 ◽  
Author(s):  
W. Singhose ◽  
W. Seering ◽  
N. Singer

This paper describes a method for limiting vibration in flexible systems by shaping the input to the system. Unlike most previous input shaping strategies, this method does not require a precise system model or lengthy numerical computation; only estimates of the system natural frequency and damping ratio are required. The effectiveness of this method when there are errors in the system model is explored and quantified. Next, an algorithm is presented, which, given an upper bound on acceptable residual vibration amplitude, determines a shaping strategy that is insensitive to errors in the estimate of the natural frequency. Finally, performance predictions are compared to hardware experiments.


Sign in / Sign up

Export Citation Format

Share Document