{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:51:01Z","timestamp":1742989861444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49614-1_17","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"227-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Parameter Adaptive Path Planning Algorithm"],"prefix":"10.1007","author":[{"given":"Guangyu","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11370-020-00313-y","volume":"13","author":"H Chen","year":"2020","unstructured":"Chen, H., Ji, Y., Niu, L.: Reinforcement learning path planning algorithm based on obstacle area expansion strategy. Intell. Serv. Robot. 13(2), 289\u2013297 (2020)","journal-title":"Intell. Serv. Robot."},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/LRA.2020.2965857","volume":"5","author":"A Devo","year":"2020","unstructured":"Devo, A., Costante, G., Valigi, P.: Deep reinforcement learning for instruction following visual navigation in 3D maze-like environments. IEEE Rob. Autom. Lett. 5(2), 1175\u20131182 (2020)","journal-title":"IEEE Rob. Autom. Lett."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287\u2013290 (2022)","DOI":"10.1145\/3544585.3544600"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/JAS.2019.1911732","volume":"7","author":"L Jiang","year":"2019","unstructured":"Jiang, L., Huang, H., Ding, Z.: Path planning for intelligent robots based on deep q-learning with experience replay and heuristic knowledge. IEEE\/CAA J. Automatica Sinica 7(4), 1179\u20131189 (2019)","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","volume":"15","author":"B Patle","year":"2019","unstructured":"Patle, B., Pandey, A., Parhi, D., Jagadeesh, A., et al.: A review: on path planning strategies for navigation of mobile robot. Defence Technol. 15(4), 582\u2013606 (2019)","journal-title":"Defence Technol."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10846-017-0468-y","volume":"86","author":"AS Polydoros","year":"2017","unstructured":"Polydoros, A.S., Nalpantidis, L.: Survey of model-based reinforcement learning: applications on robotics. J. Intell. Rob. Syst. 86(2), 153\u2013173 (2017)","journal-title":"J. Intell. Rob. Syst."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Santiago, R.M.C., De Ocampo, A.L., Ubando, A.T., Bandala, A.A., Dadios, E.P.: Path planning for mobile robots using genetic algorithm and probabilistic roadmap. In: 2017IEEE 9th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM), pp. 1\u20135. IEEE (2017)","DOI":"10.1109\/HNICEM.2017.8269498"},{"key":"17_CR9","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01551-9","volume-title":"Algorithms for Reinforcement Learning","author":"C Szepesv\u00e1ri","year":"2022","unstructured":"Szepesv\u00e1ri, C.: Algorithms for Reinforcement Learning. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-01551-9"},{"issue":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1177\/01423312211043001","volume":"44","author":"J Wei","year":"2022","unstructured":"Wei, J., De Hua, Z., Shuangbao, M., Gaocheng, Y., Wei, C.: Dynamic walking characteristics and control of four-wheel mobile robot on ultra-high voltage multi-split transmission line. Trans. Inst. Meas. Control. 44(6), 1309\u20131322 (2022)","journal-title":"Trans. Inst. Meas. Control."},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1049\/trit.2020.0024","volume":"5","author":"Y Yang","year":"2020","unstructured":"Yang, Y., Juntao, L., Lingling, P.: Multi-robot 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."},{"issue":"10","key":"17_CR13","doi-asserted-by":"publisher","first-page":"450","DOI":"10.3390\/sym10100450","volume":"10","author":"HY Zhang","year":"2018","unstructured":"Zhang, H.Y., Lin, W.M., Chen, A.X.: Path planning for the mobile robot: a review. Symmetry 10(10), 450 (2018)","journal-title":"Symmetry"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:03:52Z","timestamp":1707555832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"0","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":"62% - 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":"6","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)"}}]}}