{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:10Z","timestamp":1742914210417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"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-3-030-39881-1_30","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"342-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Train Scheduling: Hardness and Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3471-2706","authenticated-orcid":false,"given":"Christian","family":"Scheffer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"30_CR1","unstructured":"Akella, S., Hutchinson, S.: Coordinating the motions of multiple robots with specified trajectories. In: Proceedings of the 2002 IEEE International Conference on Robotics and Automation, ICRA 2002, Washington, DC, USA, 11\u201315 May 2002, pp. 624\u2013631 (2002)"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1177\/027836498400300405","volume":"3","author":"JE Hopcroft","year":"1984","unstructured":"Hopcroft, J.E., Schwartz, J.T., Sharir, M.: On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the warehouseman\u2019s problem. Int. J. Rob. Res. 3(4), 76\u201388 (1984)","journal-title":"Int. J. Rob. Res."},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1177\/027836498600500304","volume":"5","author":"K Kant","year":"1986","unstructured":"Kant, K., Zucker, S.W.: Toward efficient trajectory planning: the path-velocity decomposition. Int. J. Rob. Res. 5(3), 72\u201389 (1986)","journal-title":"Int. J. Rob. Res."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-32552-1_7","volume-title":"Springer Handbook of Robotics","author":"LE Kavraki","year":"2016","unstructured":"Kavraki, L.E., LaValle, S.M.: Motion planning. In: Siciliano, B., Khatib, O. (eds.) Springer Handbook of Robotics, pp. 139\u2013162. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-32552-1_7"},{"key":"30_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"JC Latombe","year":"1991","unstructured":"Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Norwell (1991)"},{"key":"30_CR7","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)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, P.A., Lozano-P\u00e9rez, T.: Deadlock-free and collision-free coordination of two robot manipulators. In: Proceedings of the 1989 IEEE International Conference on Robotics and Automation, Scottsdale, Arizona, USA, 14\u201319 May 1989, pp. 484\u2013489 (1989)","DOI":"10.1109\/ROBOT.1989.100033"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1145\/179812.179911","volume":"41","author":"JH Reif","year":"1994","unstructured":"Reif, J.H., Sharir, M.: Motion planning in the presence of moving obstacles. J. ACM 41(4), 764\u2013790 (1994)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:34Z","timestamp":1582139194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","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":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}