Path planning for simple robots using soft subdivision search

Ching Hsiang Hsu, John Paul Ryan, Chee Yap

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

Abstract

The concept of ε-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous framework for subdivision, called Soft Subdivision Search (SSS). In this video, we illustrate the SSS framework for a trio of simple planar robots: disc, triangle and 2-links. These robots have, respectively, 2, 3 and 4 degrees of freedom. Our 2-link robot can also avoid self-crossing. These algorithms operate in realtime and are relatively easy to implement.

Original languageEnglish (US)
Title of host publication32nd International Symposium on Computational Geometry, SoCG 2016
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages68.1-68.5
Volume51
ISBN (Electronic)9783959770095
DOIs
StatePublished - Jun 1 2016
Event32nd International Symposium on Computational Geometry, SoCG 2016 - Boston, United States
Duration: Jun 14 2016Jun 17 2016

Other

Other32nd International Symposium on Computational Geometry, SoCG 2016
CountryUnited States
CityBoston
Period6/14/166/17/16

Fingerprint

Motion planning
Robots
Acoustic waves
Sampling

Keywords

  • Configuration space
  • Path planning
  • Resolution exactness
  • Soft predicates
  • Subdivision search

ASJC Scopus subject areas

  • Software

Cite this

Hsu, C. H., Ryan, J. P., & Yap, C. (2016). Path planning for simple robots using soft subdivision search. In 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 68.1-68.5). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.68

Path planning for simple robots using soft subdivision search. / Hsu, Ching Hsiang; Ryan, John Paul; Yap, Chee.

32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 68.1-68.5.

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

Hsu, CH, Ryan, JP & Yap, C 2016, Path planning for simple robots using soft subdivision search. in 32nd International Symposium on Computational Geometry, SoCG 2016. vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 68.1-68.5, 32nd International Symposium on Computational Geometry, SoCG 2016, Boston, United States, 6/14/16. https://doi.org/10.4230/LIPIcs.SoCG.2016.68
Hsu CH, Ryan JP, Yap C. Path planning for simple robots using soft subdivision search. In 32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 68.1-68.5 https://doi.org/10.4230/LIPIcs.SoCG.2016.68
Hsu, Ching Hsiang ; Ryan, John Paul ; Yap, Chee. / Path planning for simple robots using soft subdivision search. 32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 68.1-68.5
@inproceedings{1bd68637736d4eca8b38766c2afa58b5,
title = "Path planning for simple robots using soft subdivision search",
abstract = "The concept of ε-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous framework for subdivision, called Soft Subdivision Search (SSS). In this video, we illustrate the SSS framework for a trio of simple planar robots: disc, triangle and 2-links. These robots have, respectively, 2, 3 and 4 degrees of freedom. Our 2-link robot can also avoid self-crossing. These algorithms operate in realtime and are relatively easy to implement.",
keywords = "Configuration space, Path planning, Resolution exactness, Soft predicates, Subdivision search",
author = "Hsu, {Ching Hsiang} and Ryan, {John Paul} and Chee Yap",
year = "2016",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SoCG.2016.68",
language = "English (US)",
volume = "51",
pages = "68.1--68.5",
booktitle = "32nd International Symposium on Computational Geometry, SoCG 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Path planning for simple robots using soft subdivision search

AU - Hsu, Ching Hsiang

AU - Ryan, John Paul

AU - Yap, Chee

PY - 2016/6/1

Y1 - 2016/6/1

N2 - The concept of ε-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous framework for subdivision, called Soft Subdivision Search (SSS). In this video, we illustrate the SSS framework for a trio of simple planar robots: disc, triangle and 2-links. These robots have, respectively, 2, 3 and 4 degrees of freedom. Our 2-link robot can also avoid self-crossing. These algorithms operate in realtime and are relatively easy to implement.

AB - The concept of ε-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous framework for subdivision, called Soft Subdivision Search (SSS). In this video, we illustrate the SSS framework for a trio of simple planar robots: disc, triangle and 2-links. These robots have, respectively, 2, 3 and 4 degrees of freedom. Our 2-link robot can also avoid self-crossing. These algorithms operate in realtime and are relatively easy to implement.

KW - Configuration space

KW - Path planning

KW - Resolution exactness

KW - Soft predicates

KW - Subdivision search

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

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

U2 - 10.4230/LIPIcs.SoCG.2016.68

DO - 10.4230/LIPIcs.SoCG.2016.68

M3 - Conference contribution

VL - 51

SP - 68.1-68.5

BT - 32nd International Symposium on Computational Geometry, SoCG 2016

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

ER -