期刊文献+

旋转约束的船舶装配拆卸路径规划算法 被引量:2

A Method for Assembly/Disassembly Path Planning of Ship with Rotation Constraints
下载PDF
导出
摘要 研究船舶装配拆卸路径规划优化问题,设备在安装维修过程中时会受到各种约束的限制,对快速有效地规划可行的装配拆卸路径一直都是船舶虚拟原型设计中的难点之一。针对装配拆卸路径规划中的旋转约束问题,提出一种基于快速探索随机树(RRT)算法的新的旋转约束路径规划算法。算法针对RRT算法中基于欧拉角的三维空间旋转分量随机采样函数分布不均匀的问题,设计了一种新的欧拉角均匀分布随机采样函数来生成随机位姿点,将欧拉角距离引入到C空间距离度量函数中,对路径中的旋转变化量进行控制,并引导路径规划方向。进行仿真的结果证明,算法能够对高维空间中刚体的旋转范围进行有效控制,具有较高的装配效率。 Because of the small space in the ship cabin,equipment installation or maintenance will be subject to various constraints,so the quick and effective planning of the feasible assembly/disassembly path has been difficult during the virtual prototyping of ship.To solve the assembly/disassembly path planning with rotation constraints for ship virtual prototyping,a new RRT-based path planning algorithm was presented for the environment with rotation constraints.The algorithm firstly addressed a uniform random sampling function which is used to replace the non-uniform Euler angles sampling function of RRT and generate uniform configurations in the C-space,then an Euler distance function is added to C-space metric function for controlling the changes of the rotation angles.Experiments show that the algorithm much more effectively restricts the rotation of the rigid and reduces the changes of rotation angles.
出处 《计算机仿真》 CSCD 北大核心 2011年第6期379-383,共5页 Computer Simulation
关键词 路径规划 随机采样 快速探索随机树 旋转约束 Path planning Random sampling RRT Rotation constraints
  • 引文网络
  • 相关文献

参考文献9

  • 1H Chang and T Y Li. Assembly maintainability study with motion planning[ C ]. Proceedings of the 1995 IEEE International Conference on Robotics & Automation, 1995. 1012 -1017.
  • 2M Garber and M Lin. Constraint - based motion planning for virtual prototyping[ C]. In Proc. ACM Symposium on Solid Model and Application, Saarbrucken, Germany, 2002.
  • 3L Zhang, et al. D - Plan : efiqeient collision - free path computation for part removal and disassembly[ J]. In Journal of Computer - Aided Design and Applications, 2008,5 (6) :774 - 786.
  • 4Y H Liu and S Arimoto. Computation of the tangent graph of polygonal obstacles by moving - line processing [ J ]. IEEE Transaction on Robotics and Automation, 1994,10 (6) : 823 - 830.
  • 5王佳,吴晓蓓,徐志良.避免人工势场中一类局部极小值的规划方法[J].计算机仿真,2007,24(11):151-154. 被引量:8
  • 6J Barraquand and J C Latombe. A monte - carlo algorithm for path planning with many degrees of freedom [ C ]. IEEE International Conference Robot & Automation, Cincinnati, Ohio, 1990. 1712 1717.
  • 7L Kavraki and J Latombe. Randomized preprocessing of configuration space for fast path planning [ C ]. IEEE International conference on Robotics and Automation, San Diego, 1994. 2138 -2139.
  • 8唐华斌,孙增圻.结合启发式函数的随机运动规划方法[J].清华大学学报(自然科学版),2006,46(4):580-583. 被引量:7
  • 9K Shoemake. Uniform Random Rotations [ M ]. Graphics Gems III Academic Press, 1992. 124 - 132.

