{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:21:39Z","timestamp":1761513699834},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_16","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T07:00:40Z","timestamp":1443510040000},"page":"208-221","source":"Crossref","is-referenced-by-count":14,"title":["Grid-Based Angle-Constrained Path Planning"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Yakovlev","sequence":"first","affiliation":[]},{"given":"Egor","family":"Baskin","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Hramoin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"issue":"10","key":"16_CR1","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. Communications of the ACM 22(10), 560\u2013570 (1979)","journal-title":"Communications of the ACM"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MRA.2008.921540","volume":"15","author":"P Bhattacharya","year":"2008","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Roadmap-based path planning-Using the Voronoi diagram for a clearance-based shortest path. IEEE Robotics & Automation Magazine 15(2), 58\u201366 (2008)","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-16958-8_22","volume-title":"Motion in Games","author":"M Kallmann","year":"2010","unstructured":"Kallmann, M.: Navigation queries from triangular meshes. In: Boulic, R., Chrysanthou, Y., Komura, T. (eds.) MIG 2010. LNCS, vol. 6459, pp. 230\u2013241. Springer, Heidelberg (2010)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-47922-8_4","volume-title":"Advances in Artificial Intelligence","author":"P Yap","year":"2002","unstructured":"Yap, P.: Grid-Based Path-Finding. In: Cohen, R., Spencer, B. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2338, pp. 44\u201355. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Transactions on Computational Intelligence and AI in Games 4(2), 144\u2013148 (2012)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"6","key":"16_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/2.30720","volume":"22","author":"A Elfes","year":"1989","unstructured":"Elfes, A.: Using occupancy grids for mobile robot perception and navigation. Computer 22(6), 46\u201357 (1989)","journal-title":"Computer"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"16_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 Transactions on Systems Science and Cybernetics 4(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"16_CR9","unstructured":"Likhachev, M., Gordon, G., Thrun, S.: ARA*: Anytime A* with Provable Bounds on Sub-Optimality, Advances in Neural Information Processing Systems 16 (NIPS). MIT Press, Cambridge (2004)"},{"issue":"1","key":"16_CR10","first-page":"7","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea, A., Muller, M., Schaeffer, J.: Near optimal hierarchical path finding. Journal of Game Development 1(1), 7\u201328 (2004)","journal-title":"Journal of Game Development"},{"key":"16_CR11","unstructured":"Likhachev, M., Stentz, A.: R* Search. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence. AAAI press, Menlo Park (2008)"},{"key":"16_CR12","unstructured":"Nash, A., Daniel, K., Koenig, S., Felner, A.: Theta*: any-angle path planning on grids. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, No. 2, p. 1177. AAAI Press, Menlo Park (2007)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Harabor, D., Grastien, A.: Online graph pruning for pathfinding on grid maps. In: AAAI 2011 (2011)","DOI":"10.1609\/aaai.v25i1.7994"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/TCST.2008.2012116","volume":"17","author":"Y Kuwata","year":"2009","unstructured":"Kuwata, Y., Karaman, S., Teo, J., Frazzoli, E., How, J.P., Fiore, G.: Real-time motion planning with applications to autonomous urban driving. IEEE Transactions on Control Systems Technology 17(5), 1105\u20131118 (2009)","journal-title":"IEEE Transactions on Control Systems Technology"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Munoz, P., Rodriguez-Moreno, M.: Improving efficiency in any-angle path-planning algorithms. In: 2012 6th IEEE International Conference Intelligent Systems (IS), pp. 213\u2013218. IEEE (2012)","DOI":"10.1109\/IS.2012.6335138"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.oceaneng.2014.03.034","volume":"84","author":"H Kim","year":"2014","unstructured":"Kim, H., Kim, D., Shin, J.U., Kim, H., Myung, H.: Angular rate-constrained path planning algorithm for unmanned surface vehicles. Ocean Engineering 84, 37\u201344 (2014)","journal-title":"Ocean Engineering"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1147\/sj.41.0025","volume":"4","author":"JE Bresenham","year":"1965","unstructured":"Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Systems Journal 4(1), 25\u201330 (1965)","journal-title":"IBM Systems Journal"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Pitteway, M.L.V.: Algorithms of conic generation. In: Fundamental Algorithms for Computer Graphics, pp. 219\u2013237. Springer, Heidelberg","DOI":"10.1007\/978-3-642-84574-1_11"},{"key":"16_CR19","unstructured":"http:\/\/wiki.openstreetmap.org\/wiki\/Database"},{"issue":"1","key":"16_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36(1), 267\u2013306 (2009)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T18:04:58Z","timestamp":1692036298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}