{"id":"https://openalex.org/W1887279663","doi":"https://doi.org/10.1109/robot.1986.1087656","title":"Exploiting capability constraints to solve global two-dimensional path planning problems","display_name":"Exploiting capability constraints to solve global two-dimensional path planning problems","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W1887279663","doi":"https://doi.org/10.1109/robot.1986.1087656","mag":"1887279663"},"language":"en","primary_location":{"id":"doi:10.1109/robot.1986.1087656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1986.1087656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1986 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-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/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. Richbourg","raw_affiliation_strings":["Naval Postgraduate School, Monterey, California","Naval postgraduate School, Monterey, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Naval Postgraduate School, Monterey, California","institution_ids":["https://openalex.org/I35364215"]},{"raw_affiliation_string":"Naval postgraduate School, Monterey, California","institution_ids":["https://openalex.org/I35364215"]}]},{"author_position":"middle","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":"N. Rowe","raw_affiliation_strings":["[Department of Computer Science, Naval Postgraduate School, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Department of Computer Science, Naval Postgraduate School, CA]","institution_ids":["https://openalex.org/I35364215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021024131","display_name":"Michael Zyda","orcid":"https://orcid.org/0000-0002-7154-9231"},"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":"M. Zyda","raw_affiliation_strings":["[Department of Computer Science, Naval Postgraduate School, CA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Department of Computer Science, Naval Postgraduate School, CA]","institution_ids":["https://openalex.org/I35364215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8737,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85216911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"90","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9915000200271606,"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.738633394241333},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6941431164741516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6733748316764832},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5802100896835327},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5467665195465088},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5009877681732178},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.48911529779434204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47387075424194336},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.46607279777526855},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44777414202690125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4395594000816345},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4138118624687195},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.41113004088401794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2613193392753601},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24339419603347778},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2372625470161438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1705302596092224},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10747390985488892},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09597325325012207}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.738633394241333},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6941431164741516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6733748316764832},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5802100896835327},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5467665195465088},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5009877681732178},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.48911529779434204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47387075424194336},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.46607279777526855},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44777414202690125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4395594000816345},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4138118624687195},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.41113004088401794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2613193392753601},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24339419603347778},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2372625470161438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1705302596092224},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10747390985488892},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09597325325012207},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/robot.1986.1087656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.1986.1087656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1986 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:ADA164973","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA164973","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:calhoun.nps.edu:10945/25935","is_oa":false,"landing_page_url":"http://hdl.handle.net/10945/25935","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":"Technical Report"},{"id":"pmh:oai:calhoun.nps.edu:10945/59070","is_oa":false,"landing_page_url":"http://hdl.handle.net/10945/59070","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":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W68632457","https://openalex.org/W820287622","https://openalex.org/W1513657552","https://openalex.org/W1602132814","https://openalex.org/W1646038686","https://openalex.org/W2010997912","https://openalex.org/W2024403195","https://openalex.org/W2039414274","https://openalex.org/W2052258220","https://openalex.org/W2075301351","https://openalex.org/W2102032677","https://openalex.org/W2150500908","https://openalex.org/W2163178194","https://openalex.org/W2970779830","https://openalex.org/W6602761693"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W4291700431"],"abstract_inverted_index":{"Mobile":[0],"autonomous":[1],"vehicles":[2],"require":[3,69],"the":[4,70,88,108,126],"capability":[5],"of":[6,23,29,72,90,96],"planning":[7,38,53,111],"routes":[8],"over":[9],"ranges":[10],"that":[11],"are":[12],"too":[13],"great":[14],"to":[15,120],"be":[16,46],"characterized":[17],"by":[18,48],"local":[19,41],"sensor":[20,50],"systems.":[21,51],"Completion":[22],"this":[24],"task":[25],"requires":[26],"some":[27],"form":[28],"map":[30,59],"data.":[31],"Much":[32],"work":[33],"has":[34],"been":[35],"done":[36],"concerning":[37],"paths":[39,54],"through":[40],"areas,":[42],"those":[43],"which":[44,78,113],"can":[45],"scanned":[47],"on-board":[49],"However,":[52],"based":[55],"on":[56,115],"long":[57,109],"range":[58,110],"data":[60,92],"is":[61],"a":[62,104,116,122],"very":[63],"different":[64],"problem.":[65],"Extant":[66],"solution":[67,105],"techniques":[68],"search":[71,124],"discrete,":[73],"node":[74],"and":[75],"link":[76],"representations":[77],"characterize":[79],"continuous,":[80],"two":[81],"dimensional":[82],"problem":[83,112],"environments.":[84],"The":[85],"authors":[86],"assume":[87],"availability":[89],"topographic":[91],"organized":[93],"into":[94],"regions":[95],"homogenous":[97],"traversal":[98],"cost.":[99],"Given":[100],"this,":[101],"they":[102],"present":[103],"technique":[106],"for":[107,125],"relies":[114],"Snell's":[117],"Law":[118],"heuristic":[119],"limit":[121],"graph":[123],"optimal":[127],"solution.":[128]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}