测试套件
计算机科学
一套
会话(web分析)
路径(计算)
网格
帕累托原理
多目标优化
帕累托最优
数学优化
算法
运动规划
测试用例
人工智能
机器学习
数学
万维网
历史
回归分析
考古
机器人
程序设计语言
几何学
标识
DOI:10.1109/cec45853.2021.9504943
摘要
In this paper, we consider the multimodal multi-objective path planning (MMOPP) optimization, which is the main topic of a special session in IEEE CEC 2021. The MMOPP aims at finding all the Pareto optimal paths from a start area to a goal area on a grid map, while passing through several designated must-visit areas. We propose an efficient approach based on the multi-objective A* algorithm to exactly solve the MMOPP. Experiments are conducted on the official MMOPP test suite to evaluate the performance of the proposed approach. We also show the admissibility of the proposed approach so that the computational results can be used as the standard answers to the MMOPP test suite.
科研通智能强力驱动
Strongly Powered by AbleSci AI