2021
DOI: 10.1109/access.2021.3056755
|View full text |Cite
|
Sign up to set email alerts
|

A Trade-off Between Energy Saving and Cycle Time Reduction by Pareto Optimal Corner Smoothing in Industrial Feed Drive Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 42 publications
1
8
0
Order By: Relevance
“…7 and 12 in Section III-B and Figs. 14 and 19 in Section III-C), where this result is in agreement with the findings of [34], [40].…”
Section: Discussionsupporting
confidence: 90%
See 3 more Smart Citations
“…7 and 12 in Section III-B and Figs. 14 and 19 in Section III-C), where this result is in agreement with the findings of [34], [40].…”
Section: Discussionsupporting
confidence: 90%
“…The time-optimal KCSIA* solution is a 0.017 s (i.e., 0.484 %) faster cycle time and 1.780 mm (i.e., 24.715 %) less corner smoothing than KC-SIA. KCSIA has an inferior solution since it maximizes cornering velocities, consequently maximizing the cornering Euclidean lengths as shown in (31) and (34). This results in KCSIA having a reduced cycle time at the cost of a high total cornering Euclidean length (i.e., high cornering errors), while KCSIA* considers both objectives and provides a better performance.…”
Section: ) Optimization Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Moreover, adding equality constraints at the start and end of the reparameterization function allows smooth start-and end-transitions (i.e., zero initial and final velocities and accelerations). For the bi-objective optimization problem, the process of revealing the Pareto front comprising trade-off solutions between time and jerk is implemented by applying the divide and conquer algorithm (D&C) [33]- [35] with normalized normal constraint (NNC) method [36], [37], where each solution is computed using the sequential quadratic programming (SQP) [38]. This achieves an efficient representation of the Pareto front and determines the constrained reparameterization of the trajectory with a significant trade-off.…”
Section: Introductionmentioning
confidence: 99%