{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:47:36Z","timestamp":1750261656292},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T00:00:00Z","timestamp":1342742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s13042-012-0120-x","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T11:58:32Z","timestamp":1342699112000},"page":"551-563","source":"Crossref","is-referenced-by-count":9,"title":["An auto-adaptive convex map generating path-finding algorithm: Genetic Convex A*"],"prefix":"10.1007","volume":"4","author":[{"given":"Pan","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon Chi-Keung","family":"Shiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,20]]},"reference":[{"key":"120_CR1","doi-asserted-by":"crossref","unstructured":"Yahja A, Stentz A, Singh S, Brummit B (1998) Framed-quadtree path planning for mobile robots operating in sparse environments. In: Proceedings of IEEE Conf on Robot and Automat. Leuven, Belgium, pp 650\u2013655","DOI":"10.1109\/ROBOT.1998.677046"},{"issue":"4","key":"120_CR2","first-page":"395","volume":"17","author":"PO Pettersson","year":"2006","unstructured":"Pettersson PO, Doherty P (2006) Probabilistic roadmap based path planning for an autonomous unmanned helicopter. J Intell and Fuzzy Syst 17(4):395\u2013405","journal-title":"J Intell and Fuzzy Syst"},{"key":"120_CR3","first-page":"210","volume":"2000\u201302","author":"HB Yan","year":"2002","unstructured":"Yan HB, Liu YC (2002) A new algorithm for finding shortcut in a city\u2019s road net based on GIS technology. Chinese J Comput 2000\u201302:210\u2013215","journal-title":"Chinese J Comput"},{"issue":"1","key":"120_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf RE (1985) Depth-first iterative-deepening: an optimal admissible tree search. Artif Intell 27(1):97\u2013109","journal-title":"Artif Intell"},{"issue":"1\u20132","key":"120_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"RE Korf","year":"2001","unstructured":"Korf RE, Reid M, Edelkamp S (2001) Time complexity of Iterative-Deepening-A*. Artif Intell 129(1\u20132):199\u2013218","journal-title":"Artif Intell"},{"issue":"1\u20132","key":"120_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig S, Likhachev M, Furcy D (2004) Lifelong Planning A*. Artif Intell 155(1\u20132):93\u2013146","journal-title":"Artif Intell"},{"issue":"1","key":"120_CR7","first-page":"7","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea A, Muller M, Scheaffer J (2004) Near-optimal hierarchical pathfinding. J Game Dev 1(1):7\u201328","journal-title":"J Game Dev"},{"issue":"1","key":"120_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0146-664X(82)90098-3","volume":"18","author":"H Samet","year":"1982","unstructured":"Samet H (1982) Neighbor finding techniques for image represented by quadtrees. Computer Graphic Image Process 18(1):37\u201357","journal-title":"Computer Graphic Image Process"},{"issue":"4","key":"120_CR9","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavrali","year":"1996","unstructured":"Kavrali LE, Svestka P, Latombe JC, Overmars HM (1996) Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans Robot Automat 12(4):566\u2013580","journal-title":"IEEE Trans Robot Automat"},{"issue":"1\u20132","key":"120_CR10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(95)00111-5","volume":"85","author":"RC Holte","year":"1996","unstructured":"Holte RC, Mkadmi T, Zimmer RM, MacDonald AJ (1996) Speeding up problem solving by abstraction: a graph oriented approach. Artif Intell 85(1\u20132):321\u2013361","journal-title":"Artif Intell"},{"key":"120_CR11","doi-asserted-by":"crossref","unstructured":"Sturtevant N, Jansen R (2007) An analysis of map-based abstraction and refinement. In: Proceedings of the 7th SARA. Whistler, Canada, pp 344\u2013358","DOI":"10.1007\/978-3-540-73580-9_27"},{"key":"120_CR12","unstructured":"Demyen D, Buro M (2006) Efficient triangulation-based pathfinding. In: Proceedings of the 21th AAAI. Boston, Massachusetts, pp 942\u2013947"},{"key":"120_CR13","unstructured":"Samuel E, Johan F (2008) Pathfinding with hard constraints\u2014mobile systems and real time strategy games combined. Master Thesis of Blekinge Institute of Technology, Sweden"},{"key":"120_CR14","unstructured":"Sturtevant N, Buro M (2005) Partial pathfinding using map abstraction and refinement. In: Proceedings of the 20th NCAI. Pittsburgh, Pennsylvania, pp 1392\u20131397"},{"key":"120_CR15","unstructured":"Stout B (2000). The basics of A* for path planning. In: DeLoura M (ed) Game Programming Gems. Charles River Media, Rockland, pp 254\u2013263"},{"key":"120_CR16","unstructured":"Snook G (2000) Simplified 3D movement and pathfinding using navigation meshes. In: DeLoura M (ed) Game programming gems. Charles River Media, Rockland, pp 288\u2013304"},{"key":"120_CR17","unstructured":"Michalewicz Z, Janikow C (1991) Handling constraints in genetic algorithms. In: Proceedings of the 4th ICGA. San Diego, CA, pp 151\u2013157"},{"key":"120_CR18","doi-asserted-by":"crossref","unstructured":"Chen CJ (2011) Structural vibration suppression by using neural classifier with genetic algorithm. Int J Mach Learn Cyber. doi: 10.1007\/s13042-011-0053-9","DOI":"10.1007\/s13042-011-0053-9"},{"issue":"2","key":"120_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s13042-011-0014-3","volume":"2","author":"J Zhu","year":"2010","unstructured":"Zhu J, Li XP, Shen WM (2010) Effective genetic algorithm for resource-constrained project scheduling with limited preemptions. Int J Mach Learn Cyber 2(2):55\u201365","journal-title":"Int J Mach Learn Cyber"},{"issue":"3","key":"120_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s13042-011-0030-3","volume":"2","author":"O Boehm","year":"2011","unstructured":"Boehm O, Hardoon DR, Manevitz LM (2011) Classifying cognitive states of brain activity via one-class neural networks with feature selection by genetic algorithms. Int J Mach Learn Cyber 2(3):125\u2013134","journal-title":"Int J Mach Learn Cyber"},{"issue":"1\u20134","key":"120_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s13042-010-0004-x","volume":"1","author":"DL Tong","year":"2010","unstructured":"Tong DL, Mintram R (2010) Genetic Algorithm-Neural Network (GANN): a study of neural network activation functions and depth of genetic algorithm search applied to feature selection. Int J Mach Learn Cyber 1(1\u20134):75\u201387","journal-title":"Int J Mach Learn Cyber"},{"key":"120_CR22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.neucom.2005.05.006","volume":"68","author":"XZ Wang","year":"2005","unstructured":"Wang XZ, He Q, Chen DG, Yeung D (2005) A genetic algorithm for solving the inverse problem of support vector machines. Neurocomputing 68:225\u2013238","journal-title":"Neurocomputing"},{"issue":"19","key":"120_CR23","doi-asserted-by":"crossref","first-page":"4230","DOI":"10.1016\/j.ins.2011.06.002","volume":"181","author":"XZ Wang","year":"2011","unstructured":"Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inform Sci 181(19):4230\u20134252","journal-title":"Inform Sci"},{"key":"120_CR24","unstructured":"Sturtevant N (2010) Pathfinding benchmarks. http:\/\/www.movingai.com\/benchmarks\/index.html . Accessed 19 April 2011"},{"issue":"5","key":"120_CR25","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/70.631228","volume":"13","author":"DZ Chen","year":"1997","unstructured":"Chen DZ, Szczerba RJ, Uhran JJ (1997) A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment. IEEE Trans Robot Automat 13(5):668\u2013681","journal-title":"IEEE Trans Robot Automat"},{"key":"120_CR26","unstructured":"Su P, Li Y, Li WL (2010) A game map complexity measure based on hamming distance. In: Proceedings of PACIIA. Wuhan, Hubei, pp 332\u2013335"},{"key":"120_CR27","unstructured":"Sturtevant N (2007) Memory-efficient Abstraction for Pathfinding. In: Proceedings of the 3rd AIIDE. Stanford, California, pp 31\u201336"},{"key":"120_CR28","doi-asserted-by":"crossref","unstructured":"Harabor D, Botea A (2010) Breaking path symmetries on 4-connected grid maps. In: Proceedings of the 6th AIIDE. Stanford, California, pp 33\u201338","DOI":"10.1609\/aiide.v6i1.12393"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0120-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-012-0120-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0120-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T14:01:23Z","timestamp":1687615283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-012-0120-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,20]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s13042-012-0120-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,20]]}}}