首页> 外文期刊>International Journal of Control, Automation, and Systems >Global Trajectory Planning Based on DWMR Dynamics in Circular C-space
【24h】

Global Trajectory Planning Based on DWMR Dynamics in Circular C-space

机译:基于DWMR动态的循环C空间的全局轨迹规划

获取原文
获取原文并翻译 | 示例
           

摘要

This paper proposes an efficient near time-optimal trajectory planning algorithm for differential wheeled mobile robots(DWMRs) in a circular C-space under constraints on robot's kinematics, dynamics, and motor's voltage. This problem is considered to be complex if there exist lots of obstacles to pass and robot's dynamics including motor's dynamics should be considered. A* algorithm is incorporated into the modified TOTP (Time Optimal Trajectory Planning) algorithm [1] to find near minimum time trajectory without any homotopy class by defining a node as an obstacle with direction information. In addition, TOTP algorithm is improved so that the proposed algorithm can be applied to the environment without any assumption about the distance between obstacles. Simulations show that the proposed algorithm is applied in an environment where multiple obstacles exist. An experiment shows that the generated trajectory by the proposed algorithm is well followed by the robot.
机译:本文提出了在机器人运动学,动力学和电机电压的约束下的循环式移动机器人(DWMR)中的差分轮式移动机器人(DWMR)的高效近代最佳轨迹规划算法。 如果存在许多通行证,并且应该考虑包括电机动态的机器人的动态,则该问题被认为是复杂的。 将A *算法结合到修改的TOTP(时间最佳轨迹规划)算法[1]中,以通过将节点定义为具有方向信息的障碍物来找到没有任何同谐类的最小时间轨迹。 另外,提高了TOTP算法,使得所提出的算法可以应用于环境而没有任何关于障碍物之间的距离的假设。 仿真表明,所提出的算法应用于存在多个障碍物的环境中。 实验表明,所提出的算法产生的轨迹很好地接着是机器人。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号