{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:25:55Z","timestamp":1755797155799},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30179-8_13","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:03:18Z","timestamp":1567983798000},"page":"154-167","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Monte-Carlo Search for Prize-Collecting Robot Motion Planning with Time Windows, Capacities, Pickups, and Deliveries"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Erion","family":"Plaku","sequence":"additional","affiliation":[]},{"given":"Yassin","family":"Warsame","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abdo, A., Edelkamp, S., Lawo, M.: Nested rollout policy adaptation for optimizing vehicle selection in complex VRPs. In: IEEE Conference on Local Computer Networks LCN, pp. 213\u2013221 (2016)","DOI":"10.1109\/LCN.2016.050"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Benton, J., Coles, A.J., Coles, A.: Temporal planning with preferences and time-dependent continuous costs. In: ICAPS, vol. 77, pp. 2\u201310 (2012)","DOI":"10.1609\/icaps.v22i1.13509"},{"key":"13_CR3","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Coltin, B., Veloso, M.: Online pickup and delivery planning with transfers for mobile robots. In: Workshops at the Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1109\/ICRA.2014.6907709"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TRO.2011.2160466","volume":"28","author":"IA \u015eucan","year":"2012","unstructured":"\u015eucan, I.A., Kavraki, L.E.: A sampling-based tree planner for systems with complex dynamics. IEEE Trans. Robot. 28(1), 116\u2013131 (2012)","journal-title":"IEEE Trans. Robot."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"3473","DOI":"10.1109\/LRA.2018.2853642","volume":"3","author":"S Edelkamp","year":"2018","unstructured":"Edelkamp, S., Lahijanian, M., Magazzeni, D., Plaku, E.: Integrating temporal reasoning and sampling-based motion planning for multi-goal problems with dynamics and time windows. IEEE Robot. Autom. Lett. 3, 3473\u20133480 (2018)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), pp. 44\u201351. IEEE (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"issue":"5\u20136","key":"13_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2008.10.012","volume":"173","author":"A Gerevini","year":"2009","unstructured":"Gerevini, A., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intell. 173(5\u20136), 619\u2013668 (2009)","journal-title":"Artif. Intell."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., \u0160vestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kiesel, S., Burns, E., Wilt, C., Ruml, W.: Integrating vehicle routing and motion planning. In: Twenty-Second International Conference on Automated Planning and Scheduling (2012)","DOI":"10.1609\/icaps.v22i1.13517"},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/MRA.2011.940276","volume":"18","author":"SM LaValle","year":"2011","unstructured":"LaValle, S.M.: Motion planning: the essentials. IEEE Robot. Autom. Mag. 18(1), 79\u201389 (2011)","journal-title":"IEEE Robot. Autom. Mag."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1613\/jair.1.11244","volume":"63","author":"D Le","year":"2018","unstructured":"Le, D., Plaku, E.: Cooperative, dynamics-based, and abstraction-guided multi-robot motion planning. J. Artif. Intell. Res. 63, 361\u2013390 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Nenchev, V., Belta, C., Raisch, J.: Optimal motion planning with temporal logic and switching constraints. In: 2015 European Control Conference (ECC), pp. 1141\u20131146. IEEE (2015)","DOI":"10.1109\/ECC.2015.7330693"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/TRO.2015.2424031","volume":"31","author":"E Plaku","year":"2015","unstructured":"Plaku, E.: Region-guided and sampling-based tree search for motion planning with dynamics. IEEE Trans. Robot. 31, 723\u2013735 (2015)","journal-title":"IEEE Trans. Robot."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Plaku, E., Rashidian, S., Edelkamp, S.: Multi-group motion planning in virtual environments. Comput. Anim. Virtual Worlds (2016, in press)","DOI":"10.1002\/cav.1688"},{"key":"13_CR17","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, pp. 649\u2013654 (2011)"},{"key":"13_CR18","volume-title":"Robot Modeling and Control","author":"MW Spong","year":"2005","unstructured":"Spong, M.W., Hutchinson, S., Vidyasagar, M.: Robot Modeling and Control. Wiley, Hoboken (2005)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume":"5131","author":"MH Winands","year":"2008","unstructured":"Winands, M.H., Bj\u00f6rnsson, Y., Saito, J.T.: Monte-carlo tree search solver. Comput. Games 5131, 25\u201336 (2008)","journal-title":"Comput. Games"}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:27:50Z","timestamp":1695169670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","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":"82","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":"16","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":"13","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":"20% - 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)"}}]}}