On the problem of translating an elliptic object through a workspace of elliptic obstacles

1 July 1987

journal article
research article
Published by Cambridge University Press (CUP) in Robotica

Vol. 5 (3) , 187-196
https://doi.org/10.1017/s0263574700015824

Abstract

SUMMARY: Two algorithms are presented which deal with translating an elliptic object, A, without collision amidst elliptic obstacles. These are:(i) An exact algorithm, of complexity O(N log N), where N is the number of obstacles, yielding all directions along which the object is separable from the obstacles by a single translation.(ii) An algorithm quadratic in N, which yields, with a degree of approximation determined by the user, a path of the object from its initial to its final position.

Keywords

This publication has 6 references indexed in Scilit:

A subdivision algorithm in configuration space for findpath with rotation
IEEE Transactions on Systems, Man, and Cybernetics, 1985
Planning Collision- Free Motions for Pick-and-Place Operations
The International Journal of Robotics Research, 1983
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers, 1983
On translating a set of rectangles
Published by Association for Computing Machinery (ACM) ,1980
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM, 1979
Complexity of the mover's problem and generalizations
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979