运动学
旋转(数学)
路径(计算)
控制理论(社会学)
角速度
障碍物
数学
约束(计算机辅助设计)
旋转矩阵
基质(化学分析)
差速器(机械装置)
航向(导航)
数学优化
计算机科学
弹道
转速
避障
算法
几何学
运动规划
作者
Seungmin Shin,Gyuho Eoh
出处
期刊:제어로봇시스템학회 논문지
[Institute of Control, Robotics and Systems]
日期:2026-03-01
卷期号:32 (3): 362-370
标识
DOI:10.5302/j.icros.2026.25.0324
摘要
This paper presents Continuous-time Conflict-Based Search with Velocity Profile and Rotation Cost (CCBS-VP-RC) for multi-agent path finding under kinematic constraints. Continuous-time Conflict-Based Search (CCBS) is a two-level algorithm that resolves agent conflicts through constraint generation in continuous time domains. However, CCBS does not consider real-world kinematic constraints such as velocity profiles, angular velocity limits, or a rotation cost matrix for differential drive robots. The rotation cost matrix precomputes the rotation time for all heading transitions, enabling efficient cost retrieval during path planning. The CCBS-VP-RC integrates velocity profiles with rotation costs to generate physically feasible trajectories that satisfy kinematic bounds. Simulations were conducted on grid-based environments with varying obstacle densities and agent populations. Compared to traditional Multi-Agent Path Finding (MAPF) algorithms, the CCBS-VP-RC has slightly longer makespan and flowtime due to kinematic constraints. Nevertheless, the proposed method achieves higher success rates in complex environments, demonstrating its effectiveness for practical multi-robot systems operating under real-world kinematic constraints.
科研通智能强力驱动
Strongly Powered by AbleSci AI