{"title":"Efficient path planning for cooperating manipulators","authors":"M. Fischer","doi":"10.1109/IROS.1994.407360","DOIUrl":null,"url":null,"abstract":"This paper describes a new approach to planning collision-free paths for cooperating robots with dependent tool center points (TCPs) in realistic environments. A formal description and a classification of these task are presented. Then, a path planner for online planning in 3D realistic scenes is described. On the one hand, online planning demands results in very short time intervals, on the other hand, the planners have to cope with complex 3D environments. Following these requirements, the planners presented here avoid the complexity of a complete search and use heuristics instead. These heuristics and strategies for different task classes are presented.<<ETX>>","PeriodicalId":437805,"journal":{"name":"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.1994.407360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper describes a new approach to planning collision-free paths for cooperating robots with dependent tool center points (TCPs) in realistic environments. A formal description and a classification of these task are presented. Then, a path planner for online planning in 3D realistic scenes is described. On the one hand, online planning demands results in very short time intervals, on the other hand, the planners have to cope with complex 3D environments. Following these requirements, the planners presented here avoid the complexity of a complete search and use heuristics instead. These heuristics and strategies for different task classes are presented.<>