期刊文献+

基于RRTConCon算法的船舶装配拆卸高斯采样路径规划 被引量:1

Gaussian Sampling Path Planning of Ship Assembly/Disassembly Based on RRTConCon Algorithm
下载PDF
导出
摘要 船舶舱室内的零部件在进行装配拆卸时,需要依据正确可行的路径进出装配体,通常采用路径规划的方法确定拆装路径。针对RRTConCon算法是采用随机采样的方法选取位姿点,在解决船舶舱室内狭窄通道的路径规划上效率不高的问题,提出了一种基于高斯采样的RRTConCon算法(RRTGaussion),采用高斯分布函数进行分区采样:在大的开阔区域设置较少的采样点,在复杂区域或狭窄通道设置较多的采样点,然后进行局部规划,找出拆装路径。通过在虚拟环境中对该算法进行仿真验证,结果表明,该算法在解决船舶舱室中狭窄通道的路径规划问题上效率高于RRTConCon算法。 The parts need to be moved in/out from the equipment in ship cabins with a proper and feasible path when the Assembly/Disassembly is implemented.Usually,motion planning is used to find the Assembly/Disassembly path.Among the existing motion planning algorithms,RRTConCon algorithm has higher efficiency than that of other algorithms and is suitable for the motion planning of ship parts' Assembly/Disassembly,but it has low efficiency with motion planning for narrow passages in ship cabins because of the random adding of free configurations.So,we proposed one kind of RRTGaussion algorithm with Gaussion sampling based on RRTConCon algorithm.The algorithm used the Gaussian sampling strategy that sampled less in large open regions while more in complex regions and narrow passages,and then based on this the local planner was used to try to connect these samples with a path.The proposed algorithm was validated in virtual environment.The experiments show that in solving the motion planning problems for narrow passages in ship cabins,the proposed RRTGaussion algorithm has higher efficiency than RRTConCon algorithm.
出处 《中国舰船研究》 2011年第5期108-112,共5页 Chinese Journal of Ship Research
关键词 RRTConCon算法 高斯分布 分区采样 装配拆卸 路径规划 RRTConCon algorithm Gaussian distribution regionally sampling assembly/disassembly motion planning
  • 相关文献

参考文献10

  • 1CHANG H,LI T-Y. Assembly maintainability study with motion planning [C]//Proceeding of IEEE International Conference on Robotics and Automation. Nagoya: IEEE Computer Society Press, 1995 : 1012-1017. 被引量:1
  • 2GARBER M,LIN, M. Constraint-based motion planning for virtual prototyping [C]//Proceeding of ACM Sympo- sium on Solid Model and Application,Saarbrucken,Ger- many, 2002. 被引量:1
  • 3ZHANG L, HUANG X, KIM Y. D-Plan: Efficient eolli. sion-free path computation for part removal and sisassem- bly[J]. Journal of Computer-Aided Design and Applica- tions, 2008:774-786. 被引量:1
  • 4LOZANO-PEREZ T, WESLEY M A. An algorithm for planning collision-free paths among polyhedral obstacles [J]. Communication of the ACM, 1979,22(10) :560-570. 被引量:1
  • 5BARRAQUAND J, LATOMBE J C. A monte-carlo algo- rithm for path planning with many degrees of freedom [C]// Proceeding of IEEE International Conference on Robotics and Automation,Cincinnati :IEEE Computer Society Press, 1990: 1712-1717. 被引量:1
  • 6KAVRAKI L, LATOMBE J. Randomized preprocessing of configuration space for fast path planning [C]//Proceeding of IEEE International Conference on Robotics and Au- tomation, SanDiego: IEEE Computer Society Press, 1994: 2138-2139. 被引量:1
  • 7LAVALLE S M. Rapidly-exploring random trees: a new tool for path planning [R].Technical Report TR98-11, Computer Science Department,Iowa State University, 1998. 被引量:1
  • 8刘华军,杨静宇,陆建峰,唐振民,赵春霞,成伟明.移动机器人运动规划研究综述[J].中国工程科学,2006,8(1):85-94. 被引量:74
  • 9LAVALLE S M, KUFFNER J J. Rapidly-exploring ran- dom trees: progress and prospects [M].Algorithmic and Computational Robotics:New Directions. DONALD BR, LYNCH K M,RUS D,Eds. Massachu setls:Wellesley, 2001:293-308. 被引量:1
  • 10唐华斌,孙增圻.结合启发式函数的随机运动规划方法[J].清华大学学报(自然科学版),2006,46(4):580-583. 被引量:7

二级参考文献78

  • 1张颖,吴成东,原宝龙.机器人路径规划方法综述[J].控制工程,2003,10(z1):152-155. 被引量:66
  • 2刘成良,张凯,付庄,曹其新,殷跃红.神经网络在机器人路径规划中的应用研究[J].机器人,2001,23(S1):605-608. 被引量:11
  • 3DeSouza G N,Kak A C.Vision for mobile robot navigation:a survey[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2002,24 (2):237-267. 被引量:1
  • 4Urmson C,Anhalt J,Clark M,et al.High Speed Navigation of Unrehearsed Terrain-Red Team Technology for Grand Challenge[R].CMU-RI-TR-04-37,The Robotics Institute,Carnegie Mellon University,2004. 被引量:1
  • 5Volpe R,Baumgatner E,Schenker P,Hayati S.Technology development and testing for enhanced mars rover sample return operations[A].Proc IEEE Aerospace Conference[C].2000. 被引量:1
  • 6Leonard J,Durrant-Whyte H F.Mobile robot localization by tracking geometric beacons[J].IEEE transaction on robotics and automation,1991,7 (3):376-38. 被引量:1
  • 7Nilsson N J.Shakey the robot[R].Technical Report TR223,SRI International,1984. 被引量:1
  • 8Lozano-Perez T,Wesley M A.An algorithm for planning collision-free paths among polyhedral obstacles[J].Communications of the ACM,1979,22 (10):'560- 570. 被引量:1
  • 9Laumond J P,Sekhavat S,Lamiraux F,Guidelines in Nonholonomic Motion Planning for Mobile Robots[M].Lectures Notes in Control and Information Sciences 229,Springer,1998. 被引量:1
  • 10Niku S B,孙富春,朱纪洪,刘国栋译.机器人学导论:分析、系统及应用[M].北京:电子工业出版社,2004.. 被引量:2

共引文献77

同被引文献7

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部