### 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.

Original language | English |
---|---|

Pages (from-to) | 233-239 |

Number of pages | 7 |

Journal | Conference on Robotics and Remote Systems- Proceedings |

Volume | 10 |

Publication status | Published - Jul 19 2004 |

Event | 10th International Conference on Robotics and Remote Systems for Hazardous Environments - Gainesville, FL, United States Duration: Mar 28 2004 → Mar 31 2004 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Engineering(all)

### Cite this

*Conference on Robotics and Remote Systems- Proceedings*,

*10*, 233-239.

}

*Conference on Robotics and Remote Systems- Proceedings*, vol. 10, pp. 233-239.

**A computational feasibility study of failure-tolerant path planning.** / Jamisola, Rodrigo S.; Maciejewski, Anthony A.; Roberts, Rodney G.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - A computational feasibility study of failure-tolerant path planning

AU - Jamisola, Rodrigo S.

AU - Maciejewski, Anthony A.

AU - Roberts, Rodney G.

PY - 2004/7/19

Y1 - 2004/7/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3042749786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042749786&partnerID=8YFLogxK

M3 - Conference article

VL - 10

SP - 233

EP - 239

JO - Conference on Robotics and Remote Systems- Proceedings

JF - Conference on Robotics and Remote Systems- Proceedings

SN - 0069-8644

ER -