{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:21:24Z","timestamp":1729642884278,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icmlc.2011.6017018","type":"proceedings-article","created":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T20:16:22Z","timestamp":1316636182000},"page":"1571-1576","source":"Crossref","is-referenced-by-count":0,"title":["KM-A<sup>∗<\/sup> pathfinding algorithm based on hierarchical clustering and strengthened DB Index criteria"],"prefix":"10.1109","author":[{"given":"Cai","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tie-Song","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"124","article-title":"New cluster validity function for determining cluster number","volume":"46","author":"peng","year":"2010","journal-title":"Journal of Computer Engineering and Applications"},{"key":"ref11","first-page":"65","article-title":"K-means Clustering Algorithm with Meliorated Initial Center","volume":"3","author":"yuan","year":"2007","journal-title":"Eng Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1114856"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1613\/jair.2497","article-title":"Dynamic control in real-time heuristic search","volume":"32","author":"bulitko","year":"2008","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035648"},{"key":"ref3","first-page":"84","author":"jansen","year":"2005","journal-title":"HPA* Enhancements in Proceeding of AAAI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1998.677046"},{"key":"ref5","first-page":"51","article-title":"An Overview of Quadtrees","volume":"f40","author":"samet","year":"1988","journal-title":"Octrees and Related Hierarchical DataStructures"},{"key":"ref8","article-title":"KM-A*: A Pathfinding Algorithm for Computer Games Based on A* and K-means Clustering","author":"li","year":"2010","journal-title":"Proceeding of PAC IIA"},{"key":"ref7","first-page":"254","author":"buckland","year":"2008","journal-title":"Programming Game AI by Example"},{"key":"ref2","first-page":"7","article-title":"Near-Optimal Hierarchical Pathfinding","volume":"1","author":"botea","year":"2004","journal-title":"Journal of Game Development"},{"key":"ref1","first-page":"78","author":"rabin","year":"2005","journal-title":"AI Game Programming Wisdom"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.18637\/jss.v001.i04","article-title":"Clustering in an Object-Oriented Environment","author":"struyf","year":"1996","journal-title":"Journal of Statistical Software"}],"event":{"name":"2011 International Conference on Machine Learning and Cybernetics (ICMLC)","start":{"date-parts":[[2011,7,10]]},"location":"Guilin, China","end":{"date-parts":[[2011,7,13]]}},"container-title":["2011 International Conference on Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6009138\/6016945\/06017018.pdf?arnumber=6017018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T04:43:54Z","timestamp":1560660234000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6017018\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icmlc.2011.6017018","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}