Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAcharya, R.
dc.contributor.authorJena, D.
dc.identifier.citation2018 IEEMA Engineer Infinite Conference, eTechNxT 2018, 2018, Vol., , pp.1-6en_US
dc.description.abstractRapidly-exploring random tree (RRT) is a sampling based single query algorithm that is used to generate a path. This papers describes RRT algorithm, modifies RRT algorithm by applying gradient descent method for generating the path. Simulations are run in iterations and the results are compared with and without gradient descent. Finally this paper concludes with advantages and limitations of the gradient approach. � 2018 IEEE.en_US
dc.titleGradient descent in sample-based single-query path planning algorithmen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.