Skip to main content Accessibility help
×
Home

A discrete path/trajectory planner for robotic arms

  • H. H. Tan (a1) and R. B. Potts (a1)

Abstract

An interesting and challenging problem in robotics is the off-line determination of the minimum cost path along which an end effector should move from a given initial to a given final state. This paper presents a discrete minimum cost path/trajectory planner which provides a general solution and allows for a range of constraints such as bounds on joint coordinates, joint velocities, joint torques and joint jerks. To demonstrate the practicability and feasibility of the planner, simulation results are presented for the Stanford manipulator using three and then the full six of its degrees of freedom. Simulation runs with two-link planar arms are also presented to enable a comparison with previously published results.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A discrete path/trajectory planner for robotic arms
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A discrete path/trajectory planner for robotic arms
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A discrete path/trajectory planner for robotic arms
      Available formats
      ×

Copyright

References

Hide All
[1]Ailon, A. and Langholz, G., “On the existence of time-optimal control of mechanical manipulators”, J. Opt. Theory Appls. 46 (1985) 121.
[2]Bobrow, J. E., Dubowsky, S. and Gibson, J. S., “Time-optimal control of robotic manipulators along specified paths”, Int. J. Robotics Res. 4 (1985) 317.
[3]Brady, M. et al. (eds), Robot motion: planning and control (MIT Press, Cambridge MA, 1982).
[4]Brown, M. L., “Optimal robot planning via state space networks”, M. S. Thesis, Princeton University, 1984.
[5]Dubowsky, S., Norris, M. A. and Shiller, Z., “Time optimal trajectory planning for robotic manipulators with obstacle avoidance: a CAD approach”, Proc. IEEE Conf. Robotics Autom. (1986) 19061912.
[6]Flash, T. and Potts, R. B., “Discrete trajectory planning”, Int. J. Robotics Res. 7 (1988) 4857.
[7]Geering, H. P. et al. , “Time-optimal motions of robots in assembly tasks”, IEEE Trans. Autom. Contr. 31 (1986) 512518.
[8]Gilbert, E. G. and Johnson, D. W., “Distance functions and their applications to robot path planning in the presence of obstacles”, IEEE J. Robotics Autom. 1 (1985) 2130.
[9]Gill, P. E. et al. , “User's Guide for NPSOL (Version 4.0)”, Stanford University, Department of Operations Research, Report SOL-86–2 (1986).
[10]Hearn, A. C., REDUCE User's Manual, Version 3 (Rand Corp, California, 1984).
[11]Hollerbach, J. M., “Dynamic scaling of manipulator trajectories”, ASME J. Dyn. Meas., Contr. 106 (1984) 102106.
[12]Kahn, M. E. and Roth, B., “The near-minimum-time control of open-loop articulated kine-matic chain”, J. Dyn. Sys., Meas., Contr. 93 (1971) 164172.
[13]Kim, B. K. and Shin, K. G., “Suboptimal control of industrial manipulators with a weighted time-fuel criterion”, IEEE Trans. Autom. Contr. 30 (1985) 110.
[14]Lynch, P. M., “Minimum-time, sequential axis operation of a cylindrical, two-axis manipulator”, Proc. Joint Autom. Contr. Conf. 1 (1981) paper WP-2A.
[15]Murtagh, B. A. and Saunders, M. A., “MINOS 5.1 User's Guide”, Stanford University, Department of Operations Research, Report SOL 83–20R (1987).
[16]Neuman, C. P. and Tourassis, V. D., “Discrete dynamic robot models”, IEEE Trans. Sys. Man Cyber. 15 (1985) 193204.
[17]Niv, M. and Auslander, D. M., “Optimal control of a robot with obstacles”, Proc. Amer. Contr. Conf. (1984) 280287.
[18]Paul, R. P., Robot manipulator—mathematics, programming and control (MIT Press, Cambridge, 1981).
[19]Potts, R. B., “Discrete Lagrange equations”, Bull. Austral. Math. Soc. 3 (1988) 227233.
[20]Rajan, V. T., “Minimum time trajectory planning”, Proc. IEEE Conf. Robotics Autom. (1985) 759764.
[21]Red, W. E. and Truong-Cao, H, “The configuration space approach to robot path planning”, Proc. Amer. Contr. Conf. (1984) 288295.
[22]Sahar, G. and Hollerbach, J. M., “Planning of minimum-time trajectories for robot arms”, Int. J. Robotics Res. 5 (1986) 90100.
[23]Scheinman, V. and Roth, B., “On the optimal selection and placement of manipulators”, Proc. RoManSy. 5th CISM-IFToMM Symp. (1984) 3946.
[24]Shin, K. G. and McKay, N. D., “Minimum-time control of robotic manipulators with geometric path constraints”, IEEE Trans. Autom. Contr. 30 (1985) 531541.
[25]Shin, K. G. and McKay, N. D., “Selection of near-minimum time geometric paths for robotic manipulators”, Proc. Amer. Contr. Conf. (1985) 346355.
[26]Snyder, W. E. and Gruver, W. A., “Microprocessor implementation of optimal control for a robotic manipulator system”, Proc. IEEE Conf. Dec. Contr. (1979) 839841.
[27]Sontag, E. D. and Sussman, H. J., “Remarks on the time-optimal control of two link manipulators”, Proc. IEEE Conf. Dec. Contr. (1985) 16431652.
[28]Sontag, E. D. and Sussman, H. J., “Time-optimal control of manipulator”, Proc. IEEE Conf. Robotics Autom. (1986) 16921697.
[29]Tan, H. H. and Potts, R. B., “Minimum time trajectory planner for the discrete dynamic robot model with dynamic constraints”, IEEE J. Robotics Autom. 4 (1988) 174185.
[30]Tan, H. H. and Potts, R. B., “A discrete trajectory planner for robotic arms with six degrees of freedom”, University of Adelaide, Dept. of Applied Maths. Research Report UAAM-87–5 (1987).
[31]Tan, H. H. and Pots, R. B., “Minimum time robot motions”, University of Adelaide, Dept. of Applied Maths. Research Report UAAM-87–2 (1987).
[32]Tan, H. H. and Potts, R. B., “A discrete calculus of variations algorithm”, Bull. Austral. Math. Soc. 38 (1988) 365371.
[33]Turner, T. L. and Gruver, W. A., “A viable suboptimal controller for robotic manipulators”, Proc. IEEE Conf. Dec. Contr. (1980) 8387.
[34]Wen, J. and Desrochers, A., “Existence of the time optimal control for robotic manipulators”, Proc. Amer. Contr. Conf. (1986) 109113.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Related content

Powered by UNSILO

A discrete path/trajectory planner for robotic arms

  • H. H. Tan (a1) and R. B. Potts (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.