{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:51:39Z","timestamp":1771037499750,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01908631","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T15:56:24Z","timestamp":1122047784000},"page":"41-63","source":"Crossref","is-referenced-by-count":38,"title":["Planning a time-minimal motion among moving obstacles"],"prefix":"10.1007","volume":"10","author":[{"given":"Kikuo","family":"Fujimura","sequence":"first","affiliation":[]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01908631_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"issue":"1","key":"BF01908631_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility of Disjoint Polygons,Algorithmica,1(1) (1986), 49\u201363.","journal-title":"Algorithmica"},{"key":"BF01908631_CR3","doi-asserted-by":"crossref","unstructured":"J. Canny and J. Reif, New Lower Bound Techniques for Robot Motion Planning Problems,Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987, pp. 49\u201360.","DOI":"10.1109\/SFCS.1987.42"},{"issue":"4","key":"BF01908631_CR4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M. Erdmann","year":"1987","unstructured":"M. Erdmann and T. Lozano-Perez, On Multiple Moving Objects,Algorithmica,2(4) (1987), 477\u2013522.","journal-title":"Algorithmica"},{"key":"BF01908631_CR5","doi-asserted-by":"crossref","unstructured":"K. Fujimura and H. Samet, Accessibility: A New Approach to Path Planning Among Moving Obstacles,Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Ann Arbor, ML June 1988, pp. 803\u2013807.","DOI":"10.1109\/CVPR.1988.196325"},{"key":"BF01908631_CR6","doi-asserted-by":"crossref","unstructured":"S. K. Ghosh and D. M. Mount, An Output Sensitive Algorithm for Computing Visibility Graphs,Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987, pp. 11\u201319. (To appear inSIAM Journal on Computing.)","DOI":"10.1109\/SFCS.1987.6"},{"issue":"3","key":"BF01908631_CR7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1177\/027836498600500304","volume":"5","author":"K. Kant","year":"1986","unstructured":"K. Kant and S. W. Zucker, Toward Efficient Planning: The Path-Velocity Decomposition,International Journal of Robotics Research,5(3) (Fall 1986), 72\u201389.","journal-title":"International Journal of Robotics Research"},{"key":"BF01908631_CR8","doi-asserted-by":"crossref","unstructured":"S. Kapoor and S. N. Maheshwari, Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles,Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, Urbana-Champaign, IL, June 1988, pp. 172\u2013182.","DOI":"10.1145\/73393.73411"},{"issue":"10","key":"BF01908631_CR9","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. A. Wesley, An Algorithm for Planning Collision Free Paths Among Polyhedral Obstacles,Communications of the ACM,22(10) (October 1979), 560\u2013570.","journal-title":"Communications of the ACM"},{"issue":"6","key":"BF01908631_CR10","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1109\/JRA.1987.1087133","volume":"3","author":"B. J. Oommen","year":"1987","unstructured":"B. J. Oommen, S. S. Iyengar, N. S. V. Rao, and R. L. Kashyap, Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part I: The Disjoint Convex Obstacle Case,IEEE Journal of Robotics and Automation,3(6) (December 1987), 672\u2013680.","journal-title":"IEEE Journal of Robotics and Automation"},{"key":"BF01908631_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"BF01908631_CR12","doi-asserted-by":"crossref","unstructured":"J. Reif and M. Sharir, Motion Planning in the Presence of Moving Obstacles,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 144\u2013154.","DOI":"10.1109\/SFCS.1985.36"},{"issue":"4","key":"BF01908631_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"E. Welzl, Constructing the Visibility Graph forn Line Segments inO(n 2) Time,Information Processing Letters,20(4) (May 1985), 167\u2013171.","journal-title":"Information Processing Letters"},{"key":"BF01908631_CR14","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, inComputational Geometry (G. T. Toussaint, ed.), North-Holland, Amsterdam, 1985, pp. 377\u2013427."},{"key":"BF01908631_CR15","volume-title":"Advances in Robotics, Vol. 1","author":"C. K. Yap","year":"1986","unstructured":"C. K. Yap, Algorithmic Motion Planning, inAdvances in Robotics, Vol. 1 (J. T. Schwartz and C. K. Yap, ed.), Lawrence Erlbaum, Hillsdale NJ, 1986, Chapter 3."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01908631.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01908631\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01908631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T16:22:40Z","timestamp":1557505360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01908631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01908631"],"URL":"https:\/\/doi.org\/10.1007\/bf01908631","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}