{"id":"https://openalex.org/W2556764949","doi":"https://doi.org/10.1109/ijcnn.2016.7727679","title":"Heuristic dynamic programming for mobile robot path planning based on Dyna approach","display_name":"Heuristic dynamic programming for mobile robot path planning based on Dyna approach","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2556764949","doi":"https://doi.org/10.1109/ijcnn.2016.7727679","mag":"2556764949"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2016.7727679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2016.7727679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Joint Conference on Neural Networks (IJCNN)","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/A5045953583","display_name":"Seaar Al-Dabooni","orcid":"https://orcid.org/0000-0001-5200-7587"},"institutions":[{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seaar Al Dabooni","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Missouri University of Science and Technology, Rolla, MO, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Missouri University of Science and Technology, Rolla, MO, USA","institution_ids":["https://openalex.org/I20382870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038037619","display_name":"Donald C. Wunsch","orcid":"https://orcid.org/0000-0002-9726-9051"},"institutions":[{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donald Wunsch","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Missouri University of Science and Technology, Rolla, MO, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Missouri University of Science and Technology, Rolla, MO, USA","institution_ids":["https://openalex.org/I20382870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045953583"],"corresponding_institution_ids":["https://openalex.org/I20382870"],"apc_list":null,"apc_paid":null,"fwci":3.8563,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94445781,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3723","last_page":"3730"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9994999766349792,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9944000244140625,"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.7500923275947571},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7412421703338623},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.7010215520858765},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6001840233802795},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5662431716918945},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5615973472595215},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4224855601787567},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3160974979400635},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10757207870483398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10089901089668274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7500923275947571},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7412421703338623},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.7010215520858765},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6001840233802795},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5662431716918945},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5615973472595215},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4224855601787567},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3160974979400635},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10757207870483398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10089901089668274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2016.7727679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2016.7727679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W152632125","https://openalex.org/W1491843047","https://openalex.org/W1854776945","https://openalex.org/W1970391951","https://openalex.org/W1972941473","https://openalex.org/W1997880753","https://openalex.org/W2032126548","https://openalex.org/W2032736119","https://openalex.org/W2046978863","https://openalex.org/W2074272451","https://openalex.org/W2100677568","https://openalex.org/W2124829859","https://openalex.org/W2135765924","https://openalex.org/W2136064843","https://openalex.org/W2142431690","https://openalex.org/W2156828234","https://openalex.org/W2164561380","https://openalex.org/W2165501837","https://openalex.org/W2171027111","https://openalex.org/W2293688512","https://openalex.org/W2341171179","https://openalex.org/W2393452615","https://openalex.org/W2484646121","https://openalex.org/W3213472335","https://openalex.org/W4214717370","https://openalex.org/W6658564911","https://openalex.org/W6683539816","https://openalex.org/W6704298589","https://openalex.org/W6804409665"],"related_works":["https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W2359600231","https://openalex.org/W4292862729","https://openalex.org/W2380019117","https://openalex.org/W2150982344","https://openalex.org/W2157678966"],"abstract_inverted_index":{"This":[0,23],"paper":[1],"presents":[2],"a":[3,19,47,55,89,112],"direct":[4],"heuristic":[5],"dynamic":[6],"programming":[7],"(HDP)":[8],"based":[9],"on":[10,46],"Dyna":[11,35],"planning":[12,115],"(Dyna_HDP)":[13],"for":[14,37],"online":[15],"model":[16,121],"learning":[17,31,41,69,133],"in":[18,54,111],"Markov":[20],"decision":[21],"process.":[22],"novel":[24],"technique":[25],"is":[26,60,122],"composed":[27],"of":[28],"HDP":[29],"policy":[30],"to":[32,62],"construct":[33],"the":[34,40,80,105,126,132],"agent":[36],"speeding":[38],"up":[39],"time.":[42,134],"We":[43,84],"evaluate":[44],"Dyna_HDP":[45,64,87,106],"differential-drive":[48],"wheeled":[49],"mobile":[50],"robot":[51],"navigation":[52],"problem":[53],"2D":[56],"maze.":[57],"The":[58,117],"simulation":[59],"introduced":[61],"compare":[63],"with":[65,96],"other":[66,94],"traditional":[67],"reinforcement":[68],"algorithms,":[70,95],"namely":[71],"one":[72],"step":[73],"Q-learning,":[74],"Sarsa":[75],"(\u03bb),":[76],"and":[77],"Dyna_Q,":[78],"under":[79],"same":[81],"benchmark":[82],"conditions.":[83],"demonstrate":[85],"that":[86,104],"has":[88],"faster":[90],"near-optimal":[91],"path":[92,114],"than":[93],"high":[97],"stability.":[98],"In":[99],"addition,":[100],"we":[101],"also":[102],"confirm":[103],"method":[107],"can":[108],"be":[109],"applied":[110],"multi-robot":[113],"problem.":[116],"virtual":[118],"common":[119],"environment":[120],"learned":[123],"from":[124],"sharing":[125],"robots'":[127],"experiences":[128],"which":[129],"significantly":[130],"reduces":[131]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}