2017 Third International Conference on Sensing, Signal Processing and Security (ICSSS) 2017
DOI: 10.1109/ssps.2017.8071566
|View full text |Cite
|
Sign up to set email alerts
|

Optimal trajectory planning based on bidirectional spline-RRT* for wheeled mobile robot

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…where y is the output matrix tracking, y des is the intended lateral position, v xdes is the desired speed, l des is the index number of the desired lane from the right, L w is the lane width, and ∆Y R is the lateral offset of the road relative to a straight road. The path planning nonlinear optimization problem can be expressed in the form: (10) u min < utþ i À 1jt ðÞ < u max (11) ∆u min < utþ i À 1jt ðÞ À utþ i À 2jt ðÞ < ∆u max (12) where (t + i|t) index indicate the values at future time t+iand predicted at current time t. N is the prediction horizon. The vector of slack variables at time t is denoted by s i .The tracking quadratic term, changes in inputs, inputs, potential field functions, and slack variables compose the objective function.…”
Section: Mpc Frameworkmentioning
confidence: 99%
See 2 more Smart Citations
“…where y is the output matrix tracking, y des is the intended lateral position, v xdes is the desired speed, l des is the index number of the desired lane from the right, L w is the lane width, and ∆Y R is the lateral offset of the road relative to a straight road. The path planning nonlinear optimization problem can be expressed in the form: (10) u min < utþ i À 1jt ðÞ < u max (11) ∆u min < utþ i À 1jt ðÞ À utþ i À 2jt ðÞ < ∆u max (12) where (t + i|t) index indicate the values at future time t+iand predicted at current time t. N is the prediction horizon. The vector of slack variables at time t is denoted by s i .The tracking quadratic term, changes in inputs, inputs, potential field functions, and slack variables compose the objective function.…”
Section: Mpc Frameworkmentioning
confidence: 99%
“…(10). To satisfy the limitations of actuator, the inputs of control and their changes are constrained in (11) and (12) where u min and u max are the lower and upper bounds matrices of control input, and ∆u min and ∆u max are the lower and upper bounds matrices of the control inputs changes.…”
Section: Mpc Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…As opposed to exhaustively creating a full-cost function, the idea of this technique is to firstly sample random points regardless of interfering obstacles, then connect only collision free points to construct a map. This technique is typically used for a robotic manipulator [122][123][124][125][126][127], however is still sometimes used for a mobile vehicle [128][129][130][131][132][133][134]. The problem with this technique is that post-processing to smooth the path is required in order for the path to be realistically traversable for the vehicle [135][136][137].…”
Section: Sampling-based Path Planningmentioning
confidence: 99%
“…Differ from search methods, RRT (Rapidly-Exploring Random Tree) [13] represents the sampling-based method [14] that is extended to obtain nodes in continuous feature space. In order to improve the real-time performance, Bi-RRT (Bidirectional RRT) is derived as bidirectional expansion from the start node and target node [15] and H-RRT (Heuristic RRT) employs heuristic function to extend low cost nodes [16]. However, the sample-based algorithm always contains a random seed generator, so it inevitably contains zigzags [12] leading to the planning results should be postprocessed for smoothing [17].…”
Section: Introductionmentioning
confidence: 99%