Multi-Agent Path Finding (MAPF) is an algorithm designed to identify collision-free paths for multiple agents, commonly used in fields like robotics and drone navigation. Conflict-Based Search with Continuous Time (CCBS) is particularly beneficial for real-world applications due to its capability to find paths in continuous time; however, it often experiences lengthy computation times. Although techniques such as prioritizing conflicts (PC), disjoint splitting (DS), and high-level heuristics have been implemented to reduce these times, challenges remain. To address these issues, this paper introduces methods to improve space utilization by calculating agent congestion. By optimizing space usage, we can identify paths that avoid potential collisions, even when those paths share the same cost. We propose enhancements to high-level heuristics, conflict prioritization, and low-level heuristics, as well as a method for calculating congestion in continuous time. These improvements lead to a reduction in agent collisions and a decrease in high-level expansions, resulting in a 30% increase in computational success rates compared to the existing CCBS. Incorporating space utilization into the search process significantly enhances MAPF performance.

The rising demand for robots in warehouses has highlighted the need for efficient multi-robot algorithms. In response, researchers have focused on Multi-Agent Path Finding (MAPF), which enables multiple agents to calculate conflict-free paths to their individual goals. However, the computation time of conflict-based MAPF algorithms significantly increases as the number of conflicts rises, a common challenge in warehouse environments with narrow passages or corridors. To tackle this issue, this study introduces a new type of conflict called “Overlap Conflict.” Overlap Conflicts occur when an agent stops, causing chain conflicts among subsequent agents traveling in the same direction. When an Overlap Conflict arises, the affected agents are dynamically merged into a single group, shifting the conflicts from an individual level to a group level. If the merged agents find themselves with unreachable goals, they are split back into individual agents to continue calculating paths to their respective destinations. This approach effectively reduces computation time in congested environments, particularly in narrow corridors where alternative routes exist.

This paper presents a search methodology for the optimal operational path of robots using a genetic algorithm. The work scheduled to be performed using a robot was characterized. Collision avoidance between the robot including the working tool and the target object was considered. In this study, we followed the general steps of data mining. We compared the time taken by the robot moving along the path created by our proposed methodology with the time taken for the robot along the path created by real humans. The results show that the path generated by this study was more efficient than that of humans.