{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:47:45Z","timestamp":1774367265722,"version":"3.50.1"},"publisher-location":"Cham","reference-count":124,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319325507","type":"print"},{"value":"9783319325521","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32552-1_7","type":"book-chapter","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T19:03:33Z","timestamp":1469646213000},"page":"139-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"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","published-online":{"date-parts":[[2016,7,27]]},"reference":[{"key":"7_CR1","first-page":"421","volume-title":"IEEE Symp. Found. Comput. Sci.","author":"J.H. Reif","year":"1979","unstructured":"J.H. Reif: Complexity of the mover's problem and generalizations, IEEE Symp. Found. Comput. Sci. (1979) pp. 421\u2013427"},{"key":"7_CR2","volume-title":"Automous Mobile Robots: Sensing, Control, Decision-Making and Applications","author":"H.H. Gonzalez-Banos","year":"2006","unstructured":"H.H. Gonzalez-Banos, D. Hsu, J.C. Latombe: Motion planning: Recent developments. In: Automous Mobile Robots: Sensing, Control, Decision-Making and Applications, ed. by S.S. Ge, F.L. Lewis (CRC, Boca Raton 2006)"},{"key":"7_CR3","first-page":"36","volume-title":"11th Int. Symp. Robotics Res.","author":"S.R. Lindemann","year":"2005","unstructured":"S.R. Lindemann, S.M. LaValle: Current issues in sampling-based motion planning, 11th Int. Symp. Robotics Res. (Springer, Berlin, Heidelberg 2005) pp. 36\u201354"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0004-3702(88)90053-7","volume":"37","author":"J.T. Schwartz","year":"1988","unstructured":"J.T. Schwartz, M. Sharir: A\u00a0survey of motion planning and related geometric algorithms, Artif. Intell. J. 37, 157\u2013169 (1988)","journal-title":"Artif. Intell. J."},{"key":"7_CR5","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H. Choset","year":"2005","unstructured":"H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, S. Thrun: Principles of Robot Motion: Theory, Algorithms, and Implementations (MIT, Cambridge 2005)"},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.C. Latombe","year":"1991","unstructured":"J.C. Latombe: Robot Motion Planning (Kluwer, Boston 1991)"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"S.M. LaValle: Planning Algorithms (Cambridge Univ. Press, Cambridge 2006)"},{"key":"7_CR8","series-title":"Ph.D. Thesis","volume-title":"Collision detection and avoidance in computer controlled manipulators","author":"S. Udupa","year":"1977","unstructured":"S. Udupa: Collision detection and avoidance in computer controlled manipulators, Ph.D. Thesis (Dept. of Electical Engineering, California Institute of Technology, Pasadena 1977)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"32","author":"T. Lozano-P\u00e9rez","year":"1983","unstructured":"T. Lozano-P\u00e9rez: Spatial planning: A\u00a0configuration space approach, IEEE Trans. Comput. C 32(2), 108\u2013120 (1983)","journal-title":"IEEE Trans. Comput. C"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1177\/027836498300200304","volume":"2","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz, M. Sharir: On the piano movers' problem: III. Coordinating the motion of several independent bodies, Int. J. Robotics Res. 2(3), 97\u2013140 (1983)","journal-title":"Int. J. Robotics Res."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1002\/cpa.3160370605","volume":"37","author":"J.T. Schwartz","year":"1984","unstructured":"J.T. Schwartz, M. Sharir: On the piano movers' problem: V. The case of a\u00a0rod moving in three-dimensional space amidst polyhedral obstacles, Commun. Pure Appl. Math. 37, 815\u2013848 (1984)","journal-title":"Commun. Pure Appl. Math."},{"key":"7_CR12","volume-title":"The Complexity of Robot Motion Planning","author":"J.F. Canny","year":"1988","unstructured":"J.F. Canny: The Complexity of Robot Motion Planning (MIT, Cambridge 1988)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02716803","volume":"16","author":"D. Halperin","year":"1996","unstructured":"D. Halperin, M. Sharir: A\u00a0near-quadratic algorithm for planning the motion of a\u00a0polygon in a\u00a0polygonal environment, Discret. Comput. Geom. 16, 121\u2013134 (1996)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1177\/027836498400300405","volume":"3","author":"J.E. Hopcroft","year":"1984","unstructured":"J.E. Hopcroft, J.T. Schwartz, M. Sharir: On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the warehouseman's problem, Int. J. Robotics Res. 3(4), 76\u201388 (1984)","journal-title":"Int. J. Robotics Res."},{"key":"7_CR15","first-page":"49","volume-title":"IEEE Symp. Found. Comput. Sci.","author":"J. Canny","year":"1987","unstructured":"J. Canny, J. Reif: New lower bound techniques for robot motion planning problems, IEEE Symp. Found. Comput. Sci. (1987) pp. 49\u201360"},{"key":"7_CR16","first-page":"1008","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"M.C. Lin","year":"1991","unstructured":"M.C. Lin, J.F. Canny: Efficient algorithms for incremental distance computation, IEEE Int. Conf. Robotics Autom. (1991) pp. 1008\u20131014"},{"key":"7_CR17","first-page":"1","volume-title":"Robot Motion Planning and Control","author":"P. Jim\u00e9nez","year":"1998","unstructured":"P. Jim\u00e9nez, F. Thomas, C. Torras: Collision detection algorithms for motion planning. In: Robot Motion Planning and Control, ed. by J.P. Laumond (Springer, Berlin, Heidelberg 1998) pp. 1\u201353"},{"key":"7_CR18","first-page":"787","volume-title":"Handbook of Discrete and Computational Geometry","author":"M.C. Lin","year":"2004","unstructured":"M.C. Lin, D. Manocha: Collision and proximity queries. In: Handbook of Discrete and Computational Geometry, 2nd edn., ed. by J.E. Goodman, J. O'Rourke (Chapman Hall\/CRC, Boca Raton 2004) pp. 787\u2013807","edition":"2"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L.E. Kavraki","year":"1996","unstructured":"L.E. Kavraki, P. Svestka, J.C. Latombe, M.H. Overmars: Probabilistic roadmaps for path planning in high-dimensional configuration spaces, IEEE Trans. Robotics Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR20","first-page":"155","volume-title":"Workshop Algorith. Found. Robotics","author":"N.M. Amato","year":"1998","unstructured":"N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, D. Vallejo: OBPRM: An obstacle-based PRM for 3-D workspaces, Workshop Algorith. Found. Robotics (1998) pp. 155\u2013168"},{"key":"7_CR21","first-page":"1018","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"V. Boor","year":"1999","unstructured":"V. Boor, M.H. Overmars, A.F. van der Stappen: The Gaussian sampling strategy for probabilistic roadmap planners, IEEE Int. Conf. Robotics Autom. (1999) pp. 1018\u20131023"},{"key":"7_CR22","first-page":"1408","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"C. Holleman","year":"2000","unstructured":"C. Holleman, L.E. Kavraki: A\u00a0framework for using the workspace medial axis in PRM planners, IEEE Int. Conf. Robotics Autom. (2000) pp. 1408\u20131413"},{"key":"7_CR23","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"J.M. Lien","year":"2003","unstructured":"J.M. Lien, S.L. Thomas, N.M. Amato: A\u00a0general framework for sampling on the medial axis of the free space, IEEE Int. Conf. Robotics Autom. (2003)"},{"issue":"7\/8","key":"7_CR24","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1177\/0278364904045481","volume":"23","author":"S.M. LaValle","year":"2004","unstructured":"S.M. LaValle, M.S. Branicky, S.R. Lindemann: On the relationship between classical grid search and probabilistic roadmaps, Int. J. Robotics Res. 23(7\/8), 673\u2013692 (2004)","journal-title":"Int. J. Robotics Res."},{"issue":"6","key":"7_CR25","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1163\/156855300741960","volume":"14","author":"T. Sim\u00e9on","year":"2000","unstructured":"T. Sim\u00e9on, J.-P. Laumond, C. Nissoux: Visibility based probabilistic roadmaps for motion planning, Adv. Robotics 14(6), 477\u2013493 (2000)","journal-title":"Adv. Robotics"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-1-4471-1021-7_28","volume-title":"Proc. Int. Symp. Robotics Res.","author":"J. Barraquand","year":"1996","unstructured":"J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, P. Raghavan: A\u00a0random sampling scheme for robot path planning, Proc. Int. Symp. Robotics Res. (1996) pp. 249\u2013264"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/TRA.2004.824649","volume":"20","author":"A. Ladd","year":"2004","unstructured":"A. Ladd, L.E. Kavraki: Measure theoretic analysis of probabilistic path planning, IEEE Trans. Robotics Autom. 20(2), 229\u2013242 (2004)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR28","first-page":"600","volume-title":"Int. Conf. Intell. Auton. Syst.","author":"R. Geraerts","year":"2004","unstructured":"R. Geraerts, M. Overmars: Sampling techniques for probabilistic roadmap planners, Int. Conf. Intell. Auton. Syst. (2004) pp. 600\u2013609"},{"key":"7_CR29","first-page":"4420","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"D. Hsu","year":"2003","unstructured":"D. Hsu, T. Jiang, J. Reif, Z. Sun: The bridge test for sampling narrow passages with probabilistic roadmap planners, IEEE Int. Conf. Robotics Autom. (2003) pp. 4420\u20134426"},{"key":"7_CR30","first-page":"521","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"R. Bohlin","year":"2000","unstructured":"R. Bohlin, L. Kavraki: Path planning using lazy PRM, IEEE Int. Conf. Robotics Autom. (2000) pp. 521\u2013528"},{"key":"7_CR31","first-page":"3120","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"B. Burns","year":"2005","unstructured":"B. Burns, O. Brock: Sampling-based motion planning using predictive models, IEEE Int. Conf. Robotics Autom. (2005) pp. 3120\u20133125"},{"key":"7_CR32","first-page":"2323","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"P. Isto","year":"2002","unstructured":"P. Isto: Constructing probabilistic roadmaps with powerful local planning and path optimization, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2002) pp. 2323\u20132328"},{"issue":"6","key":"7_CR33","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/TRA.2003.819732","volume":"19","author":"P. Leven","year":"2003","unstructured":"P. Leven, S.A. Hutchinson: Using manipulability to bias sampling during the construction of probabilistic roadmaps, IEEE Trans. Robotics Autom. 19(6), 1020\u20131026 (2003)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR34","first-page":"446","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"D. Nieuwenhuisen","year":"2004","unstructured":"D. Nieuwenhuisen, M.H. Overmars: Useful cycles in probabilistic roadmap graphs, IEEE Int. Conf. Robotics Autom. (2004) pp. 446\u2013452"},{"key":"7_CR35","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Direction","author":"S.M. LaValle","year":"2001","unstructured":"S.M. LaValle, J.J. Kuffner: Rapidly-exploring random trees: progress and prospects. In: Algorithmic and Computational Robotics: New Direction, ed. by B.R. Donald, K.M. Lynch, D. Rus (A.K. Peters, Wellesley 2001) pp. 293\u2013308"},{"key":"7_CR36","first-page":"656","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"K.E. Bekris","year":"2003","unstructured":"K.E. Bekris, B.Y. Chen, A. Ladd, E. Plaku, L.E. Kavraki: Multiple query probabilistic roadmap planning using single query primitives, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2003) pp. 656\u2013661"},{"key":"7_CR37","first-page":"3258","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"M. Strandberg","year":"2004","unstructured":"M. Strandberg: Augmenting RRT-planners with local trees, IEEE Int. Conf. Robotics Autom. (2004) pp. 3258\u20133262"},{"key":"7_CR38","series-title":"Techn. Rep. CMU-RI-TR-05-34 Robotics Institute","volume-title":"An Efficient Approach to Path Planning Using Balanced Bidirectional RRT Search","author":"J.J. Kuffner","year":"2005","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":"7_CR39","first-page":"2383","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"J. Bruce","year":"2002","unstructured":"J. Bruce, M. Veloso: Real-time randomized path planning for robot navigation, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2002) pp. 2383\u20132388"},{"issue":"1","key":"7_CR40","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2514\/2.4856","volume":"25","author":"E. Frazzoli","year":"2002","unstructured":"E. Frazzoli, M.A. Dahleh, E. Feron: Real-time motion planning for agile autonomous vehicles, AIAA J. Guid. Contr. 25(1), 116\u2013129 (2002)","journal-title":"AIAA J. Guid. Contr."},{"key":"7_CR41","first-page":"4399","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"M. Kallmann","year":"2004","unstructured":"M. Kallmann, M. Mataric: Motion planning using dynamic roadmaps, IEEE Int. Conf. Robotics Autom. (2004) pp. 4399\u20134404"},{"key":"7_CR42","first-page":"3867","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"A. Yershova","year":"2005","unstructured":"A. Yershova, L. Jaillet, T. Simeon, S.M. LaValle: Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain, IEEE Int. Conf. Robotics Autom. (2005) pp. 3867\u20133872"},{"key":"7_CR43","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0218195999000285","volume":"4","author":"D. Hsu","year":"1999","unstructured":"D. Hsu, J.C. Latombe, R. Motwani: Path planning in expansive configuration spaces, Int. J. Comput. Geom. Appl. 4, 495\u2013512 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"7_CR44","first-page":"247","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"D. Hsu","year":"2001","unstructured":"D. Hsu, R. Kindel, J.C. Latombe, S. Rock: Randomized kinodynamic motion planning with moving obstacles. In: Algorithmic and Computational Robotics: New Directions, ed. by B.R. Donald, K.M. Lynch, D. Rus (A.K. Peters, Wellesley 2001) pp. 247\u2013264"},{"key":"7_CR45","first-page":"403","volume-title":"ISRR Int. Symp. Robotics Res.","author":"G. S\u00e1nchez","year":"2007","unstructured":"G. S\u00e1nchez, J.-C. Latombe: A\u00a0single-query bi-directional probabilistic roadmap planner with lazy collision checking, ISRR Int. Symp. Robotics Res. (2007) pp. 403\u2013413"},{"key":"7_CR46","first-page":"3809","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"S. Carpin","year":"2003","unstructured":"S. Carpin, G. Pillonetto: Robot motion planning using adaptive random walks, IEEE Int. Conf. Robotics Autom. (2003) pp. 3809\u20133814"},{"key":"7_CR47","volume-title":"Workshop Algorithm. Found. Robotics, Amsterdam","author":"A. Ladd","year":"2004","unstructured":"A. Ladd, L.E. Kavraki: Fast exploration for robots with dynamics, Workshop Algorithm. Found. Robotics, Amsterdam (2004)"},{"key":"7_CR48","first-page":"704","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"K.E. Bekris","year":"2007","unstructured":"K.E. Bekris, L.E. Kavraki: Greedy but safe replanning under differential constraints, IEEE Int. Conf. Robotics Autom. (2007) pp. 704\u2013710"},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","volume":"6","author":"C. O'Dunlaing","year":"1982","unstructured":"C. O'Dunlaing, C.K. Yap: A\u00a0retraction method for planning the motion of a\u00a0disc, J. Algorithms 6, 104\u2013111 (1982)","journal-title":"J. Algorithms"},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D. Leven","year":"1987","unstructured":"D. Leven, M. Sharir: Planning a\u00a0purely translational motion for a\u00a0convex object in two-dimensional space using generalized Voronoi diagrams, Discret. Comput. Geom. 2, 9\u201331 (1987)","journal-title":"Discret. Comput. Geom."},{"key":"7_CR51","first-page":"1037","volume-title":"Handbook of Discrete and Computational Geometry","author":"M. Sharir","year":"2004","unstructured":"M. Sharir: Algorithmic motion planning. In: Handbook of Discrete and Computational Geometry, 2nd edn., ed. by J.E. Goodman, J. O'Rourke (Chapman Hall\/CRC, Boca Raton 2004) pp. 1037\u20131064","edition":"2"},{"key":"7_CR52","first-page":"509","volume-title":"1st Int. Conf. Artif. Intell.","author":"N.J. Nilsson","year":"1969","unstructured":"N.J. Nilsson: A\u00a0mobile automaton: An application of artificial intelligence techniques, 1st Int. Conf. Artif. Intell. (1969) pp. 509\u2013520"},{"key":"7_CR53","first-page":"643","volume-title":"Handbook of Discrete and Computational Geometry","author":"J. O'Rourke","year":"2004","unstructured":"J. O'Rourke: Visibility. In: Handbook of Discrete and Computational Geometry, 2nd edn., ed. by J.E. Goodman, J. O'Rourke (Chapman Hall\/CRC, Boca Raton 2004) pp. 643\u2013663","edition":"2"},{"key":"7_CR54","first-page":"145","volume-title":"Algorithmic and Geometric Aspects of Robotics","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle: Approximation and decomposition of shapes. In: Algorithmic and Geometric Aspects of Robotics, ed. by J.T. Schwartz, C.K. Yap (Lawrence Erlbaum, Hillsdale 1987) pp. 145\u2013185"},{"key":"7_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"2000","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf: Computational Geometry: Algorithms and Applications, 2nd edn. (Springer, Berlin, Heidelberg 2000)","edition":"2"},{"key":"7_CR56","volume-title":"Handbook on Computational Geometry","author":"J.M. Keil","year":"2000","unstructured":"J.M. Keil: Polygon decomposition. In: Handbook on Computational Geometry, ed. by J.R. Sack, J. Urrutia (Elsevier, New York 2000)"},{"key":"7_CR57","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz, M. Sharir: On the piano movers' problem: I. The case of a\u00a0two-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":"7_CR58","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O. Khatib","year":"1986","unstructured":"O. Khatib: Real-time obstacle avoidance for manipulators and mobile robots, Int. J. Robotics Res. 5(1), 90\u201398 (1986)","journal-title":"Int. J. Robotics Res."},{"issue":"6","key":"7_CR59","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1177\/027836499101000604","volume":"10","author":"J. Barraquand","year":"1991","unstructured":"J. Barraquand, J.-C. Latombe: Robot motion planning: A\u00a0distributed representation approach, Int. J. Robotics Res. 10(6), 628\u2013649 (1991)","journal-title":"Int. J. Robotics Res."},{"issue":"5","key":"7_CR60","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/70.163777","volume":"8","author":"E. Rimon","year":"1992","unstructured":"E. Rimon, D.E. Koditschek: Exact robot navigation using artificial potential fields, IEEE Trans. Robotics Autom. 8(5), 501\u2013518 (1992)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR61","first-page":"346","volume-title":"Int. Conf. Intell. Auton. Syst.","author":"J.P. Laumond","year":"1986","unstructured":"J.P. Laumond: Trajectories for mobile robots with kinematic and environment constraints, Int. Conf. Intell. Auton. Syst. (1986) pp. 346\u2013354"},{"key":"7_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0036069","volume-title":"Robot Motion Planning and Control","author":"J.P. Laumond","year":"1998","unstructured":"J.P. Laumond, S. Sekhavat, F. Lamiraux: Guidelines in nonholonomic motion planning for mobile robots. In: Robot Motion Planning and Control, ed. by J.P. Laumond (Springer, Berlin, Heidelberg 1998) pp. 1\u201353"},{"key":"7_CR63","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1145\/174147.174150","volume":"40","author":"B.R. Donald","year":"1993","unstructured":"B.R. Donald, P.G. Xavier, J. Canny, J. Reif: Kinodynamic planning, Journal ACM 40, 1048\u20131066 (1993)","journal-title":"Journal ACM"},{"issue":"4","key":"7_CR64","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01840370","volume":"2","author":"C. O'Dunlaing","year":"1987","unstructured":"C. O'Dunlaing: Motion planning with inertial constraints, Algorithmica 2(4), 431\u2013475 (1987)","journal-title":"Algorithmica"},{"key":"7_CR65","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF02574702","volume":"6","author":"J. Canny","year":"1991","unstructured":"J. Canny, A. Rege, J. Reif: An exact algorithm for kinodynamic planning in the plane, Discret. Comput. Geom. 6, 461\u2013484 (1991)","journal-title":"Discret. Comput. Geom."},{"key":"7_CR66","first-page":"9","volume-title":"SIGGRAPH\/Eurographics Symp. Comput. Animat., Aire-la-Ville","author":"J. Go","year":"2004","unstructured":"J. Go, T. Vu, J.J. Kuffner: Autonomous behaviors for interactive vehicle animations, SIGGRAPH\/Eurographics Symp. Comput. Animat., Aire-la-Ville (2004) pp. 9\u201318"},{"key":"7_CR67","first-page":"3231","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"M. Pivtoraiko","year":"2005","unstructured":"M. Pivtoraiko, A. Kelly: Generating near minimal spanning control sets for constrained motion planning in discrete state spaces, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2005) pp. 3231\u20133237"},{"key":"7_CR68","series-title":"Tech. Rep. 700","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.1983.4788214","volume-title":"Dynamic scaling of manipulator trajectories","author":"J. Hollerbach","year":"1983","unstructured":"J. Hollerbach: Dynamic scaling of manipulator trajectories, Tech. Rep. 700 (MIT, Cambridge 1983)"},{"issue":"6","key":"7_CR69","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TAC.1985.1104009","volume":"30","author":"K.G. Shin","year":"1985","unstructured":"K.G. Shin, N.D. McKay: Minimum-time control of robot manipulators with geometric path constraints, IEEE Trans. Autom. Control 30(6), 531\u2013541 (1985)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"7_CR70","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TAC.1986.1104317","volume":"31","author":"K.G. Shin","year":"1986","unstructured":"K.G. Shin, N.D. McKay: A\u00a0dynamic programming approach to trajectory planning of robotic manipulators, IEEE Trans. Autom. Control 31(6), 491\u2013500 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"7_CR71","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3108-8","volume-title":"Nonlinear Systems: Analysis, Stability, and Control","author":"S. Sastry","year":"1999","unstructured":"S. Sastry: Nonlinear Systems: Analysis, Stability, and Control (Springer, Berlin, Heidelberg 1999)"},{"issue":"3","key":"7_CR72","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1177\/027836402320556403","volume":"21","author":"D.J. Balkcom","year":"2002","unstructured":"D.J. Balkcom, M.T. Mason: Time optimal trajectories for bounded velocity differential drive vehicles, Int. J. Robotics Res. 21(3), 199\u2013217 (2002)","journal-title":"Int. J. Robotics Res."},{"key":"7_CR73","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. Sou\u00e8res, J.-D. Boissonnat: Optimal trajectories for nonholonomic mobile robots. In: Robot Motion Planning and Control, ed. by J.P. Laumond (Springer, Berlin, Heidelberg 1998) pp. 93\u2013169"},{"key":"7_CR74","first-page":"1631","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"P. Svestka","year":"1995","unstructured":"P. Svestka, M.H. Overmars: Coordinated motion planning for multiple car-like robots using probabilistic roadmaps, IEEE Int. Conf. Robotics Autom. (1995) pp. 1631\u20131636"},{"key":"7_CR75","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1177\/027836499801700803","volume":"17","author":"S. Sekhavat","year":"1998","unstructured":"S. Sekhavat, P. Svestka, J.-P. Laumond, M.H. Overmars: Multilevel path planning for nonholonomic robots using semiholonomic subsystems, Int. J. Robotics Res. 17, 840\u2013857 (1998)","journal-title":"Int. J. Robotics Res."},{"key":"7_CR76","first-page":"2949","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"P. Ferbach","year":"1996","unstructured":"P. Ferbach: A\u00a0method of progressive constraints for nonholonomic motion planning, IEEE Int. Conf. Robotics Autom. (1996) pp. 2949\u20132955"},{"key":"7_CR77","first-page":"3914","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"S. Pancanti","year":"2004","unstructured":"S. Pancanti, L. Pallottino, D. Salvadorini, A. Bicchi: Motion planning through symbols and lattices, IEEE Int. Conf. Robotics Autom. (2004) pp. 3914\u20133919"},{"key":"7_CR78","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01891837","volume":"10","author":"J. Barraquand","year":"1993","unstructured":"J. Barraquand, J.-C. Latombe: Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles, Algorithmica 10, 121\u2013155 (1993)","journal-title":"Algorithmica"},{"key":"7_CR79","first-page":"473","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"S.M. LaValle","year":"1999","unstructured":"S.M. LaValle, J.J. Kuffner: Randomized kinodynamic planning, IEEE Int. Conf. Robotics Autom. (1999) pp. 473\u2013479"},{"key":"7_CR80","first-page":"233","volume-title":"Robotics Sci. Syst.\u00a0I, Cambridge","author":"A.M. Ladd","year":"2005","unstructured":"A.M. Ladd, L.E. Kavraki: Motion planning in the presence of drift underactuation and discrete system changes, Robotics Sci. Syst.\u00a0I, Cambridge (2005) pp. 233\u2013241"},{"key":"7_CR81","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-9587-7","volume-title":"Parallel Robots","author":"J.-P. Merlet","year":"2000","unstructured":"J.-P. Merlet: Parallel Robots (Kluwer, Boston 2000)"},{"key":"7_CR82","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1992","unstructured":"D. Cox, J. Little, D. O'Shea: Ideals, Varieties, and Algorithms (Springer, Berlin, Heidelberg 1992)"},{"issue":"1","key":"7_CR83","doi-asserted-by":"publisher","first-page":"237","DOI":"10.4310\/HHA.2004.v6.n1.a14","volume":"6","author":"R.J. Milgram","year":"2004","unstructured":"R.J. Milgram, J.C. Trinkle: 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":"7_CR84","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/70.976030","volume":"17","author":"J. Yakey","year":"2001","unstructured":"J. Yakey, S.M. LaValle, L.E. Kavraki: Randomized path planning for linkages with closed kinematic chains, IEEE Trans. Robotics Autom. 17(6), 951\u2013958 (2001)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR85","first-page":"233","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"L. Han","year":"2001","unstructured":"L. Han, N.M. Amato: A\u00a0kinematics-based probabilistic roadmap method for closed chain systems. In: Algorithmic and Computational Robotics: New Directions, ed. by B.R. Donald, K.M. Lynch, D. Rus (A.K. Peters, Wellesley 2001) pp. 233\u2013246"},{"key":"7_CR86","series-title":"Ph.D. Thesis","volume-title":"Motion Planning Algorithms for General Closed-Chain Mechanisms","author":"J. Cort\u00e9s","year":"2003","unstructured":"J. Cort\u00e9s: Motion Planning Algorithms for General Closed-Chain Mechanisms, Ph.D. Thesis (Institut National Polytechnique do Toulouse, Toulouse 2003)"},{"key":"7_CR87","volume-title":"Algorithms for Robotic Motion and Manipulation","author":"R. Alami","year":"1997","unstructured":"R. Alami, J.-P. Laumond, T. Sim\u00e9on: Two manipulation planning algorithms. In: Algorithms for Robotic Motion and Manipulation, ed. by J.P. Laumond, M. Overmars (A.K. Peters, Wellesley 1997)"},{"issue":"3","key":"7_CR88","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(95)00083-O","volume":"55","author":"L.E. Kavraki","year":"1995","unstructured":"L.E. Kavraki, M. Kolountzakis: Partitioning a\u00a0planar assembly into two connected parts is NP-complete, Inform. Process. Lett. 55(3), 159\u2013165 (1995)","journal-title":"Inform. Process. Lett."},{"key":"7_CR89","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4527.001.0001","volume-title":"Mechanics of Robotic Manipulation","author":"M.T. Mason","year":"2001","unstructured":"M.T. Mason: Mechanics of Robotic Manipulation (MIT, Cambridge 2001)"},{"key":"7_CR90","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02915447","volume":"26","author":"K. Sutner","year":"1988","unstructured":"K. Sutner, W. Maass: Motion planning among time dependent obstacles, Acta Inform. 26, 93\u2013122 (1988)","journal-title":"Acta Inform."},{"key":"7_CR91","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1145\/179812.179911","volume":"41","author":"J.H. Reif","year":"1994","unstructured":"J.H. Reif, M. Sharir: Motion planning in the presence of moving obstacles, Journal ACM 41, 764\u2013790 (1994)","journal-title":"Journal ACM"},{"key":"7_CR92","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M.A. Erdmann","year":"1987","unstructured":"M.A. Erdmann, T. Lozano-P\u00e9rez: On multiple moving objects, Algorithmica 2, 477\u2013521 (1987)","journal-title":"Algorithmica"},{"key":"7_CR93","first-page":"2217","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"J. van den Berg","year":"2005","unstructured":"J. van den Berg, M. Overmars: Prioritized motion planning for multiple robots, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2005) pp. 2217\u20132222"},{"issue":"1","key":"7_CR94","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/70.988973","volume":"18","author":"T. Sim\u00e9on","year":"2002","unstructured":"T. Sim\u00e9on, S. Leroy, J.-P. Laumond: Path coordination for multiple mobile robots: A\u00a0resolution complete algorithm, IEEE Trans. Robotics Autom. 18(1), 42\u201349 (2002)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR95","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-45058-0_12","volume-title":"Workshop Algorithm. Found. Robotics","author":"R. Ghrist","year":"2004","unstructured":"R. Ghrist, J.M. O'Kane, S.M. LaValle: Pareto optimal coordination on roadmaps, Workshop Algorithm. Found. Robotics (2004) pp. 185\u2013200"},{"issue":"6","key":"7_CR96","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/70.736775","volume":"14","author":"S.M. LaValle","year":"1998","unstructured":"S.M. LaValle, S.A. Hutchinson: Optimal motion planning for multiple robots having independent goals, IEEE Trans. Robotics Autom. 14(6), 912\u2013925 (1998)","journal-title":"IEEE Trans. Robotics Autom."},{"key":"7_CR97","volume-title":"Stochastic Systems","author":"P.R. Kumar","year":"1986","unstructured":"P.R. Kumar, P. Varaiya: Stochastic Systems (Prentice Hall, Englewood Cliffs 1986)"},{"key":"7_CR98","series-title":"Foundations and Trends in Robotics","volume-title":"Sensing and Filtering: A\u00a0Fresh Perspective Based on Preimages and Information Spaces","author":"S.M. LaValle","year":"2012","unstructured":"S.M. LaValle: Sensing and Filtering: A\u00a0Fresh Perspective Based on Preimages and Information\n\t\t\tSpaces, Foundations and Trends in Robotics (Now Publ., Delft 2012)"},{"key":"7_CR99","first-page":"233","volume":"3","author":"R. Alterovitz","year":"2007","unstructured":"R. Alterovitz, N. Simeon, K. Goldberg: The stochastic motion roadmap: A\u00a0sampling framework for planning with Markov motion uncertainty, Robotics Sci. Syst. 3, 233\u2013241 (2007)","journal-title":"Robotics Sci. Syst."},{"key":"7_CR100","volume-title":"Robotics Sci. Syst.","author":"H. Kurniawati","year":"2008","unstructured":"H. Kurniawati, D. Hsu, W.S. Lee: SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces, Robotics Sci. Syst. (2008)"},{"key":"7_CR101","first-page":"1025","volume-title":"Int. Joint Conf. Artif. Intell.","author":"J. Pineau","year":"2003","unstructured":"J. Pineau, G. Gordon, S. Thrun: Point-based value iteration, Int. Joint Conf. Artif. Intell. (2003) pp. 1025\u20131032"},{"key":"7_CR102","volume-title":"Robotics Sci. Syst.","author":"R. Platt","year":"2010","unstructured":"R. Platt, R. Tedrake, T. Lozano-Perez, L.P. Kaelbling: Belief space planning assuming maximum likelihood observations, Robotics Sci. Syst. (2010)"},{"key":"7_CR103","volume-title":"Adv. Neural Inform. Process. Syst.","author":"N. Roy","year":"2003","unstructured":"N. Roy, G. Gordon: Exponential family PCA for belief compression in POMDPs, Adv. Neural Inform. Process. Syst. (2003)"},{"key":"7_CR104","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"R. He","year":"2008","unstructured":"R. He, S. Prentice, N. Roy: Planning in information space for a\u00a0quadrotor helicopter in a\u00a0GPS-denied environment, IEEE Int. Conf. Robotics Autom. (2008)"},{"key":"7_CR105","first-page":"476","volume-title":"AAAI Nat. Conf. Artif. Intell.","author":"S. Koenig","year":"2002","unstructured":"S. Koenig, M. Likhachev: $D^{*}$ lite, AAAI Nat. Conf. Artif. Intell. (2002) pp. 476\u2013483"},{"key":"7_CR106","first-page":"3310","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"A. Stentz","year":"1994","unstructured":"A. Stentz: Optimal and efficient path planning for partially-known environments, IEEE Int. Conf. Robotics Autom. (1994) pp. 3310\u20133317"},{"key":"7_CR107","first-page":"508","volume-title":"IEEE Symp. Found. Comp. Sci.","author":"J. Hershberger","year":"1995","unstructured":"J. Hershberger, S. Suri: Efficient Computation of Euclidean shortest paths in the plane, IEEE Symp. Found. Comp. Sci. (1995) pp. 508\u2013517"},{"issue":"3","key":"7_CR108","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"J.S.B. Mitchell: Shortest paths among obstacles in the plane, Int. J. Comput. Geom. Applic. 6(3), 309 (1996)","journal-title":"Int. J. Comput. Geom. Applic."},{"key":"7_CR109","first-page":"350","volume-title":"ACM Symp. Comput. Geo.","author":"J. Choi","year":"1995","unstructured":"J. Choi, J. Sellen, C.K. Yap: Precision-sensitive Euclidean shortest path in 3-space, ACM Symp. Comput. Geo. (1995) pp. 350\u2013359"},{"issue":"5","key":"7_CR110","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"C.H. Papadimitriou: An algorithm for shortest-path planning in three dimensions, Inform. Process. Lett. 20(5), 259 (1985)","journal-title":"Inform. Process. Lett."},{"key":"7_CR111","volume-title":"IEEE\/RSJ Int. Conf. Intell. Robots Syst.","author":"D. Yershov","year":"2011","unstructured":"D. Yershov, S.M. LaValle: Simplicial Dijkstra and\u00a0A* algorithms for optimal feedback planning, IEEE\/RSJ Int. Conf. Intell. Robots Syst. (2011)"},{"issue":"7","key":"7_CR112","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S. Karaman","year":"2011","unstructured":"S. Karaman, E. Frazzoli: Sampling-based algorithms for optimal motion planning, Int. J. Robotics Res. 30(7), 846 (2011)","journal-title":"Int. J. Robotics Res."},{"key":"7_CR113","volume-title":"IEEE Int. Conf. Robotics Autom.","author":"J.D. Marble","year":"2012","unstructured":"J.D. Marble, K.E. Bekris: Towards small asymptotically near-optimal roadmaps, IEEE Int. Conf. Robotics Autom. (2012)"},{"key":"7_CR114","volume-title":"An Introduction to Differentiable Manifolds and Riemannian Geometry","author":"W.M. Boothby","year":"2003","unstructured":"W.M. Boothby: An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. (Academic, New York 2003)","edition":"2"},{"key":"7_CR115","volume-title":"Algebraic Topology","author":"A. Hatcher","year":"2002","unstructured":"A. Hatcher: Algebraic Topology (Cambridge Univ. Press, Cambridge 2002)"},{"key":"7_CR116","volume-title":"Engineering Applications of Noncommutative Harmonic Analysis","author":"G.S. Chirikjian","year":"2001","unstructured":"G.S. Chirikjian, A.B. Kyatkin: Engineering Applications of Noncommutative Harmonic Analysis (CRC, Boca Raton 2001)"},{"key":"7_CR117","first-page":"117","volume-title":"Graphics Gems III","author":"J. Arvo","year":"1992","unstructured":"J. Arvo: Fast random rotation matrices. In: Graphics Gems III, ed. by D. Kirk (Academic, New York 1992) pp. 117\u2013120"},{"key":"7_CR118","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte-Carlo Methods","author":"H. Niederreiter","year":"1992","unstructured":"H. Niederreiter: Random Number Generation and Quasi-Monte-Carlo Methods (Society for Industrial and Applied Mathematics, Philadelphia 1992)"},{"key":"7_CR119","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2003","unstructured":"S. Basu, R. Pollack, M.-F. Roy: Algorithms in Real Algebraic Geometry (Springer, Berlin, Heidelberg 2003)"},{"key":"7_CR120","first-page":"537","volume-title":"Handbook of Discrete and Computational Geometry","author":"B. Mishra","year":"1997","unstructured":"B. Mishra: Computational real algebraic geometry. In: Handbook of Discrete and Computational Geometry, ed. by J.E. Goodman, J. O'Rourke (CRC, Boca Raton 1997) pp. 537\u2013556"},{"key":"7_CR121","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz, M. Sharir: On the piano movers' 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":"7_CR122","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(87)90069-5","volume":"31","author":"B.R. Donald","year":"1987","unstructured":"B.R. Donald: A\u00a0search 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":"7_CR123","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0004-3702(88)90049-5","volume":"37","author":"D.S. Arnon","year":"1988","unstructured":"D.S. Arnon: Geometric reasoning with logic and algebra, Artif. Intell. J. 37(1-3), 37\u201360 (1988)","journal-title":"Artif. Intell. J."},{"key":"7_CR124","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-7091-9459-1_2","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"G.E. Collins","year":"1998","unstructured":"G.E. Collins: Quantifier elimination by cylindrical algebraic decomposition\u2013twenty years of progress. In: Quantifier Elimination and Cylindrical Algebraic Decomposition, ed. by B.F. Caviness, J.R. Johnson (Springer, Berlin, Heidelberg 1998) pp. 8\u201323"}],"container-title":["Springer Handbooks","Springer Handbook of Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32552-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T07:00:49Z","timestamp":1660806049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-32552-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319325507","9783319325521"],"references-count":124,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32552-1_7","relation":{},"ISSN":["2522-8692","2522-8706"],"issn-type":[{"value":"2522-8692","type":"print"},{"value":"2522-8706","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"27 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}