{"id":"https://openalex.org/W3205610181","doi":"https://doi.org/10.1109/icra48506.2021.9561472","title":"Efficient Heuristic Generation for Robot Path Planning with Recurrent Generative Model","display_name":"Efficient Heuristic Generation for Robot Path Planning with Recurrent Generative Model","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3205610181","doi":"https://doi.org/10.1109/icra48506.2021.9561472","mag":"3205610181"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9561472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","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/A5101816278","display_name":"Zhaoting Li","orcid":"https://orcid.org/0000-0002-9873-0858"},"institutions":[{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhaoting Li","raw_affiliation_strings":["Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043461784","display_name":"Jiankun Wang","orcid":"https://orcid.org/0000-0001-9139-0291"},"institutions":[{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiankun Wang","raw_affiliation_strings":["Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021531143","display_name":"Max Q.\u2010H. Meng","orcid":"https://orcid.org/0000-0002-5255-5898"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]},{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]},{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Max Q.-H. Meng","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong","Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China","Shenzhen Research Institute of the Chinese University of Hong Kong, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Electronic and Electrical Engineering of the Southern, University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]},{"raw_affiliation_string":"Shenzhen Research Institute of the Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101816278"],"corresponding_institution_ids":["https://openalex.org/I3045169105"],"apc_list":null,"apc_paid":null,"fwci":0.4806,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.65420164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7386","last_page":"7392"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10812","display_name":"Human Pose and Action Recognition","score":0.9954000115394592,"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/heuristic","display_name":"Heuristic","score":0.7608410120010376},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.7109707593917847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7020882368087769},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6353415250778198},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6302127838134766},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.6131213903427124},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.49504104256629944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49328869581222534},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4417896568775177},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42942214012145996},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4261583387851715},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.41813600063323975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39337092638015747},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3418467938899994},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.28229475021362305},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.26829445362091064},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2562065124511719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18319743871688843}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7608410120010376},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.7109707593917847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7020882368087769},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6353415250778198},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6302127838134766},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.6131213903427124},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.49504104256629944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49328869581222534},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4417896568775177},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42942214012145996},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4261583387851715},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.41813600063323975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39337092638015747},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3418467938899994},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.28229475021362305},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.26829445362091064},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2562065124511719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18319743871688843},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48506.2021.9561472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9561472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320327605","display_name":"Southern University of Science and Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1521785144","https://openalex.org/W1836465849","https://openalex.org/W1901129140","https://openalex.org/W1924770834","https://openalex.org/W1959608418","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2099471712","https://openalex.org/W2103120971","https://openalex.org/W2125389028","https://openalex.org/W2128990851","https://openalex.org/W2171928131","https://openalex.org/W2173520492","https://openalex.org/W2194775991","https://openalex.org/W2739748921","https://openalex.org/W2792263949","https://openalex.org/W2804078698","https://openalex.org/W2962741254","https://openalex.org/W2962770929","https://openalex.org/W2963073614","https://openalex.org/W2963373786","https://openalex.org/W2963409832","https://openalex.org/W2963439114","https://openalex.org/W2963684088","https://openalex.org/W2964568892","https://openalex.org/W2967969632","https://openalex.org/W2970971581","https://openalex.org/W3011646207","https://openalex.org/W4295312788","https://openalex.org/W4320013936","https://openalex.org/W6638667902","https://openalex.org/W6639118987","https://openalex.org/W6639824700","https://openalex.org/W6640212811","https://openalex.org/W6640963894","https://openalex.org/W6678815747","https://openalex.org/W6685352114","https://openalex.org/W6718379498","https://openalex.org/W6729966448","https://openalex.org/W6741832134","https://openalex.org/W6749927861","https://openalex.org/W6752378368","https://openalex.org/W6766978945"],"related_works":["https://openalex.org/W126812865","https://openalex.org/W3215212546","https://openalex.org/W4302010637","https://openalex.org/W2112094742","https://openalex.org/W2740367979","https://openalex.org/W1518339624","https://openalex.org/W2349967715","https://openalex.org/W2137407544","https://openalex.org/W174564869","https://openalex.org/W1522468556"],"abstract_inverted_index":{"Robot":[0],"path":[1,66],"planning":[2,67],"is":[3],"difficult":[4],"to":[5,8,33,60,118,188],"solve":[6],"due":[7],"the":[9,12,17,30,36,62,73,93,101,110,134,151,156,162,172,181,186],"contradiction":[10],"between":[11],"optimality":[13],"of":[14,19,65,75,83,106,155],"results":[15,125],"and":[16,96,103,122,143,171,193,199],"complexity":[18],"algorithms,":[20],"even":[21],"in":[22,114,140,175,196],"2D":[23,116],"environments.":[24],"To":[25,44],"find":[26,190],"an":[27],"optimal":[28,194],"path,":[29],"algorithm":[31,187],"needs":[32],"search":[34,63],"all":[35],"state":[37],"space,":[38],"which":[39,56,81],"costs":[40],"many":[41],"computation":[42],"resources.":[43],"address":[45],"this":[46],"issue,":[47],"we":[48],"present":[49],"a":[50,84,130,197],"novel":[51,85],"recurrent":[52],"generative":[53,77],"model":[54,71,131],"(RGM),":[55],"generates":[57,137],"efficient":[58,201],"heuristic":[59,90,139,170,183],"reduce":[61],"efforts":[64],"algorithms.":[68],"This":[69],"RGM":[70,112,135,157],"adopts":[72],"framework":[74],"general":[76],"adversarial":[78],"networks":[79],"(GAN),":[80],"consists":[82],"generator":[86],"that":[87,99,180],"can":[88,184],"generate":[89],"by":[91],"refining":[92],"outputs":[94],"recurrently":[95],"two":[97],"discriminators":[98],"check":[100],"connectivity":[102],"safety":[104],"properties":[105],"heuristic.":[107],"We":[108,159],"test":[109],"proposed":[111],"module":[113],"various":[115],"environments":[117],"demonstrate":[119],"its":[120],"effectiveness":[121],"efficiency.":[123],"The":[124],"show":[126],"that,":[127],"compared":[128],"with":[129,147,168],"without":[132],"recurrence,":[133],"successfully":[136],"appropriate":[138],"both":[141,191],"seen":[142],"new":[144],"unseen":[145],"maps":[146],"higher":[148],"accuracy,":[149],"demonstrating":[150],"good":[152],"generalization":[153],"ability":[154],"model.":[158],"also":[160],"compare":[161],"rapidly-exploring":[163],"random":[164],"tree":[165],"star":[166],"(RRT*)":[167],"generated":[169,182],"conventional":[173],"RRT*":[174],"four":[176],"different":[177],"maps,":[178],"showing":[179],"guide":[185],"efficiently":[189],"initial":[192],"solutions":[195],"faster":[198],"more":[200],"way.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-01T08:55:55.761014","created_date":"2025-10-10T00:00:00"}