{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:12:18Z","timestamp":1784905938643,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030891879","type":"print"},{"value":"9783030891886","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89188-6_12","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Dueling-DDPG Architecture for Mobile Robots Path Planning Based on Laser Range Findings"],"prefix":"10.1007","author":[{"given":"Panpan","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinfang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinglin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"80771","DOI":"10.1109\/ACCESS.2020.2990770","volume":"8","author":"N Bai","year":"2020","unstructured":"Bai, N., Wang, Z., Meng, F.: A stochastic attention CNN model for rumor stance classification. IEEE Access 8, 80771\u201380778 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2990770","journal-title":"IEEE Access"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"71675","DOI":"10.1109\/ACCESS.2019.2919656","volume":"7","author":"E Bj\u00f8rlykhaug","year":"2019","unstructured":"Bj\u00f8rlykhaug, E., Egeland, O.: Vision system for quality assessment of robotic cleaning of fish processing plants using CNN. IEEE Access 7, 71675\u201371685 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2919656","journal-title":"IEEE Access"},{"issue":"8","key":"12_CR3","doi-asserted-by":"publisher","first-page":"3189","DOI":"10.1109\/TIE.2011.2160510","volume":"59","author":"LM Capisani","year":"2012","unstructured":"Capisani, L.M., Ferrara, A.: Trajectory planning and second-order sliding mode motion\/interaction control for robot manipulators in unknown environments. IEEE Trans. Industr. Electron. 59(8), 3189\u20133198 (2012). https:\/\/doi.org\/10.1109\/TIE.2011.2160510","journal-title":"IEEE Trans. Industr. Electron."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"40728","DOI":"10.1109\/ACCESS.2021.3062375","volume":"9","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Bai, G., Zhan, Y., Hu, X., Liu, J.: Path planning and obstacle avoiding of the USV based on improved ACO-APF hybrid algorithm with adaptive early-warning. IEEE Access 9, 40728\u201340742 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3062375","journal-title":"IEEE Access"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Chen, Y., Li, H., Liu, F.: An adaptive routing algorithm based on multiple-path-finding dijkstra\u2019s and q-learning algorithm in silicon photonic interconnects on chip. In: 2020 IEEE 20th International Conference on Communication Technology (ICCT), pp. 117\u2013120 (2020). https:\/\/doi.org\/10.1109\/ICCT50939.2020.9295898","DOI":"10.1109\/ICCT50939.2020.9295898"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"59486","DOI":"10.1109\/ACCESS.2021.3073704","volume":"9","author":"Z Cui","year":"2021","unstructured":"Cui, Z., Wang, Y.: UAV path planning based on multi-layer reinforcement learning technique. IEEE Access 9, 59486\u201359497 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3073704","journal-title":"IEEE Access"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Drolshagen, S., Pfingsthorn, M., Gliesche, P., Hein, A.: Acceptance of industrial collaborative robots by people with disabilities in sheltered workshops. Front. Robot. AI 7, 173 (2021)","DOI":"10.3389\/frobt.2020.541741"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TIE.2005.847576","volume":"52","author":"MJ Er","year":"2005","unstructured":"Er, M.J., Deng, C.: Obstacle avoidance of a mobile robot using hybrid learning approach. IEEE Trans. Industr. Electron. 52(3), 898\u2013905 (2005). https:\/\/doi.org\/10.1109\/TIE.2005.847576","journal-title":"IEEE Trans. Industr. Electron."},{"key":"12_CR9","unstructured":"Fernandez, S.R.: Accuracy enhancement for robotic assembly of large-scale parts in the aerospace industry (2020)"},{"issue":"10","key":"12_CR10","doi-asserted-by":"publisher","first-page":"7841","DOI":"10.1109\/TIE.2018.2886763","volume":"66","author":"K Guo","year":"2019","unstructured":"Guo, K., Pan, Y., Yu, H.: Composite learning robot control with friction compensation: a neural network-based approach. IEEE Trans. Industr. Electron. 66(10), 7841\u20137851 (2019). https:\/\/doi.org\/10.1109\/TIE.2018.2886763","journal-title":"IEEE Trans. Industr. Electron."},{"key":"12_CR11","unstructured":"Hasselt, H.V., Guez, A., Silver, D.: Deep reinforcement learning with double q-learning. Computer Science (2015)"},{"key":"12_CR12","unstructured":"Henkemans, O., Pal, S., Werner, I., Neerincx, M.A., Looije, R.: Learning with charlie: a robot buddy for children with diabetes. In: the Companion of the 2017 ACM\/IEEE International Conference (2017)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hessel, M., et al.: Rainbow: combining improvements in deep reinforcement learning (2017)","DOI":"10.1609\/aaai.v32i1.11796"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. In: Proceedings. 1985 IEEE International Conference on Robotics and Automation, vol. 2, pp. 500\u2013505 (1985). https:\/\/doi.org\/10.1109\/ROBOT.1985.1087247","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Lee, S.B., Hun Yoo, S.: Design of the companion robot interaction for supporting major tasks of the elderly. In: 2017 14th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI), pp. 655\u2013659 (2017). https:\/\/doi.org\/10.1109\/URAI.2017.7992695","DOI":"10.1109\/URAI.2017.7992695"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Li, Y., Zhang, D., Yin, F., Zhang, Y.: Cleaning robot operation decision based on causal reasoning and attribute learning*. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 6878\u20136885 (2020). https:\/\/doi.org\/10.1109\/IROS45743.2020.9340930","DOI":"10.1109\/IROS45743.2020.9340930"},{"key":"12_CR17","unstructured":"Lillicrap, T.P., et al.: Continuous control with deep reinforcement learning. Computer Science (2015)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"147827","DOI":"10.1109\/ACCESS.2020.3015976","volume":"8","author":"M Luo","year":"2020","unstructured":"Luo, M., Hou, X., Yang, J.: Surface optimal path planning using an extended dijkstra algorithm. IEEE Access 8, 147827\u2013147838 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3015976","journal-title":"IEEE Access"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"dos Santos, M.G., Petrillo, F.: Towards automated acceptance testing for industrial robots (2021)","DOI":"10.1109\/IRC55401.2022.00066"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning: An Introduction. An Introduction, Reinforcement Learning (1998)","DOI":"10.1109\/TNN.1998.712192"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Tai, L., Paolo, G., Liu, M.: Virtual-to-real deep reinforcement learning: continuous control of mobile robots for mapless navigation. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 31\u201336 (2017). https:\/\/doi.org\/10.1109\/IROS.2017.8202134","DOI":"10.1109\/IROS.2017.8202134"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"59196","DOI":"10.1109\/ACCESS.2021.3070054","volume":"9","author":"G Tang","year":"2021","unstructured":"Tang, G., Tang, C., Claramunt, C., Hu, X., Zhou, P.: Geometric a-star algorithm: an improved a-star algorithm for agv path planning in a port environment. IEEE Access 9, 59196\u201359210 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3070054","journal-title":"IEEE Access"},{"issue":"9","key":"12_CR23","doi-asserted-by":"publisher","first-page":"2184","DOI":"10.1016\/j.engappai.2013.06.016","volume":"26","author":"YH Wang","year":"2013","unstructured":"Wang, Y.H., Li, T., Lin, C.J.: Backward q-learning: The combination of Sarsa algorithm and q-learning. Eng. Appl. Artif. Intell. 26(9), 2184\u20132193 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3\u20134","key":"12_CR24","first-page":"279","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins, C., Dayan, P.: Technical note: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Xin, J., Zhao, H., Liu, D., Li, M.: Application of deep reinforcement learning in mobile robot path planning. In: 2017 Chinese Automation Congress (CAC), pp. 7112\u20137116 (2017). https:\/\/doi.org\/10.1109\/CAC.2017.8244061","DOI":"10.1109\/CAC.2017.8244061"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Yang, R., Cheng, L.: Path planning of restaurant service robot based on a-star algorithms with updated weights. In: 2019 12th International Symposium on Computational Intelligence and Design (ISCID), vol. 1, pp. 292\u2013295 (2019). https:\/\/doi.org\/10.1109\/ISCID.2019.00074","DOI":"10.1109\/ISCID.2019.00074"},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1049\/trit.2020.0024","volume":"5","author":"Y Yang","year":"2020","unstructured":"Yang, Y., Li, J., Peng, L.: Multirobot path planning based on a deep reinforcement learning DQN algorithm. CAAI Trans. Intell. Technol. 5(3), 177\u2013183 (2020)","journal-title":"CAAI Trans. Intell. Technol."},{"key":"12_CR28","unstructured":"Yong, T., Wei, H., Wang, T., Chen, D.: A multi-layered interaction architecture for elderly companion robot. In: International Conference on Intelligent Robotics & Applications (2008)"},{"issue":"12","key":"12_CR29","doi-asserted-by":"publisher","first-page":"9625","DOI":"10.1109\/TIE.2018.2823691","volume":"65","author":"J Yuan","year":"2018","unstructured":"Yuan, J., Yang, S., Cai, J.: Consistent path planning for on-axle-hitching multisteering trailer systems. IEEE Trans. Industr. Electron. 65(12), 9625\u20139634 (2018). https:\/\/doi.org\/10.1109\/TIE.2018.2823691","journal-title":"IEEE Trans. Industr. Electron."},{"issue":"5","key":"12_CR30","doi-asserted-by":"publisher","first-page":"7621","DOI":"10.3233\/JIFS-200869","volume":"39","author":"T Zhao","year":"2020","unstructured":"Zhao, T., Li, H., Dian, S.: Multi-robot path planning based on improved artificial potential field and fuzzy inference system. J. Intell. Fuzzy Syst. 39(5), 7621\u20137637 (2020)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"19761","DOI":"10.1109\/ACCESS.2021.3053169","volume":"9","author":"DD Zhu","year":"2021","unstructured":"Zhu, D.D., Sun, J.Q.: A new algorithm based on dijkstra for vehicle path planning considering intersection attribute. IEEE Access 9, 19761\u201319775 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3053169","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T17:05:26Z","timestamp":1699722326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"382","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}