{"id":"https://openalex.org/W2108010255","doi":"https://doi.org/10.1109/robot.2006.1641819","title":"Path planning above a polyhedral terrain","display_name":"Path planning above a polyhedral terrain","publication_year":2006,"publication_date":"2006-07-10","ids":{"openalex":"https://openalex.org/W2108010255","doi":"https://doi.org/10.1109/robot.2006.1641819","mag":"2108010255"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2006.1641819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5091009084","display_name":"Hamid Zarrabi-Zadeh","orcid":"https://orcid.org/0000-0002-2279-4775"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"H. Zarrabi-Zadeh","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada","Sch. of Comput. Sci., Waterloo Univ., Ont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Sch. of Comput. Sci., Waterloo Univ., Ont","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091009084"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"873","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9898999929428101,"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/T11106","display_name":"Data Management and Algorithms","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.6850011944770813},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6764781475067139},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5646077394485474},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5524741411209106},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5251554846763611},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.49754598736763},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49409058690071106},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4832197427749634},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4462932050228119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4461027979850769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4456339180469513},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.44391894340515137},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4437258839607239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40083685517311096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37037193775177},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2737829089164734},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.08868914842605591},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07790198922157288},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06413993239402771}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.6850011944770813},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6764781475067139},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5646077394485474},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5524741411209106},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5251554846763611},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.49754598736763},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49409058690071106},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4832197427749634},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4462932050228119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4461027979850769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4456339180469513},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.44391894340515137},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4437258839607239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40083685517311096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37037193775177},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2737829089164734},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.08868914842605591},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07790198922157288},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06413993239402771},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2006.1641819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1559701472","https://openalex.org/W2005314985","https://openalex.org/W2024693023","https://openalex.org/W2036114412","https://openalex.org/W2058510050","https://openalex.org/W2062105084","https://openalex.org/W2063372577","https://openalex.org/W2132457975","https://openalex.org/W2140746528","https://openalex.org/W2170220350","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W2017148941","https://openalex.org/W2360981904","https://openalex.org/W2018146256","https://openalex.org/W2112429204","https://openalex.org/W2156431668","https://openalex.org/W2232363660","https://openalex.org/W2365712669","https://openalex.org/W4200172719","https://openalex.org/W2347245430","https://openalex.org/W4382202922"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,28,51,56,69],"problem":[3,70],"of":[4,53,55],"path":[5,30],"planning":[6],"above":[7,31],"a":[8,13,23,32,74],"polyhedral":[9,33],"terrain":[10,34],"and":[11,43,58,73],"present":[12],"new":[14],"algorithm":[15,67,79],"that":[16],"for":[17,68],"any":[18],"p":[19],"ges":[20],"1,":[21],"computes":[22],"(c":[24],"+":[25,76],"epsi)-approximation":[26],"to":[27,64],"Lp-shortest":[29],"in":[35,71,80],"O(n/epsi":[36],"log":[37,39,40,45],"n":[38,49],"n)":[41,46],"time":[42],"O(n":[44],"space,":[47],"where":[48],"is":[50],"number":[52],"vertices":[54],"terrain,":[57],"c":[59],"=":[60],"2(p-1)p/.":[61],"This":[62],"leads":[63],"an":[65],"epsi-approximation":[66],"L1metric,":[72],"(radic2":[75],"epsi)-factor":[77],"approximation":[78],"Euclidean":[81],"space":[82]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}