{"id":"https://openalex.org/W2061563946","doi":"https://doi.org/10.1177/027836499000900605","title":"An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost Regions","display_name":"An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost Regions","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W2061563946","doi":"https://doi.org/10.1177/027836499000900605","mag":"2061563946"},"language":"en","primary_location":{"id":"doi:10.1177/027836499000900605","is_oa":false,"landing_page_url":"https://doi.org/10.1177/027836499000900605","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019584512","display_name":"Neil C. Rowe","orcid":"https://orcid.org/0000-0003-2612-0062"},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil C. Rowe","raw_affiliation_strings":["Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943","institution_ids":["https://openalex.org/I35364215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016400564","display_name":"Robert Richbourg","orcid":null},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.F. Richbourg","raw_affiliation_strings":["Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science U.S. Naval Postgraduate School Monterey, California 93943","institution_ids":["https://openalex.org/I35364215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6395,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.92977427,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"9","issue":"6","first_page":"48","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7968259453773499},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.6143831610679626},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6100483536720276},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5499932765960693},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5277760028839111},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5100460648536682},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5025160312652588},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.499589204788208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4616839289665222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45990678668022156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43479523062705994},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.43291565775871277},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41988930106163025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2014944851398468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18834510445594788},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1461467444896698},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11549052596092224}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7968259453773499},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.6143831610679626},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6100483536720276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5499932765960693},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5277760028839111},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5100460648536682},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5025160312652588},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.499589204788208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4616839289665222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45990678668022156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43479523062705994},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.43291565775871277},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41988930106163025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2014944851398468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18834510445594788},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1461467444896698},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11549052596092224},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/027836499000900605","is_oa":false,"landing_page_url":"https://doi.org/10.1177/027836499000900605","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},{"id":"pmh:oai:calhoun.nps.edu:10945/35983","is_oa":false,"landing_page_url":"http://hdl.handle.net/10945/35983","pdf_url":null,"source":{"id":"https://openalex.org/S4306400952","display_name":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35364215","host_organization_name":"Naval Postgraduate School","host_organization_lineage":["https://openalex.org/I35364215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W68632457","https://openalex.org/W114643741","https://openalex.org/W1513657552","https://openalex.org/W1560890255","https://openalex.org/W1602132814","https://openalex.org/W1766390095","https://openalex.org/W1898122818","https://openalex.org/W1930061024","https://openalex.org/W1971509129","https://openalex.org/W1989723858","https://openalex.org/W2001153965","https://openalex.org/W2024403195","https://openalex.org/W2033825569","https://openalex.org/W2050710547","https://openalex.org/W2057968312","https://openalex.org/W2085789363","https://openalex.org/W2090170700","https://openalex.org/W2099034771","https://openalex.org/W2102032677","https://openalex.org/W2134328746","https://openalex.org/W2163178194","https://openalex.org/W2886362482"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082","https://openalex.org/W4291700431"],"abstract_inverted_index":{"We":[0],"are":[1],"exploring":[2],"a":[3,16,73,130],"new":[4],"approach":[5,53],"to":[6,67,143],"high-level":[7],"optimal-path":[8],"planning":[9],"when":[10],"homogeneous":[11,39],"irregularly":[12],"shaped":[13],"regions":[14,44],"of":[15,75,82,100,114,133,146],"plane":[17],"have":[18],"different":[19,149],"traversal":[20],"costs":[21],"per":[22],"unit":[23],"distance.":[24],"It":[25],"is":[26,85,97,108],"based":[27],"on":[28],"the":[29,65,98,134,147],"simple":[30],"idea":[31],"that":[32],"optimal":[33],"paths":[34,128],"must":[35],"be":[36,47,144],"straight":[37],"in":[38,89,105],"regions,":[40],"and":[41,60,63,80,150],"so":[42],"those":[43],"need":[45],"not":[46,118],"subdivided":[48],"for":[49,156],"path":[50],"planning.":[51],"Our":[52],"uses":[54],"optics":[55],"anal":[56],"ogies,":[57],"ray":[58],"tracing,":[59],"Snell's":[61],"Law":[62],"reduces":[64],"problem":[66],"an":[68,90,111],"efficient":[69],"graph":[70],"search":[71,153],"with":[72],"variety":[74],"pruning":[76],"criteria.":[77],"The":[78],"time":[79],"space":[81,107,154],"our":[83,115,157],"algorithm":[84,116],"O(V":[86],"2":[87],")":[88],"intui":[91],"tively":[92],"average":[93],"case,":[94],"where":[95],"V":[96],"number":[99],"region":[101],"vertices.":[102],"In":[103],"experiments":[104],"which":[106],"held":[109],"constant,":[110],"imple":[112],"mentation":[113],"was":[117],"only":[119],"dramatically":[120],"faster":[121],"but":[122],"also":[123],"gave":[124],"better":[125],"cost":[126],"solution":[127],"than":[129],"representative":[131],"implementation":[132],"chief":[135],"competing":[136],"technique,":[137],"grid-based":[138],"wavefront":[139],"propagation.":[140],"This":[141],"appears":[142],"because":[145],"quite":[148],"considerably":[151],"smaller":[152],"required":[155],"more":[158],"intelligent":[159],"algorithm.":[160]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}