二级参考文献14

  • 1Lindemann S R,LaValle S M.Current issues in sampling-based motion planning[A].Chatila R,Dario P,Khatib O.Proc 11th Int'l Symp of Robotics Research[C].Berlin,Germany:Springer-Verlag,2004.
  • 2Kavraki L,Svestka P,Latombe J C,et al.Probabilistic roadmaps for path planning in high-dimensional configuration spaces[J].IEEE Transactions on Robotics and Automation,1996,12(4):566-580.
  • 3Hsu D,Kavraki L,Latombe J,et al.On finding narrow passages with probabilistic roadmap planners[A].Agarwal P K,Kavraka L E,Mason M T.Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics on Robotics[C].Boston,USA:A K Peters,Ltd,1998.141-153.
  • 4Amato N M,Bayazit O B,Dale L K,et al.OBPRM:An obstacle-based PRM for 3D workspaces[A].Agarwal P K,Kavraka L E,Mason M T.Proceedings of the Third Workshop on the Algorithmic Foundations of Robotics on Robotics[C].Boston,USA:A K Peters,Ltd,1998.155-168.
  • 5Aarno D,Kragic D,Christensen H I.Artificial potential-biased probabilistic roadmap method[A].Proc IEEE Int'l Conf on Robotics and Automation[C].New Orleans,LA,2004.461-466.
  • 6LaValle S M,Kuffner J J.Rapidly-exploring random trees:Progress and prospects[A].Donald B,Lynch K,Rus D.Algorithmic and Computational Robotics:New Directions[C].Boston,USA:A K Peters,Ltd,2001.293-308.
  • 7Hwang Y K,Ahuja N.A potential field approach to path planning[J].IEEE Transactions on Robotics and Automation,1992,8(1):23-32.
  • 8O Khatib. Real-time obstacle avoidance for manipulators and mobile robots[C]. In Proceedings of the IEEE International Conference on Robotics and Automation, St. Llouis,1985,500-505.
  • 9A Jaklic, A Leonardis and F Solina. Segmentation and recovery of superquadrics [J].in Computational imaging and vision, Chaper 2,2000.20.
  • 10J O Kim and P K Khosla. Real-time obstacle avoidance using harmonic potential functions [C].proc. IEEE Conference on Robotics and Automation, Sacramento, CA, 1991,790-796.

共引文献13

同被引文献17

  • 1刘检华,姚珺,宁汝新.基于虚拟装配的碰撞检测算法研究与实现[J].系统仿真学报,2004,16(8):1775-1778. 被引量:31
  • 2郑轶,宁汝新,刘检华,万毕乐.交互式虚拟装配路径规划及优选方法研究[J].中国机械工程,2006,17(11):1153-1156. 被引量:14
  • 3刘检华,宁汝新,万毕乐,熊珍奇.面向虚拟装配的复杂产品装配路径规划技术研究[J].系统仿真学报,2007,19(9):2003-2007. 被引量:27
  • 4陈家照,徐福后.基于人与装配件的虚拟装配路径规划研究[J].现代制造工程,2007(8):44-46. 被引量:1
  • 5J W Sheng, et al. An Improved artificial potential field algorithm for virtual human path planning[ M ]. Entertainment for Education: Digital Techniques and Systems. Berlin; Springer-Verlag Berlin. 2010: 592-601.
  • 6Y S He, Y Y Tang. Path planning of virtual human by using rein forcement learning[ C]. Proceedings of the 2008 International Con- ferenee on Machine Learning and Cybernetics, New York, 2008: 987 -992.
  • 7J J Kuffner, J C Latombe. Interactive manipulation planning for animated characters[ C]. Proceedings of the Eighth Pacific Confer- ence on Computer Graphics and Applications, 2000:417-418.
  • 8P J Vincent, et al. Technology for maintenance procedure valida- tion[ M]. Analytic Sciences Corp Fairbom Oh, 2001.
  • 9J Pan, et al. A hybrid approach for simulating human motion in constrained environments [ J ]. Computer Animation and Virtual Worlds, 2010,21(3-4) :137-149.
  • 10J Cort6s, L JaiUet, T Sim6on. Disassembly path planning for com- plex articulated objects [ J]. IEEE Transactions on Robotics, 2008, 24(2) :475-481.

引证文献2

二级引证文献3

;
使用帮助 返回顶部