基于最小变量的B-样条移动机器人路径规划研究  

The Research of Obstacle-Avoiding Problem based on Minimum Variation B-spline

作　　者：彭辉[1] PENG Hui（Department of Computer;Guangxi Vocational ＆ Technical Institute of Industry;Nanning 530001;China）

机构地区：[1]广西工业职业技术学院计算机系,南宁530001

出　　处：《智能计算机与应用》2011年第4期7-10,13,共5页Intelligent Computer and Applications

基　　金：广西工业职业技术学院科学研究项目（桂工业院科研2011019001）

摘　　要：为解决移动机器人在避障时的曲线优化问题,提出了基于最小变量的B-样条路径规划方法。对该方法从数学模型上进行了推导,指出了该方法相对于其它B-样条方法的优点,并对该方法进行了优化,给出了相应的优化算法。研究表明：具有最小变量的B-样条函数比只用B-样条函数定义的曲线具有更优化的线性约束,其曲线具有更好的光滑性。To solve curve optimization problems of the mobile robot in the obstacle avoidance,the paper puts forward B-spline path planning approach based on minimum variation.The method is derived from the mathematical model,and compared with other B-spline interpolation method,its advantages are also pointed out.Meanwhile,the method is optimized,frutherly,its iterative optimization method is given out.Results of the empirical investigation indicate that with more optimal linear constraints over the curves defined by B-spline functions only,the curves defined by minimum variation B-spline function have better smoothness.

关 键 词：最小变量 B-样条 凸性 路径规划 

分 类 号：TP242[自动化与计算机技术—控制科学与工程;自动化与计算机技术—检测技术与自动化装置]