Fixed-Chord Velocity Recursion and Maximum Speed Bounds for Articulated Chains on Archimedean and Piecewise-Smooth Paths

Authors

  • Zhongyuan Zhang College of Air Traffic Management, Civil Aviation Flight University of China, Chengdu, 641419, China
  • Houlin Zhang College of Air Traffic Management, Civil Aviation Flight University of China, Chengdu, 641419, China
  • Xiaotian Zhang College of Air Traffic Management, Civil Aviation Flight University of China, Chengdu, 641419, China

DOI:

https://doi.org/10.54097/31wewg98

Keywords:

Bench dragon, Archimedean spiral, Articulated-chain kinematics, Speed amplification, Particle swarm optimization

Abstract

A bench dragon is a long articulated chain governed by prescribed-track geometry and fixed hinge spacing. This paper develops a verifiable framework for two linked tasks: inward-winding kinematics and maximum head speed on an optimized S-shaped turn. The chain contains 223 rigid boards and 224 hinged handles. For the inward motion, the head follows a 0.55 m-pitch Archimedean spiral at a constant speed of 1 m s-1. An arc-length ordinary differential equation is integrated by fourth-order Runge–Kutta with a 0.05 s internal step; the remaining handles are placed by fixed-chord bisection and their velocities are recovered by differentiating the constraints. The 300 s trajectory satisfies the chord constraints with a residual of approximately 1.6 × 10-16 m. On the optimized turn, the same recursion is parameterized by path arc length. A unit-head-speed scan gives a maximum amplification factor of Mmax ≈ 13.11 at s* ≈ 2.85 m, yielding an analytical head-speed bound of vH≤ 0.153 m·s⁻¹ when all handles are constrained to 2 m  s⁻¹. A 40-particle, 120-generation particle swarm search converges to the same value. The framework separates geometry from speed control — the same fixed-chord recursion applies to both problems without modification — and the analytical speed bound provides an independent check on the particle swarm result. The approach is reusable: changing the spiral pitch, chord lengths, or path geometry requires only parameter updates, not a new derivation.

Downloads

Download data is not yet available.

References

[1] Zhao, J. S., & Wei, S. T. (2021). Kinematics of articulated planar linkages. Frontiers in Mechanical Engineering, 7.

[2] Murillo, M., Sánchez, G., Deniz, N., et al. (2022). Improving path-tracking performance of an articulated tractor-trailer system using a non-linear kinematic model. Computers and Electronics in Agriculture, 196, 106826.

[3] Deniz, N., Jorquera, F., Torres-Torriti, M., & Cheein, F. A. A. (2024). Model predictive path-following controller for generalised N-trailer vehicles with noisy sensors and disturbances. Control Engineering Practice, 142, 105747.

[4] China Undergraduate Mathematical Contest in Modeling Committee. (2024). Problem A of the 2024 contest: Bench dragon. Beijing.

[5] Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of ICNN-95 (pp. 1942–1948). Perth: IEEE.

[6] Gad, A. G. (2022). Particle swarm optimization algorithm and its applications: A systematic review. Archives of Computational Methods in Engineering, 29(5), 2531–2561.

[7] Shaikh, T. A., Hussain Rizvi, S. S., & Tanweer, M. R. (2022). Constrained self regulating particle swarm optimization. Bulletin of Electrical Engineering and Informatics, 11(2), 955–964.

[8] Tseng, H. Y., Chu, P. H., Lu, H. C., et al. (2021). Easy particle swarm optimization for nonlinear constrained optimization problems. IEEE Access, 9, 124757–124767.

[9] Butcher, J. C. (2016). Numerical methods for ordinary differential equations (3rd ed.). Chichester: Wiley.

[10] Draelos, M. (2023). Time-optimal spiral trajectories with closed-form solutions. IEEE Robotics and Automation Letters, 8(4), 2213–2220.

[11] Baumgarte, J. (1972). Stabilization of constraints and integrals of motion in dynamical systems. Computer Methods in Applied Mechanics and Engineering, 1(1), 1–16.

[12] Burden, R. L., & Faires, J. D. (2011). Numerical analysis (9th ed.). Boston: Brooks/Cole.

Downloads

Published

25-10-2026

Issue

Section

Articles