A Local Collision Avoidance Method for Non-strictly Convex Objects

  • Kanehiro F
  • Yoshida E
  • Lamiraux F
  • et al.
N/ACitations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a local method to avoid collisions with continuous velocities. The main contribution of the method is that non-strictly convex polyhedra can be used as geometric models of the robot and the environment without any approximation. The problem of the continuous interaction generation between polyhedra is reduced to the continuous constraints generation between polygonal faces and the continuity of those constraints are managed by the combinatorics based on Voronoi regions of a face. A collision-free motion is obtained by solving an optimization problem defined by an objective function which describes a task and linear inequality constraints which do geometrical constraints to avoid collisions. The proposed method is examined using example cases of simple objects and also applied to a humanoid robot HRP-2.

Cite

CITATION STYLE

APA

Kanehiro, F., Yoshida, E., Lamiraux, F., Kanoun, O., & Laumond, J.-P. (2009). A Local Collision Avoidance Method for Non-strictly Convex Objects. Journal of the Robotics Society of Japan, 27(1), 63–70. https://doi.org/10.7210/jrsj.27.63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free