Robot motion planning and the single cell problem in arrangements

@article{Halperin1994RobotMP,
  title={Robot motion planning and the single cell problem in arrangements},
  author={Dan Halperin},
  journal={Journal of Intelligent and Robotic Systems},
  year={1994},
  volume={11},
  pages={45-65}
}
  • D. Halperin
  • Published 1 March 1994
  • Mathematics
  • Journal of Intelligent and Robotic Systems
Robot motion planning has become a central topic in robotics and has been studied using a variety of techniques. One approach, followed mainly in computational geometry, aims to develop combinatorial, nonheuristic solutions to motion-planning problems. This direction is strongly related to the study of arrangements of algebraic curves and surfaces in low-dimensional Euclidean space. More specifically, the motion-planning problem can be reduced to the problem of efficiently constructing a single… 
A Review on Robot Motion Planning Approaches
TLDR
In this paper, about 100 research are reviewed and briefly described to identify and classify the amount of the existing work for each motion planning approach and the percentage of the application of each approach.
Robust Geometric Computing in Motion
TLDR
A discussion of the gap between the theory and practice of geometric algorithms, together with a brief review of existing solutions to some of the problems that this dichotomy brings about, and an overview of the CGAL project and library.
Efficient and small representation of line arrangements with applications
TLDR
This paper gives theoretical and empirical bounds to demonstrate the tradeoffs between the size of the new arrangement and the error from lossiness, and demonstrates that speedups by factors of several hundred are possible while introducing small errors.

References

SHOWING 1-10 OF 53 REFERENCES
Algorithmic motion planning in robotics
A survey is presented of an approach to motion planning that emphasizes object-oriented, exact, and discrete (or combinatorial) algorithmic techniques in which worst-case asymptotically efficient
The complexity of robot motion planning
TLDR
John Canny resolves long-standing problems concerning the complexity of motion planning and, for the central problem of finding a collision free path for a jointed robot in the presence of obstacles, obtains exponential speedups over existing algorithms by applying high-powered new mathematical techniques.
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
TLDR
A theorem is proved that identifies a collection of topological and combinatorial conditions for a set of surface patches in space, which make the complexity of a single cell in an arrangement induced by these surface patches near-quadratic.
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
  • D. Halperin, M. Sharir
  • Computer Science, Mathematics
    Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
TLDR
It is shown that the combinatorial complexity of a single connected component of the free configuration space of B is k/sup 3/n/sup 2/2/sup O(log(2/3)/ n), which is a significant improvement of the naive bound O((kn)/Sup 3/); this yields a near-quadratic bound on the complexity of such a component.
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)
TLDR
The algorithm is an optimized variant of the decomposition technique of the configuration space of the ladder, due to Schwartz and Sharir, based on some ideas which may be exploited to improve the efficiency of existing motion-planning algorithms for other more complex robot systems.
Robot motion planning
  • J. Latombe
  • Geology
    The Kluwer international series in engineering and computer science
  • 1991
TLDR
This chapter discusses the configuration space of a Rigid Object, the challenges of dealing with uncertainty, and potential field methods for solving these problems.
On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)
TLDR
A theorem is proved that identifies a collection of topological and combinatorial conditions for a set of surface patches in space, which make the complexity of a single cell in an arrangement induced by these surface patches near-quadratic.
...
...