Scissor Optimized Anytime Algorithm
Huaixiang Zhang · Journal of Hangzhou Dianzi University · 2010
Traditional Anytime algorithm may have the problems of costing redundant memory space and computing time when solving a problem in path-planning.The Scissor optimized Anytime algorithm proposed in this paper is aimed to improve these two indexes.The algorithm is based on the Anytime algorithms which has already exist,it scissors the nodes in inconsistency table in order to reduce memory space,then analyzing the left node after scissoring to decide whether to enter the next circle,by this way,it can reduce the computing time.Finally,simulation results demonstrate that the algorithm is practical and effective.