Please use this identifier to cite or link to this item:
Title: Benchmark on robotic motion planning algorithms in a drilling task
Authors: Lim, Joyce Xin Yan
Keywords: DRNTU::Engineering
Issue Date: 2018
Abstract: Sampling-based robotic motion planning algorithms have been the key concept of programming robot motion as they are validated to be probabilistically complete. Thus, numerous research studies have been carried out to continuously improve these algorithms to lower the cost, which includes the time taken to solve the query or the trajectory execution time. This report covers the benchmark of sampling-based motion planners, such as single-query and multi-query planners, in a static environment to determine whether reusing the roadmap of multi-query planners will reduce the cost of solving multiple queries, as compared to single-query planners where new trees are constructed for every query. The benchmark requires the use of Open Robotics Automation Virtual Environment (OpenRAVE), which provides an environment to simulate robot motion with their planners, and Open Motion Planning Library (OMPL) which has a variety of motion planners. The study also includes the integration of OMPL into OpenRAVE since the benchmark is carried out by using planners from not only OpenRAVE, but OMPL as well. Specifically, the benchmark will cover the total time taken to solve the queries with smoothing, total trajectory execution time and robustness of the planners. Also, the programming language used in this project is Python.
Schools: School of Mechanical and Aerospace Engineering 
Research Centres: Robotics Research Centre 
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
1.53 MBAdobe PDFView/Open

Page view(s)

Updated on Jul 11, 2024

Download(s) 50

Updated on Jul 11, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.