{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:40Z","timestamp":1759638100691,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"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-89543-3_47","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"565-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Ride-Hitching in UAV Travelling"],"prefix":"10.1007","author":[{"given":"Songhua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingjie","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor C. S.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1016\/j.neucom.2017.10.037","volume":"275","author":"J Wu","year":"2018","unstructured":"Wu, J., Wang, H., Li, N., Yao, P., Huang, Y., Yang, H.: Path planning for solar-powered UAV in urban environment. Neurocomputing 275, 2055\u20132065 (2018)","journal-title":"Neurocomputing"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"105004","DOI":"10.1016\/j.cor.2020.105004","volume":"123","author":"SH Chung","year":"2020","unstructured":"Chung, S.H., Sah, B., Lee, J.: Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions. Comput. Oper. Res. 123, 105004 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"47_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978782.1978791","volume":"7","author":"S Khuller","year":"2011","unstructured":"Khuller, S., Malekian, A., Mestre, J.: To fill or not to fill: the gas station problem. ACM Trans. Algorithms 7(3), 1\u201316 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Shan, F., Luo, J., Xiong, R., Wu, W., Li, J.: Looking before crossing: an optimal algorithm to minimize UAV energy by speed scheduling with a practical flight energy model. In: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 1758\u20131767. IEEE (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155376"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Di Franco, C., Buttazzo, G.: Energy-aware coverage path planning of UAVs. In: 2015 IEEE International Conference on Autonomous Robot Systems and Competitions, pp. 111\u2013117 (2015)","DOI":"10.1109\/ICARSC.2015.17"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Henchey, M.J., Batta, R., Karwan, M., Crassidis, A.: A flight time approximation model for unmanned aerial vehicles: estimating the effects of path variations and wind. In: Operations Research for Unmanned Systems, pp. 95\u2013117 (2016)","DOI":"10.1002\/9781118918937.ch6"},{"key":"47_CR7","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"2005","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"47_CR8","unstructured":"DHL Express. https:\/\/www.dhl.com\/tw-en\/home\/press\/press-archive\/2019\/dhl-express-launches-its-first-regular-fully-automated-and-intelligent-urban-drone-delivery-service. Accessed August 2021"},{"issue":"1\u20133","key":"47_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0304-3975(02)00409-7","volume":"295","author":"SO Krumke","year":"2003","unstructured":"Krumke, S.O., De Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. Theoret. Comput. Sci. 295(1\u20133), 279\u2013294 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"47_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The k-server problem. Comput. Sci. Rev. 3(2), 105\u2013118 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"47_CR11","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J. ACM (JACM) 42(5), 971\u2013983 (1995)","journal-title":"J. ACM (JACM)"},{"key":"47_CR12","unstructured":"Bienkowski, M., Liu, H.H.: An improved online algorithm for the traveling repairperson problem on a line. In: 44th International Symposium on Mathematical Foundations of Computer Science. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Coester, C., Koutsoupias, E.: The online $$k$$-taxi problem. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1136\u20131147 (2019)","DOI":"10.1145\/3313276.3316370"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-64843-5_31","volume-title":"Combinatorial Optimization and Applications","author":"S Li","year":"2020","unstructured":"Li, S., Li, M., Duan, L., Lee, V.C.S.: Online maximum k-interval coverage problem. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 455\u2013470. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64843-5_31"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Li, S., Li, M., Duan, L., Lee, V.C.S.: Online ride-hitching in UAV travelling. arXiv preprint. http:\/\/arxiv.org\/abs\/2108.09606 (2021)","DOI":"10.1007\/978-3-030-89543-3_47"},{"key":"47_CR16","unstructured":"Bokeno, E.T., Bort, T.M., Burns, S.S., Rucidlo, M., Wei, W., Wires, D.L.: U.S. Patent No. 9,915,956. U.S. Patent and Trademark Office, Washington, DC (2018)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:38:40Z","timestamp":1673577520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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.1","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":"2.2","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)"}}]}}