Record Details

<p>Optimal Path Planning using RRT for Dynamic Obstacles</p>

Online Publishing @ NISCAIR

View Archive Info
 
 
Field Value
 
Authentication Code dc
 
Title Statement <p>Optimal Path Planning using RRT for Dynamic Obstacles</p>
 
Added Entry - Uncontrolled Name Kalpitha, N ; Department of Information Science and Engineering, Jyothy Institute of Technology, Bangalore, Karnataka, India
Murali, S ; Visvesvaraya Technological University, Belagavi, Karnataka, India
 
Uncontrolled Index Term RRT; A*; RRG
 
Summary, etc. <p>Rapidly Exploring Random Tree is a technique that<em> </em>utilizes samples as constraints for arranging the paths from given source to reach multiple goals. A sample is randomly selected from the configuration space. Each data point is represented as a step that helps in travelling of a robot from one point to another. By initiating the search process, the pursuit calculation endeavors to achieve the objective of the proposed work, further the position assisted regions are investigated. However, when compared with A* calculation, the proposed method has a more reasonable good performance. The Simulation results demonstrate for reaching the desired goal starting from a source to destination in dynamic environment.</p>
 
Publication, Distribution, Etc. Journal of Scientific and Industrial Research (JSIR)
2020-08-26 14:54:13
 
Electronic Location and Access application/pdf
http://op.niscair.res.in/index.php/JSIR/article/view/39580
 
Data Source Entry Journal of Scientific and Industrial Research (JSIR); ##issue.vol## 79, ##issue.no## 06
 
Language Note en