2020
DOI: 10.1016/j.robot.2020.103618
|View full text |Cite
|
Sign up to set email alerts
|

Cross-entropy based stochastic optimization of robot trajectories using heteroscedastic continuous-time Gaussian processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…As an avenue for future work, we note that the method presented herein can easily be integrated into existing control and planning pipelines-it would be interesting to benchmark their performance. We have previously integrated a manipulability maximization term in the trajectory optimization formulation of [29]; we plan to integrate the proposed index in a similar formulation that is better suited for nonlinear objectives [33].…”
Section: Discussionmentioning
confidence: 99%
“…As an avenue for future work, we note that the method presented herein can easily be integrated into existing control and planning pipelines-it would be interesting to benchmark their performance. We have previously integrated a manipulability maximization term in the trajectory optimization formulation of [29]; we plan to integrate the proposed index in a similar formulation that is better suited for nonlinear objectives [33].…”
Section: Discussionmentioning
confidence: 99%
“…Zheng et al proposed a laser-based person detection and obstacle avoidance algorithm for differential drive robots applied to a handling robot to transport materials along a reference path in the hospital field ( Zheng et al, 2021 ). Luka Petrović et al proposed a new trajectory planning algorithm using stochastic optimization in order to find a continuous-time Gaussian process for collision-free trajectory generation ( Petrović et al, 2020 ). Deng et al proposed a multi-obstacle path planning and optimization method that uses convex packages to optimize the base obstacles and obtain the corresponding set of base obstacle points, and uses cubic bezier curves to smooth the path to fit the kinematic model of the robot ( Deng et al, 2021 ).…”
Section: Related Workmentioning
confidence: 99%
“…Specifically, path optimisation is the process of designing a path that can minimise/maximise some measure of performance while satisfying a series of constraints [26]. Compared with the other methods mentioned above, path optimisation methods provide several benefits including: 1) the capability of smoothing and shortening the path in a coupled way during the planning process and 2) superiority in computational speed making it suitable for online planning in environments with rapidly changing factors [27].…”
Section: Related Workmentioning
confidence: 99%