License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2016.68
URN: urn:nbn:de:0030-drops-59607
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5960/
Go to the corresponding LIPIcs Volume Portal

Hsu, Ching-Hsiang ; Ryan, John Paul ; Yap, Chee

Path Planning for Simple Robots using Soft Subdivision Search

pdf-format:
LIPIcs-SoCG-2016-68.pdf (0.4 MB)

Abstract

The concept of resolution-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.

BibTeX - Entry

@InProceedings{hsu_et_al:LIPIcs:2016:5960,
  author =	{Ching-Hsiang Hsu and John Paul Ryan and Chee Yap},
  title =	{{Path Planning for Simple Robots using Soft Subdivision Search}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{68:1--68:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{S{\'a}ndor Fekete and Anna Lubiw},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5960},
  URN =		{urn:nbn:de:0030-drops-59607},
  doi =		{10.4230/LIPIcs.SoCG.2016.68},
  annote =	{Keywords: Robot Path Planning, Soft Predicates, Resolution-Exact Algorithm, Subdivision Search}
}

Keywords: Robot Path Planning, Soft Predicates, Resolution-Exact Algorithm, Subdivision Search
Collection: 32nd International Symposium on Computational Geometry (SoCG 2016)
Issue Date: 2016
Date of publication: 10.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI