Trajectory Generation and Control for a High-DOF Articulated Robot with Dynamic Constraints
In this paper, we propose a novel and alternative approach to the task of generating trajectories for an articulated robot with dynamic constraints. We demonstrate that by focusing the effort on the generation process, the design of a trajectory controller becomes a straightforward problem. Our method is efficient and particularly suited for applications involving high-DOF articulated systems such as robotics arms or legs. We claim that our algorithm can be easily implemented by roboticists that do not share a deep background in control theory. Nevertheless, the resulting trajectories ensure a robust state-of-the-art control performance. We show, in simulation and practice, that the approach is well prepared for integration with graph-based planning techniques and yields smooth trajectories.
KeywordsPath Planning Constraint Violation Dynamic Constraint Bezier Curve Velocity Limit
Unable to display preview. Download preview PDF.
- 2.Guzzella, L.: Analysis and Synthesis of Single-Input Single-Output Control Systems, 1st edn. vdf Hochschulverlag ETH Zurich (2007)Google Scholar
- 3.Jolly, K.G., Kumar, R.S., Vijayakumar, R.: A Bezier curve based path planning in a multi-agent robot soccer system without violating the acceleration limits. International Journal of Robotics and Autonomous Systems 57(1), 23–33 (2009)Google Scholar
- 4.Lavalle, S.M.: Rapidly-exploring random trees: A new tool for path planning. Technical Report, Computer Science Dept., Iowa State University (1998)Google Scholar
- 5.Lee, C., Xu, Y.: Trajectory fitting with smoothing splines using velocity information. International Conference on Robotics and Automation 3, 2796–2801 (2000)Google Scholar
- 7.Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., Thrun, S.: Anytime dynamic A*: An anytime, replanning algorithm. In: Proc. of The International Conference on Automated Planning and Scheduling (ICAPS), pp. 262–271 (2005)Google Scholar
- 11.Stentz, A.: Optimal and efficient path planning for partially-known environments. Kluwer International Series in Engineering and Computer Science, pp. 203–220 (1997)Google Scholar