一种路径优化方法、设备和存储介质
By acquiring the passage priority order and path conflict cost of the agent's path nodes, the execution order of multiple agents is dynamically adjusted, which solves the waiting problem caused by the timing priority in the multi-robot system and improves the task execution efficiency.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- ZHEJIANG HUARAY TECH CO LTD
- Filing Date
- 2025-10-24
- Publication Date
- 2026-07-17
AI Technical Summary
In multi-robot path planning, strictly following the MAPF planning sequence can easily lead to some agents having to wait because agents with higher priority have not passed through, resulting in low task execution efficiency.
By obtaining the passage priority order of multiple agents at each path node, the path segment to be sent is selected and the passage priority order of the target path node is obtained. The high-priority agent is selected, and the path node is sent to the target agent based on the path conflict cost to optimize its execution path timing.
It improves the efficiency of multi-agent path execution, avoids waiting caused by strictly following the priority order, and enhances the system's operating efficiency and coordination.
Smart Images
Figure CN121477873B_ABST