{"id":"https://openalex.org/W3031357366","doi":"https://doi.org/10.1145/3383972.3384021","title":"Deep Learning Algorithm for Minimum Constraint Removal (MCR) Problem","display_name":"Deep Learning Algorithm for Minimum Constraint Removal (MCR) Problem","publication_year":2020,"publication_date":"2020-02-15","ids":{"openalex":"https://openalex.org/W3031357366","doi":"https://doi.org/10.1145/3383972.3384021","mag":"3031357366"},"language":"en","primary_location":{"id":"doi:10.1145/3383972.3384021","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3383972.3384021","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 12th International Conference on Machine Learning and Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100439920","display_name":"Bo Xu","orcid":"https://orcid.org/0000-0001-6049-8005"},"institutions":[{"id":"https://openalex.org/I201459984","display_name":"Guangdong University Of Finances and Economics","ror":"https://ror.org/0459pv085","country_code":"CN","type":"education","lineage":["https://openalex.org/I201459984"]},{"id":"https://openalex.org/I4210149618","display_name":"Guangdong University of Finance","ror":"https://ror.org/04grzdh47","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210149618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Xu","raw_affiliation_strings":["School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China","institution_ids":["https://openalex.org/I201459984","https://openalex.org/I4210149618"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101886049","display_name":"Liangwei Chen","orcid":"https://orcid.org/0000-0002-6558-7522"},"institutions":[{"id":"https://openalex.org/I201459984","display_name":"Guangdong University Of Finances and Economics","ror":"https://ror.org/0459pv085","country_code":"CN","type":"education","lineage":["https://openalex.org/I201459984"]},{"id":"https://openalex.org/I4210149618","display_name":"Guangdong University of Finance","ror":"https://ror.org/04grzdh47","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210149618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liangwei Chen","raw_affiliation_strings":["School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China","institution_ids":["https://openalex.org/I201459984","https://openalex.org/I4210149618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058348744","display_name":"Kewen Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I201459984","display_name":"Guangdong University Of Finances and Economics","ror":"https://ror.org/0459pv085","country_code":"CN","type":"education","lineage":["https://openalex.org/I201459984"]},{"id":"https://openalex.org/I4210149618","display_name":"Guangdong University of Finance","ror":"https://ror.org/04grzdh47","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210149618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kewen Xu","raw_affiliation_strings":["School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science, Guangdong University of Finance and Economics, Guangzhou, Guangdong, China","institution_ids":["https://openalex.org/I201459984","https://openalex.org/I4210149618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12549","display_name":"Image and Object Detection Techniques","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.7263588905334473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6598864793777466},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6298366189002991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6044989824295044},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.590997040271759},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5862241983413696},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5333298444747925},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5206253528594971},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4842934012413025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46587464213371277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19212275743484497},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.15350738167762756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1294528841972351}],"concepts":[{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.7263588905334473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6598864793777466},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6298366189002991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6044989824295044},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.590997040271759},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5862241983413696},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5333298444747925},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5206253528594971},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4842934012413025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46587464213371277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19212275743484497},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.15350738167762756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1294528841972351},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3383972.3384021","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3383972.3384021","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 12th International Conference on Machine Learning and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W135490454","https://openalex.org/W1434156133","https://openalex.org/W1492287580","https://openalex.org/W1516027685","https://openalex.org/W1817769608","https://openalex.org/W2015241127","https://openalex.org/W2023862787","https://openalex.org/W2052950171","https://openalex.org/W2119562960","https://openalex.org/W2145094598","https://openalex.org/W2288560581","https://openalex.org/W2290639523","https://openalex.org/W2494974121"],"related_works":["https://openalex.org/W4375867731","https://openalex.org/W2611989081","https://openalex.org/W4230611425","https://openalex.org/W2731899572","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"This":[0,53],"paper":[1],"investigated":[2],"the":[3,8,22,29,47,62,67,96,103],"path":[4,31,109,121],"planning":[5,122],"problem":[6,32],"and":[7,25,35,82,113,116],"feasibility":[9],"of":[10,28,58,64],"a":[11,17,36,75,78,83,108],"deep":[12,48,65,68,89],"learning":[13,49,69,90],"algorithm":[14,54,91,105],"to":[15],"search":[16],"solution.":[18],"In":[19],"this":[20],"paper,":[21],"structural":[23],"model":[24,27],"mathematical":[26],"robotic":[30],"were":[33],"constructed,":[34],"radial":[37],"basis":[38],"function":[39],"(RBF)":[40],"neural":[41,59],"network,":[42,77,81],"which":[43],"is":[44,117],"based":[45],"on":[46],"algorithm,":[50],"was":[51,71,92],"proposed.":[52],"extends":[55],"three":[56],"sets":[57],"networks":[60],"in":[61],"direction":[63],"learning;":[66],"process":[70],"progressively":[72],"advanced":[73],"using":[74],"\"reachable\"":[76],"\"least":[79],"barrier\"":[80],"\"shortest":[84],"path\"":[85],"network.":[86],"The":[87,99],"proposed":[88,104],"experimentally":[93],"compared":[94],"with":[95,110],"ACO":[97],"algorithm.":[98],"results":[100],"indicated":[101],"that":[102],"can":[106],"plan":[107],"fewer":[111],"barriers":[112],"shorter":[114],"distances":[115],"suitable":[118],"for":[119],"solving":[120],"problems.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}