{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:10:41Z","timestamp":1765041041157,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["11901113"],"award-info":[{"award-number":["11901113"]}]},{"name":"Guangzhou Science and Technology Plan Project","award":["201904010225"],"award-info":[{"award-number":["201904010225"]}]},{"name":"Natural Science Foundation of Guangdong Province","award":["2018A030307032"],"award-info":[{"award-number":["2018A030307032"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,15]]},"DOI":"10.1145\/3383972.3384021","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T18:15:22Z","timestamp":1590516922000},"page":"52-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Learning Algorithm for Minimum Constraint Removal (MCR) Problem"],"prefix":"10.1145","author":[{"given":"Bo","family":"Xu","sequence":"first","affiliation":[{"name":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangwei","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kewen","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"volume-title":"The Complexity of Robot Motion Planning","author":"Canny","key":"e_1_3_2_1_1_1","unstructured":"J. Canny . 1988. The Complexity of Robot Motion Planning . Cambridge, MA : MIT press . J. Canny. 1988. The Complexity of Robot Motion Planning. Cambridge, MA: MIT press."},{"key":"e_1_3_2_1_2_1","first-page":"269","volume-title":"Algorithmic Foundation of Robotics VII","author":"Zhang L","unstructured":"Zhang L , Kim Y , Manocha D. 2008. \"A simple path non-existence algorithm using c-obstacle query\". Algorithmic Foundation of Robotics VII , Springer Tracts in Advanced Robotics, Berlin : Springer , vol. 47 , pp. 269 -- 284 .DOI=https:\/\/doi.org\/10.1007\/978-3-540-68405-3_17 10.1007\/978-3-540-68405-3_17 Zhang L, Kim Y, Manocha D. 2008. \"A simple path non-existence algorithm using c-obstacle query\". Algorithmic Foundation of Robotics VII, Springer Tracts in Advanced Robotics, Berlin: Springer, vol.47, pp. 269--284.DOI=https:\/\/doi.org\/10.1007\/978-3-540-68405-3_17"},{"key":"e_1_3_2_1_3_1","first-page":"81","volume-title":"Proceedings of the Twentieth International Conference on Automated Planning and Scheduling","author":"Gobelbecker M.","year":"2010","unstructured":"Gobelbecker M. Keller T , Eyerich P , Brenner M , Nebel B. 2010 . \" Coming up with good excuses: what to do when no plan can be found \". In Proceedings of the Twentieth International Conference on Automated Planning and Scheduling , pp. 81 -- 88 . DOI= https:\/\/doi.org\/10.1177\/0278364913507983 10.1177\/0278364913507983 Gobelbecker M. Keller T, Eyerich P, Brenner M, Nebel B. 2010. \"Coming up with good excuses: what to do when no plan can be found\". In Proceedings of the Twentieth International Conference on Automated Planning and Scheduling, pp. 81--88. DOI= https:\/\/doi.org\/10.1177\/0278364913507983"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507983"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2014.7041499"},{"key":"e_1_3_2_1_6_1","first-page":"1388","volume-title":"USA","author":"Erickson S. M.","unstructured":"L. H. Erickson and S. M. LaValle . 2013. \"A simple, but NP-hard, motion planning problem,\" in Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13), Urbana , USA , pp. 1388 -- 1393 . L. H. Erickson and S. M. LaValle.2013. \"A simple, but NP-hard, motion planning problem,\" in Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13), Urbana, USA, pp. 1388--1393."},{"key":"e_1_3_2_1_7_1","volume-title":"PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON 2015. AIP Conf. Proc. 22--28 Rhodes, Greece. DOI=https:\/\/doi.org\/10","author":"Gorbenko A","year":"2014","unstructured":"Gorbenko A , Popov V. 2014 .\" The discrete minimum constraint removal motion planning problem \". PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON 2015. AIP Conf. Proc. 22--28 Rhodes, Greece. DOI=https:\/\/doi.org\/10 .1063\/1.49130 98 10.1063\/1.49130 Gorbenko A, Popov V. 2014.\"The discrete minimum constraint removal motion planning problem\". PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON 2015. AIP Conf. Proc. 22--28 Rhodes, Greece. DOI=https:\/\/doi.org\/10.1063\/1.49130 98"},{"key":"e_1_3_2_1_8_1","first-page":"40","volume-title":"Artificial Intelligence Journal","author":"Sharon G","year":"2015","unstructured":"Sharon G , Stern R , Felener A , Sturtevant N. 2015 \" The conflict-based search algorithm for multi-agent path finding \". Artificial Intelligence Journal , pp. 40 -- 66 . Sharon G, Stern R, Felener A, Sturtevant N. 2015 \"The conflict-based search algorithm for multi-agent path finding\". Artificial Intelligence Journal, pp. 40--66."},{"volume-title":"Eighth Annual Symposium on Combinatorial Search.","author":"Athanasios Krontiris AAAI","key":"e_1_3_2_1_9_1","unstructured":"Athanasios Krontiris , Kostas Bekris.2015. \"Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths\". AAAI Publications , Eighth Annual Symposium on Combinatorial Search. Athanasios Krontiris, Kostas Bekris.2015. \"Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths\". AAAI Publications, Eighth Annual Symposium on Combinatorial Search."},{"issue":"6","key":"e_1_3_2_1_10_1","first-page":"553","article-title":"Solving Minimum Constraint Removal (MCR) Problem Using a Social-Force- Model Based Ant Colony Algorithm [J]","volume":"43","author":"Bo Xu","year":"2016","unstructured":"Bo Xu , Huaqing Min. 2016 . Solving Minimum Constraint Removal (MCR) Problem Using a Social-Force- Model Based Ant Colony Algorithm [J] . Applied Soft Computing , 43 ( 6 ): 553 -- 560 .DOI= https:\/\/doi.org\/10.1016\/j.asoc.2016.02.047 10.1016\/j.asoc.2016.02.047 Bo Xu, Huaqing Min. 2016. Solving Minimum Constraint Removal (MCR) Problem Using a Social-Force- Model Based Ant Colony Algorithm [J]. Applied Soft Computing, 43(6): 553--560.DOI= https:\/\/doi.org\/10.1016\/j.asoc.2016.02.047","journal-title":"Applied Soft Computing"},{"issue":"12","key":"e_1_3_2_1_11_1","first-page":"3371","article-title":"Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion [J]","volume":"11","author":"Vincent P","year":"2010","unstructured":"Vincent P , Larochelle H , Lajoie I. 2010 . Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion [J] . Journal of Machine Learning Research 11 ( 12 ): 3371 -- 3408 . Vincent P, Larochelle H, Lajoie I. 2010.Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion [J]. Journal of Machine Learning Research 11(12): 3371--3408.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_12_1","first-page":"2527796","article-title":"A Robust Regularization Path Algorithm for ν-Support Vector Classification","volume":"2016","author":"Bin Gu S.","year":"2016","unstructured":"Bin Gu and Victor S. Sheng , 2016 \" A Robust Regularization Path Algorithm for ν-Support Vector Classification ,\" IEEE Transactions on Neural Networks and Learning Systems, DOI= https:\/\/doi.org\/10.1109\/tnnls. 2016 . 2527796 . 10.1109\/tnnls.2016.2527796 Bin Gu and Victor S. Sheng, 2016 \"A Robust Regularization Path Algorithm for ν-Support Vector Classification,\" IEEE Transactions on Neural Networks and Learning Systems, DOI= https:\/\/doi.org\/10.1109\/tnnls.2016.2527796.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems, DOI= https:\/\/doi.org\/10.1109\/tnnls."},{"issue":"1","key":"e_1_3_2_1_13_1","first-page":"124","volume":"51","author":"Beijing Chen","year":"2015","unstructured":"Beijing Chen , Huazhong Shu, Gouenou Coatrieux , Gang Chen, Xingming Sun , and Jean-Louis Coatrieux , 2015 .\" Color image analysis by quaternion-type moments,\" Journal of Mathematical Imaging and Vision , vol. 51 , no. 1 , pp. 124 -- 144 . DOI= https:\/\/doi.org\/10.1007\/s10851-014-0511--6. 10.1007\/s10851-014-0511--6 Beijing Chen, Huazhong Shu, Gouenou Coatrieux, Gang Chen, Xingming Sun, and Jean-Louis Coatrieux, 2015.\"Color image analysis by quaternion-type moments,\" Journal of Mathematical Imaging and Vision, vol. 51, no. 1, pp. 124--144. DOI= https:\/\/doi.org\/10.1007\/s10851-014-0511--6.","journal-title":"Color image analysis by quaternion-type moments,\" Journal of Mathematical Imaging and Vision"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2381872"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507795"}],"event":{"name":"ICMLC 2020: 2020 12th International Conference on Machine Learning and Computing","sponsor":["Shenzhen University Shenzhen University"],"location":"Shenzhen China","acronym":"ICMLC 2020"},"container-title":["Proceedings of the 2020 12th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383972.3384021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3383972.3384021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:23Z","timestamp":1750199603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383972.3384021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":15,"alternative-id":["10.1145\/3383972.3384021","10.1145\/3383972"],"URL":"https:\/\/doi.org\/10.1145\/3383972.3384021","relation":{},"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"2020-05-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}