{"id":"https://openalex.org/W2741438308","doi":"https://doi.org/10.24963/ijcai.2017/70","title":"Compromise-free Pathfinding on a Navigation Mesh","display_name":"Compromise-free Pathfinding on a Navigation Mesh","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2741438308","doi":"https://doi.org/10.24963/ijcai.2017/70","mag":"2741438308"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/70","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/70","pdf_url":"https://www.ijcai.org/proceedings/2017/0070.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0070.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110699437","display_name":"Michael M. Cui","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]},{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Michael Cui","raw_affiliation_strings":["Monash University"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035664456","display_name":"Daniel Harabor","orcid":"https://orcid.org/0000-0001-6828-7712"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]},{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Daniel D. Harabor","raw_affiliation_strings":["Monash University"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000852884","display_name":"Alban Grastien","orcid":"https://orcid.org/0000-0001-8466-8777"},"institutions":[{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]},{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alban Grastien","raw_affiliation_strings":["Australian National University","Data61","Australian National University; Data61"],"affiliations":[{"raw_affiliation_string":"Australian National University","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"Data61","institution_ids":["https://openalex.org/I42894916"]},{"raw_affiliation_string":"Australian National University; Data61","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110699437"],"corresponding_institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.7396,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.80832115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"496","last_page":"502"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12290","display_name":"Human Motion and Animation","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/pathfinding","display_name":"Pathfinding","score":0.9339580535888672},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.7735073566436768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.666471540927887},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6377261877059937},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4805353283882141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4629756808280945},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4445141553878784},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38057100772857666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30937695503234863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2633678913116455},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.14737331867218018},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08764386177062988},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0659647285938263}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.9339580535888672},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7735073566436768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.666471540927887},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6377261877059937},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4805353283882141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4629756808280945},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4445141553878784},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38057100772857666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30937695503234863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2633678913116455},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.14737331867218018},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08764386177062988},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0659647285938263},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2017/70","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/70","pdf_url":"https://www.ijcai.org/proceedings/2017/0070.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:monash.edu:openaire/e81dff93-1934-47a2-af54-042c9387ba1a","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/e81dff93-1934-47a2-af54-042c9387ba1a","pdf_url":"https://researchmgt.monash.edu/ws/files/237124046/212160334.pdf","source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cui, M L, Harabor, D D & Grastien, A 2017, Compromise-free pathfinding on a navigation mesh. in C Sierra (ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence (AAAI), Marina del Rey CA USA, pp. 496-502, International Joint Conference on Artificial Intelligence 2017, Melbourne, Victoria, Australia, 19/08/17.","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/70","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/70","pdf_url":"https://www.ijcai.org/proceedings/2017/0070.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2741438308.pdf","grobid_xml":"https://content.openalex.org/works/W2741438308.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W104507782","https://openalex.org/W105147962","https://openalex.org/W1559032952","https://openalex.org/W1563151460","https://openalex.org/W1756033394","https://openalex.org/W2133989630","https://openalex.org/W2135125135","https://openalex.org/W2145585184","https://openalex.org/W2151957548","https://openalex.org/W2152679156","https://openalex.org/W2403099801","https://openalex.org/W2403965215","https://openalex.org/W6637922572","https://openalex.org/W6680140934","https://openalex.org/W6713441206"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W4402599120","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W4221129498"],"abstract_inverted_index":{"We":[0,118],"want":[1],"to":[2,21,25,66,126],"compute":[3,22,71],"geometric":[4,113],"shortest":[5,42,74,114],"paths":[6,115],"in":[7,34,116],"a":[8,17,55,81,103,141],"collection":[9],"of":[10,132,143],"convex":[11,133],"traversable":[12],"polygons,":[13],"also":[14],"known":[15],"as":[16],"navigation":[18,27],"mesh.":[19],"Simple":[20],"and":[23,49,94,100,105,135,145],"easy":[24],"update,":[26],"meshes":[28],"are":[29],"widely":[30],"used":[31],"for":[32,111],"pathfinding":[33,83],"computer":[35],"games.":[36],"When":[37,59],"the":[38,60],"mesh":[39,61],"is":[40,62,86,90],"static,":[41],"path":[43],"problems":[44],"can":[45,123],"be":[46,124],"solved":[47],"exactly":[48],"very":[50],"fast":[51],"but":[52],"only":[53,72],"after":[54],"costly":[56],"preprocessing":[57],"step.":[58],"dynamic,":[63],"practitioners":[64],"turn":[65],"online":[67,93],"methods":[68],"which":[69,85],"typically":[70],"approximately":[73],"paths.":[75],"In":[76],"this":[77],"work":[78],"we":[79],"present":[80],"new":[82],"algorithm":[84,122],"compromise-free;":[87],"i.e.":[88],"it":[89],"simultaneously":[91],"fast,":[92],"optimal.":[95],"Our":[96],"method,":[97],"Polyanya,":[98],"extends":[99],"generalises":[101],"Anya;":[102],"recent":[104],"related":[106],"interval-based":[107],"search":[108,128],"technique":[109],"developed":[110],"computing":[112],"grids.":[117],"show":[119],"how":[120],"that":[121],"modified":[125],"support":[127],"over":[129],"arbitrary":[130],"sets":[131],"polygons":[134],"then":[136],"evaluate":[137],"its":[138],"performance":[139],"on":[140],"range":[142],"realistic":[144],"synthetic":[146],"benchmark":[147],"problems.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}