S-Curve Path Planning Method with Initial Velocity

For the problem of S-curve path planning with initial velocity, firstly, reverse velocity update is performed to obtain the maximum initial velocity allowed for displacement. According to the principle of optimal time, the binary Newton iteration method is used to calculate the periods of variable acceleration and variable deceleration, and the periods are revised based on dynamic constraints. Then the same method is used to calculate the periods of uniform acceleration and deceleration. For the situation that the initial velocity exceeds the maximum initial velocity allowed for displacement and the acceleration reaches acceleration constraint, equation reconstruction is performed to re-establish equations for uniform acceleration and variable deceleration periods to solve. Finally, the uniform velocity period is calculated by a linear equation. After solving the time of each planning segment, the expected velocity and position can be calculated, which achieves closed-loop control of the S-curve with initial velocity. This method can solve boundary situations, such as initial velocity being negative, initial velocity exceeding the maximum initial velocity allowed for displacement and acceleration reaching acceleration constraint. Simulation and experimental results show that this method is simple, efficient, and boundary full coverage, which can meet the control requirements of efficient and smooth in inertial navigation system.

Authors

Institutions

Publication Details

Published
2024-11-22
DOI
https://doi.org/10.1109/ifeea64237.2024.10878593
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

S-Curve Path Planning Method with Initial Velocity

De-Song Mu, Tianxiao Song, Jin Wang, Yunshuang Yu
Robotic Path Planning Algorithms
article

S-Curve Path Planning Method with Initial Velocity

De-Song Mu, Tianxiao Song, Jin Wang, Yunshuang Yu
article en

Abstract

For the problem of S-curve path planning with initial velocity, firstly, reverse velocity update is performed to obtain the maximum initial velocity allowed for displacement. According to the principle of optimal time, the binary Newton iteration method is used to calculate the periods of variable acceleration and variable deceleration, and the periods are revised based on dynamic constraints. Then the same method is used to calculate the periods of uniform acceleration and deceleration. For the situation that the initial velocity exceeds the maximum initial velocity allowed for displacement and the acceleration reaches acceleration constraint, equation reconstruction is performed to re-establish equations for uniform acceleration and variable deceleration periods to solve. Finally, the uniform velocity period is calculated by a linear equation. After solving the time of each planning segment, the expected velocity and position can be calculated, which achieves closed-loop control of the S-curve with initial velocity. This method can solve boundary situations, such as initial velocity being negative, initial velocity exceeding the maximum initial velocity allowed for displacement and acceleration reaching acceleration constraint. Simulation and experimental results show that this method is simple, efficient, and boundary full coverage, which can meet the control requirements of efficient and smooth in inertial navigation system.

China Academy of Launch Vehicle Technology (CN)
Sustainable cities and communities
Openalex Percentile: Top 73%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.