论文标题
在未知环境中,基于优化的基于优化的轨迹跟踪方法
Optimization-based Trajectory Tracking Approach for Multi-rotor Aerial Vehicles in Unknown Environments
论文作者
论文摘要
本文的目的是开发基于参考轨迹的连续优化的完善,以在未知环境中的多转机航空车的全球阶段中“将其推出”。我们提出的方法包括两个计划者:全球规划师和本地规划师。当轨迹穿过障碍物或障碍物附近时,全球规划师会完善初始参考轨迹,并让本地规划师计算出近乎最佳的控制策略。全球规划师包括两种凸编程方法:第一种方法有助于完善参考轨迹,而第二种方法有助于如果第一种方法未能完善参考轨迹。 The global planner mainly focuses on real-time performance and obstacles avoidance, whereas the proposed formulation of the constrained nonlinear model predictive control-based local planner ensures safety, dynamic feasibility, and the reference trajectory tracking accuracy for low-speed maneuvers, provided that local and global planners have mean computation times 0.06s (15Hz) and 0.05s (20Hz), respectively, on an NVIDIA Jetson Xavier NX计算机。我们的实验结果证实,在混乱的环境中,所提出的方法的表现超过了其他三种方法:基于采样的途径调查,然后是轨迹产生,局部规划师,基于图的探路,然后是轨迹生成。
The goal of this paper is to develop a continuous optimization-based refinement of the reference trajectory to 'push it out' of the obstacle-occupied space in the global phase for Multi-rotor Aerial Vehicles in unknown environments. Our proposed approach comprises two planners: a global planner and a local planner. The global planner refines the initial reference trajectory when the trajectory goes either through an obstacle or near an obstacle and lets the local planner calculate a near-optimal control policy. The global planner comprises two convex programming approaches: the first one helps to refine the reference trajectory, and the second one helps to recover the reference trajectory if the first approach fails to refine. The global planner mainly focuses on real-time performance and obstacles avoidance, whereas the proposed formulation of the constrained nonlinear model predictive control-based local planner ensures safety, dynamic feasibility, and the reference trajectory tracking accuracy for low-speed maneuvers, provided that local and global planners have mean computation times 0.06s (15Hz) and 0.05s (20Hz), respectively, on an NVIDIA Jetson Xavier NX computer. The results of our experiment confirmed that, in cluttered environments, the proposed approach outperformed three other approaches: sampling-based pathfinding followed by trajectory generation, a local planner, and graph-based pathfinding followed by trajectory generation.