检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学控制科学与工程学院,浙江杭州310027
出 处:《控制理论与应用》2016年第5期561-568,共8页Control Theory & Applications
基 金:国家重点基础研究发展计划项目(2012CB720503)资助~~
摘 要:本文提出联立框架下的自主泊车动态优化方法.不同于通常采用的几何方法,该联立方法对障碍环境和车辆模型进行统一的描述和处理.提出基于互补约束的数学规划方法(MPCC)与R函数方法描述泊车过程的避障条件约束,并联立车辆的运动学、动力学、相关物理约束建立行车系统模型;在此基础上以运动学相关的最短时间为优化目标,构造泊车轨迹动态优化命题;基于有限元正交配置离散化方法实现该动态问题的精确求解,得到具有时间信息的、可直接用于指导车辆操作的泊车轨迹.多种泊车位情形下的数值试验验证了本文方法的有效性.A simultaneous framework is put forward for dynamic optimization for autonomous parking, In contrast to geometric methods, models of the vehicle as well as environment with obstacles are handled all together in this approach. Mathematical programs with complementarity constraints (MPCC) and R-functions methods are proposed to describe the conditional constraints relating to obstacle avoidance. Combined with the vehicles' kinematic and physical constraints, a driving system model is established. Based on this model, a dynamic trajectory optimization problem is formulated with a kinematics related objective, the minimum operating time. Discretization based on orthogonal collocation over finite elements is applied to obtain accurate numerical solution of the dynamic problem. The resulting trajectory with time information can be employed directly to vehicle operation. Performance of the proposed method is demonstrated by numerical experiments of various parking cases.
关 键 词:自主泊车 轨迹规划 联立法 动态优化 互补约束数学规划(MPCC) R函数
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222