{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:42:39Z","timestamp":1777714959881,"version":"3.51.4"},"reference-count":22,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[1990,12]]},"abstract":"<jats:p>\n                    We are exploring a new approach to high-level optimal-path planning when homogeneous irregularly shaped regions of a plane have different traversal costs per unit distance. It is based on the simple idea that optimal paths must be straight in homogeneous regions, and so those regions need not be subdivided for path planning. Our approach uses optics anal ogies, ray tracing, and Snell's Law and reduces the problem to an efficient graph search with a variety of pruning criteria. The time and space of our algorithm is O(V\n                    <jats:sup>2<\/jats:sup>\n                    ) in an intui tively average case, where V is the number of region vertices. In experiments in which space is held constant, an imple mentation of our algorithm was not only dramatically faster but also gave better cost solution paths than a representative implementation of the chief competing technique, grid-based wavefront propagation. This appears to be because of the quite different and considerably smaller search space required for our more intelligent algorithm.\n                  <\/jats:p>","DOI":"10.1177\/027836499000900605","type":"journal-article","created":{"date-parts":[[2007,3,4]],"date-time":"2007-03-04T20:24:06Z","timestamp":1173039846000},"page":"48-66","source":"Crossref","is-referenced-by-count":40,"title":["An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost Regions"],"prefix":"10.1177","volume":"9","author":[{"given":"Neil C.","family":"Rowe","sequence":"first","affiliation":[{"name":"Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.F.","family":"Richbourg","sequence":"additional","affiliation":[{"name":"Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1990,12,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313112"},{"key":"atypb2","volume-title":"Proceedings of the International Conference on Robotics","author":"Chavez, R."},{"key":"atypb3","volume-title":"First IEEE Conference on Artificial Intelligence Applications","author":"Crowley, J.L."},{"key":"atypb4","volume-title":"Proceedings of the IEEE International Conference on Intelligent Control","author":"Graglia, P."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1986.1087051"},{"key":"atypb7","volume-title":"Proceedings of the 1987 IEEE Conference on Robotics and Automation","author":"Metea, M.B."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90054-9"},{"key":"atypb9","author":"Mitchell, J.S.B.","year":"1990","journal-title":"J. ACM"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1002\/int.4550020204"},{"key":"atypb11","volume-title":"Proceedings of the IEEE Conference on Robotics and Automation","author":"Parodi, A.M."},{"key":"atypb12","volume-title":"Solving a class of spatial reasoning problems: minimal-cost path planning in the Cartesian plane","author":"Richbourg, R.F.","year":"1987"},{"key":"atypb13","volume-title":"Proceedings of the 1987 IEEE Conference on Robotics and Automation","author":"Richbourg, R.F."},{"key":"atypb14","volume-title":"Artificial Intelligence Through Prolog","author":"Rowe, N.C.","year":"1988"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1177\/027836499000900606"},{"key":"atypb16","author":"Rowe, N.C.","year":"1990","journal-title":"IEEE Trans. Rob. Aut."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1987.4767900"},{"key":"atypb18","volume-title":"An analysis of ground mobility models (ANAMOB)","author":"Rula, A.A.","year":"1971"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90010-5"},{"key":"atypb20","volume-title":"Proceedings of the National Conference on Artificial Intelligence","author":"Thorpe, C.E."},{"key":"atypb21","volume-title":"Adaptation and condensation of the Army Mobility Model for cross-country mobility mapping","author":"Turnage, G.W.","year":"1983"},{"key":"atypb22","unstructured":"Witkowski, C.M. 1983 (Karlsruhe, West Germany, August). A parallel processor algorithm for robot route planning. Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Palo Alto, Calif.: William Kauffman, pp. 827-829."}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499000900605","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499000900605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:13:24Z","timestamp":1777457604000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/027836499000900605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["10.1177\/027836499000900605"],"URL":"https:\/\/doi.org\/10.1177\/027836499000900605","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}