On soft predicates in subdivision motion planning

Cong Wang, Yi Jen Chiang, Chee Yap

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

Abstract

We propose to design new algorithms for motion planning problems using the well-known Domain Subdivision paradigm, coupled with "soft" predicates. Unlike the traditional exact predicates in computational geometry, our primitives are only exact in the limit. We introduce the notion of resolution-exact algorithms in motion planning: such an algorithm has an "accuracy" constant K > 1, and takes an arbitrary input "resolution" parameter ε > 0 such that: if there is a path with clearance Kε, it will output a path with clearance ε/K; if there are no paths with clearance ε/K, it reports "no path". Besides the focus on soft predicates, our framework also admits a variety of global search strategies including forms of the A* search and probabilistic search. Our algorithms are theoretically sound, practical, easy to implement, without implementation gaps, and have adaptive complexity. Our deterministic and probabilistic strategies avoid the Halting Problem of current probabilistically complete algorithms. We develop the first provably resolution-exact algorithms for motion-planning problems in SE(2) = R 2 × S1. To validate this approach, we implement our algorithms and the experiments demonstrate the efficiency of our approach, even compared to probabilistic algorithms.

Original languageEnglish (US)
Title of host publicationProceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013
Pages349-358
Number of pages10
StatePublished - 2013
Event29th Annual Symposium on Computational Geometry, SoCG 2013 - Rio de Janeiro, Brazil
Duration: Jun 17 2013Jun 20 2013

Other

Other29th Annual Symposium on Computational Geometry, SoCG 2013
CountryBrazil
CityRio de Janeiro
Period6/17/136/20/13

Fingerprint

Motion Planning
Motion planning
Subdivision
Predicate
Clearance
Path
Exact Algorithms
Halting Problem
Probabilistic Algorithms
Global Search
Computational Geometry
Search Strategy
Computational geometry
Paradigm
Output
Arbitrary
Demonstrate
Acoustic waves
Experiment

Keywords

  • Computational geometry
  • Exact algorithms
  • Motion planning
  • Resolution-exact algorithms
  • Robotics
  • Soft predicates
  • Subdivision algorithms

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology
  • Theoretical Computer Science

Cite this

Wang, C., Chiang, Y. J., & Yap, C. (2013). On soft predicates in subdivision motion planning. In Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013 (pp. 349-358)

On soft predicates in subdivision motion planning. / Wang, Cong; Chiang, Yi Jen; Yap, Chee.

Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013. 2013. p. 349-358.

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

Wang, C, Chiang, YJ & Yap, C 2013, On soft predicates in subdivision motion planning. in Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013. pp. 349-358, 29th Annual Symposium on Computational Geometry, SoCG 2013, Rio de Janeiro, Brazil, 6/17/13.
Wang C, Chiang YJ, Yap C. On soft predicates in subdivision motion planning. In Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013. 2013. p. 349-358
Wang, Cong ; Chiang, Yi Jen ; Yap, Chee. / On soft predicates in subdivision motion planning. Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013. 2013. pp. 349-358
@inproceedings{0eb2435b1675487d80d676a3e2f2683b,
title = "On soft predicates in subdivision motion planning",
abstract = "We propose to design new algorithms for motion planning problems using the well-known Domain Subdivision paradigm, coupled with {"}soft{"} predicates. Unlike the traditional exact predicates in computational geometry, our primitives are only exact in the limit. We introduce the notion of resolution-exact algorithms in motion planning: such an algorithm has an {"}accuracy{"} constant K > 1, and takes an arbitrary input {"}resolution{"} parameter ε > 0 such that: if there is a path with clearance Kε, it will output a path with clearance ε/K; if there are no paths with clearance ε/K, it reports {"}no path{"}. Besides the focus on soft predicates, our framework also admits a variety of global search strategies including forms of the A* search and probabilistic search. Our algorithms are theoretically sound, practical, easy to implement, without implementation gaps, and have adaptive complexity. Our deterministic and probabilistic strategies avoid the Halting Problem of current probabilistically complete algorithms. We develop the first provably resolution-exact algorithms for motion-planning problems in SE(2) = R 2 × S1. To validate this approach, we implement our algorithms and the experiments demonstrate the efficiency of our approach, even compared to probabilistic algorithms.",
keywords = "Computational geometry, Exact algorithms, Motion planning, Resolution-exact algorithms, Robotics, Soft predicates, Subdivision algorithms",
author = "Cong Wang and Chiang, {Yi Jen} and Chee Yap",
year = "2013",
language = "English (US)",
isbn = "9781450320313",
pages = "349--358",
booktitle = "Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013",

}

TY - GEN

T1 - On soft predicates in subdivision motion planning

AU - Wang, Cong

AU - Chiang, Yi Jen

AU - Yap, Chee

PY - 2013

Y1 - 2013

N2 - We propose to design new algorithms for motion planning problems using the well-known Domain Subdivision paradigm, coupled with "soft" predicates. Unlike the traditional exact predicates in computational geometry, our primitives are only exact in the limit. We introduce the notion of resolution-exact algorithms in motion planning: such an algorithm has an "accuracy" constant K > 1, and takes an arbitrary input "resolution" parameter ε > 0 such that: if there is a path with clearance Kε, it will output a path with clearance ε/K; if there are no paths with clearance ε/K, it reports "no path". Besides the focus on soft predicates, our framework also admits a variety of global search strategies including forms of the A* search and probabilistic search. Our algorithms are theoretically sound, practical, easy to implement, without implementation gaps, and have adaptive complexity. Our deterministic and probabilistic strategies avoid the Halting Problem of current probabilistically complete algorithms. We develop the first provably resolution-exact algorithms for motion-planning problems in SE(2) = R 2 × S1. To validate this approach, we implement our algorithms and the experiments demonstrate the efficiency of our approach, even compared to probabilistic algorithms.

AB - We propose to design new algorithms for motion planning problems using the well-known Domain Subdivision paradigm, coupled with "soft" predicates. Unlike the traditional exact predicates in computational geometry, our primitives are only exact in the limit. We introduce the notion of resolution-exact algorithms in motion planning: such an algorithm has an "accuracy" constant K > 1, and takes an arbitrary input "resolution" parameter ε > 0 such that: if there is a path with clearance Kε, it will output a path with clearance ε/K; if there are no paths with clearance ε/K, it reports "no path". Besides the focus on soft predicates, our framework also admits a variety of global search strategies including forms of the A* search and probabilistic search. Our algorithms are theoretically sound, practical, easy to implement, without implementation gaps, and have adaptive complexity. Our deterministic and probabilistic strategies avoid the Halting Problem of current probabilistically complete algorithms. We develop the first provably resolution-exact algorithms for motion-planning problems in SE(2) = R 2 × S1. To validate this approach, we implement our algorithms and the experiments demonstrate the efficiency of our approach, even compared to probabilistic algorithms.

KW - Computational geometry

KW - Exact algorithms

KW - Motion planning

KW - Resolution-exact algorithms

KW - Robotics

KW - Soft predicates

KW - Subdivision algorithms

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

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

M3 - Conference contribution

SN - 9781450320313

SP - 349

EP - 358

BT - Proceedings of the 29th Annual Symposium on Computational Geometry, SoCG 2013

ER -