{"id":"https://openalex.org/W2978949425","doi":"https://doi.org/10.1109/jas.2019.1911732","title":"Path planning for intelligent robots based on deep Q-learning with experience replay and heuristic knowledge","display_name":"Path planning for intelligent robots based on deep Q-learning with experience replay and heuristic knowledge","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2978949425","doi":"https://doi.org/10.1109/jas.2019.1911732","mag":"2978949425"},"language":"en","primary_location":{"id":"doi:10.1109/jas.2019.1911732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jas.2019.1911732","pdf_url":null,"source":{"id":"https://openalex.org/S2484288132","display_name":"IEEE/CAA Journal of Automatica Sinica","issn_l":"2329-9266","issn":["2329-9266","2329-9274"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/CAA Journal of Automatica Sinica","raw_type":"journal-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/A5047194485","display_name":"Lan Jiang","orcid":"https://orcid.org/0000-0003-2008-9631"},"institutions":[{"id":"https://openalex.org/I1328775524","display_name":"Zhejiang Sci-Tech University","ror":"https://ror.org/03893we55","country_code":"CN","type":"education","lineage":["https://openalex.org/I1328775524"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lan Jiang","raw_affiliation_strings":["Laboratory of Intelligent Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Intelligent Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China","institution_ids":["https://openalex.org/I1328775524"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074480091","display_name":"Hongyun Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I1328775524","display_name":"Zhejiang Sci-Tech University","ror":"https://ror.org/03893we55","country_code":"CN","type":"education","lineage":["https://openalex.org/I1328775524"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongyun Huang","raw_affiliation_strings":["Center of Multi-Media Big Data of Library, Zhejiang Sci-Tech University, Hangzhou 310018, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Multi-Media Big Data of Library, Zhejiang Sci-Tech University, Hangzhou 310018, China","institution_ids":["https://openalex.org/I1328775524"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077615805","display_name":"Zuohua Ding","orcid":"https://orcid.org/0000-0002-9671-7836"},"institutions":[{"id":"https://openalex.org/I1328775524","display_name":"Zhejiang Sci-Tech University","ror":"https://ror.org/03893we55","country_code":"CN","type":"education","lineage":["https://openalex.org/I1328775524"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zuohua Ding","raw_affiliation_strings":["Laboratory of Intelligent Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Intelligent Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China","institution_ids":["https://openalex.org/I1328775524"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1328775524"],"apc_list":null,"apc_paid":null,"fwci":5.6574,"has_fulltext":false,"cited_by_count":157,"citation_normalized_percentile":{"value":0.96847872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"7","issue":"4","first_page":"1179","last_page":"1189"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9980000257492065,"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/computer-science","display_name":"Computer science","score":0.764618992805481},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7517008781433105},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7256351709365845},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6408309936523438},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6408160924911499},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.6360999345779419},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.616442084312439},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5924754738807678},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5607798099517822},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.517379641532898},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5096511840820312},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.504817545413971},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4595218598842621},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.26063674688339233}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.764618992805481},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7517008781433105},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7256351709365845},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6408309936523438},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6408160924911499},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.6360999345779419},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.616442084312439},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5924754738807678},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5607798099517822},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.517379641532898},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5096511840820312},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.504817545413971},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4595218598842621},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.26063674688339233},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jas.2019.1911732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jas.2019.1911732","pdf_url":null,"source":{"id":"https://openalex.org/S2484288132","display_name":"IEEE/CAA Journal of Automatica Sinica","issn_l":"2329-9266","issn":["2329-9266","2329-9274"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/CAA Journal of Automatica Sinica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1497046610","https://openalex.org/W1595483645","https://openalex.org/W1757796397","https://openalex.org/W1977655452","https://openalex.org/W1994955764","https://openalex.org/W2018236549","https://openalex.org/W2039167866","https://openalex.org/W2089706171","https://openalex.org/W2163605009","https://openalex.org/W2247021770","https://openalex.org/W2330580939","https://openalex.org/W2341147552","https://openalex.org/W2387231897","https://openalex.org/W2498017881","https://openalex.org/W2533682755","https://openalex.org/W2547419118","https://openalex.org/W2548084570","https://openalex.org/W2562788852","https://openalex.org/W2573269332","https://openalex.org/W2592981353","https://openalex.org/W2613999312","https://openalex.org/W2740584750","https://openalex.org/W2755553401","https://openalex.org/W2755839709","https://openalex.org/W2806832624","https://openalex.org/W2848676021","https://openalex.org/W2978070926"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W3043170174","https://openalex.org/W2155948905","https://openalex.org/W4380590094","https://openalex.org/W2050548713"],"abstract_inverted_index":{"Path":[0],"planning":[1],"and":[2,34,98,131,143],"obstacle":[3],"avoidance":[4],"are":[5],"two":[6],"challenging":[7],"problems":[8,26],"in":[9,58,66,113,136],"the":[10,48,56,93,105,116],"study":[11],"of":[12,51,55],"intelligent":[13],"robots.":[14],"In":[15,37],"this":[16,38],"paper,":[17],"we":[18],"develop":[19],"a":[20,40,62,79,84,134],"new":[21],"method":[22,120],"to":[23,46,123],"alleviate":[24],"these":[25],"based":[27],"on":[28],"deep":[29],"Q-learning":[30],"with":[31,115,128,140],"experience":[32,72,88],"replay":[33],"heuristic":[35],"knowledge.":[36],"method,":[39],"neural":[41,80,106],"network":[42,81],"has":[43],"been":[44],"used":[45,76],"resolve":[47],"\u201c":[49],"curse":[50],"dimensionality":[52],"\u201d":[53],"issue":[54],"Q-table":[57],"reinforcement":[59],"learning.":[60],"When":[61],"robot":[63,94],"is":[64,75,86],"walking":[65],"an":[67,124,137],"unknown":[68,138],"environment,":[69],"it":[70],"collects":[71],"data":[73,102],"which":[74],"for":[77,103],"training":[78,104],";":[82],"such":[83],"process":[85],"called":[87],"replay.":[89],"Heuristic":[90],"knowledge":[91],"helps":[92],"avoid":[95],"blind":[96],"exploration":[97],"provides":[99],"more":[100],"effective":[101],"network.":[107],"The":[108],"simulation":[109],"results":[110],"show":[111],"that":[112],"comparison":[114],"existing":[117],"methods,":[118],"our":[119],"can":[121,132],"converge":[122],"optimal":[125],"action":[126],"strategy":[127],"less":[129],"time":[130],"explore":[133],"path":[135],"environment":[139],"fewer":[141],"steps":[142],"larger":[144],"average":[145],"reward.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":33},{"year":2023,"cited_by_count":27},{"year":2022,"cited_by_count":32},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":4}],"updated_date":"2026-07-14T08:27:34.040176","created_date":"2025-10-10T00:00:00"}