Energetically optimal cruising motion of robots

J. Somló, A. Loginov
{"title":"Energetically optimal cruising motion of robots","authors":"J. Somló, A. Loginov","doi":"10.1109/INES.1997.632440","DOIUrl":null,"url":null,"abstract":"A robot motion is cruising when one of the velocities (joint or Cartesian) is at its limit value. When the path of the motion is given (CPC problem) it can be proved that time-optimal motion is realized when at least one of the joint velocities is at its maximum value. Which joint's velocity should be at maximum depends on the position in working space, and the maximum velocity values of joints, and can be determined by simple general method. The authors consider the following problem: The robot end effector centre point should move between two points (PTP problem) for minimum time and also satisfying the conditions of energetical optimality. A motion is energetically optimal when there is no energy lost for not needed changes of kinetic energy of the robot mechanisms. A simple method is given for the determination of minimum time cruising PTP motion. All of the realizable trajectories inside the attainable domain of motion realize minimum time. From these trajectories the energetically optimal can be determined using the dynamic model of robots in Riemann space. As side results, the problem of when the motion on a straight line takes more time than on some other, and energetically optimal motion along a given path, is also solved.","PeriodicalId":161975,"journal":{"name":"Proceedings of IEEE International Conference on Intelligent Engineering Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.1997.632440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A robot motion is cruising when one of the velocities (joint or Cartesian) is at its limit value. When the path of the motion is given (CPC problem) it can be proved that time-optimal motion is realized when at least one of the joint velocities is at its maximum value. Which joint's velocity should be at maximum depends on the position in working space, and the maximum velocity values of joints, and can be determined by simple general method. The authors consider the following problem: The robot end effector centre point should move between two points (PTP problem) for minimum time and also satisfying the conditions of energetical optimality. A motion is energetically optimal when there is no energy lost for not needed changes of kinetic energy of the robot mechanisms. A simple method is given for the determination of minimum time cruising PTP motion. All of the realizable trajectories inside the attainable domain of motion realize minimum time. From these trajectories the energetically optimal can be determined using the dynamic model of robots in Riemann space. As side results, the problem of when the motion on a straight line takes more time than on some other, and energetically optimal motion along a given path, is also solved.
机器人的能量最优巡航运动
当其中一个速度(关节速度或笛卡尔速度)达到极限时,机器人的运动就是巡航。当运动路径给定时(CPC问题),可以证明当至少有一个关节速度达到最大值时,可以实现时间最优运动。哪个关节速度最大取决于关节在工作空间中的位置和关节的最大速度值,可以用简单的一般方法确定。作者考虑了以下问题:机器人末端执行器中心点在两点之间移动的时间最短(PTP问题),并满足能量最优的条件。当机器人机构不需要的动能变化而没有能量损失时,运动是能量最优的。给出了一种确定最小巡航PTP运动时间的简单方法。在可实现的运动域内,所有可实现的轨迹都实现了最短时间。利用黎曼空间中的机器人动力学模型,可以从这些轨迹中确定能量最优。同时,还解决了沿直线运动何时比沿其他直线运动花费更多时间以及沿给定路径进行能量最优运动的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信