{"id":"https://openalex.org/W2945129520","doi":"https://doi.org/10.1017/s0263574719000560","title":"CWave: Theory and Practice of a Fast Single-source Any-angle Path Planning Algorithm","display_name":"CWave: Theory and Practice of a Fast Single-source Any-angle Path Planning Algorithm","publication_year":2019,"publication_date":"2019-05-15","ids":{"openalex":"https://openalex.org/W2945129520","doi":"https://doi.org/10.1017/s0263574719000560","mag":"2945129520"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574719000560","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574719000560","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","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/A5015371354","display_name":"Dmitry A. Sinyukov","orcid":"https://orcid.org/0000-0002-6786-9486"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dmitry A. Sinyukov","raw_affiliation_strings":["Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA 01609, USA"],"raw_orcid":"https://orcid.org/0000-0002-6786-9486","affiliations":[{"raw_affiliation_string":"Robotics Engineering Program, Worcester Polytechnic Institute, Worcester, MA 01609, USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009032681","display_name":"Ta\u015fk\u0131n Pad\u0131r","orcid":"https://orcid.org/0000-0001-5123-5801"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ta\u015fkin Padir","raw_affiliation_strings":["Electrical and Computer Engineering Department, Northeastern University, Boston, MA 02115, USA E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA 02115, USA E-mail:","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015371354"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.1985,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5160939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"38","issue":"2","first_page":"207","last_page":"234"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.7022705078125},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6570516228675842},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5949831604957581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5863829255104065},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5857256054878235},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5388348698616028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5195670127868652},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4727683365345001},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43725693225860596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32698142528533936},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2664102017879486},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2645416259765625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2456495761871338},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2169482409954071}],"concepts":[{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.7022705078125},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6570516228675842},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5949831604957581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5863829255104065},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5857256054878235},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5388348698616028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5195670127868652},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4727683365345001},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43725693225860596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32698142528533936},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2664102017879486},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2645416259765625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2456495761871338},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2169482409954071},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574719000560","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574719000560","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W80201019","https://openalex.org/W562242262","https://openalex.org/W1756033394","https://openalex.org/W1935926926","https://openalex.org/W1972267259","https://openalex.org/W1999244633","https://openalex.org/W2049534753","https://openalex.org/W2052258220","https://openalex.org/W2074100404","https://openalex.org/W2089033613","https://openalex.org/W2098006849","https://openalex.org/W2108567935","https://openalex.org/W2113256452","https://openalex.org/W2130422193","https://openalex.org/W2131288186","https://openalex.org/W2135125135","https://openalex.org/W2135181899","https://openalex.org/W2135835974","https://openalex.org/W2152679156","https://openalex.org/W2153580689","https://openalex.org/W2163178194","https://openalex.org/W2171330332","https://openalex.org/W2295752869","https://openalex.org/W2403099801","https://openalex.org/W2403965215","https://openalex.org/W2408436805","https://openalex.org/W2739429530","https://openalex.org/W2901136733","https://openalex.org/W2908817916","https://openalex.org/W2927638312","https://openalex.org/W2948960466","https://openalex.org/W3103759471","https://openalex.org/W3149322120","https://openalex.org/W4235486443","https://openalex.org/W4365800129","https://openalex.org/W6713104703"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W2359600231","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583"],"abstract_inverted_index":{"Summary":[0],"Path":[1],"planning":[2,41,59,85,247],"on":[3,24,86,117,142,211,219],"a":[4,8,18,25,46,87],"two-dimensional":[5],"grid":[6,26,32,88,144],"is":[7,76,91,133,197,206,225,257,277,288],"well-studied":[9],"problem":[10],"in":[11],"robotics.":[12],"It":[13],"usually":[14],"involves":[15],"searching":[16],"for":[17,68,81,245],"shortest":[19,43],"path":[20,40,58,84],"between":[21],"two":[22],"vertices":[23,53],"given":[27,47],"that":[28,97,115,232],"some":[29],"of":[30,54,131,151,186,194,216,221,233,253,275,302,312],"the":[31,55,73,98,136,143,156,177,217,222,310,313],"cells":[33],"are":[34],"impassable":[35],"(occupied":[36],"by":[37,63],"obstacles).":[38],"Single-source":[39],"finds":[42],"paths":[44,67,101],"from":[45],"source":[48],"vertex":[49],"to":[50,112,134,154,200,227,281,308],"all":[51],"other":[52],"grid.":[56],"Singles-source":[57],"enhances":[60],"robot":[61],"autonomy":[62],"calculating":[64],"multiple":[65],"possible":[66],"various":[69],"navigation":[70],"scenarios":[71],"when":[72],"destination":[74],"state":[75],"unknown.":[77],"A":[78,183],"high-performance":[79],"algorithm":[80,99,218],"single-source":[82,246],"any-angle":[83],"called":[89],"CWave":[90,132,167,187,276],"proposed":[92],"here.":[93],"Any-angle":[94],"attribute":[95],"implies":[96],"calculates":[100],"which":[102,121,205],"can":[103,175],"include":[104],"line":[105],"segments":[106],"at":[107,180],"any":[108,202],"angle,":[109],"as":[110],"opposed":[111],"standard":[113],"A*":[114,243],"runs":[116],"an":[118,283],"8-connected":[119],"graph,":[120],"permits":[122],"turns":[123],"with":[124,191,250],"45\u00b0":[125],"increments":[126],"only.":[127],"The":[128,214,295],"key":[129],"idea":[130],"abandon":[135],"graph":[137],"model":[138],"and":[139,209,242,279,299,304,316],"operate":[140],"directly":[141],"geometry":[145],"using":[146],"discrete":[147],"geometric":[148],"primitives":[149],"(instead":[150],"individual":[152],"vertices)":[153],"represent":[155],"wave":[157],"front.":[158],"In":[159],"its":[160,262],"most":[161,220],"basic":[162],"form":[163],"(":[164,188,272],"CWaveInt":[165,172],"),":[166],"requires":[168],"only":[169],"integer":[170],"arithmetics.":[171],",":[173],"however,":[174],"accumulate":[176],"distance":[178],"error":[179],"turning":[181],"points.":[182],"modified":[184],"version":[185],"CWaveFpuSrc":[189,256],")":[190,274],"minimal":[192],"usage":[193],"floating-point":[195],"calculations":[196],"also":[198],"developed":[199],"eliminate":[201],"accumulative":[203],"errors,":[204],"proven":[207],"mathematically":[208],"experimentally":[210],"several":[212],"maps.":[213],"performance":[215,285,319],"tested":[223,264,280],"maps":[224,249],"demonstrated":[226],"be":[228],"significantly":[229],"faster":[230,260,291],"than":[231,261,292],"Theta*,":[234,236],"Lazy":[235],"Field":[237],"A*,":[238,241],"ANYA,":[239],"Block":[240,266],"adapted":[244],"(on":[248],"lower":[251],"number":[252],"isolated":[254],"obstacles,":[255],"2\u22123":[258],"times":[259,290],"fastest":[263],"alternative":[265],"A*).":[267],"An":[268],"N":[269],"-threaded":[270],"implementation":[271,287],"CWaveN":[273],"presented":[278],"demonstrate":[282],"improved":[284],"(multithreaded":[286],"1.5\u22123":[289],"single-threaded":[293],"CWave).":[294],"paper":[296],"discusses":[297],"foundations":[298],"experimental":[300],"validation":[301],"CWave,":[303],"presents":[305],"future":[306],"work":[307],"address":[309],"limitations":[311],"current":[314],"implementations":[315],"obtain":[317],"further":[318],"enhancements.":[320]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}