{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T14:12:43Z","timestamp":1769695963608,"version":"3.49.0"},"reference-count":21,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"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":[[2024,7,2]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The purpose of this paper is to propose a new velocity prediction navigation algorithm to develop a conflict-free path for robots in dynamic crowded environments. The algorithm BP-prediction and reciprocal velocity obstacle (PRVO) combines the BP neural network for velocity PRVO to accomplish dynamic collision avoidance.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This presented method exhibits innovation by anticipating ahead velocities using BP neural networks to reconstruct the velocity obstacle region; determining the optimized velocity corresponding to the robot\u2019s scalable radius range from the error generated by the non-holonomic robot tracking the desired trajectory; and considering acceleration constraints, determining the set of multi-step reachable velocities of non-holonomic robot in the space of velocity variations.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The method is validated using three commonly used metrics of collision rate, travel time and average distance in a comparison between simulation experiments including multiple differential drive robots and physical experiments using the Turtkebot3 robot. The experimental results show that our method outperforms other RVO extension methods on the three metrics.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>In this paper, the authors propose navigation algorithms capable of adaptively selecting the optimal speed for a multi-robot system to avoid robot collisions during dynamic crowded interactions.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ir-12-2023-0337","type":"journal-article","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:45:44Z","timestamp":1712303144000},"page":"607-616","source":"Crossref","is-referenced-by-count":2,"title":["Multi-robot navigation based on velocity obstacle prediction in dynamic crowded environments"],"prefix":"10.1108","volume":"51","author":[{"given":"Yimei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoquan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tohru","family":"Kamiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2024,4,8]]},"reference":[{"issue":"4","key":"key2024070211044575300_ref001","first-page":"47","article-title":"A PSO-Optimized reciprocal velocity obstacles algorithm for navigation of multiple mobile robots","volume":"3","year":"2014","journal-title":"IAES International Journal of Robotics and Automation (IJRA)"},{"issue":"2","key":"key2024070211044575300_ref002","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TRO.2018.2793890","article-title":"Cooperative collision avoidance for nonholonomic robots","volume":"34","year":"2018","journal-title":"IEEE Transactions on Robotics"},{"key":"key2024070211044575300_ref003","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/ICRA.2012.6225166","article-title":"Reciprocal collision avoidance for multiple car-like robots","volume-title":"2012 IEEE International Conference on Robotics and Automation","year":"2012"},{"key":"key2024070211044575300_ref004","first-page":"203","article-title":"Optimal reciprocal collision avoidance for multiple non-holonomic robots","volume-title":"Distributed autonomous robotic systems: The 10th international symposium","year":"2013"},{"key":"key2024070211044575300_ref005","doi-asserted-by":"crossref","first-page":"8097","DOI":"10.1109\/IROS51168.2021.9636618","article-title":"V-RVO: decentralized multi-agent collision avoidance using Voronoi diagrams and reciprocal velocity obstacles","volume-title":"2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","year":"2021"},{"key":"key2024070211044575300_ref006","doi-asserted-by":"crossref","first-page":"102196","DOI":"10.1016\/j.rcim.2021.102196","article-title":"Path planning for manipulators based on an improved probabilistic roadmap method","volume":"72","year":"2021","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"key2024070211044575300_ref007","first-page":"2013","article-title":"Indicator probabilistic acceleration velocity obstacles for dynamic collision avoidance in uncertain environments","volume-title":"AIAA SciTech 2021 Forum","year":"2021"},{"key":"key2024070211044575300_ref008","first-page":"7829","article-title":"NAVREP: unsupervised representations for reinforcement learning of robot navigation in dynamic human environments","year":"2021"},{"issue":"7","key":"key2024070211044575300_ref009","first-page":"760","article-title":"Motion planning in dynamic environments using velocity obstacles","volume":"17","year":"2016","journal-title":"The International Journal of Robotics Research"},{"issue":"4","key":"key2024070211044575300_ref010","doi-asserted-by":"crossref","first-page":"3011","DOI":"10.1007\/s11063-021-10536-4","article-title":"Research on robot motion planning based on RRT algorithm with nonholonomic constraints","volume":"53","year":"2021","journal-title":"Neural Processing Letters"},{"key":"key2024070211044575300_ref011","first-page":"8627","article-title":"Kinematic constraints based Bi-directional RRT (KB-RRT) with parameterized trajectories for robot path planning in cluttered environment","year":"2019"},{"issue":"1","key":"key2024070211044575300_ref012","first-page":"90","article-title":"Real-Time obstacle avoidance for manipulators and mobile robots","volume":"5","year":"2016","journal-title":"The International Journal of Robotics Research"},{"key":"key2024070211044575300_ref013","first-page":"4172","article-title":"Reflective navigation: individual behaviors and group behaviors","year":"2004"},{"key":"key2024070211044575300_ref014","first-page":"1","article-title":"Path planning for smart car based on Dijkstra algorithm and dynamic window approach","volume":"2021","year":"2021","journal-title":"Wireless Communications and Mobile Computing"},{"issue":"1","key":"key2024070211044575300_ref015","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1108\/IR-05-2015-0096","article-title":"KidVO: a kinodynamically consistent algorithm for online motion planning in dynamic environments","volume":"43","year":"2016","journal-title":"Industrial Robot: An International Journal"},{"issue":"84","key":"key2024070211044575300_ref016","doi-asserted-by":"crossref","first-page":"eadf7843","DOI":"10.1126\/scirobotics.adf7843","article-title":"Motion planning around obstacles with convex optimization","volume":"8","year":"2023","journal-title":"Science Robotics"},{"key":"key2024070211044575300_ref017","first-page":"1928","article-title":"Reciprocal velocity obstacles for real-time multi-agent navigation","year":"2008"},{"key":"key2024070211044575300_ref018","first-page":"3","article-title":"Reciprocal n-body collision avoidance","year":"2011"},{"issue":"4","key":"key2024070211044575300_ref019","doi-asserted-by":"crossref","first-page":"1748","DOI":"10.1109\/TASE.2020.2976560","article-title":"Neural RRT*: learning-based optimal path planning","volume":"17","year":"2020","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"4","key":"key2024070211044575300_ref020","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1108\/01439911011044840","article-title":"Real\u2010time motion planning for mobile robots by means of artificial potential field method in unknown environment","volume":"37","year":"2010","journal-title":"Industrial Robot: An International Journal"},{"issue":"4","key":"key2024070211044575300_ref021","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1108\/AA-07-2020-0095","article-title":"Robot navigation based on improved a* algorithm in dynamic environment","volume":"41","year":"2021","journal-title":"Assembly Automation"}],"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-12-2023-0337\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-12-2023-0337\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:40:44Z","timestamp":1753393244000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/51\/4\/607-616\/1217008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,8]]},"references-count":21,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4,8]]},"published-print":{"date-parts":[[2024,7,2]]}},"alternative-id":["10.1108\/IR-12-2023-0337"],"URL":"https:\/\/doi.org\/10.1108\/ir-12-2023-0337","relation":{},"ISSN":["0143-991X","0143-991X"],"issn-type":[{"value":"0143-991X","type":"print"},{"value":"0143-991X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,8]]}}}