{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:40:42Z","timestamp":1781908842171,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"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":["J Intell Robot Syst"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10846-016-0362-z","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T10:34:00Z","timestamp":1464086040000},"page":"829-858","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":159,"title":["A Review of Global Path Planning Methods for Occupancy Grid Maps Regardless of Obstacle Density"],"prefix":"10.1007","volume":"84","author":[{"given":"E. G.","family":"Tsardoulias","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Iliakopoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Kargakos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Petrou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"issue":"10","key":"362_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Prez","year":"1979","unstructured":"Lozano-Prez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"362_CR2","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane, ISBN:9780521875745. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"key":"362_CR3","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments and polygons. In: Proceedings of India-Taiwan Conference on Discrete Mathematics, Taipei, pp 44\u201354 (2009)"},{"issue":"18","key":"362_CR4","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1163\/016918611X603855","volume":"25","author":"J Kim","year":"2011","unstructured":"Kim, J., Kim, M., Kim, D.: Variants of the quantized visibility graph for efficient path planning. Adv. Robot. 25(18), 2341\u20132360 (2011)","journal-title":"Adv. Robot."},{"key":"362_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Gavrilova, M.L.: Voronoi diagram in optimal path planning. In: 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007. ISVD \u201907, pp. 38\u201347","DOI":"10.1109\/ISVD.2007.43"},{"key":"362_CR6","doi-asserted-by":"crossref","unstructured":"Garrido, S., Moreno, L., Abderrahim, M., Martin, F.: Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching. In: 2006 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp 2376\u20132381 (2006)","DOI":"10.1109\/IROS.2006.282649"},{"key":"362_CR7","doi-asserted-by":"crossref","unstructured":"Ok, K.-C., Ansari, S., Gallagher, B., Sica, W., Dellaert, F., Stilman, M.: Path planning with uncertainty: Voronoi uncertainty fields. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), pp 4596\u20134601. IEEE (2013)","DOI":"10.1109\/ICRA.2013.6631230"},{"key":"362_CR8","doi-asserted-by":"crossref","unstructured":"Geraerts, R., Overmars, M.H.: A comparative study of probabilistic roadmap planners. In: Workshop on the algorithmic foundations of robotics, pp 43\u201357 (2002)","DOI":"10.1007\/978-3-540-45058-0_4"},{"key":"362_CR9","first-page":"600","volume":"8","author":"RJ Geraerts","year":"2004","unstructured":"Geraerts, R.J., Overmars, M.H.A.: Sampling Techniques for Probabilistic Roadmap Planners. Intelligent Autonomous Systems 8, 600\u2013609 (2004)","journal-title":"Intelligent Autonomous Systems"},{"key":"362_CR10","unstructured":"Kavraki, L.E., Latombe, J.-C.: Probabilistic Roadmaps for Robot Path Planning, Practical Motion Planning in Robotics: Current Approaches and Future Directions, pp 33\u201353. Wiley (1998)"},{"issue":"1","key":"362_CR11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/70.660866","volume":"14","author":"LE Kavraki","year":"1998","unstructured":"Kavraki, L.E., Kolountzakis, M.N., Latombe, J.-C.: Analysis of probabilistic roadmaps for path planning. IEEE Trans. Robot. Autom. 14(1), 166\u2013171 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"4","key":"362_CR12","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 Transactions on Robotics and Automation 12(4), 566\u2013580 (1996)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"362_CR13","unstructured":"Laumond, J.-P., Nissoux, C.: Visibility-based probabilistic roadmaps for motion planning. In: Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, 1999. IROS \u201999, vol. 3, pp 1316\u20131321 (1999)"},{"key":"362_CR14","doi-asserted-by":"crossref","unstructured":"Bohlin, R., Kavraki, L.E.: Path planning using lazy PRM. In: Proceedings of the IEEE International Conference on Robotics and Automation, 2000. ICRA \u201900, vol. 1, pp 521\u2013528 (2000)","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"362_CR15","doi-asserted-by":"crossref","unstructured":"Hsu, D., Sanchez-Ante, G., Sun, Z.: Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation 2005, ICRA 2005, pp 3874\u20133880","DOI":"10.1109\/ROBOT.2005.1570712"},{"issue":"7","key":"362_CR16","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."},{"key":"362_CR17","unstructured":"Marble, J.D., Bekris, K.E.: Asymptotically near-optimal is good enough for motion planning. In: International Symposium on Robotics Research (2011)"},{"key":"362_CR18","doi-asserted-by":"crossref","unstructured":"Marble, J.D., Bekris, K.E.: Towards small asymptotically near-optimal roadmaps. IEEE (2012)","DOI":"10.1109\/ICRA.2012.6225296"},{"issue":"3-4","key":"362_CR19","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10846-013-9861-3","volume":"75","author":"Y Li","year":"2014","unstructured":"Li, Y., Li, D., Maple, C., Yue, Y., Oyekan, J.: K-Order Surrounding roadmaps path planner for robot path planning. J. Intell. Robot. Syst. 75(3-4), 493\u2013516 (2014)","journal-title":"J. Intell. Robot. Syst."},{"key":"362_CR20","unstructured":"LaValle, S.M.: Rapidly-exploring random trees: A New Tool for Path Planning. TR 98\u201311, Computer Science Dept., Iowa State University (1998)"},{"key":"362_CR21","doi-asserted-by":"crossref","unstructured":"Bruce, J., Veloso, M.: Real-time randomized path planning for robot navigation. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, vol. 3, pp 2383\u20132388 (2002)","DOI":"10.1109\/IRDS.2002.1041624"},{"key":"362_CR22","doi-asserted-by":"crossref","unstructured":"Martin, S.R., Wright, S.E., Sheppard, J.W.: Offline and Online Evolutionary Bi-Directional RRT Algorithms for Efficient Re-Planning in Dynamic Environments (2007)","DOI":"10.1109\/COASE.2007.4341761"},{"key":"362_CR23","doi-asserted-by":"crossref","unstructured":"Karaman, S., Frazzoli, E.: Incremental Sampling-based Algorithms for Optimal Motion Planning coRR (2010)","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"362_CR24","doi-asserted-by":"crossref","unstructured":"Nasir, J., Islam, F., Malik, U., Ayaz, Y., Hasan, O., Khan, M., Muhammad, M.S.: RRT*-SMART: a rapid convergence implementation of RRT*. Int. J. Adv. Robot. Syst., 10 (2013)","DOI":"10.5772\/56718"},{"issue":"4","key":"362_CR25","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1109\/TRO.2010.2049527","volume":"26","author":"L Jaillet","year":"2010","unstructured":"Jaillet, L., Corts, J., Simon, T.: Sampling-based path planning on configuration-space costmaps. IEEE Transactions on Robotics 26(4), 635\u2013646 (2010)","journal-title":"IEEE Transactions on Robotics"},{"key":"362_CR26","doi-asserted-by":"crossref","unstructured":"Guitton, J., Farges, J.-L., Chatila, R.: Cell-RRT: Decomposing the environment for better plan. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, 2009. IROS 2009, pp. 5776\u20135781","DOI":"10.1109\/IROS.2009.5354106"},{"key":"362_CR27","doi-asserted-by":"crossref","unstructured":"Jacobs, S.A., Stradford, N., Rodriguez, C., Thomas, S., Amato, N.M.: A scalable distributed RRT for motion planning. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), pp. 5088\u20135095, p 2013. IEEE","DOI":"10.1109\/ICRA.2013.6631304"},{"key":"362_CR28","unstructured":"Felzenszwalb, P., Huttenlocher, D.: Distance transforms of sampled functions Cornell University (2004)"},{"issue":"6","key":"362_CR29","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1177\/027836499101000604","volume":"10","author":"J Barraquand","year":"1991","unstructured":"Barraquand, J., Latombe, J.-C.: Robot motion planning: A distributed representation approach. Int. J. Robot. Res. 10(6), 628\u2013649 (1991)","journal-title":"Int. J. Robot. Res."}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-016-0362-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-016-0362-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-016-0362-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-016-0362-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T18:51:29Z","timestamp":1567968689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-016-0362-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":29,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10846-016-0362-z","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,23]]}}}