{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T08:15:41Z","timestamp":1767860141293,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"crossref","award":["19-22555Y"],"award-info":[{"award-number":["19-22555Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10846-020-01247-4","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T11:03:01Z","timestamp":1598871781000},"page":"1527-1543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Searching Multiple Approximate Solutions in Configuration Space to Guide Sampling-Based Motion Planning"],"prefix":"10.1007","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9224-2151","authenticated-orcid":false,"given":"Vojt\u011bch","family":"Von\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"P\u011bni\u010dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbora","family":"Kozl\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"issue":"4","key":"1247_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.cosrev.2012.07.002","volume":"6","author":"I Al-Bluwi","year":"2012","unstructured":"Al-Bluwi, I., Sim\u00e9on, T., Cort\u00e9s, J.: Motion planning algorithms for molecular simulations: a survey. Comput. Sci. Rev. 6(4), 125\u2013143 (2012)","journal-title":"Comput. Sci. Rev."},{"key":"1247_CR2","unstructured":"Amato, N.M., Dale, L.K., Bayazit, O.B., Jones, C.H., Vallejo, D. : OBPRM: an obstacle-based PRM for 3D workspaces. In: Workshop on the Algorithmic Foundations of Robotics (WAFR), pp 155\u2013168. A. K. Peters, Ltd., Natick (1998)"},{"issue":"3-4","key":"1247_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1089\/10665270360688002","volume":"10","author":"NM Amato","year":"2003","unstructured":"Amato, N.M., Dill, K., Song, G.: Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures. J. Comput. Biol. 10(3-4), 239\u2013255 (2003)","journal-title":"J. Comput. Biol."},{"key":"1247_CR4","doi-asserted-by":"crossref","unstructured":"Bayazit, O.B., Xie, D., Amato, N.M.: Iterative relaxation of constraints: a framework for improving automated motion planning. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp 3433\u20133440 (2005)","DOI":"10.1109\/IROS.2005.1545045"},{"key":"1247_CR5","doi-asserted-by":"crossref","unstructured":"Belter, D., Labecki, P., Skrzypczynski, P.: An exploration-based approach to terrain traversability assessment for a walking robot. In: IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), pp 1\u20136 (2013)","DOI":"10.1109\/SSRR.2013.6719331"},{"issue":"3","key":"1247_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10514-012-9304-1","volume":"33","author":"S Bhattacharya","year":"2012","unstructured":"Bhattacharya, S., Likhachev, M., Kumar, V.: Topological constraints in search-based robot path planning. Auton. Robot. 33(3), 273\u2013290 (2012)","journal-title":"Auton. Robot."},{"key":"1247_CR7","doi-asserted-by":"crossref","unstructured":"Brock, O., Kavraki, L.E.: Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces. In: IEEE International Conference on Robotics and Automation (ICRA), vol. 2, pp 469\u20131474 (2001)","DOI":"10.1109\/ROBOT.2001.932817"},{"key":"1247_CR8","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: AAAI: Proceedings of the 21st National Conference on Artificial Intelligence (2006)"},{"key":"1247_CR9","doi-asserted-by":"crossref","unstructured":"Denny, J., Sandstr\u00f6m, R., Amato, N.M.: A general region-based framework for collaborative planning. In: Robotics Research, pp 563\u2013579. Springer (2018)","DOI":"10.1007\/978-3-319-60916-4_32"},{"key":"1247_CR10","unstructured":"Denny, J., Sandstr\u00f6m, R., Bregger, A., Amato, N.M.: Dynamic region-biased rapidly-exploring random trees. In: Twelfth International Workshop on the Algorithmic Foundations of Robotics (WAFR) (2016)"},{"key":"1247_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/ACCESS.2014.2302442","volume":"2","author":"M Elbanhawi","year":"2014","unstructured":"Elbanhawi, M., Simic, M.: Sampling-based robot motion planning: a review. IEEE Access 2, 56\u201377 (2014)","journal-title":"IEEE Access"},{"key":"1247_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cad.2015.05.001","volume":"67-68","author":"S Ghandi","year":"2015","unstructured":"Ghandi, S., Masehian, E.: Review and taxonomies of assembly and disassembly path planning problems and approaches. Comput. Aided Des. 67-68, 58\u201386 (2015)","journal-title":"Comput. Aided Des."},{"key":"1247_CR13","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Slissenko, A.: Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. In: ISSAC, vol. 98 (1998)","DOI":"10.1145\/281508.281528"},{"key":"1247_CR14","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. In: Workshop on Algorithms and Data Structures, pp 331\u2013342. Springer (1991)","DOI":"10.1007\/BFb0028273"},{"key":"1247_CR15","unstructured":"Hsu, D., Cheng, H., Latombe, J.-C.: Multi-level free-space dilation for sampling narrow passages in PRM planning. In: IEEE International Conference on Robotics and Automation (ICRA) (2006)"},{"key":"1247_CR16","doi-asserted-by":"crossref","unstructured":"Hsu, D., Jiang, T., Reif, J., Sun, Z.: The bridge test for sampling narrow passages with probabilistic roadmap planners. In: IEEE International Conference on Robotics and Automation (ICRA), pp 4420\u20134426 (2003)","DOI":"10.1109\/ROBOT.2003.1242285"},{"issue":"7","key":"1247_CR17","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1177\/0278364906067174","volume":"25","author":"D Hsu","year":"2006","unstructured":"Hsu, D., Latombe, J.-C., Kurniawati, H.: On the probabilistic foundations of probabilistic roadmap planning. Int. J. Robot. Res. 25(7), 627\u2013643 (2006)","journal-title":"Int. J. Robot. Res."},{"key":"1247_CR18","doi-asserted-by":"crossref","unstructured":"Jaillet, L., Yershova, A., LaValle, S.M., Simeon, T.: Adaptive tuning of the sampling domain for dynamic-domain RRTs. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp 2851\u20132856 (2005)","DOI":"10.1109\/IROS.2005.1545607"},{"key":"1247_CR19","doi-asserted-by":"publisher","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, 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"1247_CR20","unstructured":"LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Technical report 98-11 (1998)"},{"key":"1247_CR21","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":"1247_CR22","doi-asserted-by":"crossref","unstructured":"Lindemann, S.R., LaValle, S.M.: Current issues in sampling-based motion planning. In: Robotics Research: The Eleventh International Symposium, pp 36\u201354 (2005)","DOI":"10.1007\/11008941_5"},{"issue":"11","key":"1247_CR23","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1002\/jcc.25132","volume":"39","author":"MK Nguyen","year":"2018","unstructured":"Nguyen, M.K., Jaillet, L., Redon, S.: ART-RRT as-rigid-as-possible exploration of ligand unbinding pathways. Journal of Computational Chemistry 39(11), 665\u2013678 (2018)","journal-title":"Journal of Computational Chemistry"},{"key":"1247_CR24","unstructured":"Overmars, M.H.: The gaussian sampling strategy for probabilistic roadmap planners. In: International Conference on Robotics and Automation (ICRA), pp 1018\u20131023 (1999)"},{"key":"1247_CR25","doi-asserted-by":"crossref","unstructured":"Plaku, E., Kavraki, L.E., Vardi, M.Y.: Discrete search leading continuous exploration for kinodynamic motion planning. In: Robotics: Science and Systems, pp 326\u2013333 (2007)","DOI":"10.15607\/RSS.2007.III.040"},{"key":"1247_CR26","doi-asserted-by":"crossref","unstructured":"Rickert, M., Brock, O., Knoll, A.: Balancing exploration and exploitation in motion planning. In: IEEE International Conference on Robotics and Automation (ICRA), pp 2812\u20132817 (2008)","DOI":"10.1109\/ROBOT.2008.4543636"},{"key":"1247_CR27","unstructured":"Schmitzberger, E., Bouchet, J.-L., Dufaut, M., Wolf, D., Husson, R.: Capture of homotopy classes with probabilistic road map. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (2002)"},{"key":"1247_CR28","doi-asserted-by":"crossref","unstructured":"Szadeczky-Kardoss, E., Kiss, B.: Extension of the rapidly exploring random tree algorithm with key configurations for nonholonomic motion planning. In: IEEE International Conference on Mechatronics, pp 363\u2013368 (2006)","DOI":"10.1109\/ICMECH.2006.252554"},{"key":"1247_CR29","unstructured":"Uwacu, D., Rex, R., Wang, B., Thomas, S.L., Amato, N.M.: Annotated-skeleton biased motion planning for faster relevant region discovery. arXiv:2003.02176 (2020)"},{"key":"1247_CR30","doi-asserted-by":"crossref","unstructured":"Von\u00e1sek, V., Faigl, J., Krajn\u00edk, T., P\u0159eu\u010dil, L.: RRT-path \u2014 a guided rapidly exploring random tree. In: Robot Motion and Control (RoMoCo), pp 307\u2013316. Springer (2009)","DOI":"10.1007\/978-1-84882-985-5_28"},{"key":"1247_CR31","doi-asserted-by":"crossref","unstructured":"Von\u00e1sek, V., P\u011bni\u010dka, R.: Path planning of 3d solid objects using approximate solutions. In: 2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), pp 593\u2013600 (2019)","DOI":"10.1109\/ETFA.2019.8869344"},{"key":"1247_CR32","doi-asserted-by":"crossref","unstructured":"Von\u00e1sek, V., P\u011bni\u010dka, R., Kozl\u00edkov\u00e1, B.: Computing multiple guiding paths for sampling-based motion planning. In: 2019 19th International Conference on Advanced Robotics (ICAR), pp 374\u2013381 (2019)","DOI":"10.1109\/ICAR46387.2019.8981589"},{"key":"1247_CR33","doi-asserted-by":"crossref","unstructured":"Wilmarth, S.A., Amato, N.M., P. F. Stiller: MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space. In: IEEE International Conference on Robotics and Automation (ICRA), pp 1024\u20131031 (1999)","DOI":"10.1109\/ROBOT.1999.772448"},{"key":"1247_CR34","unstructured":"Yershova, A., Jaillet, L., Simeon, T., LaValle, S.M.: Dynamic-domain RRTs: efficient exploration by controlling the sampling domain. In: IEEE International Conference on Robotics and Automation (ICRA) (2005)"},{"key":"1247_CR35","unstructured":"Zhang, L., Manocha, D.: An efficient retraction-based RRT planner. In: IEEE International Conference on Robotics and Automation (ICRA), pp 3743\u20133750 (2008)"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-020-01247-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10846-020-01247-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-020-01247-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T21:48:29Z","timestamp":1723499309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10846-020-01247-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,31]]},"references-count":35,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1247"],"URL":"https:\/\/doi.org\/10.1007\/s10846-020-01247-4","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,31]]},"assertion":[{"value":"18 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}