Iterative Path Planning of a Serial Manipulator in a Cluttered Known Environment

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robot path planning in a cluttered environment can be a challenging task. In this paper, a new algorithm is proposed to perform path planning of a point-to-point motion of an industrial manipulator. The algorithm starts from a simple joint interpolated movement and, by computing collision detection along the path, creates a set of via-points that form a path which allows the robot to move to the end position without any collision. In the paper, the new algorithm is presented and compared in simulation to other methods.

Cite

CITATION STYLE

APA

Bottin, M., Rosati, G., & Cipriani, G. (2021). Iterative Path Planning of a Serial Manipulator in a Cluttered Known Environment. In Mechanisms and Machine Science (Vol. 91, pp. 237–244). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-030-55807-9_27

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