This paper proposes an enhanced conflict-based search algorithm for addressing conflict detection and resolution in multi-agent path planning, particularly focusing on simultaneous arrival scenarios. Considering the practical scenario where agents possess safety radii and adjustable velocities, the algorithm incorporates several enhancements. Firstly, it improves the evaluation function of the low-level search and applies path smoothing to ensure that the generated paths are more continuous and feasible. Secondly, in the high-level search, path solutions are guided by the objective of achieving simultaneous arrival times. Furthermore, the conflict detection is improved, and a conflict resolution method based on velocity and constraints is proposed to more effectively resolve path conflicts. Simulation results demonstrate that the proposed conflict detection and resolution methods effectively address path conflicts, enabling successful realization of multi-agent temporal coordination tasks.