{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:08:00Z","timestamp":1746504480206,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444399"},{"type":"electronic","value":"9783662444405"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44440-5_17","type":"book-chapter","created":{"date-parts":[[2014,10,30]],"date-time":"2014-10-30T04:56:22Z","timestamp":1414644982000},"page":"277-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diverse Planning for UAV Trajectories"],"prefix":"10.1007","author":[{"given":"Jan","family":"To\u017ei\u010dka","sequence":"first","affiliation":[]},{"given":"David","family":"\u0160i\u0161l\u00e1k","sequence":"additional","affiliation":[]},{"given":"Michal","family":"P\u011bchou\u010dek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,31]]},"reference":[{"issue":"2","key":"17_CR1","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":"17_CR2","unstructured":"Nash, A., Daniel, K., Koenig, S., Felner, A.: Theta*: Any-angle path planning on grids. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1177\u20131183 (2007)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Yap, P.: Grid-based path-finding. In: Proceedings of the Canadian Conference on Aritificial Intelligence, pp. 44\u201355 (2002)","DOI":"10.1007\/3-540-47922-8_4"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Coman, A., Mu\u00f1oz-Avila, H.: Generating diverse plans using quantitative and qualitative plan distance metrics. In: AAAI. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.8006"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: Strips: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - A survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Garrido, S., Moreno, L., Blanco, D.: Voronoi diagram and fast marching applied to path planning. In: Proceedings of the 2006 IEEE International Conference on Robotics and Automation, ICRA 2006, pp. 3049\u20133054. IEEE (2006)","DOI":"10.1109\/ROBOT.2006.1642165"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hui-ying, D., Shuo, D., Yu, Z.: Delaunay graph based path planning method for mobile robot. In: 2010 International Conference on Communications and Mobile Computing (CMC), vol. 3, pp. 528\u2013531 (2010)","DOI":"10.1109\/CMC.2010.225"},{"key":"17_CR9","first-page":"377","volume-title":"Handbook of Discrete and Computational Geometry","author":"S Fortune","year":"1997","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 377\u2013388. CRC Press LLC, Boca Raton (1997)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"F Karaman","year":"2011","unstructured":"Karaman, F.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30, 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006). http:\/\/planning.cs.uiuc.edu\/","DOI":"10.1017\/CBO9780511546877"}],"container-title":["Communications in Computer and Information Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44440-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T21:21:10Z","timestamp":1746480070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44440-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444399","9783662444405"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44440-5_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"31 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}