期刊文献+

采用单位四元数的旋转约束RRT路径规划 被引量:2

Unit quaternion RRT path planning with rotation constraints
下载PDF
导出
摘要 针对船舶虚拟原型设计时装配拆卸路径规划中的旋转约束问题,提出了一种基于快速随机探索树的旋转约束路径规划算法。该算法首先针对三维空间中的旋转提出了一种新的单位四元组随机采样函数,然后将单位四元数内积引入到C空间距离度量函数中,对路径中的旋转变化量进行控制。实验证明:该算法能够对刚体的旋转范围进行有效控制,同时还降低了运动过程中的旋转变化量。 A RRT-based new path planning algorithm was presented to deal with the assembly/disassembly path planning with rotation constraints for ship virtual prototyping.The algorithm involves a random sampling function of unit quaternion,and adds the unit quaternion inner product to C-space metric function for controlling the change of the rotation angles.The experiments show that the algorithm can more effectively constrain the rotation of the rigid and reduce the change of rotation angles.
出处 《海军工程大学学报》 CAS 北大核心 2010年第4期76-81,共6页 Journal of Naval University of Engineering
关键词 路径规划 随机采样 RRT 旋转约束 单位四元数 path planning random sampling RRT rotation constraints unit quaternion
  • 相关文献

参考文献11

  • 1CHANG H, LIT Y. Assembly maintainability study with motion planning [C]//Proceedings of the 1995 IEEE International Conference on Robotics & Automation. Nagoya, Aichi, Japan: IEEE 1995.
  • 2GARBER M, LIN M. Constraint-based motion planning for virtual prototyping [C]// Proc. ACM Symposium on Solid Model and Application. Saarbrucken, Germany: ACM 2002.
  • 3ZHANG L, HUANG X, KIM Y, et al. D-plan: Efficient collision-free path computation for part removal and disassembly [J]. Journal of Computer-Aided Design and Applications, 2008,5(6):774-786.
  • 4唐华斌,孙增圻.结合启发式函数的随机运动规划方法[J].清华大学学报(自然科学版),2006,46(4):580-583. 被引量:7
  • 5BARRAQUAND J, LATOMBE J. A Monte-Carlo algorithm for path planning with many degrees of freedom [C]//IEEE Int. Conf. Robotics and Automation. Cincinnati, Ohio: IEEE,1990.
  • 6KAVRAKI L, LATOMBE J. Randomized preprocessing of configuration space for fast path planning [C]//IEEE Int. Conf. on Robotics and Automation. San Diego, USA:IEEE,1994.
  • 7LA VALLE S M. Rapidly-Exploring Random Trees: A New Tool for Path Planning [R]. Ames, USA: Iowa State University, 1998.
  • 8刘华军,杨静宇,陆建峰,唐振民,赵春霞,成伟明.移动机器人运动规划研究综述[J].中国工程科学,2006,8(1):85-94. 被引量:74
  • 9KUFFNER J. Effective sampling and distance metrics for 3D rigid body path planning [C]//Proc. IEEE Int. Conf. Robotics and Automation. New Orleans: IEEE, 2004.
  • 10SHOEMAKE K. Uniform Random Rotations [M]. San Diego: Graphics Gems III Academic Press,1992.

二级参考文献84

  • 1张颖,吴成东,原宝龙.机器人路径规划方法综述[J].控制工程,2003,10(z1):152-155. 被引量:66
  • 2刘成良,张凯,付庄,曹其新,殷跃红.神经网络在机器人路径规划中的应用研究[J].机器人,2001,23(S1):605-608. 被引量:11
  • 3梁伟杰,郝建平,刘安清.虚拟维修性分析评价系统[J].兵工自动化,2005,24(6):27-28. 被引量:2
  • 4柳辉,郝建平.基于虚拟维修仿真的维修性分析系统设计与实现[J].系统仿真学报,2006,18(2):378-383. 被引量:26
  • 5DeSouza 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.
  • 6Urmson 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.
  • 7Volpe 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.
  • 8Leonard J,Durrant-Whyte H F.Mobile robot localization by tracking geometric beacons[J].IEEE transaction on robotics and automation,1991,7 (3):376-38.
  • 9Nilsson N J.Shakey the robot[R].Technical Report TR223,SRI International,1984.
  • 10Lozano-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.

共引文献80

同被引文献13

  • 1张涛,张建军,郭波,谭跃进.装备使用阶段维修保障能力评估指标体系研究[J].装甲兵工程学院学报,2005,19(1):7-10. 被引量:28
  • 2任博,秦春明,张恒喜.战时航空机务军械保障仿真研究[J].装备指挥技术学院学报,2006,17(4):14-16. 被引量:3
  • 3KAVRAKI L, LATOMBE J. Randomized prepro- cessing of configuration space for fast path planning [C] // IEEE International Conference on Robotics and Automation. San Diego, USA~ IEEE, 1994.
  • 4RAVEH B, ENOSH A, HALPERIN D. A little more, a lot better: Improving path quality by a path-merging algorithm [J]. IEEE Transactions on Robotics, 2011,27(2) :365-371.
  • 5KARAMAN S, FRAZZOLI E. Incremental sampling-based algorithms for optimal motion plan- ning[C] // Proceedings of Robotics: Science and Systems (RSS). Zaragoza, Spain: s. n. , 2010.
  • 6KARAMAN S, FRAZZOLI E. Sampling-based al- gorithms for optimal motion planning with deter- ministic/z-calculus spe-cifications [C] // American Control Conference. Montr6al, Canada: s. n. , 2012.
  • 7PEREZ A, KARAMAN S, SHKOLNIK A, et al. Asymptotically-optimal path planning for manipula- tion using incremental sampling-based algorithms [C] // IEEE/RSJ International Conference on In telligent Robots and Systems. San Francisco, USA: IEEE, 2011.
  • 8GERAERTS R, OVERMARS M H. Creating high- quality paths for motion planning [J]. International Journal. of Robotics Research, 2007, 26 (8): 845- 863.
  • 9GERAERTS, R. Planning short paths with clea- rance using explicit corridors [C] // IEEE Interna- tional Conference on Robotics and Automation. An- chorage, USA: IEEE, 2010.
  • 10谢君,肖汉斌.基于汽车滚装码头的装卸工艺流程研究[J].武汉理工大学学报(交通科学与工程版),2009,33(4):787-790. 被引量:3

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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