期刊文献+

水果收获机器人避障路径规划 被引量:42

Path Planning of Fruits Harvesting Robot
下载PDF
导出
摘要 在综合分析路径规划研究的基础上,采用基于概率地图的路径规划方法,运用启发式搜索算法对水果收获机器人机械臂运动路径进行实时规划。在搜索过程中,以位姿点密度作为权重使路径向自由空间扩散,避免过度采样。为提高路径规划速度,采用延迟碰撞检测策略,可有效降低计算量。采用有向包围盒进行碰撞检测。最后利用虚拟现实技术,对水果收获时要绕过的支架和狭窄区域进行三维计算机模拟。结果显示,路径规划时间均小于0.15s,达到实时要求。 In research of path planning of fruit picking robot the probabilistic roadmap method is adopted to achieve on-line planning with heuristic search arithmetic. At the sampling and searching stage, the density of samples in neighborhood was used as weight to control expansion of roadmap and avoiding over sampling in free space. After finding out best path, we used hierarchical decomposition methods to detect collision, which based on oriented bounding boxes. When picking the fruit, a robot usually needs to round over shelf and pass through narrow region. We simulated these two typical situations with virtual reality technique. The results show that a path planning cycle is less than 0.15 s and meets the request of real-time.
出处 《农业机械学报》 EI CAS CSCD 北大核心 2007年第3期102-105,135,共5页 Transactions of the Chinese Society for Agricultural Machinery
基金 国家"863"高技术研究发展计划资助项目(项目编号:2006AA10Z263) 江苏省高校自然科学基金资助项目(项目编号:05KJB210019)
关键词 收获机器人 路径规划 概率图法 分层分解法 Harvesting robot, Path planning, Probabilistic roadmap method, Hierarchical decomposition method
  • 相关文献

参考文献12

  • 1Chen P C,Hwang Y K.SANDROS:a dynamic graph search algorithm for motion planning[J].IEEE Transactions on Robotics and Automation,1998,14 (3):390~ 403.
  • 2Hsu D.Randomized single-query motion planning in expansive spaces[D].California:Stanford University.CA,2000.
  • 3Kavraki L E,Latombe J C.Randomized preprocessing of configurations space for fast path planning[C] //Proceedings IEEE International Conference on Robotics and Automation,San Diego,CA,USA,1994:2 138~2 145.
  • 4Hsu D,Latombe J C,Motwani R.Path planning in expansive configuration spaces[C]//Proceedings IEEE International Conference on Robotics and Automation,Albuquerque,NM,USA,1997:2 719~ 2 726.
  • 5Bohlin R,Kavraki L E.Path planning using lazy PRM[C]//Proceedings IEEE International Conference on Robotics and Automation,San Francisco,CA,USA,2000:521~528.
  • 6Sanchez G,Latombe J C.Single-query bi-directional motion planning with lazy collision checking[C]//Proc.10th International Symposium on Robotics Research,Lorne,Australia,2001:403~418.
  • 7Sanchez G,Latombe J C.On delaying collision checking in PRM planning-application to multi-robot coordination[J].Int.J.of Robotics Research,2002,21(1):5~26.
  • 8Nielsen C,Kavraki L E.A two-level fuzzy PRM for manipulation planning[C]//Proceedings IEEE/RSJ International Conference,Takamatsu,Japan,2000:1 716~1 721.
  • 9Lin M C.Efficient collision detection for animation and robotics[D].California:University of California At Berkeley,1993.
  • 10Gottschalk S,Lin M C,Manocha D.Obb-tree:a hierarchical structure for rapid interference detection[C]//Proc.of ACM Siggraph'96,1996:171~ 180.

二级参考文献27

共引文献221

同被引文献482

引证文献42

二级引证文献493

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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