Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/4931
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Conkur, Erdinç Şahin | - |
dc.contributor.author | Buckingham, R. | - |
dc.contributor.author | Harrison, A. | - |
dc.date.accessioned | 2019-08-16T11:39:04Z | |
dc.date.available | 2019-08-16T11:39:04Z | |
dc.date.issued | 2005 | - |
dc.identifier.issn | 0957-4158 | - |
dc.identifier.uri | https://hdl.handle.net/11499/4931 | - |
dc.identifier.uri | https://doi.org/10.1016/j.mechatronics.2004.06.009 | - |
dc.description.abstract | An algorithm for path planning for redundant manipulators is presented in this paper. The algorithm uses harmonic potential fields defined globally in W-space (work space) for both path planning and obstacle avoidance. Although paths generated by harmonic potential fields are collision free for point robots, this is not always the case for manipulators when especially tight manocuvring is required. To enhance collision avoidance ability of redundant manipulators, the beam analysis algorithm is proposed. The algorithm sends beams along the path generated for point robots to determine virtual obstacle points where collision with obstacle is likely to occur. The potential field is then regenerated to include these virtual obstacle points. Besides, the interaction between manipulator links and the potential field is accomplished by the control points situated on only proximal ends of the links. The virtual obstacle points and selected control points allow the manipulator to achieve tight manoeuvring in W-spaces cluttered with many obstacles. The improvement in performance is also clearly indicated by a benchmark scheme that compares the algorithms by means of the complexity of the environment with respect to link lengths of redundant manipulators. Furthermore, the beam analysis algorithm readily produces safer paths for mobile robots, which does not suffer too far or too close problems. Examples are included to demonstrate these features of the algorithm. © 2004 Elsevier Ltd. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Mechatronics | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Obstacle avoidance | en_US |
dc.subject | Path planning | en_US |
dc.subject | Potential field | en_US |
dc.subject | Redundant robots | en_US |
dc.subject | Benchmarking | en_US |
dc.subject | Collision avoidance | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Mobile robots | en_US |
dc.subject | Motion planning | en_US |
dc.subject | Optimization | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Redundant manipulators | en_US |
dc.subject | Vectors | en_US |
dc.subject | Beam analysis algorithm | en_US |
dc.subject | Laplacian operator | en_US |
dc.subject | Algorithms | en_US |
dc.title | The beam analysis algorithm for path planning for redundant manipulators | en_US |
dc.type | Article | en_US |
dc.identifier.volume | 15 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.startpage | 67 | |
dc.identifier.startpage | 67 | en_US |
dc.identifier.endpage | 94 | en_US |
dc.identifier.doi | 10.1016/j.mechatronics.2004.06.009 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-9244236006 | en_US |
dc.identifier.wos | WOS:000225384400004 | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.owner | Pamukkale_University | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | 10.07. Mechanical Engineering | - |
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 |
CORE Recommender
SCOPUSTM
Citations
7
checked on Nov 16, 2024
WEB OF SCIENCETM
Citations
3
checked on Nov 21, 2024
Page view(s)
46
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.