Soft subdivision motion planning for complex planar robots

Bo Zhou, Yi-Jen Chiang, Chee Yap

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

Abstract

The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between easily implementable predicates and their accuracy/effectivity. In this paper, we focus on the class of planar polygonal rigid robots with arbitrarily complex geometry. We exploit the remarkable decomposability property of soft collision-detection predicates of such robots. We introduce a general technique to produce such a decomposition. If the robot is an m-gon, the complexity of this approach scales linearly in m. This contrasts with the O(m3) complexity known for exact planners. It follows that we can now routinely produce soft predicates for any rigid polygonal robot. This results in resolution-exact planners for such robots within the general Soft Subdivision Search (SSS) framework. This is a significant advancement in the theory of sound and complete planners for planar robots. We implemented such decomposed predicates in our open-source Core Library. The experiments show that our algorithms are effective, perform in real time on non-trivial environments, and can outperform many sampling-based methods.

Original languageEnglish (US)
Title of host publication26th European Symposium on Algorithms, ESA 2018
EditorsHannah Bast, Grzegorz Herman, Yossi Azar
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume112
ISBN (Print)9783959770811
DOIs
StatePublished - Aug 1 2018
Event26th European Symposium on Algorithms, ESA 2018 - Helsinki, Finland
Duration: Aug 20 2018Aug 22 2018

Other

Other26th European Symposium on Algorithms, ESA 2018
CountryFinland
CityHelsinki
Period8/20/188/22/18

Fingerprint

Motion planning
Robots
Acoustic waves
Sampling
Decomposition
Geometry
Experiments

Keywords

  • Algorithmic motion planning
  • Computational geometry
  • Planar robots with complex geometry
  • Resolution-exact algorithms
  • Soft predicates

ASJC Scopus subject areas

  • Software

Cite this

Zhou, B., Chiang, Y-J., & Yap, C. (2018). Soft subdivision motion planning for complex planar robots. In H. Bast, G. Herman, & Y. Azar (Eds.), 26th European Symposium on Algorithms, ESA 2018 (Vol. 112). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2018.73

Soft subdivision motion planning for complex planar robots. / Zhou, Bo; Chiang, Yi-Jen; Yap, Chee.

26th European Symposium on Algorithms, ESA 2018. ed. / Hannah Bast; Grzegorz Herman; Yossi Azar. Vol. 112 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.

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

Zhou, B, Chiang, Y-J & Yap, C 2018, Soft subdivision motion planning for complex planar robots. in H Bast, G Herman & Y Azar (eds), 26th European Symposium on Algorithms, ESA 2018. vol. 112, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26th European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 8/20/18. https://doi.org/10.4230/LIPIcs.ESA.2018.73
Zhou B, Chiang Y-J, Yap C. Soft subdivision motion planning for complex planar robots. In Bast H, Herman G, Azar Y, editors, 26th European Symposium on Algorithms, ESA 2018. Vol. 112. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018 https://doi.org/10.4230/LIPIcs.ESA.2018.73
Zhou, Bo ; Chiang, Yi-Jen ; Yap, Chee. / Soft subdivision motion planning for complex planar robots. 26th European Symposium on Algorithms, ESA 2018. editor / Hannah Bast ; Grzegorz Herman ; Yossi Azar. Vol. 112 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.
@inproceedings{f1d8456da7fe43c48f1225050356541f,
title = "Soft subdivision motion planning for complex planar robots",
abstract = "The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between easily implementable predicates and their accuracy/effectivity. In this paper, we focus on the class of planar polygonal rigid robots with arbitrarily complex geometry. We exploit the remarkable decomposability property of soft collision-detection predicates of such robots. We introduce a general technique to produce such a decomposition. If the robot is an m-gon, the complexity of this approach scales linearly in m. This contrasts with the O(m3) complexity known for exact planners. It follows that we can now routinely produce soft predicates for any rigid polygonal robot. This results in resolution-exact planners for such robots within the general Soft Subdivision Search (SSS) framework. This is a significant advancement in the theory of sound and complete planners for planar robots. We implemented such decomposed predicates in our open-source Core Library. The experiments show that our algorithms are effective, perform in real time on non-trivial environments, and can outperform many sampling-based methods.",
keywords = "Algorithmic motion planning, Computational geometry, Planar robots with complex geometry, Resolution-exact algorithms, Soft predicates",
author = "Bo Zhou and Yi-Jen Chiang and Chee Yap",
year = "2018",
month = "8",
day = "1",
doi = "10.4230/LIPIcs.ESA.2018.73",
language = "English (US)",
isbn = "9783959770811",
volume = "112",
editor = "Hannah Bast and Grzegorz Herman and Yossi Azar",
booktitle = "26th European Symposium on Algorithms, ESA 2018",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Soft subdivision motion planning for complex planar robots

AU - Zhou, Bo

AU - Chiang, Yi-Jen

AU - Yap, Chee

PY - 2018/8/1

Y1 - 2018/8/1

N2 - The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between easily implementable predicates and their accuracy/effectivity. In this paper, we focus on the class of planar polygonal rigid robots with arbitrarily complex geometry. We exploit the remarkable decomposability property of soft collision-detection predicates of such robots. We introduce a general technique to produce such a decomposition. If the robot is an m-gon, the complexity of this approach scales linearly in m. This contrasts with the O(m3) complexity known for exact planners. It follows that we can now routinely produce soft predicates for any rigid polygonal robot. This results in resolution-exact planners for such robots within the general Soft Subdivision Search (SSS) framework. This is a significant advancement in the theory of sound and complete planners for planar robots. We implemented such decomposed predicates in our open-source Core Library. The experiments show that our algorithms are effective, perform in real time on non-trivial environments, and can outperform many sampling-based methods.

AB - The design and implementation of theoretically-sound robot motion planning algorithms is challenging. Within the framework of resolution-exact algorithms, it is possible to exploit soft predicates for collision detection. The design of soft predicates is a balancing act between easily implementable predicates and their accuracy/effectivity. In this paper, we focus on the class of planar polygonal rigid robots with arbitrarily complex geometry. We exploit the remarkable decomposability property of soft collision-detection predicates of such robots. We introduce a general technique to produce such a decomposition. If the robot is an m-gon, the complexity of this approach scales linearly in m. This contrasts with the O(m3) complexity known for exact planners. It follows that we can now routinely produce soft predicates for any rigid polygonal robot. This results in resolution-exact planners for such robots within the general Soft Subdivision Search (SSS) framework. This is a significant advancement in the theory of sound and complete planners for planar robots. We implemented such decomposed predicates in our open-source Core Library. The experiments show that our algorithms are effective, perform in real time on non-trivial environments, and can outperform many sampling-based methods.

KW - Algorithmic motion planning

KW - Computational geometry

KW - Planar robots with complex geometry

KW - Resolution-exact algorithms

KW - Soft predicates

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

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

U2 - 10.4230/LIPIcs.ESA.2018.73

DO - 10.4230/LIPIcs.ESA.2018.73

M3 - Conference contribution

AN - SCOPUS:85052513617

SN - 9783959770811

VL - 112

BT - 26th European Symposium on Algorithms, ESA 2018

A2 - Bast, Hannah

A2 - Herman, Grzegorz

A2 - Azar, Yossi

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

ER -