曲率有界路径的延长
Elongation of Curvature-Bounded Path
AI总结:
本文研究两个有向点间最短曲率有界路径的延长问题,利用可达集性质建立了可数值验证的路径存在显式条件,并提出延长策略,最后通过固定翼飞行器协同编队示例验证了方法有效性。
摘要:
本文研究将两个有向点之间最短曲率有界路径延长至预期长度的问题。将曲率有界路径延长至预期长度,对于规划非完整约束车辆执行任务具有根本重要性,这在许多实际应用中至关重要,例如协调多辆非完整约束车辆同时抵达目的地,或在严格时间窗口内执行任务。本文通过应用曲率有界路径可达集的性质,建立了连接两个有向点且具有预期长度的曲率有界路径存在的显式条件。这些存在性条件可进行数值验证,从而能够轻松检验两个指定有向点之间是否存在具有期望长度的曲率有界路径。此外,一旦满足存在性条件,本文提供了延长策略,以获得具有预期长度的曲率有界路径。最后,给出了多架固定翼飞行器协同实现三角形飞行编队的最短时间路径规划示例,以说明并验证本文的研究成果。
英文摘要:
The paper is concerned with elongating the shortest curvature-bounded path between two oriented points to an expected length. The elongation of curvature-bounded paths to an expected length is fundamentally important to plan missions for nonholonomic-constrained vehicles in many practical applications, such as coordinating multiple nonholonomic-constrained vehicles to reach a destination simultaneously or performing a mission with a strict time window. In the paper, the explicit conditions for the existence of curvature-bounded paths joining two oriented points with an expected length are established by applying the properties of the reachability set of curvature-bounded paths. These existence conditions are numerically verifiable, allowing readily checking the existence of curvature-bounded paths between two prescribed oriented points with a desired length. In addition, once the existence conditions are met, elongation strategies are provided in the paper to get curvature-bounded paths with expected lengths. Finally, some examples of minimum-time path planning for multiple fixed-wing aerial vehicles to cooperatively achieve a triangle-shaped flight formation are presented, illustrating and verifying the developments of the paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。