A computational feasibility study of failure-tolerant path planning
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 mani...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Published: |
Animo Repository
2004
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7131 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |