[Submitted on 3 Nov 2026]
Title:$\mathcal{C}^\infty$ Smooth Trajectory Planning with Application to Soft Robots
View a PDF of the paper titled $\mathcal{C}^\infty$ Smooth Trajectory Planning with Application to Soft Robots, by Reinhard M. Grassmann and 2 other authors
View PDF HTML (experimental)
Abstract:High motion performance and avoiding structural vibrations rely on smooth trajectory planning. The smoothness requirement depends on the robot's complexity in terms of the number of degrees of freedom and system order due to the flexibility of the joints and links. For industrial robots, the smoothness requirements have been determined and subsequently taken into account. Although unknown for soft continuum robots, the exact smoothness requirement can potentially be much larger than previously considered ones such as $\mathbf{\mathcal{C}^4}$ for collaborative robots and $\mathbf{\mathcal{C}^5}$ for quadcopter drones. To address this gap, we introduce a $\mathbf{\mathcal{C}^\infty}$-smooth trajectory generator that respects defined kinematic limits and generates infinitely differentiable trajectories. The generated path addresses and generalizes to all smoothness requirements, where a transition between sequential states is needed. Therefore, all trajectories have continuous velocity, acceleration, jerk, snap, crackle, pop, etc. Of particular interest is the case of null boundary conditions, i.e., all derivatives at the start and end of the trajectory are equal to zero. We verified and evaluated our proposed approach in simulations and on hardware.
Comments: 8 pages, 6 figures
Subjects:
Robotics (cs.RO)
Cite as: arXiv:2611.05615 [cs.RO]
(or arXiv:2611.05615v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2611.05615
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Reinhard Grassmann [view email] [v1] Tue, 3 Nov 2026 20:59:09 UTC (7,084 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled $\mathcal{C}^\infty$ Smooth Trajectory Planning with Application to Soft Robots, by Reinhard M. Grassmann and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Additional Features
Audio Summary
Current browse context:
cs.RO
new | recent | 2026-11
Change to browse by:
cs
References & Citations
SciX
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)