Automatic path planning for coordinate measuring machines

A. Limaiem, H. Elmaraghy
{"title":"Automatic path planning for coordinate measuring machines","authors":"A. Limaiem, H. Elmaraghy","doi":"10.1109/ROBOT.1998.677098","DOIUrl":null,"url":null,"abstract":"This paper describes the path planning module of a computer-aided tactile inspection planning (CATIP) system. The path planner is based on Dijkistra's shortest path algorithm combined with collision detection routines. The working space is dicretized into a regular grid of nodes. The workpiece, the objects in the environment and the probe are automatically approximated by a set of cartesian boxes generated from their octree representation. Optimization and robustness are the main issues considered in this work, and the use of heuristics is completely avoided. The results are demonstrated using an example.","PeriodicalId":272503,"journal":{"name":"Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBOT.1998.677098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

This paper describes the path planning module of a computer-aided tactile inspection planning (CATIP) system. The path planner is based on Dijkistra's shortest path algorithm combined with collision detection routines. The working space is dicretized into a regular grid of nodes. The workpiece, the objects in the environment and the probe are automatically approximated by a set of cartesian boxes generated from their octree representation. Optimization and robustness are the main issues considered in this work, and the use of heuristics is completely avoided. The results are demonstrated using an example.
坐标测量机的自动路径规划
本文介绍了计算机辅助触觉检测规划(CATIP)系统的路径规划模块。路径规划器是基于dijkstra最短路径算法结合碰撞检测例程。工作空间被划分成一个规则的网格节点。工件、环境中的物体和探头由一组由它们的八叉树表示生成的直角方框自动逼近。优化和鲁棒性是这项工作中考虑的主要问题,并且完全避免了启发式的使用。最后通过一个算例对结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信