{"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.