首页> 外文会议>IEEE/RSJ International Conference on Intelligent Robots and Systems >Convexification and real-time on-board optimization for agile quad-rotor maneuvering and obstacle avoidance
【24h】

Convexification and real-time on-board optimization for agile quad-rotor maneuvering and obstacle avoidance

机译:敏捷四轮转子操纵和避免抵抗和避障的凸起和实时轨道优化

获取原文

摘要

In this paper, we apply lossless and successive convexification techniques and employ real-time on-board convex optimization to perform constrained motion planning for quadrotors. In general, this problem is challenging for real-time on-board applications due to its non-convex nature. The ability to generate feasible trajectories quickly and reliably is central to operating high-performance aerial robots in populated spaces. Motivated by our earlier research on convexification of non-convex optimal control problems, we use these convexification techniques to cast the problems into one (or a sequence of) Second-Order Cone Programming (SOCP) problem(s). In doing so, we are able to attain our solutions by leveraging modern advances in Interior Point Method (IPM) algorithms. Here, we focus on 3-degree-of-freedom trajectory generation, whereby closed-loop control is used to track a translational trajectory computed on-board at the onset of the maneuver. To the best of our knowledge, this is the first demonstration of convexification techniques used in real-time on-board trajectory generation for high-performance quad-rotor flight. We present two example scenarios: (1) a case where lossless convexification is used to increase the available control envelope, thus enabling an agile flip maneuver, and (2) a case where both convexification techniques are used to compute a path through a flight space containing ellipsoidal keep-out zones. We present flight demonstration results obtained using the Autonomous Control Laboratory's (ACL's) custom quad-rotor platforms and SOCP optimization software. Additionally, computation timing statistics for the example scenarios obtained using a series of mobile ARM and Intel processors show a minimum mean computation time of 36.5 and 122.2 milliseconds, respectively.
机译:在本文中,我们采用板载凸优化来进行约束的运动规划的四旋翼飞行器无损和连续凸化技术和应用的实时性。在一般情况下,这个问题是由于其非凸性质具有挑战性的实时车载应用。快速生成可行的轨迹和可靠的能力,是中央在人口密集场所经营高性能的空中机器人。我们对非凸最优控制问题凸化早期研究的启发,我们使用这些凸化技术来投的问题变成一个(或序列)二阶锥规划(SOCP)问题(一个或多个)。在此过程中,我们能够通过利用对内点法(IPM)算法现代进步实现我们的解决方案。在这里,我们专注于3度的自由度轨迹生成,从而闭环控制被用在机动的开始跟踪一个平移的轨迹计算板上。据我们所知,这是在车载轨迹生成的实时使用高性能的四旋翼飞行凸化技术的第一个示范。我们目前的两个示例方案:(1)其中无损凸化被用来增加可用控制包络,从而使一个敏捷翻转动作的情况下,和(2)其中两个凸化技术被用于通过一个飞行空间来计算的路径的情况下含椭圆形禁入区。使用自主控制实验室(ACL的)定制的四旋翼平台和SOCP优化软件获得我们目前的飞行演示效果。此外,对于使用一系列移动ARM和Intel处理器的所获得的示例场景的计算定时统计数据显示36.5和122.2毫秒的最小均计算时间,分别。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号