{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:11:56Z","timestamp":1761808316587,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T00:00:00Z","timestamp":1564444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T00:00:00Z","timestamp":1564444800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61471110"],"award-info":[{"award-number":["61471110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61733003"],"award-info":[{"award-number":["61733003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key R&D Program of China","award":["No.2017YFC0805000\/5005","2017YFB1301103"],"award-info":[{"award-number":["No.2017YFC0805000\/5005","2017YFB1301103"]}]},{"name":"Fundamental Research Funds for the Central Universities, China","award":["N172608005"],"award-info":[{"award-number":["N172608005"]}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"crossref","award":["20180520040"],"award-info":[{"award-number":["20180520040"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00521-019-04370-y","type":"journal-article","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T11:02:47Z","timestamp":1564484567000},"page":"9185-9205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning sampling distribution for motion planning with local reconstruction-based self-organizing incremental neural network"],"prefix":"10.1007","volume":"31","author":[{"given":"Chongkun","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunzhou","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I-Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,30]]},"reference":[{"key":"4370_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning algorithms","author":"S Lavalle","year":"2006","unstructured":"Lavalle S (2006) Planning algorithms. Cambridge University Press, Cambridge"},{"issue":"9","key":"4370_CR2","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1177\/0278364914528132","volume":"33","author":"J Schulman","year":"2014","unstructured":"Schulman J, Duan Y, Ho J et al (2014) Motion planning with sequential convex optimization and convex collision checking. Int J Robot Res 33(9):1251\u20131270","journal-title":"Int J Robot Res"},{"issue":"2","key":"4370_CR3","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TRO.2012.2234312","volume":"29","author":"JD Marble","year":"2013","unstructured":"Marble JD, Bekris KE (2013) Asymptotically near-optimal planning with probabilistic roadmap spanners. IEEE Trans Robot 29(2):432\u2013444","journal-title":"IEEE Trans Robot"},{"issue":"5","key":"4370_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"Steven M LaValle","year":"2001","unstructured":"LaValle Steven M, Kuffner James J Jr (2001) Randomized kinodynamic planning. Int J Robot Res 20(5):378\u2013400","journal-title":"Int J Robot Res"},{"issue":"7","key":"4370_CR5","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846\u2013894","journal-title":"Int J Robot Res"},{"issue":"10","key":"4370_CR6","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1109\/TKDE.2018.2808953","volume":"30","author":"Haijun Zhang","year":"2018","unstructured":"Zhang Haijun, Wang Shuang, Zhao Mingbo, Xiaofei Xu, Ye Yunming (2018) Locality reconstruction models for book representation. IEEE Trans Knowl Data Eng 30(10):1873\u20131886","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"4370_CR7","doi-asserted-by":"publisher","first-page":"5304","DOI":"10.1109\/TNNLS.2018.2797060","volume":"29","author":"H Zhang","year":"2018","unstructured":"Zhang H, Wang S, Xu X, Chow TWS, Wu QMJ (2018) Tree2Vector: learning a vectorial representation for tree-structured data. IEEE Trans Neural Netw Learn Syst 29(11):5304\u20135318","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"8","key":"4370_CR8","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.neunet.2007.07.008","volume":"20","author":"S Furao","year":"2007","unstructured":"Furao S, Ogura T, Hasegawa O (2007) An enhanced self-organizing incremental neural network for online unsupervised learning. Neural Netw 20(8):893\u2013903","journal-title":"Neural Netw"},{"issue":"6","key":"4370_CR9","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1109\/TNNLS.2013.2287884","volume":"25","author":"H Zhang","year":"2014","unstructured":"Zhang H, Xiao X, Hasegawa O (2014) A load-balancing self-organizing incremental neural network. IEEE Trans Neural Netw Learn Syst 25(6):1096\u20131105","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"7","key":"4370_CR10","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1177\/0278364906067174","volume":"25","author":"D Hsu","year":"2006","unstructured":"Hsu D, Latombe JC, Kurniawati H (2006) On the probabilistic foundations of probabilistic roadmap planning. Int J Robot Res 25(7):627\u2013643","journal-title":"Int J Robot Res"},{"key":"4370_CR11","doi-asserted-by":"crossref","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2015) Batch informed trees (BIT*): sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs. In: 2015 IEEE international conference on robotics and automation (ICRA). IEEE, pp 3067\u20133074","DOI":"10.1109\/ICRA.2015.7139620"},{"issue":"12","key":"4370_CR12","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1177\/0278364905060132","volume":"24","author":"JP Van den Berg","year":"2005","unstructured":"Van den Berg JP, Overmars MH (2005) Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. Int J Robot Res 24(12):1055\u20131071","journal-title":"Int J Robot Res"},{"key":"4370_CR13","doi-asserted-by":"crossref","unstructured":"Yang Y, Brock O (2004) Adapting the sampling distribution in PRM planners based on an approximated medial axis. In: 2004 IEEE international conference on robotics and automation. Proceedings ICRA\u201904, vol 5. IEEE, pp 4405\u20134410","DOI":"10.1109\/ROBOT.2004.1302411"},{"key":"4370_CR14","doi-asserted-by":"crossref","unstructured":"Berenson D, Abbeel P, Goldberg K (2012) A robot path planning framework that learns from experience. In: IEEE international conference on robotics and automation. IEEE, pp 3671\u20133678","DOI":"10.1109\/ICRA.2012.6224742"},{"key":"4370_CR15","doi-asserted-by":"crossref","unstructured":"Coleman D, \u015eucan IA, Moll M, et al (2015) Experience-based planning with sparse roadmap spanners. In: IEEE international conference on robotics and automation. IEEE, pp 900\u2013905","DOI":"10.1109\/ICRA.2015.7139284"},{"key":"4370_CR16","doi-asserted-by":"crossref","unstructured":"Li Y, Bekris KE (2011) Learning approximate cost-to-go metrics to improve sampling-based motion planning. In: IEEE international conference on robotics and automation. IEEE, pp 4196\u20134201","DOI":"10.1109\/ICRA.2011.5980427"},{"key":"4370_CR17","doi-asserted-by":"crossref","unstructured":"Arslan O, Tsiotras P (2015) Machine learning guided exploration for sampling-based motion planning algorithms. In: 2015 IEEE\/RSJ international conference on intelligent robots and systems (IROS). IEEE, pp 2646\u20132652","DOI":"10.1109\/IROS.2015.7353738"},{"key":"4370_CR18","unstructured":"Huh J, Lee DD (2016) Learning high-dimensional mixture models for fast collision detection in rapidly-exploring random trees. In: 2016 IEEE international conference on robotics and automation (ICRA). IEEE, pp 63\u201369"},{"key":"4370_CR19","doi-asserted-by":"crossref","unstructured":"Huh J, Lee B, Lee DD (2017) Adaptive motion planning with high-dimensional mixture models. In: 2017 IEEE international conference on robotics and automation (ICRA). IEEE, pp 3740\u20133747","DOI":"10.1109\/ICRA.2017.7989431"},{"key":"4370_CR20","doi-asserted-by":"crossref","unstructured":"Chen N, Karl M, van der Smagt P (2016) Dynamic movement primitives in latent space of time-dependent variational autoencoders. In: 2016 IEEE-RAS 16th international conference on humanoid robots (humanoids). IEEE, pp 629\u2013636","DOI":"10.1109\/HUMANOIDS.2016.7803340"},{"key":"4370_CR21","doi-asserted-by":"crossref","unstructured":"Ichter B, Harrison J, Pavone M (2018) Learning sampling distributions for robot motion planning. In: 2018 IEEE international conference on robotics and automation (ICRA). IEEE, pp 7087\u20137094","DOI":"10.1109\/ICRA.2018.8460730"},{"issue":"12","key":"4370_CR22","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TPAMI.2016.2522425","volume":"38","author":"ID Gebru","year":"2016","unstructured":"Gebru ID, Alameda-Pineda X, Forbes F et al (2016) EM algorithms for weighted-data clustering with application to audio-visual scene analysis. IEEE Trans Pattern Anal Mach Intell 38(12):2402\u20132415","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4370_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.neunet.2016.08.011","volume":"84","author":"Y Xing","year":"2016","unstructured":"Xing Y, Shi X, Shen F et al (2016) A self-organizing incremental neural network based on local distribution learning. Neural Netw 84:143\u2013160","journal-title":"Neural Netw"},{"issue":"6","key":"4370_CR24","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TNN.2009.2014374","volume":"20","author":"A Sudo","year":"2009","unstructured":"Sudo A, Sato A, Hasegawa O (2009) Associative memory for online learning in noisy environments using self-organizing incremental neural network. IEEE Trans Neural Netw 20(6):964\u2013972","journal-title":"IEEE Trans Neural Netw"},{"key":"4370_CR25","doi-asserted-by":"crossref","unstructured":"Kawewong A, Pimpup R, Hasegawa O (2013) Incremental learning framework for indoor scene recognition. In: Twenty-seventh AAAI conference on artificial intelligence. AAAI Press, Menlo Park","DOI":"10.1609\/aaai.v27i1.8584"},{"issue":"2","key":"4370_CR26","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TSMCB.2006.885309","volume":"37","author":"X He","year":"2007","unstructured":"He X, Kojima R, Hasegawa O (2007) Developmental word grounding through a growing neural network with a humanoid robot. IEEE Trans Syst Man Cybern Part B (Cybern) 37(2):451\u2013462","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"9","key":"4370_CR27","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1038\/78829","volume":"3","author":"S Song","year":"2000","unstructured":"Song S, Miller KD, Abbott LF (2000) Competitive Hebbian learning through spike-timing-dependent synaptic plasticity. Nat Neurosci 3(9):919","journal-title":"Nat Neurosci"},{"issue":"6","key":"4370_CR28","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1109\/TCYB.2015.2426723","volume":"46","author":"J Mei","year":"2016","unstructured":"Mei J, Liu M, Wang YF et al (2016) Learning a Mahalanobis distance-based dynamic time warping measure for multivariate time series classification. IEEE Trans Cybern 46(6):1363\u20131374","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"4370_CR29","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1177\/0278364915577958","volume":"34","author":"L Janson","year":"2015","unstructured":"Janson L, Schmerling E, Clark A et al (2015) Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions. Int J Robot Res 34(7):883\u2013921","journal-title":"Int J Robot Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04370-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04370-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04370-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T21:11:13Z","timestamp":1664053873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04370-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,30]]},"references-count":29,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["4370"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04370-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2019,7,30]]},"assertion":[{"value":"6 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"No conflict of interest exits in the submission of this manuscript, and the manuscript is approved by all authors for publication. We would like to declare that the work described was original research that has not been published previously, and not under consideration for publication elsewhere, in whole or in part. All authors listed have approved the manuscript that is enclosed.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}