{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:36:51Z","timestamp":1772105811582,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Vision, Graphics, and Image Processing"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0734-189x(90)90165-r","type":"journal-article","created":{"date-parts":[[2006,7,20]],"date-time":"2006-07-20T12:06:12Z","timestamp":1153397172000},"page":"95-103","source":"Crossref","is-referenced-by-count":11,"title":["Establishing collision zones for obstacles moving with uncertainty"],"prefix":"10.1016","volume":"49","author":[{"given":"N.","family":"Kehtarnavaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Griswold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0734-189X(90)90165-R_bib1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-Perez","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0734-189X(90)90165-R_bib2","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-Perez","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0734-189X(90)90165-R_bib3","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. Systems Man Cybern."},{"key":"10.1016\/0734-189X(90)90165-R_bib4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TSMC.1985.6313352","article-title":"A subdivision algorithm in configuration space for path with rotation","volume":"15","author":"Brooks","year":"1985","journal-title":"IEEE Trans. Systems Man Cybern."},{"key":"10.1016\/0734-189X(90)90165-R_bib5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/JRA.1985.1087002","article-title":"Navigation of an intelligent mobile robot","volume":"1","author":"Crowley","year":"1985","journal-title":"IEEE J. Rob. Autom."},{"key":"10.1016\/0734-189X(90)90165-R_bib6","series-title":"Proceedings, IEEE Int. Conf. on Robotics and Automation","first-page":"506","article-title":"A hierarchical-orthogonal-space approach to collision-free path planning","author":"Wong","year":"1985"},{"key":"10.1016\/0734-189X(90)90165-R_bib7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/rob.4620030404","article-title":"Robot navigation in an unexplored terrain","volume":"3","author":"Rao","year":"1986","journal-title":"J. Robot. Systems"},{"key":"10.1016\/0734-189X(90)90165-R_bib8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/JRA.1986.1087051","article-title":"Multiresolution path planning for mobile robots","volume":"2","author":"Kambhampatic","year":"1986","journal-title":"IEEE J. Rob. Autom."},{"key":"10.1016\/0734-189X(90)90165-R_bib9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TPAMI.1987.4767900","article-title":"Structuring free space as a hypergraph for roving path planning and navigation","volume":"9","author":"Rueb","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0734-189X(90)90165-R_bib10","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1109\/JRA.1987.1087133","article-title":"Robot navigation in unknown terrains using learned visibility graphs. Part I. The disjoint convex obstacle case","volume":"3","author":"Oommen","year":"1987","journal-title":"IEEE J. Rob. Autom."},{"key":"10.1016\/0734-189X(90)90165-R_bib11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1177\/027836498600500304","article-title":"Toward efficient planning: The path-velocity decomposition","volume":"5","author":"Kant","year":"1986","journal-title":"Int. J. Rob. Res."},{"key":"10.1016\/0734-189X(90)90165-R_bib12","series-title":"Proceedings, IEEE Symp. on Foundations of Computer Science","first-page":"144","article-title":"Motion planning in the presence of moving obstacles","author":"Reif","year":"1985"},{"key":"10.1016\/0734-189X(90)90165-R_bib13","series-title":"Proceedings, IEEE Conf. on Computer Vision and Pattern Recognition","first-page":"803","article-title":"Accessibility: A new approach to path planning among moving obstacles","author":"Fujimura","year":"1988"},{"key":"10.1016\/0734-189X(90)90165-R_bib14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/70.88018","article-title":"A hierarchical strategy for path planning among moving obstacles","volume":"5","author":"Fujimura","year":"1989","journal-title":"IEEE Trans. Rob. Automat."},{"key":"10.1016\/0734-189X(90)90165-R_bib15","series-title":"Probability, Random Variables, and Stochastic Processes","author":"Papoulis","year":"1984"},{"key":"10.1016\/0734-189X(90)90165-R_bib16","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TASSP.1981.1163587","article-title":"Recursive least squares ladder estimation algorithms","volume":"29","author":"Lee","year":"1981","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/0734-189X(90)90165-R_bib17","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/TAC.1981.1102682","article-title":"Recursive least squares lattice algorithms\u2014A geometrical approach","volume":"26","author":"Shensa","year":"1981","journal-title":"IEEE Trans. Auto. Control"}],"container-title":["Computer Vision, Graphics, and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X9090165R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X9090165R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T00:26:15Z","timestamp":1547511975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0734189X9090165R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0734189X9090165R"],"URL":"https:\/\/doi.org\/10.1016\/0734-189x(90)90165-r","relation":{},"ISSN":["0734-189X"],"issn-type":[{"value":"0734-189X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}