{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:38:27Z","timestamp":1742960307506,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319165943"},{"type":"electronic","value":"9783319165950"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-16595-0_40","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T13:42:10Z","timestamp":1430314930000},"page":"695-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Asymptotically Optimal Feedback Planning: FMM Meets Adaptive Mesh Refinement"],"prefix":"10.1007","author":[{"given":"Dmitry S.","family":"Yershov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Frazzoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S1064827597323373","volume":"22","author":"D Arnold","year":"2000","unstructured":"Arnold, D., Mukherjee, A., Pouly, L.: Locally adapted tetrahedral meshes using bisection. SIAM J. Sci. Comput. 22(2), 431\u2013448 (2000)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"40_CR2","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/0715049","volume":"15","author":"I Babu\u0161ka","year":"1978","unstructured":"Babu\u0161ka, I., Rheinboldt, W.: Error estimates for adaptive finite element computations. SIAM J. Numer. Anal. 15(4), 736\u2013754 (1978)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0378-4754(80)90098-1","volume":"22","author":"RE Bank","year":"1980","unstructured":"Bank, R.E., Sherman, A.H.: The use of adaptive grid refinement for badly behaved elliptic partial differential equations. Math. Comput. Simul. 22(1), 18\u201324 (1980)","journal-title":"Math. Comput. Simul."},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0899-8248(91)90006-G","volume":"3","author":"E B\u00e4nsch","year":"1991","unstructured":"B\u00e4nsch, E.: Local mesh refinement in 2 and 3 dimensions. IMPACT Comput. Sci. Eng. 3(3), 181\u2013191 (1991)","journal-title":"IMPACT Comput. Sci. Eng."},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcph.1998.6007","volume":"145","author":"TJ Barth","year":"1998","unstructured":"Barth, T.J., Sethian, J.A.: Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains. J. Comput. Phys. 145(1), 1\u201340 (1998)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02238487","volume":"55","author":"J Bey","year":"1995","unstructured":"Bey, J.: Tetrahedral grid refinement. Computing 55(4), 355\u2013378 (1995)","journal-title":"Computing"},{"issue":"2","key":"40_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/060669073","volume":"51","author":"J Brandts","year":"2009","unstructured":"Brandts, J., Korotov, S., K\u0159\u00ed\u017eek, M., \u0160olc, J.: On nonobtuse simplicial partitions. SIAM Rev. 51(2), 317\u2013335 (2009)","journal-title":"SIAM Rev."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: Proceedings of 28th Annual Symposium on Foundations of Computer Science, October 1987, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"issue":"1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.jcp.2003.07.030","volume":"192","author":"J-H Choi","year":"2003","unstructured":"Choi, J.-H., Byun, K.-R., Hwang, H.-J.: Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching. J. Comput. Phys. 192(1), 312\u2013324 (2003)","journal-title":"J. Comput. Phys."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Choi, J., Sellen, J., Yap, C.K.: Approximate euclidean shortest path in 3-space. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, series SCG\u201994, pp. 41\u201348. ACM, New York (1994)","DOI":"10.1145\/177424.177501"},{"issue":"167","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0025-5718-1984-0744921-8","volume":"43","author":"MG Crandall","year":"1984","unstructured":"Crandall, M.G., Lions, P.L.: Two approximations of solutions of Hamilton-Jacobi equations. Math. Comput. 43(167), 1\u201319 (1984)","journal-title":"Math. Comput."},{"key":"40_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7793-9","volume-title":"Differential Equations with Discontinuous Righthand Sides: Control Systems","author":"AF Filippov","year":"1988","unstructured":"Filippov, A.F.: Differential Equations with Discontinuous Righthand Sides: Control Systems, 1st edn. Springer, New York (1988)","edition":"1"},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., 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."},{"key":"40_CR14","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, 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"40_CR15","unstructured":"Janson, L., Pavone, M.: Fast marching trees: a fast marching sampling-based method for optimal motion planning in many dimensions\u2014extended version (2013). http:\/\/arxiv.org\/abs\/1306.3532"},{"issue":"7","key":"40_CR16","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."},{"key":"40_CR17","unstructured":"Koenig, S., Likhachev, M.: D* lite. In: AAAI Conference of Artificial Intelligence (2002)"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1), 93\u2013146 (2004)","journal-title":"Artif. Intell."},{"issue":"2","key":"40_CR19","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/S003614290037040X","volume":"39","author":"S Korotov","year":"2001","unstructured":"Korotov, S., K\u0159\u00ed\u017eek, M.: Acute type refinements of tetrahedral partitions of polyhedral domains. SIAM J. Numer. Anal. 39(2), 724\u2013733 (2001)","journal-title":"SIAM J. Numer. Anal."},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TRO.2012.2234312","volume":"29","author":"J Marble","year":"2013","unstructured":"Marble, J., Bekris, K.E.: Asymptotically near-optimal planning with probabilistic roadmap spanners. IEEE Trans. Robot. 29, 432\u2013444 (2013)","journal-title":"IEEE Trans. Robot."},{"issue":"1","key":"40_CR21","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0916014","volume":"16","author":"J Maubach","year":"1995","unstructured":"Maubach, J.: Local bisection refinement for n-simplicial grids generated by reflection. SIAM J. Sci. Comput. 16(1), 210\u2013227 (1995)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"40_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JSB Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(3), 309\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"40_CR23","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"JSB Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"40_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0913009","volume":"13","author":"W Mitchell","year":"1992","unstructured":"Mitchell, W.: Optimal multilevel iterative methods for adaptive grids. SIAM J. Sci. Stat. Comput. 13(1), 146\u2013167 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"5","key":"40_CR25","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20(5), 259\u2013263 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"40_CR26","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1016\/j.amc.2012.08.029","volume":"219","author":"F Perdomo","year":"2012","unstructured":"Perdomo, F., Plaza, A.: A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes. Appl. Math. Comput. 219(4), 2342\u20132344 (2012)","journal-title":"Appl. Math. Comput."},{"key":"40_CR27","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.amc.2013.06.075","volume":"221","author":"F Perdomo","year":"2013","unstructured":"Perdomo, F., Plaza, A.: Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric. Appl. Math. Comput. 221, 424\u2013432 (2013)","journal-title":"Appl. Math. Comput."},{"key":"40_CR28","doi-asserted-by":"crossref","unstructured":"Perez, A., Platt, R., Konidaris, G., Kaelbling, L., Lozano-Perez, T.: LQR-RRT*: optimal sampling-based motion planning with automatically derived extension heuristics. In: 2012 IEEE International Conference on Robotics and Automation (ICRA), May 2012, pp. 2537\u20132542. IEEE (2012)","DOI":"10.1109\/ICRA.2012.6225177"},{"issue":"10","key":"40_CR29","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"TL P\u00e9rez","year":"1979","unstructured":"P\u00e9rez, T.L., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"40_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0168-9274(99)00022-7","volume":"32","author":"A Plaza","year":"2000","unstructured":"Plaza, A., Carey, G.F.: Local refinement of simplicial grids based on the skeleton. Appl. Numer. Math. 32(2), 195\u2013218 (2000)","journal-title":"Appl. Numer. Math."},{"issue":"1\u20132","key":"40_CR31","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/S0377-0427(01)00484-8","volume":"140","author":"A Plaza","year":"2002","unstructured":"Plaza, A., Rivara, M.-C.: On the adjacencies of triangular meshes based on skeleton-regular partitions. J. Comput. Appl. Math. 140(1\u20132), 673\u2013693 (2002)","journal-title":"J. Comput. Appl. Math."},{"issue":"7","key":"40_CR32","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1002\/nme.1620240710","volume":"24","author":"M-C Rivara","year":"1987","unstructured":"Rivara, M.-C.: A grid generator based on 4-triangles conforming mesh-refinement algorithms. Int. J. Numer. Methods Eng. 24(7), 1343\u20131354 (1987)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"5","key":"40_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/cnm.1630080502","volume":"8","author":"M-C Rivara","year":"1992","unstructured":"Rivara, M.-C., Levin, C.: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques. Commun. Appl. Numer. Methods 8(5), 281\u2013290 (1992)","journal-title":"Commun. Appl. Numer. Methods"},{"issue":"130","key":"40_CR34","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1090\/S0025-5718-1975-0375068-5","volume":"29","author":"IG Rosenberg","year":"1975","unstructured":"Rosenberg, I.G., Stenger, F.: A lower bound on the angles of triangles constructed by bisecting the longest side. Math. Comput. 29(130), 390\u2013395 (1975)","journal-title":"Math. Comput."},{"issue":"4","key":"40_CR35","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"JA Sethian","year":"1996","unstructured":"Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591\u20131595 (1996)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"11","key":"40_CR36","doi-asserted-by":"publisher","first-page":"5699","DOI":"10.1073\/pnas.090060097","volume":"97","author":"JA Sethian","year":"2000","unstructured":"Sethian, J.A., Vladimirsky, A.: Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes. Proc. Natl. Acad. Sci. 97(11), 5699\u20135703 (2000)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"40_CR37","unstructured":"Stentz, A.: The focussed D* algorithm for real-time replanning. In: International Joint Conference on Artificial Intelligence, August 1995"},{"key":"40_CR38","doi-asserted-by":"crossref","unstructured":"Webb, D.J., van den Berg, J.: Kinodynamic RRT*: asymptotically optimal motion planning for robots with linear dynamics. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), May 2013, pp. 5054\u20135061. IEEE (2013)","DOI":"10.1109\/ICRA.2013.6631299"},{"issue":"17","key":"40_CR39","doi-asserted-by":"publisher","first-page":"2065","DOI":"10.1080\/01691864.2012.729559","volume":"26","author":"DS Yershov","year":"2012","unstructured":"Yershov, D.S., LaValle, S.M.: Simplicial Dijkstra and A* algorithms: from graphs to continuous spaces. Adv. Robot. 26(17), 2065\u20132085 (2012)","journal-title":"Adv. Robot."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16595-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:50:19Z","timestamp":1676947819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16595-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165943","9783319165950"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16595-0_40","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}