{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T12:23:14Z","timestamp":1743510194067},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf01530886","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:09:47Z","timestamp":1113869387000},"page":"1-20","source":"Crossref","is-referenced-by-count":11,"title":["On-line motion planning: Case of a planar rod"],"prefix":"10.1007","volume":"3","author":[{"given":"James","family":"Cox","sequence":"first","affiliation":[]},{"given":"Chee-Keng","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"J.F. Canny, A new algebraic method for motion planning and real geometry,28th FOCS (1987) pp. 39?48."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0196-6774(87)90025-3","volume":"8","author":"R. Cole","year":"1987","unstructured":"R. Cole and C.K. Yap, Shape from probing, J. Algorithms 8 (1987) 19?38.","journal-title":"J. Algorithms"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume":"33","author":"G.E. Collins","year":"1975","unstructured":"G.E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition,2nd GI Conf. on Automata Theory and Formal Languages, Lecture Notes in Computer Science, vol. 33 (1975) pp. 134?183.","journal-title":"2nd GI Conf. on Automata Theory and Formal Languages, Lecture Notes in Computer Science"},{"key":"CR4","unstructured":"J. Cox, Online motion planning, PhD. Thesis, Courant Institute, New York University (1988)."},{"key":"CR5","unstructured":"J. Cox, Online motion planning: case of a polygon (in preparation) (1989)."},{"key":"CR6","unstructured":"E. Davis, A high-level real time programming language, Robotics Rept. 36, New York University (Oct. 1984)."},{"key":"CR7","unstructured":"D. Dobkin, H. Edelsbrunner and C.K. Yap, Pobing convex polytopes,18th STOC (1986) pp. 424?432."},{"key":"CR8","unstructured":"H. Edelsbrunner and S.S. Skiena, Probing convex polygons with X-rays, Univ. of Ill. at Urbana-Champaign, Computer Science Dept., Rep. No. UIUCDCS-R-86-1306 (November 1986)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"D. Kozen and C.K. Yap, Algebraic cell decomposition in NC,Proc. IEEE Symp. on Foundations of Computer Science (1985) pp. 515?521.","DOI":"10.1109\/SFCS.1985.4"},{"key":"CR10","first-page":"221","volume":"1","author":"D. Leven","year":"1985","unstructured":"D. Leven and M. Sharir, An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers, Comp. Geom. 1 (1985) 221?227.","journal-title":"Comp. Geom."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D. Leven","year":"1987","unstructured":"D. Leven and M. Sharir, Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discr. Comp. Geom. 2 (1987) 9?31.","journal-title":"Discr. Comp. Geom."},{"issue":"11","key":"CR12","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/TAC.1986.1104175","volume":"AC-31","author":"V.J. Lumelsky","year":"1986","unstructured":"V.J. Lumelsky and A.A. Stepanov, Dynamic path planning for a mobile automation with limited information on the environment, IEEE Trans. Automatic Control AC-31 (11) (1986) 1058?1063.","journal-title":"IEEE Trans. Automatic Control"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01840369","volume":"2","author":"V.J. Lumelsky","year":"1987","unstructured":"V.J. Lumelsky and A.A. Stepanov, Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape, Algorithmica 2 (1987) 403?430.","journal-title":"Algorithmica"},{"issue":"5","key":"CR14","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0005-1098(87)90051-3","volume":"23","author":"V.J. Lumelsky","year":"1987","unstructured":"V.J. Lumelsky, Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles, Automatica 23 (5) (1987) 551?570.","journal-title":"Automatica"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0885-064X(87)90025-2","volume":"3","author":"V.J. Lumelsky","year":"1987","unstructured":"V.J. Lumelsky, Algorithmic and complexity issues of robot motion in an uncertain environment, J. Complexity 3 (2) (1987) 146?182.","journal-title":"J. Complexity"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","volume":"6","author":"C. \u00d3'D\u00fanlaing","year":"1985","unstructured":"C. \u00d3'D\u00fanlaing and C.K. Yap, A retraction method for planning the motion of a disc, J. Algorithms 6 (1985) 104?111. Also, chapter 6 in:Planning, Geometry, and Complexity, eds. Hopcroft, Schwartz and Sharir (Ablex Publ. Corp., Norwood, NJ, 1987).","journal-title":"J. Algorithms"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/cpa.3160390402","volume":"39","author":"C. \u00d3'D\u00fanlaing","year":"1986","unstructured":"C. \u00d3'D\u00fanlaing, M. Sharir and C.K. Yap, Generalized Voronoi diagrams for moving a ladder: I. Topological analysis, Comm. Pure Appl. Math. 39 (1986) 423?483.","journal-title":"Comm. Pure Appl. Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01840348","volume":"2","author":"C. \u00d3'D\u00fanlaing","year":"1987","unstructured":"C. \u00d3'D\u00fanlaing, M. Sharir and C.K. Yap, Generalized Voronoi diagrams for moving a ladder: II. Efficient construction of the diagram, Algorithmica 2 (1987) 27?59.","journal-title":"Algorithmica"},{"key":"CR19","unstructured":"J. O'Rourke, A lower bound for moving ladder, Tech. Rept. JHU\/EECS-85\/20, Johns Hopkins University (1985)."},{"key":"CR20","unstructured":"R.P. Paul,Robot Manipulators: Mathematics, Programming and Control (MIT Press, 1981)."},{"key":"CR21","unstructured":"N.S.V. Rao, N. Stoltzfus and S.S. Iyengar, The terrain acquisition by mobile robots. IV. A retraction method, C.S.TR-87-013, Louisiana State University (1987)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz and M. Sharir, On the piano movers' problem: I. The special case of a rigid polygonal body moving amidst polygonal barriers, Comm. Pure Appl. Math. 36 (1983) 345?398.","journal-title":"Comm. Pure Appl. Math."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","volume":"4","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz and M. Sharir, On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds, Adv. Appl. Math. 4 (1983) 298?351.","journal-title":"Adv. Appl. Math."},{"key":"CR24","unstructured":"M. Sharir, Algorithmic motion planning, Comp. Sci. TR 392, NYU (Aug. 1988)."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01840368","volume":"2","author":"S. Sifrony","year":"1987","unstructured":"S. Sifrony and M. Sharir, An efficient motion planning algorithm for a rod moving in two-dimensional polygonal space, Algorithmica 2 (1987) 367?402.","journal-title":"Algorithmica"},{"issue":"12","key":"CR26","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/T-C.1969.222592","volume":"C-18","author":"I. Sutherland","year":"1969","unstructured":"I. Sutherland, A method for solving arbitrary-wall mazes by computer, IEEE Trans. Comp. C-18 (12) (1969) 1092?1097.","journal-title":"IEEE Trans. Comp."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"A. Tarski,A Decision Method for Elementary Algebra and Geometry (Univ. of California Press, 1951). (2nd ed. rev.)","DOI":"10.1525\/9780520348097"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/B978-0-444-87806-9.50019-0","volume-title":"Computational Geometry","author":"S.H. Whitesides","year":"1985","unstructured":"S.H. Whitesides, Computational geometry and motion planning, in:Computational Geometry, ed. G.T. Toussaint (Elsevier Science\/North-Holland, 1985) pp. 377?427."},{"key":"CR29","volume-title":"Advances in Robotics, vol. 1: Algorithmic and Geometric Aspects","author":"C.K. Yap","year":"1987","unstructured":"C.K. Yap, Algorithmic motion planning, in:Advances in Robotics, vol. 1: Algorithmic and Geometric Aspects, eds. J.T. Schwartz and C.K. Yap (Lawrence Erlbaum Assoc., Hillsdale, New Jersey, 1987)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530886\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530886.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530886\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T04:17:27Z","timestamp":1625804247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01530886"],"URL":"https:\/\/doi.org\/10.1007\/bf01530886","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}