{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T05:08:31Z","timestamp":1746508111291},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T00:00:00Z","timestamp":1505865600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10846-017-0642-2","type":"journal-article","created":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T10:23:55Z","timestamp":1505903035000},"page":"101-111","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Simple Global Path Planning Algorithm Using a Ray-Casting and Tracking Method"],"prefix":"10.1007","volume":"90","author":[{"given":"In-Seok","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Woong-Ki","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Dae","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,20]]},"reference":[{"issue":"6","key":"642_CR1","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1163\/156855300741960","volume":"14","author":"T Sim\u00e9on","year":"2000","unstructured":"Sim\u00e9on, T., Laumond, J.P., Nissoux, C.: Visibility-based probabilistic roadmaps for motion planning. Adv. Robot. 14(6), 477\u2013493 (2000)","journal-title":"Adv. Robot."},{"key":"642_CR2","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Voronoi diagram in optimal path planning. In: Proc. IEEE Int. Symp. Voronoi Diagrams in Sci. Eng., pp. 38\u201347 (2007)","DOI":"10.1109\/ISVD.2007.43"},{"key":"642_CR3","unstructured":"Sleumer, N.H., Tschichold-G\u00fcrman, N.: Exact cell decomposition of arrangements used for path planning in robotics. Technical report. Switzerland: Institute of Theoretical Computer Science Swiss Federal Institute of Technology Zurich (1999)"},{"key":"642_CR4","doi-asserted-by":"crossref","unstructured":"Koren, Y., Borenstein, J.: Potential field methods and their inherent limitations for mobile robot navigation. In: Proc. IEEE Int. Conf. Robot. Autom., vol. 2, pp. 1398\u20131404 (1991)","DOI":"10.1109\/ROBOT.1991.131810"},{"issue":"1","key":"642_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/70.127236","volume":"8","author":"YK Hwang","year":"1992","unstructured":"Hwang, Y.K., Ahuja, N.: A potential field approach to path planning. IEEE Trans. Robot. Autom. 8(1), 23\u201332 (1992)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"3","key":"642_CR6","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/3477.931544","volume":"31","author":"YJ Kim","year":"2001","unstructured":"Kim, Y.J., Kim, J.H., Kwon, D.S.: Evolutionary programming-based univector field navigation method for past mobile robots. IEEE Trans. Syst., Man, Cybern. B. Cybern. 31(3), 450\u2013458 (2001)","journal-title":"IEEE Trans. Syst., Man, Cybern. B. Cybern."},{"issue":"4","key":"642_CR7","doi-asserted-by":"crossref","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":"642_CR8","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proc. IEEE Int. Conf. Robot. Autom., 2, pp. 995\u20131001 (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"issue":"2","key":"642_CR9","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TRO.2013.2239571","volume":"29","author":"D Devaurs","year":"2013","unstructured":"Devaurs, D., Sim\u00e9on, T., Cort\u00e9s, J.: Parallelizing RRT on large-scale distributed-memory architectures. IEEE Trans. Robot. 29(2), 571\u2013571 (2013)","journal-title":"IEEE Trans. Robot."},{"key":"642_CR10","unstructured":"LaValle, S.M., Kuffner, J.J. Jr.: Rapidly-exploring random trees: progress and prospects. In: Donald, B.R., Lynch, K., Rus, D., Wellesley, M.A. (eds.) New Directions in Algorithmic and Computational Robotics, pp. 293\u2013308. A. K. Peters, Natick (2001)"},{"issue":"6","key":"642_CR11","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","volume":"21","author":"Z Sun","year":"2005","unstructured":"Sun, Z., Hsu, D., Jiang, T., Kurniawati, H., Reif, J.H.: Narrow passage sampling for probabilistic roadmap planning. IEEE Trans. Robot. 21(6), 1105\u20131115 (2005)","journal-title":"IEEE Trans. Robot."},{"key":"642_CR12","doi-asserted-by":"crossref","unstructured":"Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. In: Robot. Sci. and Syst. VI (2010)","DOI":"10.15607\/RSS.2010.VI.034"},{"issue":"7","key":"642_CR13","doi-asserted-by":"crossref","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":"2","key":"642_CR14","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/TRO.2012.2234312","volume":"29","author":"JD Marble","year":"2013","unstructured":"Marble, J.D., Bekris, K.E.: Asymptotically near-optimal planning with probabilistic roadmap spanners. IEEE Trans. Robot. 29(2), 432\u2013444 (2013)","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"642_CR15","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TRO.2004.838026","volume":"21","author":"S Koenig","year":"2005","unstructured":"Koenig, S., Likhachev, M.: Fast replanning for navigation in unknown terrain. IEEE Trans. Robot. 21(3), 354\u2013363 (2005)","journal-title":"IEEE Trans. Robot."},{"key":"642_CR16","doi-asserted-by":"crossref","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybern., SSC-4(2), pp. 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"642_CR17","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, pp. 1177\u20131183 (2007)"},{"key":"642_CR18","doi-asserted-by":"crossref","unstructured":"Garrido, S., Moreno, L., Blanco, D.: Voronoi diagram and fast marching applied to path planning. In: Proc. Robot. Autom., ICRA IEEE Int. Conf., pp. 3049\u20133054 (2006)","DOI":"10.1109\/ROBOT.2006.1642165"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-017-0642-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0642-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0642-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T13:53:35Z","timestamp":1520430815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-017-0642-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,20]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s10846-017-0642-2","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,20]]}}}