2017
DOI: 10.1017/s026357471700011x
|View full text |Cite
|
Sign up to set email alerts
|

An efficient stochastic approach for robust time-optimal trajectory planning of robotic manipulators under limited actuation

Abstract: SUMMARYThis paper focuses on the problem of robust time-optimal trajectory planning of robotic manipulators to track a given path under a probabilistic limited actuation, that is, the probability for the actuation to be limited is no less than a given bound κ. We give a general and practical method to reduce the probabilistic constraints to a set of deterministic constraints and show that the deterministic constraints are equivalent to a set of linear constraints under certain conditions. As a result, the orig… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…SPM has been widely used in various kinds of robots under various constraints. [31][32][33][34][35][36][37] To further optimize the path, Bobrow 38 described paths by B-spline and adopted SPM to search the minimum-time path. Pham et al 39 combined SPM with rapidly-exploring random tree to plan the optimal path.…”
Section: Introductionmentioning
confidence: 99%
“…SPM has been widely used in various kinds of robots under various constraints. [31][32][33][34][35][36][37] To further optimize the path, Bobrow 38 described paths by B-spline and adopted SPM to search the minimum-time path. Pham et al 39 combined SPM with rapidly-exploring random tree to plan the optimal path.…”
Section: Introductionmentioning
confidence: 99%
“…The method has currently been applied to various situations such as parallel 21 and cable-based 22 manipulators, nonlinear mechatronic systems, 23 wheeled robots, 24 jerk constraints, 25 impulse constraints 26 and probabilistic constraints. 27…”
Section: Introductionmentioning
confidence: 99%
“…22 In the convex optimization approach, the time-optimal path tracking problem is transformed into a convex optimal control problem by discretization the path s into N segments. [18][19][20] Recently, this method has been used to find the minimum time motion of humanoid robots in multi-contact tasks. 21 The convex optimization method is indeed a more generic approach, as it not only applies to finding time-optimal solutions, but can also be used to minimize any other index function.…”
Section: Introductionmentioning
confidence: 99%