首页 | 本学科首页   官方微博 | 高级检索  
     检索      

弹跳机器人的弹跳序列规划问题研究
引用本文:刘壮志,朱剑英.弹跳机器人的弹跳序列规划问题研究[J].南京航空航天大学学报(英文版),2004,21(2).
作者姓名:刘壮志  朱剑英
作者单位:南京航空航天大学机电学院,南京,210016,中国
摘    要:传统轮动式与爬行式机器人难以直接越过大的障碍物或沟壑 ,野外行动能力有限 ,需要研制弹跳机器人。为了快速并顺利地越过障碍物 ,应根据自身获取的或用户输入的地形信息规划出弹跳动作序列。本文分析了弹跳机器人与连续移动式机器人路径规划方法的区别 ,总结出影响弹跳运动规划过程的几个因素。调整影响系数后 ,在简化地形的基础上实现了弹跳序列的启发式搜索算法。结果表明 ,通过适当调整参数 ,该算法可以得到安全高效的弹跳动作序列

关 键 词:机器人  路径规划算法  启发式搜索

RESEARCH ON JUMPING SEQUENCE PLANNING ISSUES OF HOPPING ROBOTS
LIU Zhuang-zhi,ZHU Jian-ying.RESEARCH ON JUMPING SEQUENCE PLANNING ISSUES OF HOPPING ROBOTS[J].Transactions of Nanjing University of Aeronautics & Astronautics,2004,21(2).
Authors:LIU Zhuang-zhi  ZHU Jian-ying
Abstract:The wheeled or crawled robots often suffer from big obstacles or ditches, so a hopping robot needs to fit the tough landform in the field environments. In order to jump over obstacles rapidly, a jumping sequence must be generated based on the landform information from sensors or user input. The planning method for planar mobile robots is compared with that of hopping robots. Several factors can change the planning result. Adjusting these coefficients, a heuristic searching algorithm for the jumping sequence is developed on a simplified landform. Calculational result indicates that the algorithm can achieve safety and efficient control sequences for a desired goal.
Keywords:robots  path planning algorithm  heuristic search
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号