Backend
$\mathcal{C}^\infty$ Smooth Trajectory Planning with Application to Soft Robots
arXiv cs.RO0 views
arXiv:2611.05615v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2611.05615PreviousContact-Implicit Whole-Body Trajectory Optimization for Dynamic Humanoid Locomotion on Parameterizable Uneven TerrainNextCorrect Robots Before They Make Mistakes: Proactive Human-in-the-Loop Intervention via Preference Learning
Related posts
MuLaCover: Flexible Cover Song Generation via Symbolic Tonal Control
0arXiv cs.SD
GraphSeal: Graph-Augmented Speech Deepfake Detection via Temporal-Spectral Artifact Propagation
0arXiv cs.SD
Landscape Analysis of Simultaneous Blind Deconvolution and Phase Retrieval via Structured Low-Rank Tensor Recovery
0arXiv math.IT
Distributed Consensus, Optimization, and Learning under Communication Constraints
0arXiv math.IT
Hotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes
0arXiv math.IT
GPUMAP: GPU-Accelerated Progressive Uniform Manifold Approximation and Projection
0arXiv cs.HC