首页> 外文会议>Association for the Advancement of Artificial Intelligence Symposium >Fast Path Planning Using Experience Learning from Obstacle Patterns
【24h】

Fast Path Planning Using Experience Learning from Obstacle Patterns

机译:快速路径规划,使用障碍模式的体验

获取原文

摘要

We consider the problem of robot path planning in an environment where the location and geometry of obstacles are initially unknown while reusing relevant knowledge about collision avoidance learned from robots' previous navigational experience. Our main hypothesis in this paper is that the path planning times for a robot can be reduced if it can refer to previous maneuvers it used to avoid collisions with obstacles during earlier missions, and adapt that information to avoid obstacles during its current navigation. To verify this hypothesis, we propose an algorithm called LearnerRRT that first uses a feature matching algorithm called Sample Consensus Initial Alignment (SAC-IA) to efficiently match currently encountered obstacle features with past obstacle features, and, then uses an experience based learning technique to adapt previously recorded robot obstacle avoidance trajectories corresponding to the matched feature, to the current scenario. The feature matching and machine learning techniques are integrated into the robot's path planner so that the robot can rapidly and seamlessly update its path to circumvent an obstacle it encounters, in real-time, and continue to move towards its goal. We have conducted several experiments using a simulated Coroware Corobot robot within the Webots simulator to verify the performance of our proposed algorithm, with different start and goal locations, and different obstacle geometries and placements, as well as compared our approach to a state-of-the-art sampling-based path planner. Our results show that the proposed algorithm LearnerRRT performs much better than Informed RRT~*. When given the same time, our algorithm finished its task successfully whereas Informed RRT~* could only achieve 10 - 20 percent of the optimal distance.
机译:我们考虑在障碍物的位置和几何形状的环境中的机器人路径规划问题最初是未知的,同时重用关于从机器人的先前导航体验中汲取的避免碰撞的相关知识。本文的主要假设是,如果它可以参考以避免在早期任务期间的障碍物碰撞,可以减少机器人的路径规划时间,并适应该信息以避免在其当前导航期间避免障碍物以避免障碍物。为了验证这一假设,我们提出了所谓的LearnerRRT的算法,首先采用了一种名为样品共识初始对准(SAC-IA),以有效地匹配当前遇到的障碍特征匹配算法与过去的障碍的功能特点,并且,然后使用基于学习技术经验适应先前记录的机器人障碍避免对应于匹配功能的轨迹,到当前的场景。特征匹配和机器学习技术集成到机器人的路径规划器中,使机器人可以迅速且无缝地更新其路径,以规避它在实时遇到的障碍物,并继续朝着其目标移动。我们已经进行使用Webots模拟器内的模拟Coroware Corobot机器人来验证我们提出的算法的性能,用不同的起点和目标位置,以及不同的障碍几何形状和展示位置,以及相比我们到了最先进的方法多次实验基于艺术采样的路径规划仪。我们的结果表明,该算法学习者的算法比知情RRT〜*更好地表现得多。当给出同时,我们的算法成功完成了任务,而通知RRT〜*只能达到最佳距离的10-20%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号