{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:11:45Z","timestamp":1778253105255,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":107,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239574","type":"print"},{"value":"9783540303015","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-30301-5_6","type":"book-chapter","created":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T10:30:01Z","timestamp":1210847401000},"page":"109-131","source":"Crossref","is-referenced-by-count":39,"title":["Motion Planning"],"prefix":"10.1007","author":[{"given":"Lydia E.","family":"Kavraki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"LaValle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1_6","doi-asserted-by":"crossref","unstructured":"J.H.\u00a0Reif: Complexity of the mover\u02bcs problem and generalizations, IEEE Symp. Found. Comput. Sci. (1979) pp.\u2009421\u2013427","DOI":"10.1109\/SFCS.1979.10"},{"key":"6_CR2_6","volume-title":"Automous Mobile Robots: Sensing, Control, Decision-Making and Applications","author":"HH Gonzalez-Banos","year":"2006","unstructured":"H.H.\u00a0Gonzalez-Banos, D.\u00a0Hsu, J.C.\u00a0Latombe: Motion planning: Recent developments. In: Automous Mobile Robots: Sensing, Control, Decision-Making and Applications, ed. by S.S.\u00a0Ge, F.L.\u00a0Lewis (CRC, Boca Raton 2006)"},{"key":"6_CR3_6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11008941_5","volume-title":"Robotics Research: The Eleventh International Symposium","author":"SR Lindemann","year":"2005","unstructured":"S.R.\u00a0Lindemann, S.M.\u00a0LaValle: Current issues in sampling-based motion planning. In: Robotics Research: The Eleventh International Symposium, ed. by P.\u00a0Dario, R.\u00a0Chatila (Springer, Berlin 2005) pp.\u200936\u201354"},{"key":"6_CR4_6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0004-3702(88)90053-7","volume":"37","author":"JT Schwartz","year":"1988","unstructured":"J.T.\u00a0Schwartz, M.\u00a0Sharir: A survey of motion planning and related geometric algorithms, Artif. Intell. J. 37, 157\u2013169 (1988)","journal-title":"Artif. Intell. J."},{"key":"6_CR5_6","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"H.\u00a0Choset, K.M.\u00a0Lynch, S.\u00a0Hutchinson, G.\u00a0Kantor, W.\u00a0Burgard, L.E.\u00a0Kavraki, S.\u00a0Thrun: Principles of Robot Motion: Theory, Algorithms, and Implementations (MIT Press, Cambridge 2005)"},{"key":"6_CR6_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"JC Latombe","year":"1991","unstructured":"J.C.\u00a0Latombe: Robot Motion Planning (Kluwer, Boston 1991)"},{"key":"6_CR7_6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"S.M.\u00a0LaValle: Planning Algorithms (Cambridge Univ. Press, Cambridge 2006)"},{"key":"6_CR8_6","unstructured":"S.\u00a0Udupa: Collision detection and avoidance in computer controlled manipulators. Ph.D. Thesis (Dept. of Electical Engineering, California Institute of Technology 1977)"},{"issue":"2","key":"6_CR9_6","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"C-32","author":"T Lozano-P\u00e9rez","year":"1983","unstructured":"T.\u00a0Lozano-P\u00e9rez: Spatial planning: A configuration space approach, IEEE Trans. Comput. C-32(2), 108\u2013120 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"6_CR10_6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1177\/027836498300200304","volume":"2","author":"JT Schwartz","year":"1983","unstructured":"J.T.\u00a0Schwartz, M.\u00a0Sharir: On the piano movers\u02bc problem: III. Coordinating the motion of several independent bodies, Int. J. Robot. Res. 2(3), 97\u2013140 (1983)","journal-title":"Int. J. Robot. Res."},{"key":"6_CR11_6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1002\/cpa.3160370605","volume":"37","author":"JT Schwartz","year":"1984","unstructured":"J.T.\u00a0Schwartz, M.\u00a0Sharir: On the piano movers\u02bc problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles, Commun. Pure Appl. Math. 37, 815\u2013848 (1984)","journal-title":"Commun. Pure Appl. Math."},{"key":"6_CR12_6","volume-title":"The Complexity of Robot Motion Planning","author":"JF Canny","year":"1988","unstructured":"J.F.\u00a0Canny: The Complexity of Robot Motion Planning (MIT Press, Cambridge 1988)"},{"key":"6_CR13_6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02716803","volume":"16","author":"D Halperin","year":"1996","unstructured":"D.\u00a0Halperin, M.\u00a0Sharir: A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment, Discrete Comput. Geom. 16, 121\u2013134 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"6_CR14_6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1177\/027836498400300405","volume":"3","author":"JE Hopcroft","year":"1984","unstructured":"J.E.\u00a0Hopcroft, J.T.\u00a0Schwartz, M.\u00a0Sharir: On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the warehouseman\u02bcs problem, Int. J. Robot. Res. 3(4), 76\u201388 (1984)","journal-title":"Int. J. Robot. Res."},{"key":"6_CR15_6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Canny, J.\u00a0Reif: New lower bound techniques for robot motion planning problems, IEEE Symp. Found. Comput. Sci. (1987) pp.\u200949\u201360","DOI":"10.1109\/SFCS.1987.42"},{"key":"6_CR16_6","unstructured":"M.C.\u00a0Lin, J.F.\u00a0Canny: Efficient algorithms for incremental distance computation, IEEE Int. Conf. Robot. Autom. (1991)"},{"key":"6_CR17_6","first-page":"1","volume-title":"Robot Motion Planning and Control","author":"P Jim\u00e9nez","year":"1998","unstructured":"P.\u00a0Jim\u00e9nez, F.\u00a0Thomas, C.\u00a0Torras: Collision detection algorithms for motion planning. In: Robot Motion Planning and Control, ed. by J.P.\u00a0Laumond (Springer, Berlin 1998) pp.\u20091\u201353"},{"key":"6_CR18_6","first-page":"787","volume-title":"Handbook of Discrete and Computational Geometry, 2nd Ed","author":"MC Lin","year":"2004","unstructured":"M.C.\u00a0Lin, D.\u00a0Manocha: Collision and proximity queries. In: Handbook of Discrete and Computational Geometry, 2nd Ed, ed. by J.E.\u00a0Goodman, J.\u00a0O\u02bcRourke (Chapman Hall\/CRC, New York 2004) pp.\u2009787\u2013807"},{"issue":"4","key":"6_CR19_6","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"L.E.\u00a0Kavraki, P.\u00a0Svestka, J.C.\u00a0Latombe, M.H.\u00a0Overmars: 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":"6_CR20_6","unstructured":"N.M.\u00a0Amato, O.B.\u00a0Bayazit, L.K.\u00a0Dale, C.\u00a0Jones, D.\u00a0Vallejo: OBPRM: an obstacle-based PRM for 3D workspaces, Workshop Algorith. Found. Robot. (1998) pp.\u2009155\u2013168"},{"key":"6_CR21_6","doi-asserted-by":"crossref","unstructured":"V.\u00a0Boor, M.H.\u00a0Overmars, A.F.\u00a0van der Stappen: The Gaussian sampling strategy for probabilistic roadmap planners, IEEE Int. Conf. Robot. Autom. (1999) pp.\u20091018\u20131023","DOI":"10.1109\/ROBOT.1999.772447"},{"key":"6_CR22_6","doi-asserted-by":"crossref","unstructured":"C.\u00a0Holleman, L.E.\u00a0Kavraki: A framework for using the workspace medial axis in PRM planners, IEEE Int. Conf. Robot. Autom. (2000) pp.\u20091408\u20131413","DOI":"10.1109\/ROBOT.2000.844795"},{"key":"6_CR23_6","unstructured":"J.M.\u00a0Lien, S.L.\u00a0Thomas, N.M.\u00a0Amato: A general framework for sampling on the medial axis of the free space, IEEE Int. Conf. Robot. Autom. (2003)"},{"issue":"7\/8","key":"6_CR24_6","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1177\/0278364904045481","volume":"23","author":"SM LaValle","year":"2004","unstructured":"S.M.\u00a0LaValle, M.S.\u00a0Branicky, S.R.\u00a0Lindemann: On the relationship between classical grid search and probabilistic roadmaps, Int. J. Robot. Res. 23(7\/8), 673\u2013692 (2004)","journal-title":"Int. J. Robot. Res."},{"issue":"6","key":"6_CR25_6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1163\/156855300741960","volume":"14","author":"T Sim\u00e9on","year":"2000","unstructured":"T.\u00a0Sim\u00e9on, J.-P.\u00a0Laumond, C.\u00a0Nissoux: Visibility based probabilistic roadmaps for motion planning, Adv. Robot. 14(6), 477\u2013493 (2000)","journal-title":"Adv. Robot."},{"key":"6_CR26_6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-1-4471-1021-7_28","volume-title":"Proceedings International Symposium on Robotics Research","author":"J Barraquand","year":"1996","unstructured":"J.\u00a0Barraquand, L.\u00a0Kavraki, J.-C.\u00a0Latombe, T.-Y.\u00a0Li, R.\u00a0Motwani, P.\u00a0Raghavan: A random sampling scheme for robot path planning. In: Proceedings International Symposium on Robotics Research, ed. by G.\u00a0Giralt, G.\u00a0Hirzinger (Springer, New York 1996) pp.\u2009249\u2013264"},{"issue":"2","key":"6_CR27_6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/TRA.2004.824649","volume":"20","author":"A Ladd","year":"2004","unstructured":"A.\u00a0Ladd, L.E.\u00a0Kavraki: Measure theoretic analysis of probabilistic path planning, IEEE Trans. Robot. Autom. 20(2), 229\u2013242 (2004)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR28_6","doi-asserted-by":"crossref","unstructured":"R.\u00a0Geraerts, M.\u00a0Overmars: Sampling techniques for probabilistic roadmap planners, Int. Conf. Intell. Auton. Syst. (2004)","DOI":"10.1007\/978-3-540-45058-0_4"},{"key":"6_CR29_6","unstructured":"D.\u00a0Hsu, T.\u00a0Jiang, J.\u00a0Reif, Z.\u00a0Sun: The bridge test for sampling narrow passages with probabilistic roadmap planners, IEEE Int. Conf. Robot. Autom. (2003)"},{"key":"6_CR30_6","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bohlin, L.\u00a0Kavraki: Path planning using lazy PRM, IEEE Int. Conf. Robot. Autom. (2000)","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"6_CR31_6","unstructured":"B.\u00a0Burns, O.\u00a0Brock: Sampling-based motion planning using predictive models, IEEE\/RSJ Int. Conf. Intell. Robot. Autom. (2005)"},{"key":"6_CR32_6","doi-asserted-by":"crossref","unstructured":"P.\u00a0Isto: Constructing probabilistic roadmaps with powerful local planning and path optimization, IEEE\/RSJ Int. Conf. Intell. Robot. Syst. (2002) pp.\u20092323\u20132328","DOI":"10.1109\/IRDS.2002.1041614"},{"issue":"6","key":"6_CR33_6","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/TRA.2003.819732","volume":"19","author":"P Leven","year":"2003","unstructured":"P.\u00a0Leven, S.A.\u00a0Hutchinson: Using manipulability to bias sampling during the construction of probabilistic roadmaps, IEEE Trans. Robot. Autom. 19(6), 1020\u20131026 (2003)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR34_6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Nieuwenhuisen, M.H.\u00a0Overmars: Useful cycles in probabilistic roadmap graphs, IEEE Int. Conf. Robot. Autom. (2004) pp.\u2009446\u2013452","DOI":"10.1109\/ROBOT.2004.1307190"},{"key":"6_CR35_6","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Direction","author":"SM LaValle","year":"2001","unstructured":"S.M.\u00a0LaValle, J.J.\u00a0Kuffner: Rapidly-exploring random trees: progress and prospects. In: Algorithmic and Computational Robotics: New Direction, ed. by B.R.\u00a0Donald, K.M.\u00a0Lynch, D.\u00a0Rus (A. K. Peters, Wellesley 2001) pp.\u2009293\u2013308"},{"key":"6_CR36_6","unstructured":"K.E.\u00a0Bekris, B.Y.\u00a0Chen, A.\u00a0Ladd, E.\u00a0Plaku, L.E.\u00a0Kavraki: Multiple query probabilistic roadmap planning using single query primitives, IEEE\/RSJ Int. Conf. Intell. Robot. Syst. (2003)"},{"key":"6_CR37_6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Strandberg: Augmenting RRT-planners with local trees, IEEE Int. Conf. Robot. Autom. (2004) pp.\u20093258\u20133262","DOI":"10.1109\/ROBOT.2004.1308756"},{"key":"6_CR38_6","unstructured":"J. J. Kuffner, S. M. LaValle: An efficient approach to path planning using balanced bidirectional RRT search, Techn. Rep. CMU-RI-TR-05-34 Robotics Institute, Carnegie Mellon University, Pittsburgh (2005)"},{"key":"6_CR39_6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bruce, M.\u00a0Veloso: Real-time randomized path planning for robot navigation, IEEE\/RSJ Int. Conf. Intell. Robot. Autom. (2002)","DOI":"10.1007\/978-3-540-45135-8_23"},{"issue":"1","key":"6_CR40_6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2514\/2.4856","volume":"25","author":"E Frazzoli","year":"2002","unstructured":"E.\u00a0Frazzoli, M.A.\u00a0Dahleh, E.\u00a0Feron: Real-time motion planning for agile autonomous vehicles, AIAA J. Guid. Contr. 25(1), 116\u2013129 (2002)","journal-title":"AIAA J. Guid. Contr."},{"key":"6_CR41_6","unstructured":"M.\u00a0Kallmann, M.\u00a0Mataric: Motion planning using dynamic roadmaps, IEEE Int. Conf. Robot. Autom. (2004)"},{"key":"6_CR42_6","unstructured":"A.\u00a0Yershova, L.\u00a0Jaillet, T.\u00a0Simeon, S.M.\u00a0LaValle: Dynamic-domain RRTs: efficient exploration by controlling the sampling domain, IEEE Int. Conf. Robot. Autom. (2005)"},{"key":"6_CR43_6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0218195999000285","volume":"4","author":"D Hsu","year":"1999","unstructured":"D.\u00a0Hsu, J.C.\u00a0Latombe, R.\u00a0Motwani: Path planning in expansive configuration spaces, Int. J. Comput. Geom. Appl. 4, 495\u2013512 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"6_CR44_6","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"D Hsu","year":"2001","unstructured":"D.\u00a0Hsu, R.\u00a0Kindel, J.C.\u00a0Latombe, S.\u00a0Rock: Randomized kinodynamic motion planning with moving obstacles. In: Algorithmic and Computational Robotics: New Directions, ed. by B.R.\u00a0Donald, K.M.\u00a0Lynch, D.\u00a0Rus (A.K. Peters, Wellesley 2001)"},{"key":"6_CR45_6","unstructured":"G.\u00a0S\u00e1nchez, J.-C.\u00a0Latombe: A single-query bi-directional probabilistic roadmap planner with lazy collision checking, ISRR Int. Symp. Robot. Res. (2001)"},{"key":"6_CR46_6","doi-asserted-by":"crossref","unstructured":"S.\u00a0Carpin, G.\u00a0Pillonetto: Robot motion planning using adaptive random walks, IEEE Int. Conf. Robot. Autom. (2003) pp.\u20093809\u20133814","DOI":"10.1109\/ROBOT.2003.1242181"},{"key":"6_CR47_6","volume-title":"Workshop Algorithm. Found. Robot.","author":"A Ladd","year":"2004","unstructured":"A.\u00a0Ladd, L.E.\u00a0Kavraki: Fast exploration for robots with dynamics, Workshop Algorithm. Found. Robot. (Zeist, Amsterdam 2004)"},{"key":"6_CR48_6","doi-asserted-by":"crossref","unstructured":"K.E.\u00a0Bekris, L.E.\u00a0Kavraki: Greedy but safe replanning under differential constraints, IEEE Int. Conf. Robot. Autom. (2007)","DOI":"10.1109\/ROBOT.2007.363069"},{"key":"6_CR49_6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","volume":"6","author":"C O\u02bcDunlaing","year":"1982","unstructured":"C.\u00a0O\u02bcDunlaing, C.K.\u00a0Yap: A retraction method for planning the motion of a disc, J. Algorithms 6, 104\u2013111 (1982)","journal-title":"J. Algorithms"},{"key":"6_CR50_6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D Leven","year":"1987","unstructured":"D.\u00a0Leven, M.\u00a0Sharir: Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discrete Comput. Geom. 2, 9\u201331 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR51_6","doi-asserted-by":"crossref","unstructured":"M. Sharir: Algorithmic motion planning. In: Handbook of Discrete and Computational Geometry, 2nd edn., ed. by J. E. Goodman, J. O\u02bcRourke (Chapman Hall\/CRC Press, New York 2004) pp. 1037\u20131064","DOI":"10.1201\/9781420035315.ch47"},{"key":"6_CR52_6","doi-asserted-by":"crossref","unstructured":"N.J.\u00a0Nilsson: A mobile automaton: An application of artificial intelligence techniques, 1st Int. Conf. Artif. Intell. (1969) pp.\u2009509\u2013520","DOI":"10.21236\/ADA459660"},{"key":"6_CR53_6","unstructured":"J. O\u02bcRourke: Visibility. In: Handbook of Discrete and Computational Geometry, 2nd edn., ed. by J. E. Goodman, J. O\u02bcRourke (Chapman Hall\/CRC Press, New York 2004) pp. 643\u2013663"},{"key":"6_CR54_6","first-page":"145","volume-title":"Algorithmic and Geometric Aspects of Robotics","author":"B Chazelle","year":"1987","unstructured":"B.\u00a0Chazelle: Approximation and decomposition of shapes. In: Algorithmic and Geometric Aspects of Robotics, ed. by J.T.\u00a0Schwartz, C.K.\u00a0Yap (Lawrence Erlbaum, Hillsdale 1987) pp.\u2009145\u2013185"},{"key":"6_CR55_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2000","unstructured":"M.\u00a0de Berg, M.\u00a0van Kreveld, M.\u00a0Overmars, O.\u00a0Schwarzkopf: Computational Geometry: Algorithms and Applications, 2nd edn. (Springer, Berlin 2000)","edition":"2nd"},{"key":"6_CR56_6","volume-title":"Handbook on Computational Geometry","author":"JM Keil","year":"2000","unstructured":"J.M.\u00a0Keil: Polygon decomposition. In: Handbook on Computational Geometry, ed. by J.R.\u00a0Sack, J.\u00a0Urrutia (Elsevier, New York 2000)"},{"key":"6_CR57_6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"JT Schwartz","year":"1983","unstructured":"J.T.\u00a0Schwartz, M.\u00a0Sharir: On the piano movers\u02bc problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Commun. Pure Appl. Math. 36, 345\u2013398 (1983)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"6_CR58_6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O Khatib","year":"1986","unstructured":"O.\u00a0Khatib: Real-time obstacle avoidance for manipulators and mobile robots, Int. J. Robot. Res. 5(1), 90\u201398 (1986)","journal-title":"Int. J. Robot. Res."},{"issue":"6","key":"6_CR59_6","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1177\/027836499101000604","volume":"10","author":"J Barraquand","year":"1991","unstructured":"J.\u00a0Barraquand, J.-C.\u00a0Latombe: Robot motion planning: A distributed representation approach, Int. J. Robot. Res. 10(6), 628\u2013649 (1991)","journal-title":"Int. J. Robot. Res."},{"issue":"5","key":"6_CR60_6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/70.163777","volume":"8","author":"E Rimon","year":"1992","unstructured":"E.\u00a0Rimon, D.E.\u00a0Koditschek: Exact robot navigation using artificial potential fields, IEEE Trans. Robot. Autom. 8(5), 501\u2013518 (1992)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR61_6","unstructured":"J.P.\u00a0Laumond: Trajectories for mobile robots with kinematic and environment constraints, Int. Conf. Intell. Auton. Syst. (1986) pp.\u2009346\u2013354"},{"key":"6_CR62_6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0036070","volume-title":"Robot Motion Planning and Control","author":"JP Laumond","year":"1998","unstructured":"J.P.\u00a0Laumond, S.\u00a0Sekhavat, F.\u00a0Lamiraux: Guidelines in nonholonomic motion planning for mobile robots. In: Robot Motion Planning and Control, ed. by J.P.\u00a0Laumond (Springer, Berlin 1998) pp.\u20091\u201353"},{"key":"6_CR63_6","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1145\/174147.174150","volume":"40","author":"BR Donald","year":"1993","unstructured":"B.R.\u00a0Donald, P.G.\u00a0Xavier, J.\u00a0Canny, J.\u00a0Reif: Kinodynamic planning, J. ACM 40, 1048\u20131066 (1993)","journal-title":"J. ACM"},{"issue":"4","key":"6_CR64_6","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01840370","volume":"2","author":"C O\u02bcDunlaing","year":"1987","unstructured":"C.\u00a0O\u02bcDunlaing: Motion planning with inertial constraints, Algorithmica 2(4), 431\u2013475 (1987)","journal-title":"Algorithmica"},{"key":"6_CR65_6","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF02574702","volume":"6","author":"J Canny","year":"1991","unstructured":"J.\u00a0Canny, A.\u00a0Rege, J.\u00a0Reif: An exact algorithm for kinodynamic planning in the plane, Discrete Comput. Geom. 6, 461\u2013484 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR66_6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Go, T.\u00a0Vu, J.J.\u00a0Kuffner: Autonomous behaviors for interactive vehicle animations, SIGGRAPH Symp. Comput. Animat. (2004)","DOI":"10.1145\/1028523.1028525"},{"key":"6_CR67_6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Pivtoraiko, A.\u00a0Kelly: Generating near minimal spanning control sets for constrained motion planning in discrete state spaces, IEEE\/RSJ Int. Conf. Intell. Robot. Syst. (2005)","DOI":"10.1109\/IROS.2005.1545046"},{"key":"6_CR68_6","doi-asserted-by":"crossref","unstructured":"J. Hollerbach: Dynamic scaling of manipulator trajectories, Tech. Rep. 700 (MIT A.I. Lab Memo, 1983)","DOI":"10.23919\/ACC.1983.4788214"},{"issue":"6","key":"6_CR69_6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TAC.1985.1104009","volume":"30","author":"KG Shin","year":"1985","unstructured":"K.G.\u00a0Shin, N.D.\u00a0McKay: Minimum-time control of robot manipulators with geometric path constraints, IEEE Trans. Autom. Contr. 30(6), 531\u2013541 (1985)","journal-title":"IEEE Trans. Autom. Contr."},{"issue":"6","key":"6_CR70_6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TAC.1986.1104317","volume":"31","author":"KG Shin","year":"1986","unstructured":"K.G.\u00a0Shin, N.D.\u00a0McKay: A dynamic programming approach to trajectory planning of robotic manipulators, IEEE Trans. Autom. Contr. 31(6), 491\u2013500 (1986)","journal-title":"IEEE Trans. Autom. Contr."},{"key":"6_CR71_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3108-8","volume-title":"Nonlinear Systems: Analysis, Stability, and Control","author":"S Sastry","year":"1999","unstructured":"S.\u00a0Sastry: Nonlinear Systems: Analysis, Stability, and Control (Springer, Berlin 1999)"},{"issue":"3","key":"6_CR72_6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1177\/027836402320556403","volume":"21","author":"DJ Balkcom","year":"2002","unstructured":"D.J.\u00a0Balkcom, M.T.\u00a0Mason: Time optimal trajectories for bounded velocity differential drive vehicles, Int. J. Robot. Res. 21(3), 199\u2013217 (2002)","journal-title":"Int. J. Robot. Res."},{"key":"6_CR73_6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BFb0036072","volume-title":"Robot Motion Planning and Control","author":"P Sou\u00e8res","year":"1998","unstructured":"P.\u00a0Sou\u00e8res, J.-D.\u00a0Boissonnat: Optimal trajectories for nonholonomic mobile robots. In: Robot Motion Planning and Control, ed. by J.P.\u00a0Laumond (Springer, Berlin 1998) pp.\u200993\u2013169"},{"key":"6_CR74_6","doi-asserted-by":"crossref","unstructured":"P.\u00a0Svestka, M.H.\u00a0Overmars: Coordinated motion planning for multiple car-like robots using probabilistic roadmaps, IEEE Int. Conf. Robot. Autom. (1995) pp.\u20091631\u20131636","DOI":"10.1109\/ROBOT.1995.525508"},{"key":"6_CR75_6","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1177\/027836499801700803","volume":"17","author":"S Sekhavat","year":"1998","unstructured":"S.\u00a0Sekhavat, P.\u00a0Svestka, J.-P.\u00a0Laumond, M.H.\u00a0Overmars: Multilevel path planning for nonholonomic robots using semiholonomic subsystems, Int. J. Robot. Res. 17, 840\u2013857 (1998)","journal-title":"Int. J. Robot. Res."},{"key":"6_CR76_6","doi-asserted-by":"crossref","unstructured":"P.\u00a0Ferbach: A method of progressive constraints for nonholonomic motion planning, IEEE Int. Conf. Robot. Autom. (1996) pp.\u20092949\u20132955","DOI":"10.1109\/ROBOT.1996.509160"},{"key":"6_CR77_6","doi-asserted-by":"crossref","unstructured":"S.\u00a0Pancanti, L.\u00a0Pallottino, D.\u00a0Salvadorini, A.\u00a0Bicchi: Motion planning through symbols and lattices, IEEE Int. Conf. Robot. Autom. (2004) pp.\u20093914\u20133919","DOI":"10.1109\/ROBOT.2004.1308878"},{"key":"6_CR78_6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01891837","volume":"10","author":"J Barraquand","year":"1993","unstructured":"J.\u00a0Barraquand, J.-C.\u00a0Latombe: Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles, Algorithmica 10, 121\u2013155 (1993)","journal-title":"Algorithmica"},{"key":"6_CR79_6","doi-asserted-by":"crossref","unstructured":"S.M.\u00a0LaValle, J.J.\u00a0Kuffner: Randomized kinodynamic planning, IEEE Int. Conf. Robot. Autom. (1999) pp.\u2009473\u2013479","DOI":"10.1109\/ROBOT.1999.770022"},{"key":"6_CR80_6","doi-asserted-by":"crossref","unstructured":"A. M. Ladd, L. E. Kavraki: Motion planning in the presence of drift underactuation and discrete system changes. In: Robotics: Science and Systems I ed. by (MIT Press, Boston 2005) pp. 233\u2013241","DOI":"10.15607\/RSS.2005.I.031"},{"key":"6_CR81_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-9587-7","volume-title":"Parallel Robots","author":"J-P Merlet","year":"2000","unstructured":"J.-P.\u00a0Merlet: Parallel Robots (Kluwer, Boston 2000)"},{"key":"6_CR82_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"1992","unstructured":"D.\u00a0Cox, J.\u00a0Little, D.\u00a0O\u02bcShea: Ideals, Varieties, and Algorithms (Springer, Berlin 1992)"},{"issue":"1","key":"6_CR83_6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.4310\/HHA.2004.v6.n1.a14","volume":"6","author":"RJ Milgram","year":"2004","unstructured":"R.J.\u00a0Milgram, J.C.\u00a0Trinkle: The geometry of configuration spaces for closed chains in two and three dimensions, Homol. Homot. Appl. 6(1), 237\u2013267 (2004)","journal-title":"Homol. Homot. Appl."},{"issue":"6","key":"6_CR84_6","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/70.976030","volume":"17","author":"J Yakey","year":"2001","unstructured":"J.\u00a0Yakey, S.M.\u00a0LaValle, L.E.\u00a0Kavraki: Randomized path planning for linkages with closed kinematic chains, IEEE Trans. Robot. Autom. 17(6), 951\u2013958 (2001)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR85_6","first-page":"233","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"L Han","year":"2001","unstructured":"L.\u00a0Han, N.M.\u00a0Amato: A kinematics-based probabilistic roadmap method for closed chain systems. In: Algorithmic and Computational Robotics: New Directions, ed. by B.R.\u00a0Donald, K.M.\u00a0Lynch, D.\u00a0Rus (A.K. Peters, Wellesley 2001) pp.\u2009233\u2013246"},{"key":"6_CR86_6","unstructured":"J.\u00a0Cort\u00e9s: Motion Planning Algorithms for General Closed-Chain Mechanisms. Ph.D. Thesis (Institut National Polytechnique do Toulouse, Toulouse 2003)"},{"key":"6_CR87_6","volume-title":"Algorithms for Robotic Motion and Manipulation","author":"R Alami","year":"1997","unstructured":"R.\u00a0Alami, J.-P.\u00a0Laumond, T.\u00a0Sim\u00e9on: Two manipulation planning algorithms. In: Algorithms for Robotic Motion and Manipulation, ed. by J.P.\u00a0Laumond, M.\u00a0Overmars (A.K. Peters, Wellesley 1997)"},{"issue":"3","key":"6_CR88_6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(95)00083-O","volume":"55","author":"LE Kavraki","year":"1995","unstructured":"L.E.\u00a0Kavraki, M.\u00a0Kolountzakis: Partitioning a planar assembly into two connected parts is NP-complete, Inform. Process. Lett. 55(3), 159\u2013165 (1995)","journal-title":"Inform. Process. Lett."},{"key":"6_CR89_6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4527.001.0001","volume-title":"Mechanics of Robotic Manipulation","author":"MT Mason","year":"2001","unstructured":"M.T.\u00a0Mason: Mechanics of Robotic Manipulation (MIT Press, Cambridge 2001)"},{"key":"6_CR90_6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02915447","volume":"26","author":"K Sutner","year":"1988","unstructured":"K.\u00a0Sutner, W.\u00a0Maass: Motion planning among time dependent obstacles, Acta Informatica 26, 93\u2013122 (1988)","journal-title":"Acta Informatica"},{"key":"6_CR91_6","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1145\/179812.179911","volume":"41","author":"JH Reif","year":"1994","unstructured":"J.H.\u00a0Reif, M.\u00a0Sharir: Motion planning in the presence of moving obstacles, J. ACM 41, 764\u2013790 (1994)","journal-title":"J. ACM"},{"key":"6_CR92_6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"MA Erdmann","year":"1987","unstructured":"M.A.\u00a0Erdmann, T.\u00a0Lozano-P\u00e9rez: On multiple moving objects, Algorithmica 2, 477\u2013521 (1987)","journal-title":"Algorithmica"},{"key":"6_CR93_6","doi-asserted-by":"crossref","unstructured":"J.\u00a0van den Berg, M.\u00a0Overmars: Prioritized motion planning for multiple robots, IEEE\/RSJ Int. Conf. Intell. Robot. Syst. (2005) pp.\u20092217\u20132222","DOI":"10.1109\/IROS.2005.1545306"},{"issue":"1","key":"6_CR94_6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/70.988973","volume":"18","author":"T Sim\u00e9on","year":"2002","unstructured":"T.\u00a0Sim\u00e9on, S.\u00a0Leroy, J.-P.\u00a0Laumond: Path coordination for multiple mobile robots: A resolution complete algorithm, IEEE Trans. Robot. Autom. 18(1), 42\u201349 (2002)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR95_6","unstructured":"R.\u00a0Ghrist, J.M.\u00a0O\u02bcKane, S.M.\u00a0LaValle: Pareto optimal coordination on roadmaps, Workshop Algorithm. Found. Robot. (2004) pp.\u2009185\u2013200"},{"issue":"6","key":"6_CR96_6","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/70.736775","volume":"14","author":"SM LaValle","year":"1998","unstructured":"S.M.\u00a0LaValle, S.A.\u00a0Hutchinson: Optimal motion planning for multiple robots having independent goals, IEEE Trans. Robot. Autom. 14(6), 912\u2013925 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"6_CR97_6","volume-title":"An Introduction to Differentiable Manifolds and Riemannian Geometry","author":"WM Boothby","year":"2003","unstructured":"W.M.\u00a0Boothby: An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. (Academic, New York 2003)","edition":"2nd"},{"key":"6_CR98_6","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"A.\u00a0Hatcher: Algebraic Topology (Cambridge Univ Press, Cambridge 2002)"},{"key":"6_CR99_6","volume-title":"Engineering Applications of Noncommutative Harmonic Analysis","author":"GS Chirikjian","year":"2001","unstructured":"G.S.\u00a0Chirikjian, A.B.\u00a0Kyatkin: Engineering Applications of Noncommutative Harmonic Analysis (CRC, Boca Raton 2001)"},{"key":"6_CR100_6","first-page":"117","volume-title":"Graphics Gems III","author":"J Arvo","year":"1992","unstructured":"J.\u00a0Arvo: Fast random rotation matrices. In: Graphics Gems III, ed. by D.\u00a0Kirk (Academic, New York 1992) pp.\u2009117\u2013120"},{"key":"6_CR101_6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte-Carlo Methods","author":"H Niederreiter","year":"1992","unstructured":"H.\u00a0Niederreiter: Random Number Generation and Quasi-Monte-Carlo Methods (Society for Industrial and Applied Mathematics, Philadelphia 1992)"},{"key":"6_CR102_6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2003","unstructured":"S.\u00a0Basu, R.\u00a0Pollack, M.-F.\u00a0Roy: Algorithms in Real Algebraic Geometry (Springer, Berlin 2003)"},{"key":"6_CR103_6","first-page":"537","volume-title":"Handbook of Discrete and Computational Geometry","author":"B Mishra","year":"1997","unstructured":"B.\u00a0Mishra: Computational real algebraic geometry. In: Handbook of Discrete and Computational Geometry, ed. by J.E.\u00a0Goodman, J.\u00a0O\u02bcRourke (CRC, New York 1997) pp.\u2009537\u2013556"},{"key":"6_CR104_6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"JT Schwartz","year":"1983","unstructured":"J.T.\u00a0Schwartz, M.\u00a0Sharir: On the piano movers\u02bc problem: II. General techniques for computing topological properties of algebraic manifolds, Commun. Pure Appl. Math. 36, 345\u2013398 (1983)","journal-title":"Commun. Pure Appl. Math."},{"key":"6_CR105_6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(87)90069-5","volume":"31","author":"BR Donald","year":"1987","unstructured":"B.R.\u00a0Donald: A search algorithm for motion planning with six degrees of freedom, Artif. Intell. J. 31, 295\u2013353 (1987)","journal-title":"Artif. Intell. J."},{"issue":"1-3","key":"6_CR106_6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0004-3702(88)90049-5","volume":"37","author":"DS Arnon","year":"1988","unstructured":"D.S.\u00a0Arnon: Geometric reasoning with logic and algebra, Artif. Intell. J. 37(1-3), 37\u201360 (1988)","journal-title":"Artif. Intell. J."},{"key":"6_CR107_6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/978-3-7091-9459-1_2","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"GE Collins","year":"1998","unstructured":"G.E.\u00a0Collins: Quantifier elimination by cylindrical algebraic decomposition\u2013twenty years of progress. In: Quantifier Elimination and Cylindrical Algebraic Decomposition, ed. by B.F.\u00a0Caviness, J.R.\u00a0Johnson (Springer, Berlin 1998) pp.\u20098\u201323"}],"container-title":["Springer Handbook of Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30301-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:26:28Z","timestamp":1778250388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30301-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540239574","9783540303015"],"references-count":107,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30301-5_6","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}