Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-19T20:49:49.027Z Has data issue: false hasContentIssue false
  • English
  • Français

A Discrete calculus of variations algorithm

Published online by Cambridge University Press:  17 April 2009

H.H. Tan  and
R.B. Potts
H.H. Tan
Affiliation:
Applied Mathematics Department, The University of AdelaideG.P.O. Box 498Adealide, S.A. 5001Australia
R.B. Potts
Affiliation:
Applied Mathematics Department, The University of AdelaideG.P.O. Box 498Adealide, S.A. 5001Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An algorithm which has been developed to solve the problem of determining an optimal path of the hand of a robot is applied to various classical problems in the calculus of variations.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 38 , Issue 3 , December 1988 , pp. 365 - 371
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Gotuso, L., ‘On the energy theorem for the Lagrange equations in the discrete case’, App. Math. Comput. 17 (1985), 120–136.Google Scholar
[2]Greenspan, D., Discrete Models (Addison-Wesley, Mass., U.S.A., 1973).Google Scholar
[3]Neuman, C.P. and Tourassis, V.D., ‘Discrete dynamic robot models’, IEEE Trans. Systems Man Cybernet 15 (1985), 193–204.Google Scholar
[4]Potts, R.B., ‘Discrete Lagrange equations’, Bull. Austral. Math. Soc. 37 (1988), 227–233.Google Scholar
[5]Reports SOL 83–20R and SOL 86–2 (Department of Operations Research, Stanford University, Stanford, U.S.A.).Google Scholar
[6]Tan, H.H. and Potts, R.B., ‘A minimum time discrete path planner’, Univ. of Adel. App. Maths Res. Rep. UAAM-87–9 (12 1987).Google Scholar