Scholarlink

This research demonstrates the effectiveness of combining an exact algorithm with an approximation algorithm to address a complex, multi-objective, multi-constrained problem. The findings show that, in isolation, each algorithm may struggle to find collision-free, optimal (or near optimal) paths for multiple robots under time constraints. However, a systematic and carefully integrated approach that leverages multiple algorithms can resolve the problem.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An A*-Aware Coevolutionary Algorithm Solution for Finding Collision-Free Paths

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Morteza Kiadi,
  • Enol García,
  • José R. Villar,
  • Amir Kiadi

摘要

This research demonstrates the effectiveness of combining an exact algorithm with an approximation algorithm to address a complex, multi-objective, multi-constrained problem. The findings show that, in isolation, each algorithm may struggle to find collision-free, optimal (or near optimal) paths for multiple robots under time constraints. However, a systematic and carefully integrated approach that leverages multiple algorithms can resolve the problem.