Virtual Sphere Algorithms for orthodrome-based collision-free & smooth robot motion

T. Anand
{"title":"Virtual Sphere Algorithms for orthodrome-based collision-free & smooth robot motion","authors":"T. Anand","doi":"10.1109/ROBIO.2009.5420404","DOIUrl":null,"url":null,"abstract":"A novel geometric algorithm is proposed that assures a smooth path around the obstacle by generating a Virtual Sphere around it. The Spherical Virtual Sphere Algorithm (SVSA) makes the end-effector (the outermost tip of a closed gripper and hence, considered a point object) of the robot manipulator navigate along the orthodrome, the shortest path connecting the end-points of the obstacle avoidance path on the Virtual Sphere. The Exponential Virtual Sphere Algorithm (EVSA), although uses a Virtual Sphere to determine the end-points of the obstacle avoidance path, makes the end-effector navigate along an exponential curve around the obstacle. A performance comparison of both these algorithms is presented, followed by achievements over the past algorithms. Unlike some of the existing algorithms that focus on recovering from local minima, Virtual Sphere Algorithms (VSAs) avoid entering a concave obstacle due to the spherical encapsulation. Simplicity due to the geometric nature and guarantee of shortest path are major achievements of VSAs.","PeriodicalId":91430,"journal":{"name":"... IEEE International Conference on Robotics and Biomimetics. IEEE International Conference on Robotics and Biomimetics","volume":"36 1","pages":"1530-1536"},"PeriodicalIF":0.0000,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"... IEEE International Conference on Robotics and Biomimetics. IEEE International Conference on Robotics and Biomimetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2009.5420404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A novel geometric algorithm is proposed that assures a smooth path around the obstacle by generating a Virtual Sphere around it. The Spherical Virtual Sphere Algorithm (SVSA) makes the end-effector (the outermost tip of a closed gripper and hence, considered a point object) of the robot manipulator navigate along the orthodrome, the shortest path connecting the end-points of the obstacle avoidance path on the Virtual Sphere. The Exponential Virtual Sphere Algorithm (EVSA), although uses a Virtual Sphere to determine the end-points of the obstacle avoidance path, makes the end-effector navigate along an exponential curve around the obstacle. A performance comparison of both these algorithms is presented, followed by achievements over the past algorithms. Unlike some of the existing algorithms that focus on recovering from local minima, Virtual Sphere Algorithms (VSAs) avoid entering a concave obstacle due to the spherical encapsulation. Simplicity due to the geometric nature and guarantee of shortest path are major achievements of VSAs.
基于正交坐标系的机器人无碰撞平滑运动的虚拟球算法
提出了一种新的几何算法,通过在障碍物周围生成虚拟球来保证障碍物周围的平滑路径。球面虚拟球算法(SVSA)使机器人机械手的末端执行器(闭合夹持器的最外端,因此被认为是一个点对象)沿着连接虚拟球上避障路径端点的最短路径正交线进行导航。指数虚拟球算法(EVSA)虽然使用虚拟球来确定避障路径的终点,但使末端执行器沿着指数曲线围绕障碍物进行导航。对这两种算法进行了性能比较,然后介绍了过去算法的成就。与现有的一些算法侧重于从局部最小值恢复不同,虚拟球体算法(VSAs)由于球形封装而避免了进入凹障碍物。几何性质的简单性和最短路径的保证是vsa的主要成就。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书