{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:38:35Z","timestamp":1726083515326},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030440503"},{"type":"electronic","value":"9783030440510"}],"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-44051-0_49","type":"book-chapter","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T20:02:40Z","timestamp":1588881760000},"page":"852-867","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hardness of 3D Motion Planning Under Obstacle Uncertainty"],"prefix":"10.1007","author":[{"given":"Luke","family":"Shimanuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Axelrod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"issue":"1\u20133","key":"49_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1177\/0278364915594029","volume":"35","author":"S Aine","year":"2016","unstructured":"Aine, S., Swaminathan, S., Narayanan, V., Hwang, V., Likhachev, M.: Multi-heuristic a*. Int. J. Robot. Res. 35(1\u20133), 224\u2013243 (2016)","journal-title":"Int. J. Robot. Res."},{"key":"49_CR2","unstructured":"Axelrod, B.: Algorithms for safe robot navigation. Master\u2019s thesis, Massachusetts Institute of Technology (2017)"},{"key":"49_CR3","first-page":"1760","volume":"13","author":"B Axelrod","year":"2017","unstructured":"Axelrod, B., Kaelbling, L., Lozano-Perez, T.: Provably safe robot navigation with obstacle uncertainty. Robot. Sci. Syst. 13, 1760\u20131774 (2017)","journal-title":"Robot. Sci. Syst."},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1177\/0278364918778338","volume":"37","author":"B Axelrod","year":"2018","unstructured":"Axelrod, B., Kaelbling, L.P., Lozano-P\u00e9rez, T.: Provably safe robot navigation with obstacle uncertainty. Int. J. Robot. Res. 37, 1760\u20131774 (2018)","journal-title":"Int. J. Robot. Res."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Bry, A., Roy, N.: Rapidly-exploring random belief trees for motion planning under uncertainty. In: 2011 IEEE International Conference on Robotics and Automation (ICRA), pp. 723\u2013730. IEEE (2011)","DOI":"10.1109\/ICRA.2011.5980508"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: Foundations of Computer Science, pp. 49 \u2013 60 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"49_CR8","unstructured":"Cassandra, A., Kaelbling, L., Kurien, J.: Acting under uncertainty: discrete Bayesian models for mobile-robot navigation. In: International Conference on Intelligent Robots and Systems, vol. 12, pp. 963\u2013972 (1996)"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Ding, X.C., Pinto, A., Surana, A.: Strategic planning under uncertainties via constrained Markov decision processes. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), pp. 4568\u20134575. IEEE (2013)","DOI":"10.1109\/ICRA.2013.6631226"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1137\/0213038","volume":"13","author":"J Hopcroft","year":"1984","unstructured":"Hopcroft, J., Joseph, D., Whitesides, S.: Movement problems for 2-dimensional linkages. SIAM J. Comput. 13, 610\u2013629 (1984)","journal-title":"SIAM J. Comput."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Feyzabadi, S., Carpin, S.: Multi-objective planning with multiple high level task specifications. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 5483\u20135490. IEEE (2016)","DOI":"10.1109\/ICRA.2016.7487762"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/0278364913507795","volume":"33","author":"K Hauser","year":"2014","unstructured":"Hauser, K.: The minimum constraint removal problem with three robotics applications. Int. J. Robot. Res. 33, 5\u201317 (2014)","journal-title":"Int. J. Robot. Res."},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Joseph, D., Whitesides, S.: On the movement of robot arms in 2-dimensional bounded regions. In: SIAM J. Comput. 14, 280\u2013289 (1982)","DOI":"10.1109\/SFCS.1982.29"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1177\/0278364913484072","volume":"32","author":"LP Kaelbling","year":"2013","unstructured":"Kaelbling, L.P., Lozano-P\u00e9rez, T.: Integrated task and motion planning in belief space. Int. J. Robot. Res. 32, 1194\u20131227 (2013)","journal-title":"Int. J. Robot. Res."},{"issue":"7","key":"49_CR15","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"issue":"4","key":"49_CR16","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, 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":"49_CR17","doi-asserted-by":"crossref","unstructured":"Kurniawati, H., Hsu, D., Lee, W.S.: SARSOP: efficient point-based POMDP planning by approximating optimally reachable belief spaces. In: Robotics: Science and Systems (2008)","DOI":"10.15607\/RSS.2008.IV.009"},{"key":"49_CR18","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). http:\/\/planning.cs.uiuc.edu\/"},{"key":"49_CR19","unstructured":"LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. In: ICRA (1999)"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Lee, A., Duan, Y., Patil, S., Schulman, J., McCarthy, Z., van\u00a0den Berg, J., Goldberg, K., Abbeel, P.: Sigma hulls for gaussian belief space planning for imprecise articulated robots amid obstacles. In: 2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 5660\u20135667. IEEE (2013)","DOI":"10.1109\/IROS.2013.6697176"},{"issue":"3","key":"49_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"CH Papadimitriou","year":"1987","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of markov decision processes. Math. Oper. Res. 12(3), 441\u2013450 (1987)","journal-title":"Math. Oper. Res."},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Platt, R., Tedrake, R., Kaelbling, L., Lozano-Perez, T.: Belief space planning assuming maximum likelihood observations. In: Proceedings of Robotics: Science and Systems. Zaragoza, Spain (2010)","DOI":"10.15607\/RSS.2010.VI.037"},{"key":"49_CR23","unstructured":"Prentice, S., Roy, N.: The belief roadmap: efficient planning in linear POMDPs by factoring the covariance. In: Proceedings of the 13th International Symposium of Robotics Research (ISRR), Hiroshima, Japan (2007)"},{"key":"49_CR24","doi-asserted-by":"crossref","unstructured":"Reif, J.: Complexity of the mover\u2019s problem and generalizations. In: Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pp. 421\u2013427 (1979)","DOI":"10.1109\/SFCS.1979.10"},{"key":"49_CR25","unstructured":"Sadigh, D., Kapoor, A.: Safe control under uncertainty with probabilistic signal temporal logic. In: Proceedings of Robotics: Science and Systems, Ann Arbor, Michigan (2016)"},{"key":"49_CR26","doi-asserted-by":"crossref","unstructured":"Salzman, O., Hou, B., Srinivasa, S.: Efficient motion planning for problems lacking optimal substructure. arXiv preprint arXiv:1703.02582 (2017)","DOI":"10.1609\/icaps.v27i1.13855"},{"key":"49_CR27","unstructured":"Salzman, O., Srinivasa, S.: Open problem on risk-aware planning in the plane. arXiv preprint arXiv:1612.05101 (2016)"},{"key":"49_CR28","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 1st edn. International Thomson Publishing, Stamford (1996)","edition":"1"},{"key":"49_CR29","unstructured":"Somani, A., Ye, N., Hsu, D., Sun Lee, W.: DESPOT: online POMDP planning with regularization. In: Advances in Neural Information Processing Systems, vol. 58 (2013)"}],"container-title":["Springer Proceedings in Advanced Robotics","Algorithmic Foundations of Robotics XIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44051-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T07:59:22Z","timestamp":1666511962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44051-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030440503","9783030440510"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44051-0_49","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"type":"print","value":"2511-1256"},{"type":"electronic","value":"2511-1264"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","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":"Merida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wafr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parasol.tamu.edu\/wafr\/wafr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}