Research On the Dance Path of Multi-Segment Bench Dragon Based on Dynamic Spiral Curves
DOI:
https://doi.org/10.54097/pdbqzy06Keywords:
Bench Dragon, Archimedean Spiral, Collision Detection, Binary Search, SAT.Abstract
The Bench Dragon is a traditional folk performance originating from southeastern China, in which performers carry a series of interconnected benches to simulate the movement of a dragon. This paper develops a mathematical motion planning model to optimize the spatial trajectory and safety of a multi-segment Bench Dragon during spiral entry. A dynamic Archimedean spiral model is constructed, and the dragon head’s position is derived by solving an ordinary differential equation. Using recursive geometric analysis, the positions and velocities of all segments are computed based on structural differences between the head and body. To detect collisions between segments, a novel method is proposed by integrating the Separating Axis Theorem (SAT) with a risk-based workspace filtering strategy, effectively identifying critical contact moments. Finally, a binary search algorithm is applied to determine the minimum spiral pitch required to avoid collisions during entry into the circular turning region. The proposed method offers a systematic solution for coordinated multi-body path planning under spatial constraints, with potential applications in large-scale performance choreography and robotics.
Downloads
References
[1] Hou Taogang, Li Jiaxin, Pei Xuan, et al. A Spiral Coverage Path Planning Algorithm for Nonomnidirectional Robots [J]. Journal of Field Robotics, 2025, 42(1): 1-15.
[2] Tang Jingtao, Ma Hang. Multi-Robot Connected Fermat Spiral Coverage [J]. Proceedings of the International Conference on Automated Planning and Scheduling, 2024, 34(1): 579-587.
[3] Zhang Xiaofeng, Tao Bo, Jiang Du, et al. Novel Probabilistic Collision Detection for Manipulator Motion Planning Using HNSW [J]. Machines, 2024, 12(5): 321.
[4] Pipe James G, Zwart Nicholas R. Spiral trajectory design: A flexible numerical algorithm and base analytical equations [J]. Magnetic Resonance in Medicine, 2013, 71(1): 278-285.
[5] Liu Qingjian, Huang Gangpeng, Zhang Xu, et al. Speed Planning and Interpolation Algorithm of Archimedes Spiral Based on Tangential Vector [J]. International Journal of Precision Engineering and Manufacturing, 2024, 25: 2235-2248.
[6] Draelos Mark. Time-Optimal Spiral Trajectories with Closed-Form Solutions [J]. IEEE Robotics and Automation Letters, 2023, 8(4): 2213-2220.
[7] Liu Jie, Yap Hwa Jen, Mohd Khairuddin Anis Salwa. Path Planning for the Robotic Manipulator in Dynamic Environments Based on a Deep Reinforcement Learning Method [J]. Journal of Intelligent & Robotic Systems, 2024, 111: 3.
[8] Raibail Mehak, Rahman Abdul Hadi Abd, AL-Anizy Ghassan Jasim, et al. Decentralized Multi-Robot Collision Avoidance: A Systematic Review from 2015 to 2021 [J]. Symmetry, 2022, 14(3): 610.
[9] Xie Guojun, Yang Huanhuan, Deng Hao, et al. Formal Verification of Robot Rotary Kinematics [J]. Electronics, 2023, 12(2): 369.
[10] Wang Dexian, Liu Qilong, Yang Jinghui, et al. Research on Path Planning for Intelligent Mobile Robots Based on Improved A* Algorithm [J]. Symmetry,2024, 16(10): 1311.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







