{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T04:29:31Z","timestamp":1783484971541,"version":"3.55.0"},"reference-count":17,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T00:00:00Z","timestamp":1660608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IR"],"published-print":{"date-parts":[[2023,1,2]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The purpose of this study is to solve the problems of poor stability and high energy consumption of the dynamic window algorithm (DWA) for the mobile robots, a novel enhanced dynamic window algorithm is proposed in this paper.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The novel algorithm takes the distance function as the weight of the target-oriented coefficient, and a new evaluation function is presented to optimize the azimuth angle.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The jitter of the mobile robot caused by the drastic change of angular velocity is reduced when the robot is closer to the target point. The simulation results show that the proposed algorithm effectively optimizes the stability of the mobile robot during operation with lower angular velocity dispersion and less energy consumption, but with a slightly higher running time than DWA.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>A novel enhanced dynamic window algorithm is proposed and verified. According to the experimental result, the proposed algorithm can reduce the energy consumption of the robot and improves the efficiency of the robot.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ir-05-2022-0130","type":"journal-article","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T13:41:47Z","timestamp":1660398107000},"page":"186-194","source":"Crossref","is-referenced-by-count":49,"title":["Enhanced DWA algorithm for local path planning of mobile robot"],"prefix":"10.1108","volume":"50","author":[{"given":"Xin","family":"Lai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia He","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"issue":"7","key":"key2022122715133488200_ref001","first-page":"1282","article-title":"Multi \u2010 objective optimal path planning using elitist non-dominated sorting genetic algorithms","volume":"17","year":"2013","journal-title":"Soft Computing"},{"issue":"5","key":"key2022122715133488200_ref002","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/21.44033","article-title":"Real-time obstacle avoidance for fast mobile robots","volume":"19","year":"1989","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"3","key":"key2022122715133488200_ref003","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/70.88137","article-title":"The vector field histogram-fast obstacle avoidance for mobile robots","volume":"7","year":"1991","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"1","key":"key2022122715133488200_ref004","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10514-020-09947-4","article-title":"Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment","volume":"45","year":"2021","journal-title":"Autonomous Robots"},{"issue":"6","key":"key2022122715133488200_ref005","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1080\/00207721.2014.929191","article-title":"UAV path planning using artificial potential field method updated by optimal control theory","volume":"47","year":"2016","journal-title":"International Journal of Systems Science"},{"key":"key2022122715133488200_ref006","first-page":"18","article-title":"VFH* based local path planning for mobile robot","year":"2019"},{"issue":"2","key":"key2022122715133488200_ref007","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1515\/cait-2015-0037","article-title":"An improved path planning method based on artificial potential field for a mobile robot","volume":"15","year":"2015","journal-title":"Cybernetics and Information Technologies"},{"key":"key2022122715133488200_ref008","first-page":"5971","article-title":"Velocity space approach with region analysis and look-ahead verification for robot navigation verification for robot navigation","year":"2009"},{"issue":"1","key":"key2022122715133488200_ref009","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/100.580977","article-title":"The dynamic window approach to collision avoidance","volume":"4","year":"1997","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"key2022122715133488200_ref010","first-page":"293","article-title":"Rapidly-exploring random trees: progress and prospects","volume-title":"Algorithmic and Computational Robotics: New Directions","year":"2000"},{"issue":"10","key":"key2022122715133488200_ref011","doi-asserted-by":"crossref","first-page":"9998","DOI":"10.1109\/TIE.2020.3020024","article-title":"Finite distribution estimation-based dynamic window approach to reliable obstacle avoidance of mobile robot","volume":"68","year":"2021","journal-title":"IEEE Transactions on Industrial Electronics"},{"issue":"3","key":"key2022122715133488200_ref012","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1108\/AA-12-2016-173","article-title":"Genetic algorithm-based compliant robot path planning: an improved Bi-RRT-based initialization method","volume":"37","year":"2017","journal-title":"Assembly Automation"},{"key":"key2022122715133488200_ref013","first-page":"6169","article-title":"Local path planning algorithm for blind-guiding robot based on improved DWA algorithm","year":"2019"},{"issue":"6","key":"key2022122715133488200_ref014","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","article-title":"Research on path planning of mobile robot based on improved ant colony algorithm","volume":"32","year":"2020","journal-title":"Neural Computing and Applications"},{"issue":"1","key":"key2022122715133488200_ref015","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","article-title":"Real-time obstacle avoidance for manipulators and mobile robots","volume":"5","year":"1986","journal-title":"The International Journal of Robotics Research"},{"issue":"1","key":"key2022122715133488200_ref016","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TSMCB.2003.811769","article-title":"A neural network approach to complete coverage path planning","volume":"34","year":"2004","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)"},{"key":"key2022122715133488200_ref017","first-page":"523","article-title":"A modified dynamic window approach to obstacle avoidance combined with fuzzy logic","year":"2015"}],"container-title":["Industrial Robot: the international journal of robotics research and application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-05-2022-0130\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-05-2022-0130\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:39:10Z","timestamp":1753393150000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/50\/1\/186-194\/433663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,16]]},"references-count":17,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,8,16]]},"published-print":{"date-parts":[[2023,1,2]]}},"alternative-id":["10.1108\/IR-05-2022-0130"],"URL":"https:\/\/doi.org\/10.1108\/ir-05-2022-0130","relation":{},"ISSN":["0143-991X","0143-991X"],"issn-type":[{"value":"0143-991X","type":"print"},{"value":"0143-991X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,16]]}}}