{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:12:59Z","timestamp":1744261979090},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534140"},{"type":"electronic","value":"9789811534157"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3415-7_35","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"418-430","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Research on Two-Stage Path Planning Algorithms for Storage Multi-AGV"],"prefix":"10.1007","author":[{"given":"Tao","family":"Mu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoling","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juntao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"4","key":"35_CR1","first-page":"17","volume":"35","author":"B Liu","year":"2016","unstructured":"Liu, B., Chen, X., Cheng, Z.: A dynamic multipath planning algorithm based on A* algorithm. Softw. Algorithms 35(4), 17\u201319 (2016)","journal-title":"Softw. Algorithms"},{"issue":"1","key":"35_CR2","first-page":"33","volume":"10","author":"W Li","year":"2015","unstructured":"Li, W., Su, X.: AGV path planning based on improved A* algorithm. Mod. Manuf. Eng. 10(1), 33\u201336 (2015)","journal-title":"Mod. Manuf. Eng."},{"issue":"12","key":"35_CR3","first-page":"7","volume":"230","author":"H Chen","year":"2018","unstructured":"Chen, H., Li, Y., Luo, J.: Path planning for mobile robots based on improved A* algorithm. Autom. Instrum. 230(12), 7\u201310 (2018)","journal-title":"Autom. Instrum."},{"issue":"06","key":"35_CR4","first-page":"967","volume":"46","author":"B Hu","year":"2012","unstructured":"Hu, B., Wang, B., Wang, C.: Dynamic routing of automated guided vehicles based on time window. J. Shanghai Jiaotong Univ. 46(06), 967\u2013971 (2012)","journal-title":"J. Shanghai Jiaotong Univ."},{"issue":"3","key":"35_CR5","first-page":"91","volume":"33","author":"B Li","year":"2019","unstructured":"Li, B., Yi, J.: The time-based multi-robot coordinated collision avoidance algorithm. J. Chongqing Univ. Technol. (Nat. Sci.) 33(3), 91\u201397 (2019)","journal-title":"J. Chongqing Univ. Technol. (Nat. Sci.)"},{"key":"35_CR6","unstructured":"Zahy, B., Ariel, F.: Conflict-oriented windowed hierarchical cooperative A*. In: IEEE International Conference on Robotics & Automation. IEEE (2014)"},{"issue":"6","key":"35_CR7","first-page":"150","volume":"37","author":"Z Xu","year":"2018","unstructured":"Xu, Z., Ma, Y.: Research on improved two-stage AGV path planning based on time window. Comput. Control Syst. 37(6), 150\u2013159 (2018)","journal-title":"Comput. Control Syst."},{"issue":"6","key":"35_CR8","first-page":"68","volume":"21","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Qin, S., Cheng, G.: Vehicle routing problem with time windows based on dynamic demand. Ind. Eng. Manag. 21(6), 68\u201374 (2016)","journal-title":"Ind. Eng. Manag."},{"issue":"12","key":"35_CR9","first-page":"155","volume":"538","author":"J Liu","year":"2018","unstructured":"Liu, J., Sun, W., Liu, M.: Path planning of automatic guided vehicle in warehousing logistics. Mod. Mach. Tool Autom. Mach. Technol. 538(12), 155\u2013159 (2018)","journal-title":"Mod. Mach. Tool Autom. Mach. Technol."},{"key":"35_CR10","unstructured":"Yu, H., Li, C.: Research and simulation of path planning for storage multi-AGV system. Comput. Eng. Appl. \nhttp:\/\/kns.cnki.net\/kcms\/detail\/11.2127.TP.20190705.1737.036.html"},{"issue":"05","key":"35_CR11","first-page":"138","volume":"43","author":"P Xing","year":"2019","unstructured":"Xing, P., Li, Q., Wei, W., et al.: Application of AGV path planning in intelligent storage based on improved A~* algorithms. Inf. Technol. 43(05), 138\u2013141 (2019)","journal-title":"Inf. Technol."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3415-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:18:41Z","timestamp":1585768721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3415-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534140","9789811534157"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3415-7_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"197","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":"121","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":"61% - 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":"3","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)"}}]}}