Publications

Detailed Information

Precise contact motion planning for deformable planar curved shapes

Cited 1 time in Web of Science Cited 2 time in Scopus
Authors

Kim, Yong-Joon; Elber, Gershon; Kim, Myung-Soo

Issue Date
2016-01
Publisher
Pergamon Press Ltd.
Citation
CAD Computer Aided Design, Vol.70, pp.126-133
Abstract
We present a precise contact motion planning algorithm for a deformable robot in a planar environment with stationary obstacles. The robot and obstacles are both represented with C-1-continuous implicit or parametric curves. The robot is changing its shape using a single degree of freedom (via a oneparameter family of deformable curves). In order to reduce the dimensionality of the configuration space, geometrically constrained yet collision free contact motions are sought, that have K (= 2, 3) simultaneous tangential contact points between the robot and the obstacles. The K-contact motion analysis effectively reduces the degrees of freedom of the robot, which enables a more efficient motion planning. The geometric conditions for the K-contact motions can be formulated as a system of non-linear polynomial equations, which can be solved precisely using a multivariate equation solver. The solutions for K-contact motions are represented as curves in a 4-dimensional (x, y, theta, t) space, where x, y, theta are the degrees of freedom of the rigid motion and t is the deformation's parameter. Using the graph structure of the solution curves for the K-contact motions, our algorithm efficiently finds a feasible path connecting two configurations via a graph searching algorithm, whenever available. We demonstrate the effectiveness of the proposed approach using several examples. (C) 2015 Elsevier Ltd. All rights reserved.
ISSN
0010-4485
URI
https://hdl.handle.net/10371/191208
DOI
https://doi.org/10.1016/j.cad.2015.06.015
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share