### Abstract

We present an algorithm for constructing an inner approximation of the free space for a polyhedral robot with four degrees of freedom. The robot rotates about a fixed axis and translates in three dimensions with respect to a fixed polyhedral obstacle. We approximate the free space by subdividing the rotation dimension into short angle ranges, generating a three dimensional free space for each angle range, and constructing a graph for navigation in the four dimensional space. We also present an algorithm for path planning that is complete in the approximated space. The path planning algorithm produces paths that are guaranteed to be collision free and approximately maximizes obstacle clearance, ensuring safe and practical paths.

Original language | English (US) |
---|---|

Pages | 223-229 |

Number of pages | 7 |

State | Published - Jan 1 2018 |

Event | 30th Canadian Conference on Computational Geometry, CCCG 2018 - Winnipeg, Canada Duration: Aug 8 2018 → Aug 10 2018 |

### Conference

Conference | 30th Canadian Conference on Computational Geometry, CCCG 2018 |
---|---|

Country | Canada |

City | Winnipeg |

Period | 8/8/18 → 8/10/18 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology
- Computational Mathematics

### Cite this

*Approximate free space construction and maximum clearance path planning for a four degree of freedom robot*. 223-229. Paper presented at 30th Canadian Conference on Computational Geometry, CCCG 2018, Winnipeg, Canada.

**Approximate free space construction and maximum clearance path planning for a four degree of freedom robot.** / Arluck, Chloe; Milenkovic, Victor; Sacks, Elisha.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - Approximate free space construction and maximum clearance path planning for a four degree of freedom robot

AU - Arluck, Chloe

AU - Milenkovic, Victor

AU - Sacks, Elisha

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We present an algorithm for constructing an inner approximation of the free space for a polyhedral robot with four degrees of freedom. The robot rotates about a fixed axis and translates in three dimensions with respect to a fixed polyhedral obstacle. We approximate the free space by subdividing the rotation dimension into short angle ranges, generating a three dimensional free space for each angle range, and constructing a graph for navigation in the four dimensional space. We also present an algorithm for path planning that is complete in the approximated space. The path planning algorithm produces paths that are guaranteed to be collision free and approximately maximizes obstacle clearance, ensuring safe and practical paths.

AB - We present an algorithm for constructing an inner approximation of the free space for a polyhedral robot with four degrees of freedom. The robot rotates about a fixed axis and translates in three dimensions with respect to a fixed polyhedral obstacle. We approximate the free space by subdividing the rotation dimension into short angle ranges, generating a three dimensional free space for each angle range, and constructing a graph for navigation in the four dimensional space. We also present an algorithm for path planning that is complete in the approximated space. The path planning algorithm produces paths that are guaranteed to be collision free and approximately maximizes obstacle clearance, ensuring safe and practical paths.

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

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

M3 - Paper

AN - SCOPUS:85072889488

SP - 223

EP - 229

ER -