A computational feasibility study of failure-tolerant path planning

College

Gokongwei College of Engineering

Department/Unit

Electronics And Communications Engg

Document Type

Conference Proceeding

Source Title

10th Robotics & Remote Systems Meeting Proceedings

First Page

233

Last Page

239

Publication Date

3-2004

Abstract

This work considers the computational costs associated with the implementation of a failure-tolerant path planning algorithm proposed in [1]. The algorithm makes the following assumptions: a manipulator is redundant relative to its task, only a single joint failure occurs at any given time, the manipulator is capable of detecting a joint failure and immediately locks the failed joint, and the environment is static and known. The algorithm is evaluated on a three degree-of-freedom planar manipulator for a total of eleven thousand different scenarios, randomly varying the robot's start and goal positions and the number and locations of obstacles in the environment. Statistical data are presented related to the computation time required by the different steps of the algorithm as a function of the complexity of the environment.

html

Disciplines

Robotics

Keywords

Fault-tolerant computing; Manipulators (Mechanism)

Upload File

wf_no

This document is currently not available here.

Share

COinS