{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:52:22Z","timestamp":1772502742700,"version":"3.50.1"},"reference-count":71,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,2,11]],"date-time":"2004-02-11T00:00:00Z","timestamp":1076457600000},"content-version":"vor","delay-in-days":5550,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0004-3702(88)90053-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"157-169","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":97,"title":["A survey of motion planning and related geometric algorithms"],"prefix":"10.1016","volume":"37","author":[{"given":"J.T.","family":"Schwartz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(88)90053-7_BIB1","series-title":"Proceedings 26th Symposium on Foundations of Computer Science","first-page":"155","article-title":"Visibility polygon search and Euclidean shortest paths","author":"Asano","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB2","series-title":"Proceedings 24th Symposium on Foundations of Computer Science","first-page":"92","article-title":"Dynamic computational geometry","author":"Atallah","year":"1983"},{"key":"10.1016\/0004-3702(88)90053-7_BIB3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/42282.214094","article-title":"On shortest paths between two convex polyhedra","volume":"35","author":"Baltsan","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(88)90053-7_BIB4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","article-title":"Solving the find-path problem by good representation of free space","volume":"13","author":"Brooks","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"4","key":"10.1016\/0004-3702(88)90053-7_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1177\/027836498300200402","article-title":"Planning collision-free motions for pick-and-place operations","volume":"2","author":"Brooks","year":"1983","journal-title":"Int. J. Rob. Res."},{"key":"10.1016\/0004-3702(88)90053-7_BIB6","article-title":"A subdivision algorithm in configuration space for findpath with rotation","author":"Brooks","year":"1982"},{"key":"10.1016\/0004-3702(88)90053-7_BIB7","series-title":"Proceedings ACM Symposium on Computational Geometry","first-page":"214","article-title":"Planning the shortest path for a disc in O(n2 log n) time","author":"Chew","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB8","unstructured":"Cole, R. and Sharir, M., Visibility problems for polyhedral terrains, J. Symbolic Comput. (to appear)."},{"key":"10.1016\/0004-3702(88)90053-7_BIB9","series-title":"Proceedings Second GI Conference on Automata Theory and Formal Languages","first-page":"134","article-title":"Quantifier elimination for real closed fields by cylindrical algebraic decomposition","volume":"33","author":"Collins","year":"1975"},{"key":"10.1016\/0004-3702(88)90053-7_BIB10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.4064\/aa-17-4-363-372","article-title":"A combinatorial problem connected with differential equations, II","volume":"17","author":"Davenport","year":"1971","journal-title":"Acta Arithmetica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB11","doi-asserted-by":"crossref","first-page":"684","DOI":"10.2307\/2373068","article-title":"A combinatorial problem connected with differential equations","volume":"87","author":"Davenport","year":"1965","journal-title":"Am. J. Math."},{"key":"10.1016\/0004-3702(88)90053-7_BIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for shortest path and visibility problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0214025","article-title":"On the movement of robot arms in 2-dimensional bounded regions","volume":"14","author":"Hopcroft","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB15","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/0213038","article-title":"Movement problems for 2-dimensional linkages","volume":"13","author":"Hopcroft","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0004-3702(88)90053-7_BIB16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1177\/027836498400300405","article-title":"On the complexity of motion planning for multiple independent objects; PSPACE hardness of the \u2018warehouseman's problem\u2019","volume":"3","author":"Hopcroft","year":"1984","journal-title":"Int. J. Rob. Res."},{"issue":"4","key":"10.1016\/0004-3702(88)90053-7_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1177\/027836498300200405","article-title":"Efficient detection of intersections among spheres","volume":"2","author":"Hopcroft","year":"1983","journal-title":"Rob. Res."},{"key":"10.1016\/0004-3702(88)90053-7_BIB18","year":"1987"},{"key":"10.1016\/0004-3702(88)90053-7_BIB19","article-title":"On the motion of objects in contact","author":"Hopcroft","year":"1984"},{"key":"10.1016\/0004-3702(88)90053-7_BIB20","article-title":"Voronoi diagram in the Laguerre geometry and its applications","author":"Imai","year":"1983"},{"key":"10.1016\/0004-3702(88)90053-7_BIB21","series-title":"Proceedings ACM Symposium on Computational Geometry","first-page":"62","article-title":"On the complexity of reachability and motion planning questions","author":"Joseph","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/0004-3702(88)90053-7_BIB23","series-title":"Proceedings ACM Symposium on Computational Geometry","first-page":"75","article-title":"An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles","author":"Kedem","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB24","unstructured":"Kedem, K. and Sharir, M., An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, Discrete Comput. Geometry (to appear)."},{"key":"10.1016\/0004-3702(88)90053-7_BIB25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0004-3702(88)90053-7_BIB26","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0196-6774(87)90038-1","article-title":"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers","volume":"8","author":"Leven","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0004-3702(88)90053-7_BIB27","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","article-title":"Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/0004-3702(88)90053-7_BIB28","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187883","article-title":"On the number of critical free contacts of a convex polygonal object moving in 2-D polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/0004-3702(88)90053-7_BIB29","first-page":"187","article-title":"Intersection and proximity problems and Voronoi diagrams","volume":"I","author":"Leven","year":"1987"},{"issue":"2","key":"10.1016\/0004-3702(88)90053-7_BIB30","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning: A configuration space approach","volume":"32","author":"Lozano-P\u00e9rez","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB31","article-title":"A simple motion planning algorithm for general robot manipulators","author":"Lozano-P\u00e9rez","year":"1986"},{"key":"10.1016\/0004-3702(88)90053-7_BIB32","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-P\u00e9rez","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0004-3702(88)90053-7_BIB33","article-title":"Path planning strategies for a traveling automaton in an environment with uncertainty","author":"Lumelsky","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB34","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0004-3702(88)90053-7_BIB35","article-title":"The discrete geodesic problem","author":"Mitchell","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB36","article-title":"The weighted region problem","author":"Mitchell","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB37","article-title":"Robot rover visual navigation","author":"Moravec","year":"1981"},{"key":"10.1016\/0004-3702(88)90053-7_BIB38","article-title":"On finding shortest paths on convex polyhedra","author":"Mount","year":"1984"},{"key":"10.1016\/0004-3702(88)90053-7_BIB39","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","article-title":"A \u2018retraction\u2019 method for planning the motion of a disc","volume":"6","author":"O'Dunlaing","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0004-3702(88)90053-7_BIB40","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/cpa.3160390402","article-title":"Generalized Voronoi diagrams for a ladder, I: Topological analysis","volume":"39","author":"O'Dunlaing","year":"1986","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0004-3702(88)90053-7_BIB41","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01840348","article-title":"Generalized Voronoi diagrams for a ladder, II: Efficient construction of the diagram","volume":"2","author":"O'Dunlaing","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB42","article-title":"Lower bounds on moving a ladder","author":"O'Rourke","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB43","first-page":"259","article-title":"An algorithm for shortest path motion in three dimensions","volume":"20","author":"Papadimitriou","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB44","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02187902","article-title":"Separating two simple polygons by a sequence of translations","volume":"3","author":"Pollack","year":"1988","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/0004-3702(88)90053-7_BIB45","series-title":"Proceedings 20th IEEE Symposium on Foundations of Computer Science","first-page":"421","article-title":"Complexity of the mover's problem and generalizations","author":"Reif","year":"1979"},{"key":"10.1016\/0004-3702(88)90053-7_BIB46","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1985.36","article-title":"Motion planning in the presence of moving obstacles","author":"Reif","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB47","article-title":"Shortest paths in Eucidean space with polyhedral obstacles","author":"Reif","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB48","series-title":"Proceedings ACM Symposium on Computational Geomedtry","first-page":"204","article-title":"Rectilinear shortest paths with retangular barriers","author":"de Rezende","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB49","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","article-title":"On the piano movers' problem, I: The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers","volume":"36","author":"Schwartz","year":"1983","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0004-3702(88)90053-7_BIB50","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","article-title":"On the piano movers' problem, II: General techniques for computing topological properties of real algebraic manifolds","volume":"4","author":"Schwartz","year":"1983","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"10.1016\/0004-3702(88)90053-7_BIB51","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1177\/027836498300200304","article-title":"On the piano movers' problem, III: Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers","volume":"2","author":"Schwartz","year":"1983","journal-title":"Rob. Res."},{"key":"10.1016\/0004-3702(88)90053-7_BIB52","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/cpa.3160370605","article-title":"On the piano movers' problem, V: The case of a rod moving in three-dimensional space amidst polyhedral obstacles","volume":"37","author":"Schwartz","year":"1984","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0004-3702(88)90053-7_BIB53","article-title":"Efficient motion planning algorithms in environments of bounded local complexity","author":"Schwartz","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB54","first-page":"478","article-title":"Mathematical problems and training in robotics","volume":"30","author":"Schwartz","year":"1983","journal-title":"Notices Am. Math. Soc."},{"key":"10.1016\/0004-3702(88)90053-7_BIB55","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","article-title":"Intersection and closest-pair problems for a set of planar discs","volume":"14","author":"Sharir","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB56","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02579209","article-title":"Almost linear upper bounds on the length of general Davenport-Schinzel sequences","volume":"7","author":"Sharir","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB57","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0216038","article-title":"On shortest paths amidst convex polyhedra","volume":"16","author":"Sharir","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB58","article-title":"On the two-dimensional Davenport Schinzel problem","author":"Sharir","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB59","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02122559","article-title":"Improved lower bounds on the length of Davenport Schinzel sequences","volume":"8","author":"Sharir","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB60","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/cpa.3160370406","article-title":"On the piano movers' problem, IV: Various decomposable two-dimensional motion planning problems","volume":"37","author":"Sharir","year":"1984","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0004-3702(88)90053-7_BIB61","series-title":"Proceedings 26th Symposium Foundations of Computer Science","first-page":"312","article-title":"On minima of functions, intersection patterns of curves, and Davenport-Schinzel sequences","author":"Sharir","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB62","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","article-title":"On shortest paths in polyhedral spaces","volume":"15","author":"Sharir","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB63","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01840368","article-title":"An efficient motion planning algorithm for a rod moving in two-dimensional polygonal space","volume":"2","author":"Sifrony","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB64","first-page":"55","article-title":"Strong NP-hardness of moving many discs","volume":"19","author":"Spirakis","year":"1984"},{"key":"10.1016\/0004-3702(88)90053-7_BIB65","series-title":"Motion planning among time dependent obstacles","author":"Sutner","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB66","doi-asserted-by":"crossref","first-page":"213","DOI":"10.4064\/aa-25-2-213-224","article-title":"On a problem by Davenport and Schinzel","volume":"25","author":"Szemeredi","year":"1974","journal-title":"Acta Arithmetica"},{"key":"10.1016\/0004-3702(88)90053-7_BIB67","article-title":"An O(n log log n) time algorithm for triangulating simple polygons","volume":"17","author":"Tarjan","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(88)90053-7_BIB68","article-title":"Collision detection and avoidance in computer controlled manipulators","author":"Udupa","year":"1977"},{"key":"10.1016\/0004-3702(88)90053-7_BIB69","first-page":"167","article-title":"Constructing the visibility graph for n line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985"},{"key":"10.1016\/0004-3702(88)90053-7_BIB70","article-title":"Coordinating the motion of several discs","author":"Yap","year":"1984"},{"key":"10.1016\/0004-3702(88)90053-7_BIB71","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","author":"Yap","year":"1985"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370288900537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370288900537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T14:19:34Z","timestamp":1756909174000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370288900537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":71,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0004370288900537"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(88)90053-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A survey of motion planning and related geometric algorithms","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(88)90053-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}