{"id":"https://openalex.org/W4293812070","doi":"https://doi.org/10.1109/access.2022.3203072","title":"Improved Q-Learning Applied to Dynamic Obstacle Avoidance and Path Planning","display_name":"Improved Q-Learning Applied to Dynamic Obstacle Avoidance and Path Planning","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4293812070","doi":"https://doi.org/10.1109/access.2022.3203072"},"language":"en","primary_location":{"id":"doi:10.1109/access.2022.3203072","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3203072","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09870811.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09870811.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100710372","display_name":"Chunlei Wang","orcid":"https://orcid.org/0000-0003-2574-7314"},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chunlei Wang","raw_affiliation_strings":["School of Public Administration, China University of Mining and Technology, Xuzhou, China","School of Public Administration, China University of Mining and Technology, Xuzhou City, Jiangsu Province, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Public Administration, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"School of Public Administration, China University of Mining and Technology, Xuzhou City, Jiangsu Province, China","institution_ids":["https://openalex.org/I25757504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102012320","display_name":"Xiao Dong Yang","orcid":"https://orcid.org/0000-0003-2837-4760"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Yang","raw_affiliation_strings":["School of Computer Science and Technology, Harbin Engineering University, Harbin, China","School of Computer Science and Technology, Harbin Engineering University, Nantong Street, Harbin City, Heilongjiang Province, China"],"raw_orcid":"https://orcid.org/0000-0003-2837-4760","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]},{"raw_affiliation_string":"School of Computer Science and Technology, Harbin Engineering University, Nantong Street, Harbin City, Heilongjiang Province, China","institution_ids":["https://openalex.org/I151727225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016853137","display_name":"He Li","orcid":null},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"He Li","raw_affiliation_strings":["Department of Languages and Communication Studies, Beijing Jiaotong University, Beijing, China","Department of Languages and Communication Studies, Beijing Jiaotong University, No.3 Shangyuancun Haidian District Beijing, Beijing City, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Languages and Communication Studies, Beijing Jiaotong University, Beijing, China","institution_ids":["https://openalex.org/I21193070"]},{"raw_affiliation_string":"Department of Languages and Communication Studies, Beijing Jiaotong University, No.3 Shangyuancun Haidian District Beijing, Beijing City, China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100710372"],"corresponding_institution_ids":["https://openalex.org/I25757504"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.337,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.8990732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"10","issue":null,"first_page":"92879","last_page":"92888"},"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11106","display_name":"Data Management and Algorithms","score":0.972000002861023,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.824472188949585},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.7898393869400024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.710662841796875},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6705207824707031},{"id":"https://openalex.org/keywords/q-learning","display_name":"Q-learning","score":0.647586464881897},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5998756885528564},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5988385677337646},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5614822506904602},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.548774778842926},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46858590841293335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4446813464164734},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4298633337020874},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.41597485542297363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38639914989471436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19166299700737},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1133967936038971},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.09573012590408325}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.824472188949585},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.7898393869400024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.710662841796875},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6705207824707031},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.647586464881897},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5998756885528564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5988385677337646},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5614822506904602},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.548774778842926},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46858590841293335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4446813464164734},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4298633337020874},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.41597485542297363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38639914989471436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19166299700737},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1133967936038971},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.09573012590408325},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2022.3203072","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3203072","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09870811.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9dc15dd99dc54353940368136dd26553","is_oa":true,"landing_page_url":"https://doaj.org/article/9dc15dd99dc54353940368136dd26553","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 10, Pp 92879-92888 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2022.3203072","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3203072","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09870811.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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 Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2633800318","display_name":null,"funder_award_id":"21YYB014","funder_id":"https://openalex.org/F4320329865","funder_display_name":"Social Science Foundation of Jiangsu Province"}],"funders":[{"id":"https://openalex.org/F4320329865","display_name":"Social Science Foundation of Jiangsu Province","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293812070.pdf","grobid_xml":"https://content.openalex.org/works/W4293812070.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1596729410","https://openalex.org/W1997880753","https://openalex.org/W2114998424","https://openalex.org/W2126357802","https://openalex.org/W2953083820","https://openalex.org/W3003100621","https://openalex.org/W3014079666","https://openalex.org/W3042266059","https://openalex.org/W3080437618","https://openalex.org/W3095184972","https://openalex.org/W3098856973","https://openalex.org/W3114748666","https://openalex.org/W3127917319","https://openalex.org/W3129692087","https://openalex.org/W3133563892","https://openalex.org/W3134048614","https://openalex.org/W3135153044","https://openalex.org/W3151306683","https://openalex.org/W3154552588","https://openalex.org/W3155121415","https://openalex.org/W3166118626","https://openalex.org/W3168592837","https://openalex.org/W3171545142","https://openalex.org/W3182312102","https://openalex.org/W3186909580","https://openalex.org/W3193878267","https://openalex.org/W3196961387","https://openalex.org/W3202530169","https://openalex.org/W3215003707","https://openalex.org/W4200008035","https://openalex.org/W4200127946","https://openalex.org/W4205257762","https://openalex.org/W4205770567","https://openalex.org/W4214657975","https://openalex.org/W4214743713","https://openalex.org/W4226125647","https://openalex.org/W6712227361"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W4391249562","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W3043170174","https://openalex.org/W2155948905","https://openalex.org/W4380590094"],"abstract_inverted_index":{"Due":[0],"to":[1,16,42,72,104],"the":[2,74,78,87,91,113,118,125,132],"complexity":[3],"of":[4,77,135],"interactive":[5],"environments,":[6],"dynamic":[7,105],"obstacle":[8,106],"avoidance":[9,107],"path":[10,20,108,134],"planning":[11,21],"poses":[12],"a":[13,23,66],"significant":[14],"challenge":[15],"agent":[17],"mobility.":[18],"Dynamic":[19],"is":[22,65,97],"complex":[24,60],"multi-constraint":[25],"combinatorial":[26],"optimization":[27,36],"problem.":[28],"Some":[29],"existing":[30,100],"algorithms":[31,101],"easily":[32],"fall":[33],"into":[34,90],"local":[35],"when":[37],"solving":[38,55,81],"such":[39],"problems,":[40,83],"leading":[41],"defects":[43],"in":[44,54,59,80,138],"convergence":[45,119],"speed":[46,120],"and":[47,102,121,123],"accuracy.":[48],"Reinforcement":[49],"learning":[50,68],"has":[51],"certain":[52],"advantages":[53],"decision":[56],"sequence":[57],"problems":[58],"environments.":[61],"A":[62],"Q-learning":[63,92],"algorithm":[64,79,96,115,130],"reinforcement":[67],"method.":[69],"In":[70],"order":[71],"improve":[73],"value":[75,126],"evaluation":[76],"practical":[82],"this":[84],"paper":[85],"introduces":[86],"priority":[88],"weight":[89],"algorithm.":[93],"The":[94,128],"improved":[95,114,129],"compared":[98],"with":[99],"applied":[103],"planning.":[109],"Experiments":[110],"show":[111],"that":[112],"dramatically":[116],"improves":[117],"accuracy":[122],"increases":[124],"evaluation.":[127],"finds":[131],"shortest":[133],"16":[136],"units":[137],"27":[139],"seconds.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}