复杂环境中车机协同系统的任务分配和路径规划

Task Allocation and Path Planning for Truck-Drone Collaboration Systems in Complex Environments

  • 摘要: 随着无人自主系统技术的发展,车机协同的路径规划在复杂环境中仍面临障碍物处理和运动学可行性等挑战,亟需深入研究以提高任务成功率和执行效率。本文提出了一种分配—搜索—优化(ASO)算法对车机系统进行任务分配和路径规划,通过对智能体进行避障处理和轨迹优化分别处理障碍物因素和智能体运动学可行性因素。在初始路径搜索部分,设计了一种车机扩展冲突搜索(TD-ECBS)算法来实现车机系统中不同类型智能体的避障;而在后端轨迹优化部分,构建了一种适用于车机系统的模型预测控制(MPC)算法,以对车机系统中的智能体进行轨迹优化。最后在现有实例集的基础上引入了障碍物环境,并在ROS系统中进行了仿真。结果表明,在障碍物较多的复杂环境中,相比于Boccia等和Gonzalez-R等提出的算法,本文算法在考虑智能体运动学可行性的同时,可以将规划成功率低于50% 时的障碍物密度临界值提高20% 以上。即使在不考虑障碍物和智能体运动学可行性的情况下,本文算法在规划时间上也比Boccia等提出的算法在10和20个智能体数量等级上分别缩短了6.87% 和4.23%。证明了所提算法在车机系统等复杂非结构环境中的高效性和有效性。

     

    Abstract: With the advancement of unmanned autonomous system technologies, path planning for truck-drone collaboration still faces challenges such as obstacle handling and kinematic feasibility in complex environments, necessitating in-depth research to improve mission success rates and execution efficiency. An allocation-search-optimization (ASO) algorithm is proposed for task allocation and path planning of truck-drone systems, addressing obstacle factors and agent kinematic feasibility through obstacle avoidance processing and trajectory optimization of agents, respectively. In the initial path search phase, a truck-drone ECBS (enhanced conflict-based search) algorithm is designed to achieve obstacle avoidance among different types of agents in truck-drone systems, named TD-ECBS. In the back-end trajectory optimization phase, a model predictive control (MPC) algorithm suitable for truck-drone systems is constructed to optimize the trajectories of agents within these systems. Obstacle environments are introduced based on existing instance sets, and simulations are conducted in the ROS (Robot Operating System). Results indicate that compared to the algorithms proposed by Boccia and Gonzalez-R, the proposed algorithm increases the critical obstacle density threshold by more than 20% when the planning success rate is below 50% in complex environments with numerous obstacles, while considering agent kinematic feasibility. Even when obstacles and agent kinematic feasibility are not considered, the proposed algorithm reduces the planning time by 6.87% and 4.23% compared to Boccia's algorithm at agent quantity levels of 10 and 20 respectively, demonstrating the efficiency and effectiveness of the proposed algorithm when applied to truck-drone systems in complex unstructured environments.

     

/

返回文章
返回