{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T00:10:35Z","timestamp":1778976635644,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319223827","type":"print"},{"value":"9783319223834","type":"electronic"}],"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-22383-4_9","type":"book-chapter","created":{"date-parts":[[2015,8,8]],"date-time":"2015-08-08T01:06:29Z","timestamp":1438995989000},"page":"131-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Collided Path Replanning in Dynamic Environments Using RRT and Cell Decomposition Algorithms"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Abbadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaclav","family":"Prenosil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,9]]},"reference":[{"key":"9_CR1","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementation","author":"H Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S.: Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, Cambridge (2005)"},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry","author":"M De Berg","year":"2008","unstructured":"De Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Springer, Heidelberg (2008)"},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"9_CR4","unstructured":"LaValle, S.M.: Rapidly-Exploring Random Trees: A New Tool for Path Planning (1998)"},{"key":"9_CR5","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: progress and prospects. In: 4th Workshop on Algorithmic and Computational Robotics: New Directions, pp. 293\u2013308 (2000)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings of 2000 ICRA Millennium Conference IEEE International Conference Robotic Automation Symposium Proceeding 2, vol. 2, pp. 995\u20131001 (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Strandberg, M.: Augmenting RRT-planners with local trees. In: 2004 IEEE International Conference on Robotics and Automation, Proceedings of ICRA 2004, vol. 4, pp. 3258\u20133262 (2004)","DOI":"10.1109\/ROBOT.2004.1308756"},{"key":"9_CR8","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":"9_CR9","unstructured":"Bruce, J., Bowling, M., Browning, B., Veloso, M.: Multi-robot team response to a multi-robot opponent team (2003)"},{"key":"9_CR10","first-page":"1","volume":"6","author":"A Abbadi","year":"2012","unstructured":"Abbadi, A., Matousek, R.: RRTs review and statistical analysis. Int. J. Math. Comput. Simul. 6, 1\u20138 (2012)","journal-title":"Int. J. Math. Comput. Simul."},{"key":"9_CR11","unstructured":"Sleumer, N.H., Tschichold-G\u00fcrman, N.: Exact Cell Decomposition of Arrangements used for Path Planning in Robotics (1999)"},{"key":"9_CR12","unstructured":"Abbadi, A., Matousek, R., Osmera, P., Knispel, L.: Spatial guidance to RRT planner using cell-decomposition algorithm. In: 20th International Conference on Soft Computing MENDEL (2014)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1177\/0278364905060132","volume":"24","author":"JP Van den Berg","year":"2005","unstructured":"Van den Berg, J.P., Overmars, M.H.: Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. Int. J. Robot. Res. 24, 1055\u20131071 (2005)","journal-title":"Int. J. Robot. Res."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008034314006","volume":"22","author":"NI Katevas","year":"1998","unstructured":"Katevas, N.I., Tzafestas, S.G., Pnevmatikatos, C.G.: The approximate cell decomposition with local node refinement global path planning method : path nodes refinement and curve parametric interpolation. J. Intell. Robot. Syst. 22, 289\u2013314 (1998)","journal-title":"J. Intell. Robot. Syst."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Lingelbach, F.: Path planning using probabilistic cell decomposition. In: Proceedings of IEEE International Conference on Robotics and Automation ICRA 2004, vol. 1, pp. 467\u2013472 (2004)","DOI":"10.1109\/ROBOT.2004.1307193"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1109\/TSMCB.2008.2008561","volume":"39","author":"C Cai","year":"2009","unstructured":"Cai, C., Ferrari, S.: Information-driven sensor path planning by approximate cell decomposition. IEEE Trans. Syst. Man Cybern. Part B Cybern. 39, 672\u2013689 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"9_CR17","unstructured":"Abbadi, A., Prenosil, V.: Safe path planning using cell decomposition approximation. In: International Conference Distance Learning, Simulation and Communication, Brno (2015)"},{"key":"9_CR18","unstructured":"Abbadi, A., Matousek, R., Jancik, S., Roupec, J.: Rapidly-exploring random trees: 3D planning. In: 18th International Conference on Soft Computing MENDEL 2012, pp. 594\u2013599. Brno University of Technology, Brno (2012)"}],"container-title":["Lecture Notes in Computer Science","Modelling and Simulation for Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22383-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T22:50:32Z","timestamp":1748559032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22383-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223827","9783319223834"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22383-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}