In this paper, we address a minimum-time steering problem for a drone modeled as point mass with bounded acceleration, across a set of desired waypoints in the presence of gravity. We first provide a method to solve for the minimum-time control input that will steer the point mass between two waypoints based on a continuous-time problem formulation which we address by using Pontryagin's Minimum Principle. Subsequently, we solve for the time-optimal trajectory across the given set of waypoints by discretizing in the time domain and formulating the minimum-time problem as a nonlinear program (NLP). The velocities at each waypoint obtained from solving the NLP in the discretized domain are then used as boundary conditions to extend our two-point solution across those multiple waypoints. We apply this planning methodology to execute a surveying task that minimizes the time taken to completely explore a target area or volume. Numerical simulations and theoretical analyses of this new planning methodology are presented. The results from our approach are also compared to traditional polynomial trajectories like minimum snap planning.
翻译:在本文中,我们解决了以点质量为模型的无人驾驶飞机的最低时间方向问题,该无人驾驶飞机在有重力的情况下,在一组想要的路径点上,以捆绑加速度为界点。我们首先提供一种方法,解决最小时间控制输入的问题,这种输入将引导我们通过使用Pontryagin的最低限度原则解决的连续时间问题配制的两个路径点之间的点质量。随后,我们通过在时间域中分解和作为非线性程序(NLP)来解决特定路径点之间的时间最佳轨迹。然后,通过在离散域中解决非线性轨道点获得的每个路径点的速率作为边界条件,将我们的两点解决办法扩展到这些多条路径点之间。我们运用这一规划方法来执行一项勘测任务,将完全探索目标区域或目标体积所需的时间减少到最小。介绍了对这一新规划方法的数值模拟和理论分析。我们方法的结果也与像最低断点规划那样的传统多轨迹比较。