APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS.

Nitish V Thakor, Martin McNeela

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The authors present a dynamic programming (DP) algorithm to calculate robot manipulator kinematics and plan optimized trajectories. The algorithm optimizes desirable cost functions such as absolute accuracy or time of travel. They show that when necessary, suboptimal (higher cost) alternative can be advantageously accepted. For example, if an optimal trajectory is blocked by an obstacle, the robot can reach the destination by following a suboptimal path. The authors also present computer simulations of many diverse applications of DP to robot kinematic problems. The DP algorithm requires more computations than conventional techniques, but permits optimization of objective criteria and flexibility in path planning.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages679-683
Number of pages5
ISBN (Print)0818606959
StatePublished - 1986

Fingerprint

Dynamic programming
Kinematics
Robots
Trajectories
Motion planning
Cost functions
Manipulators
Computer simulation
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Thakor, N. V., & McNeela, M. (1986). APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS. In Unknown Host Publication Title (pp. 679-683). IEEE.

APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS. / Thakor, Nitish V; McNeela, Martin.

Unknown Host Publication Title. IEEE, 1986. p. 679-683.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Thakor, NV & McNeela, M 1986, APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS. in Unknown Host Publication Title. IEEE, pp. 679-683.
Thakor NV, McNeela M. APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS. In Unknown Host Publication Title. IEEE. 1986. p. 679-683
Thakor, Nitish V ; McNeela, Martin. / APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS. Unknown Host Publication Title. IEEE, 1986. pp. 679-683
@inproceedings{327a68c7fe264a0e8981c8924c72be98,
title = "APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS.",
abstract = "The authors present a dynamic programming (DP) algorithm to calculate robot manipulator kinematics and plan optimized trajectories. The algorithm optimizes desirable cost functions such as absolute accuracy or time of travel. They show that when necessary, suboptimal (higher cost) alternative can be advantageously accepted. For example, if an optimal trajectory is blocked by an obstacle, the robot can reach the destination by following a suboptimal path. The authors also present computer simulations of many diverse applications of DP to robot kinematic problems. The DP algorithm requires more computations than conventional techniques, but permits optimization of objective criteria and flexibility in path planning.",
author = "Thakor, {Nitish V} and Martin McNeela",
year = "1986",
language = "English (US)",
isbn = "0818606959",
pages = "679--683",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - APPLICATION OF DYNAMIC PROGRAMMING TO ROBOT KINEMATICS.

AU - Thakor, Nitish V

AU - McNeela, Martin

PY - 1986

Y1 - 1986

N2 - The authors present a dynamic programming (DP) algorithm to calculate robot manipulator kinematics and plan optimized trajectories. The algorithm optimizes desirable cost functions such as absolute accuracy or time of travel. They show that when necessary, suboptimal (higher cost) alternative can be advantageously accepted. For example, if an optimal trajectory is blocked by an obstacle, the robot can reach the destination by following a suboptimal path. The authors also present computer simulations of many diverse applications of DP to robot kinematic problems. The DP algorithm requires more computations than conventional techniques, but permits optimization of objective criteria and flexibility in path planning.

AB - The authors present a dynamic programming (DP) algorithm to calculate robot manipulator kinematics and plan optimized trajectories. The algorithm optimizes desirable cost functions such as absolute accuracy or time of travel. They show that when necessary, suboptimal (higher cost) alternative can be advantageously accepted. For example, if an optimal trajectory is blocked by an obstacle, the robot can reach the destination by following a suboptimal path. The authors also present computer simulations of many diverse applications of DP to robot kinematic problems. The DP algorithm requires more computations than conventional techniques, but permits optimization of objective criteria and flexibility in path planning.

UR - http://www.scopus.com/inward/record.url?scp=0022605760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022605760&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022605760

SN - 0818606959

SP - 679

EP - 683

BT - Unknown Host Publication Title

PB - IEEE

ER -