{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:11:02Z","timestamp":1742933462888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210891"},{"type":"electronic","value":"9783031210907"}],"license":[{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21090-7_32","type":"book-chapter","created":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T18:11:35Z","timestamp":1671041495000},"page":"540-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lower Bounding Framework for Motion Planning Amid Dynamic Obstacles in 2D"],"prefix":"10.1007","author":[{"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Howie","family":"Choset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,15]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 49\u201360. IEEE (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"32_CR2","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press (2005)"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2514\/2.4856","volume":"25","author":"E Frazzoli","year":"2002","unstructured":"Frazzoli, E., Dahleh, M.A., Feron, E.: Real-time motion planning for agile autonomous vehicles. J. Guid. Control. Dyn. 25(1), 116\u2013129 (2002)","journal-title":"J. Guid. Control. Dyn."},{"issue":"5","key":"32_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1177\/027836499401300502","volume":"13","author":"K Fujimura","year":"1994","unstructured":"Fujimura, K.: Motion planning amid transient obstacles. Int. J. Robot. Res. 13(5), 395\u2013407 (1994)","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01908631","volume":"10","author":"K Fujimura","year":"1993","unstructured":"Fujimura, K., Samet, H.: Planning a time-minimal motion among moving obstacles. Algorithmica 10(1), 41\u201363 (1993)","journal-title":"Algorithmica"},{"key":"32_CR6","unstructured":"Gochev, K., Cohen, B., Butzke, J., Safonova, A., Likhachev, M.: Path planning with adaptive dimensionality. In: Fourth Annual Symposium on Combinatorial Search (2011)"},{"key":"32_CR7","unstructured":"Halperin, D., Salzman, O., Sharir, M.: Algorithmic motion planning. In: Handbook of Discrete and Computational Geometry, pp. 1311\u20131342. Chapman and Hall\/CRC (2017)"},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"6","key":"32_CR9","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1177\/027836402320556421","volume":"21","author":"D Hsu","year":"2002","unstructured":"Hsu, D., Kindel, R., Latombe, J.C., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. Int. J. Robot. Res. 21(3), 233\u2013255 (2002)","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"32_CR11","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. Robot. Res. 5(3), 72\u201389 (1986)","journal-title":"Int. J. Robot. Res."},{"key":"32_CR12","unstructured":"Latombe, J.C.: Robot Motion Planning, vol. 124. Springer Science & Business Media (2012)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546877"},{"issue":"10","key":"32_CR14","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Nouri, A., Sack, J.R.: Shortest paths among transient obstacles. J. Comb. Optim. 1\u201339 (2020)","DOI":"10.1007\/s10878-020-00604-1"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Phillips, M., Likhachev, M.: Sipp: safe interval path planning for dynamic environments. In: 2011 IEEE International Conference on Robotics and Automation, pp. 5628\u20135635. IEEE (2011)","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Ren, Z., Gong, C., Choset, H.: Deformed state lattice planning. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 6307\u20136312. IEEE (2017)","DOI":"10.1109\/IROS.2017.8206534"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21090-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T18:20:45Z","timestamp":1671042045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21090-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,15]]},"ISBN":["9783031210891","9783031210907"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21090-7_32","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"type":"print","value":"2511-1256"},{"type":"electronic","value":"2511-1264"}],"subject":[],"published":{"date-parts":[[2022,12,15]]},"assertion":[{"value":"15 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAFR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Algorithmic Foundations of Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":", MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wafr2022.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}