On soft predicates in subdivision motion planning
type: Item
instance of: scholarly article
title: On soft predicates in subdivision motion planning
zbMATH Open document ID: 1339.68283
author: Cong Wang
author: Yi-Jen Chiang
author: Chee K. Yap
published in: Computational Geometry
publication date: 2015-07-27T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6465036
zbMATH Keywords: exact algorithms
zbMATH Keywords: subdivision algorithms
zbMATH Keywords: motion planning
zbMATH Keywords: soft predicates
zbMATH Keywords: resolution-exact algorithms
describes a project that uses: SqFreeEVAL
describes a project that uses: gmp
describes a project that uses: MPFR
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2216320547
cites work: Q4788603
cites work: SqFreeEVAL: An (almost) optimal real-root isolation algorithm
cites work: Computing Roadmaps of General Semi-Algebraic Sets
cites work: Shortest path amidst disc obstacles is computable
cites work: Q5713497
cites work: An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Q4401031
cites work: Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
cites work: Planning Algorithms
cites work: Q5566070
cites work: A “retraction” method for planning the motion of a disc
cites work: Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
cites work: When Newton meets Descartes
cites work: A simple but exact and efficient algorithm for complex root isolation
cites work: Motion planning via manifold samples
cites work: On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
cites work: On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds
cites work: Generalized voronoi diagrams for moving a ladder. I: Topological analysis
cites work: Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
cites work: Near optimal tree size bounds on a simple real root isolation algorithm
cites work: Accurate Minkowski sum approximation of polyhedral models
cites work: Q3479508
cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
cites work: Q4821338
cites work: In Praise of Numerical Computation
DOI: 10.1016/J.COMGEO.2015.04.002
Recommended article: On soft predicates in subdivision motion planning
Recommended article: Soft Subdivision Search in Motion Planning, II: Axiomatics
Recommended article: Soft Subdivision Motion Planning for Complex Planar Robots
Recommended article: Soft subdivision motion planning for complex planar robots
Recommended article: Path Planning for Simple Robots using Soft Subdivision Search
Recommended article: Probabilistic Motion Planning Under Temporal Tasks and Soft Constraints
Recommended article: Reachability in a Planar Subdivision with Direction Constraints
Recommended article: Sequential parametrized motion planning and its complexity
Recommended article: On fast planning of suboptimal paths amidst polygonal obstacles in plane
description: scientific article; zbMATH DE number 6465036