arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.00627math.OCcs.RO
收藏

运动规划中实时Optimization的凸可行集算法

The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning

University of California at Berkeley(加州大学伯克利分校);FANUC Corporation(发那科公司)

Changliu Liu, Chung-Yen Lin, Masayoshi Tomizuka

摘要:

随着机器人技术的发展,对实时运动规划的需求越来越大。然而,由于环境中的障碍物,规划问题是高度非凸的,这使得它很难实现实时计算使用现有的非凸优化算法。本文介绍了一种求解具有凸代价和非凸约束的非凸优化问题的快速算法--凸可行集算法。其思想是为原问题找到一个凸可行集,并使用凸约束迭代求解一系列子问题。证明了算法的可行性和收敛性。讨论了该方法在移动机器人运动规划中的应用。仿真结果表明了该算法的有效性。

英文摘要:

With the development of robotics, there are growing needs for real time motion planning. However, due to obstacles in the environment, the planning problem is highly non-convex, which makes it difficult to achieve real time computation using existing non-convex optimization algorithms. This paper introduces the convex feasible set algorithm (CFS) which is a fast algorithm for non-convex optimization problems that have convex costs and non-convex constraints. The idea is to find a convex feasible set for the original problem and iteratively solve a sequence of subproblems using the convex constraints. The feasibility and the convergence of the proposed algorithm are proved in the paper. The application of this method on motion planning for mobile robots is discussed. The simulations demonstrate the effectiveness of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