Rods and rings

Soft subdivision planner for ℝ3 × S2

Ching Hsiang Hsu, Yi-Jen Chiang, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider path planning for a rigid spatial robot moving amidst polyhedral obstacles. Our robot is either a rod or a ring. Being axially-symmetric, their configuration space is ℝ3 ×S2 with 5 degrees of freedom (DOF). Correct, complete and practical path planning for such robots is a long standing challenge in robotics. While the rod is one of the most widely studied spatial robots in path planning, the ring seems to be new, and a rare example of a non-simply-connected robot. This work provides rigorous and complete algorithms for these robots with theoretical guarantees. We implemented the algorithms in our open-source Core Library. Experiments show that they are practical, achieving near real-time performance. We compared our planner to state-of-the-art sampling planners in OMPL [31]. Our subdivision path planner is based on the twin foundations of ε-exactness and soft predicates. Correct implementation is relatively easy. The technical innovations include subdivision atlases for S2, introduction of Σ2 representations for footprints, and extensions of our feature-based technique for “opening up the blackbox of collision detection”.

Original languageEnglish (US)
Title of host publication35th International Symposium on Computational Geometry, SoCG 2019
EditorsGill Barequet, Yusu Wang
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771047
DOIs
StatePublished - Jun 1 2019
Event35th International Symposium on Computational Geometry, SoCG 2019 - Portland, United States
Duration: Jun 18 2019Jun 21 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume129
ISSN (Print)1868-8969

Conference

Conference35th International Symposium on Computational Geometry, SoCG 2019
CountryUnited States
CityPortland
Period6/18/196/21/19

Fingerprint

Robots
Motion planning
Robotics
Innovation
Sampling
Experiments

Keywords

  • Algorithmic motion planning
  • Resolution-exact algorithms
  • Soft predicates
  • Spatial ring robots
  • Spatial rod robots
  • Subdivision methods

ASJC Scopus subject areas

  • Software

Cite this

Hsu, C. H., Chiang, Y-J., & Yap, C. (2019). Rods and rings: Soft subdivision planner for ℝ3 × S2. In G. Barequet, & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 [43] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.43

Rods and rings : Soft subdivision planner for ℝ3 × S2. / Hsu, Ching Hsiang; Chiang, Yi-Jen; Yap, Chee.

35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 43 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hsu, CH, Chiang, Y-J & Yap, C 2019, Rods and rings: Soft subdivision planner for ℝ3 × S2. in G Barequet & Y Wang (eds), 35th International Symposium on Computational Geometry, SoCG 2019., 43, Leibniz International Proceedings in Informatics, LIPIcs, vol. 129, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 35th International Symposium on Computational Geometry, SoCG 2019, Portland, United States, 6/18/19. https://doi.org/10.4230/LIPIcs.SoCG.2019.43
Hsu CH, Chiang Y-J, Yap C. Rods and rings: Soft subdivision planner for ℝ3 × S2. In Barequet G, Wang Y, editors, 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 43. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.SoCG.2019.43
Hsu, Ching Hsiang ; Chiang, Yi-Jen ; Yap, Chee. / Rods and rings : Soft subdivision planner for ℝ3 × S2. 35th International Symposium on Computational Geometry, SoCG 2019. editor / Gill Barequet ; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{960eb9c455ee4950b2e62bf714258fe0,
title = "Rods and rings: Soft subdivision planner for ℝ3 × S2",
abstract = "We consider path planning for a rigid spatial robot moving amidst polyhedral obstacles. Our robot is either a rod or a ring. Being axially-symmetric, their configuration space is ℝ3 ×S2 with 5 degrees of freedom (DOF). Correct, complete and practical path planning for such robots is a long standing challenge in robotics. While the rod is one of the most widely studied spatial robots in path planning, the ring seems to be new, and a rare example of a non-simply-connected robot. This work provides rigorous and complete algorithms for these robots with theoretical guarantees. We implemented the algorithms in our open-source Core Library. Experiments show that they are practical, achieving near real-time performance. We compared our planner to state-of-the-art sampling planners in OMPL [31]. Our subdivision path planner is based on the twin foundations of ε-exactness and soft predicates. Correct implementation is relatively easy. The technical innovations include subdivision atlases for S2, introduction of Σ2 representations for footprints, and extensions of our feature-based technique for “opening up the blackbox of collision detection”.",
keywords = "Algorithmic motion planning, Resolution-exact algorithms, Soft predicates, Spatial ring robots, Spatial rod robots, Subdivision methods",
author = "Hsu, {Ching Hsiang} and Yi-Jen Chiang and Chee Yap",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SoCG.2019.43",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Gill Barequet and Yusu Wang",
booktitle = "35th International Symposium on Computational Geometry, SoCG 2019",

}

TY - GEN

T1 - Rods and rings

T2 - Soft subdivision planner for ℝ3 × S2

AU - Hsu, Ching Hsiang

AU - Chiang, Yi-Jen

AU - Yap, Chee

PY - 2019/6/1

Y1 - 2019/6/1

N2 - We consider path planning for a rigid spatial robot moving amidst polyhedral obstacles. Our robot is either a rod or a ring. Being axially-symmetric, their configuration space is ℝ3 ×S2 with 5 degrees of freedom (DOF). Correct, complete and practical path planning for such robots is a long standing challenge in robotics. While the rod is one of the most widely studied spatial robots in path planning, the ring seems to be new, and a rare example of a non-simply-connected robot. This work provides rigorous and complete algorithms for these robots with theoretical guarantees. We implemented the algorithms in our open-source Core Library. Experiments show that they are practical, achieving near real-time performance. We compared our planner to state-of-the-art sampling planners in OMPL [31]. Our subdivision path planner is based on the twin foundations of ε-exactness and soft predicates. Correct implementation is relatively easy. The technical innovations include subdivision atlases for S2, introduction of Σ2 representations for footprints, and extensions of our feature-based technique for “opening up the blackbox of collision detection”.

AB - We consider path planning for a rigid spatial robot moving amidst polyhedral obstacles. Our robot is either a rod or a ring. Being axially-symmetric, their configuration space is ℝ3 ×S2 with 5 degrees of freedom (DOF). Correct, complete and practical path planning for such robots is a long standing challenge in robotics. While the rod is one of the most widely studied spatial robots in path planning, the ring seems to be new, and a rare example of a non-simply-connected robot. This work provides rigorous and complete algorithms for these robots with theoretical guarantees. We implemented the algorithms in our open-source Core Library. Experiments show that they are practical, achieving near real-time performance. We compared our planner to state-of-the-art sampling planners in OMPL [31]. Our subdivision path planner is based on the twin foundations of ε-exactness and soft predicates. Correct implementation is relatively easy. The technical innovations include subdivision atlases for S2, introduction of Σ2 representations for footprints, and extensions of our feature-based technique for “opening up the blackbox of collision detection”.

KW - Algorithmic motion planning

KW - Resolution-exact algorithms

KW - Soft predicates

KW - Spatial ring robots

KW - Spatial rod robots

KW - Subdivision methods

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

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

U2 - 10.4230/LIPIcs.SoCG.2019.43

DO - 10.4230/LIPIcs.SoCG.2019.43

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 35th International Symposium on Computational Geometry, SoCG 2019

A2 - Barequet, Gill

A2 - Wang, Yusu

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -