Trajectory Generation and Control for a High-DOF Articulated Robot with Dynamic Constraints

  • Marc Spirig
  • Ralf Kaestner
  • Dizan Vasquez
  • Roland Siegwart
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6359)


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.


Path Planning Constraint Violation Dynamic Constraint Bezier Curve Velocity Limit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fahim, A., Tetreault, M., Necsulescu, D.S.: Robot trajectory optimisation with dynamic constraints. The International Journal of Advanced Manufacturing Technology 3(1), 71–76 (1988)CrossRefGoogle Scholar
  2. 2.
    Guzzella, L.: Analysis and Synthesis of Single-Input Single-Output Control Systems, 1st edn. vdf Hochschulverlag ETH Zurich (2007)Google Scholar
  3. 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. 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. 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
  6. 6.
    Lepetič, M., Klančar, G., Škrjanc, I., Matko, D., Potočnik, B.: Time optimal path planning considering acceleration limits. International Journal of Robotics and Autonomous Systems 45, 199–210 (2003)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Luca, A.D., Lanari, L., Oriolo, G.: A sensitivity approach to optimal spline robot trajectories. Automatica 27(3), 535–539 (1991)CrossRefGoogle Scholar
  9. 9.
    Prado, M., Simón, A., Carabias, E., Perez, A., Ezquerro, F.: Optimal velocity planning of wheeled mobile robots on specific paths in static and dynamic environments. Journal of Robotic Systems 20(12), 737–754 (2003)CrossRefGoogle Scholar
  10. 10.
    Shiller, Z., Gwo, Y.-R.: Dynamic motion planning of autonomous vehicles. IEEE Transactions on Robotics and Automation 7(2), 241–249 (1991)CrossRefGoogle Scholar
  11. 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
  12. 12.
    Tondu, B., Bazaz, S.A.: The three-cubic method: An optimal online robot joint trajectory generator under velocity, acceleration and wandering constraints. The International Journal of Robotics Research 18(9), 893–901 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Marc Spirig
    • 1
  • Ralf Kaestner
    • 1
  • Dizan Vasquez
    • 1
  • Roland Siegwart
    • 1
  1. 1.ETH ZurichSwitzerland

Personalised recommendations