A "Piano Movers" Problem Reformulated

@article{Wilson2013AM,
  title={A "Piano Movers" Problem Reformulated},
  author={David J. Wilson and J. Davenport and M. England and R. Bradford},
  journal={2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing},
  year={2013},
  pages={53-60}
}
It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a ``Piano Mover's Problem'' which considers moving an infinitesimally thin piano (or ladder) through a right-angled corridor. Producing a CAD for the original formulation of this problem is still infeasible after 25 years of improvements in both CAD theory and computer… Expand
Advances in cylindrical algebraic decomposition
TLDR
A prototype software CADassistant is described to help users take advantage of the advances without knowledge of the underlying theory, to improve the practical efficiency of CAD for a variety of problems. Expand
An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance
TLDR
This report describes how the CADs produced using equational constraints are able to take advantage of not just improved projection but also improvements in the lifting phase, and presents an extension to the original TTICAD algorithm which increases both the applicability of TTICad and its relative benefit over other algorithms. Expand
Truth table invariant cylindrical algebraic decomposition
TLDR
An extended version of McCallum's theory of reduced projection operators is presented which can be applied to an arbitrary list of formulae, achieving savings if at least one has an equational constraint. Expand
Formulating problems for real algebraic geometry
TLDR
The thesis is that intelligently formulating problems for algorithms, and indeed choosing the correct algorithm variant for a problem, is key to improving the practical use of both quantifier elimination and symbolic real algebraic geometry in general. Expand
An implementation of Sub-CAD in Maple
TLDR
This report reports on new functionality: the ability to build cylindrical algebraic sub-decompositions (sub-CADs) where only certain cells are returned, and implemented algorithms to return cells of a prescribed dimensions or higher and an algorithm to return only those cells on which given poly-nomials are zero. Expand
Cylindrical Algebraic Sub-Decompositions
TLDR
This paper introduces cylindrical algebraic sub-decompositions (sub-CADs), which are subsets of CADs containing all the information needed to specify a solution for a given problem. Expand
Using Machine Learning to Improve Cylindrical Algebraic Decomposition
TLDR
This paper applies machine learning to Symbolic Computation in two case studies: the first to select between heuristics for choosing a CAD variable ordering; the second to identify when a CAD problem instance would benefit from Gröbner Basis preconditioning. Expand
Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
TLDR
The latest variant of this which builds the complex decomposition incrementally by polynomial and produces CADs on whose cells a sequence of formulae are truth-invariant is considered. Expand
Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition
TLDR
It is found that cells by dimension in cylindrical algebraic decompositions follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used, and is combined with an algorithm that produces only full-dimensional cells to give an accurate method of predicting the number of cells in a complete CAD. Expand
Machine learning and computer algebra
TLDR
The results show that machine learning can effectively be applied to these applications, with the machine learned choices being superior to both choosing a single fixed individual algorithm, as well as to random choice. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 45 REFERENCES
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
We present an algorithm that solves a two-dimensional case of the following problem which arises in robotics: Given a body B, and a region bounded by a collection of “walls”, either find a continuousExpand
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
This paper continues the discussion, begun in J. Schwartz and M. Sharir [Comm. Pure Appl. Math., in press], of the following problem, which arises in robotics: Given a collection of bodies B, whichExpand
An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance
TLDR
This report describes how the CADs produced using equational constraints are able to take advantage of not just improved projection but also improvements in the lifting phase, and presents an extension to the original TTICAD algorithm which increases both the applicability of TTICad and its relative benefit over other algorithms. Expand
Constructing a single open cell in a cylindrical algebraic decomposition
TLDR
The paper reports on a few example computations carried out by a test implementation of the new algorithm, which demonstrate the functioning of the algorithm and illustrate the sense in which it is more efficient than following the usual "open CAD" approach. Expand
An implementation of CAD in Maple utilising McCallum projection
TLDR
The implementation described here is of interest as the only full implementation of CADW, (since Qepcad does not currently make use of McCallum’s delineating polynomials), and hence can solve problems not admissible to other CAD implementations. Expand
Layered Cylindrical Algebraic Decomposition
In this report the idea of a Layered CAD is introduced: a truncation of a CAD to cells of dimension higher than a prescribed value. Limiting to full-dimensional cells has already been investigated inExpand
A :20piano movers' '
TLDR
The purpose of this note is to discuss a particularly simple such problem, and show what actually happens during the decomposition (as far as the authors could take it). Expand
Optimising Problem Formulation for Cylindrical Algebraic Decomposition
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doublyExpand
The algorithm by Schwartz, Sharir and Collins on the piano mover's problem
  • J. Marchand
  • Mathematics, Computer Science
  • Geometry and Robotics
  • 1988
TLDR
The quantifier elimination problem, and other problems connected to it, is followed by the state of the art on the question, and Schwartz', Sharir's and Collins' algorithm, based on the cylindrical algebraic decomposition, is explained. Expand
An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space
  • S. McCallum
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1988
TLDR
It is shown, using a theorem from complex analytic geometry, that the original projection set for trivariate polynomials that Collins used can be substantially reduced in size, without affecting its essential properties. Expand
...
1
2
3
4
5
...