Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/8151Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Acharya, R. | |
| dc.contributor.author | Jena, D. | |
| dc.date.accessioned | 2020-03-30T10:18:08Z | - |
| dc.date.available | 2020-03-30T10:18:08Z | - |
| dc.date.issued | 2018 | |
| dc.identifier.citation | 2018 IEEMA Engineer Infinite Conference, eTechNxT 2018, 2018, Vol., , pp.1-6 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8151 | - |
| dc.description.abstract | Rapidly-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.title | Gradient descent in sample-based single-query path planning algorithm | en_US |
| dc.type | Book chapter | en_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.