Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/4814
Title: | Path planning using potential fields for highly redundant manipulators | Authors: | Conkur, Erdinç Şahin | Keywords: | Highly redundant manipulators Obstacle avoidance Path planning Potential field method Algorithms C (programming language) Collision avoidance Computer software Matrix algebra Problem solving Redundant manipulators Robotics Harmonic potential fields Path planning algorithms Potential field methods Motion planning |
Abstract: | Several aspects of the path planning problem for highly redundant manipulators are dealt with in this paper. A new method is presented for the path planning. The basic idea is to find a smooth path consisting of points close enough to each other using harmonic potential fields, and then to keep the tip of each link on these path points until the manipulator reaches the goal. The concept of master link is introduced and applied to three path planning algorithms for the smooth motion of the manipulator. A reversing procedure is included to take the manipulator to its initial position. Besides, software developed in C++ for Windows platforms is introduced. The main features of the software are to draw obstacles and manipulators on the screen, to obtain two- and three-dimensional images of potential fields and implement path planning algorithms. © 2005 Elsevier B.V. All rights reserved. | URI: | https://hdl.handle.net/11499/4814 https://doi.org/10.1016/j.robot.2005.03.005 |
ISSN: | 0921-8890 |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
52
checked on Aug 17, 2024
WEB OF SCIENCETM
Citations
34
checked on Jul 31, 2024
Page view(s)
38
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.