Weight Value and Map Complexity in Theta*
Robot lab, Department of Computer Engineering, Yeungnam University, Gyeongsan-si, South Korea
A performance of an experiment to analyze the relationship between weight value and map complexity. That means there is a trial to find which weight value performs the best on maps with different complexity. And then in this article there is an application of hierarchical and dynamic weight method into Theta* path-finding algorithm. The dynamic weight value is picked from the first experiment. For different abstract map, a weight value is changed base on the complexity of the abstract map. This article contains a re-test of new implementation of Theta* and compare to the Mr. Nash’s Theta* to collect the positive outcome. And by applying the dynamic weight method with different weight based on map complexity, the dynamic weight theta* perform better in time costing
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.