Optimal Trajectory Planning for a Space Robot Docking with a Moving Target via Homotopy Algorithms

dc.contributor.authorChen, Yuxinen
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:01Zen
dc.date.available2013-06-19T14:37:01Zen
dc.date.issued1993en
dc.description.abstractThe mathematical formulation of optimal trajectory planning for a space robot docking with a moving target is derived. The calculus of variations is applied to the problem so that the optimal robot trajectory can be obtained directlt from the target information without first planning the trajectory of the end-effector. The nonlinear two-point boundary value problem resulting from the problem formulation is solved numerically by a globally convergent homotopy algorithm. The algorithm guarantees convergence to a solution for an arbitrarily chosen initial guess. Numerical simulation for three examples demonstrates the approach.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000367/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000367/01/TR-93-25.pdfen
dc.identifier.trnumberTR-93-25en
dc.identifier.urihttp://hdl.handle.net/10919/19852en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOptimal Trajectory Planning for a Space Robot Docking with a Moving Target via Homotopy Algorithmsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR-93-25.pdf
Size:
717.42 KB
Format:
Adobe Portable Document Format