Abstract: For Android phones there are problems of insufficient mobile phone resources like the lower CPU frequency and smaller memory．To solve these problems,on the basis of the hierarchical routing algorithm,a routing algorithm for Android game agents based on non-uniform partition of map was presented．In this algorithm,the game map is non-uniformly partitioned to generate the abstract map in preprocessing phase．And in online searching phase,it first finds paths in key points of the abstract map,then searches paths in each sub-map until the destination node is found．The experiment results indicate that compared with the HPA* Enhancements and KM-A*,the algorithm has the advantages of shorter searching time,fewer traverse points and better results．Finally,a topographical factor is taken into consideration in order to adapt this algorithm to the need of the Android phone games.

Key words: Android phones,Hierarchical routing algorithm,Non-uniform partition,Topographical factor