An Empirical Comparison of Search Approaches for Moving Agents

摘要: This study empirically compares existing search approaches used for path planning of moving agents, namely, incremental and real-time approaches. The comparisons are performed in both stationary target problems separately. In each problem domain, well-known representatives evaluated partially observable environments where the agent senses a limited area based on its sensor range. addition to available algorithms, we propose two algorithms be problem. simulations conducted random grid maze structures show that behave differently have advantages over other especially as range varies. Therefore, proposed enables determine most appropriate algorithm depending priorities