Table 1 Pseudocode of double-quartic polynomial trajectory planning
From: A Real-time Look-ahead Trajectory Planning Methodology for Multi Small Line Segments Path
Pseudocode | Â |
|---|---|
\(s_{1} = 0\) \(v^{\prime}_{\max } = v_{{{\text{end}}}}\) \(i = 0\) While \(i < n\) \(s_{1} = s_{{v_{{{\text{start}}}} \to v^{\prime}_{\max } }} + s_{{v_{{{\text{end}}}} \to v^{\prime}_{\max } }}\) \(v^{\prime}_{\max } = v_{{s = \frac{{s - s_{1} }}{2}}}\) end | |