{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:44:58Z","timestamp":1742931898957,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811681738"},{"type":"electronic","value":"9789811681745"}],"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-981-16-8174-5_10","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Calculation Time Prediction-Based Multiflow Network Path Planning Method for the AGV Sorting System"],"prefix":"10.1007","author":[{"given":"Ke","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaguang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans. Robot. 32(5), 1163\u20131177 (2016)","journal-title":"IEEE Trans. Robot."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"10_CR3","unstructured":"Boyarski, E., et al.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 740\u2013746. AAAI Press, Buenos Aires (2015)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Felner, A., et al.: Adding heuristics to conflict-based search for multi-agent path finding. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 83\u201387. AAAI Press, The Netherlands (2018)","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Li, J., Surynek, P., Felner, A., Ma, H., Kumar, T.S., Koenig, S.: Multi-agent path finding for large agents. In: Proceedings of the 33th AAAI Conference on Artificial Intelligence, pp. 7627\u20137634. AAAI Press, Hawaii (2019)","DOI":"10.1609\/aaai.v33i01.33017627"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Li, J., Felner, A., Boyarski, E., Ma, H., Koenig, S.: Improved heuristics for multi-agent path finding with conflict-based search. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 442\u2013449. AAAI Press, Macao (2019)","DOI":"10.24963\/ijcai.2019\/63"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: the IEEE International Conference on Robotics and Automation, pp. 3612\u20133617. IEEE, Germany (2013)","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Fast, near-optimal computation for multi-robot path planning on graphs. In: 27th AAAI Conference on Artificial Intelligence, pp. 155\u2013157. AAAI Press, Washington (2013)","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"106270","DOI":"10.1016\/j.cie.2020.106270","volume":"141","author":"K Murakami","year":"2020","unstructured":"Murakami, K.: Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system. Comput. Ind. Eng. 141, 106270 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TASE.2010.2043096","volume":"7","author":"T Nishi","year":"2010","unstructured":"Nishi, T., Maeno, R.: Petri net decomposition approach to optimization of route planning problems for AGV systems. IEEE Trans. Autom. Sci. Eng. 7(3), 523\u2013537 (2010)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TSMCA.2012.2183353","volume":"42","author":"T Nishi","year":"2012","unstructured":"Nishi, T., Tanaka, Y.: Petri net decomposition approach for dispatching and conflict-free routing of bidirectional automated guided vehicle systems. IEEE Trans. Syst. Man Cybern. Syst. 42(5), 1230\u20131243 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Bnaya, Z., Felner, A.: Conflict-oriented windowed hierarchical cooperative A*. In: 2014 IEEE International Conference on Robotics and Automation, pp. 3743\u20133748. IEEE, Hong Kong (2014)","DOI":"10.1109\/ICRA.2014.6907401"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/LRA.2020.2967326","volume":"5","author":"SD Han","year":"2020","unstructured":"Han, S.D., Yu, J.: DDM: fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics. IEEE Robot. Autom. Lett. 5(2), 1350\u20131357 (2020)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10_CR14","unstructured":"Liu, Z., Wang, H., Wei, H., Liu, M., Liu, Y.H.: Prediction, planning, and coordination of thousand-warehousing-robot networks with motion and communication uncertainties. IEEE Trans. Autom. Sci. Eng. 1\u201313 (2020)"}],"container-title":["Communications in Computer and Information Science","Wireless Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-8174-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T23:05:57Z","timestamp":1673910357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-8174-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811681738","9789811681745"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-8174-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CWSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China Conference on Wireless Sensor Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guilin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwsn2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/web\/html5\/index.html?globalId=m8310963194006118401618190403568&type=1","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":"Conference website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"19","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":"32% - 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)"}}]}}