Please use this identifier to cite or link to this item:
Title: Workspace-based sampling for probabilistic path planning
Keywords: Path planning, motion planning, robotics, hyper redundant robots, randomized algorithm, computational geometry
Issue Date: 3-Mar-2008
Citation: HANNA KURNIAWATI (2008-03-03). Workspace-based sampling for probabilistic path planning. ScholarBank@NUS Repository.
Abstract: This thesis focuses on probabilistic path planning, the most promising approach for path planning of robots with many degrees of freedom. Despite its success, probabilistic path planners perform poorly when the configuration space contains narrow passages. Our thesis is workspace provides useful information for generating suitable sampling distributions for probabilistic path planning. We start by presenting an empirical study to explore the importance of sampling distribution in probabilistic path planning. We then explore the relation between workspace and configuration space of the robot. Finally, we present our new workspace-based probabilistic path planner Workspace-based Connectivity Oracle (WCO). Analysis shows that WCO is probabilistic complete. Experimental results show that WCO significantly improves the performance of probabilistic path planners in solving realistic narrow passages problems. The applicability of WCO is also shown in a simulation of the bridge-inspection problem involving a hyper-redundant robot with up to 35 DOFs.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesisDemo-bridgeInspection-hanna.mpg25.08 MBMPEG


None Preview online
thesis-hanna.pdf1.51 MBAdobe PDF



Page view(s)

checked on Apr 19, 2019


checked on Apr 19, 2019

Google ScholarTM


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