{"id":"https://openalex.org/W2978271176","doi":"https://doi.org/10.1109/ijcnn.2019.8851776","title":"Closer to Optimal Angle-Constrained Path Planning","display_name":"Closer to Optimal Angle-Constrained Path Planning","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2978271176","doi":"https://doi.org/10.1109/ijcnn.2019.8851776","mag":"2978271176"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2019.8851776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2019.8851776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Joint Conference on Neural Networks (IJCNN)","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/A5044146520","display_name":"Changwu Zhang","orcid":"https://orcid.org/0000-0002-2918-8647"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Changwu Zhang","raw_affiliation_strings":["School of Computer, National University of Defense Technology, Changsha, China"],"affiliations":[{"raw_affiliation_string":"School of Computer, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057739949","display_name":"Hengzhu Liu","orcid":"https://orcid.org/0000-0003-4912-0364"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengzhu Liu","raw_affiliation_strings":["School of Computer, National University of Defense Technology, Changsha, China"],"affiliations":[{"raw_affiliation_string":"School of Computer, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050231409","display_name":"Yuchen Tang","orcid":"https://orcid.org/0000-0002-2270-5672"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yuchen Tang","raw_affiliation_strings":["Electrical and Electronics Engineering Department, The University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Electrical and Electronics Engineering Department, The University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044146520"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.1012,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.44445332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"1","last_page":"8"},"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.9908000230789185,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9904999732971191,"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/motion-planning","display_name":"Motion planning","score":0.7482693195343018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6157205104827881},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5829749703407288},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5488888621330261},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.5387682914733887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.50428307056427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3091379702091217},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20674744248390198},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.19432717561721802},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19347470998764038},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.08842691779136658}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7482693195343018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6157205104827881},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5829749703407288},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5488888621330261},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.5387682914733887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.50428307056427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3091379702091217},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20674744248390198},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.19432717561721802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19347470998764038},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.08842691779136658},{"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.1109/ijcnn.2019.8851776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2019.8851776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1521785144","https://openalex.org/W1531225991","https://openalex.org/W1585104299","https://openalex.org/W1935926926","https://openalex.org/W1967005434","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W2099144379","https://openalex.org/W2116772004","https://openalex.org/W2120944681","https://openalex.org/W2128990851","https://openalex.org/W2133361850","https://openalex.org/W2135835974","https://openalex.org/W2159722616","https://openalex.org/W2169528473","https://openalex.org/W2171330332","https://openalex.org/W2295752869","https://openalex.org/W2333223202","https://openalex.org/W2414947275","https://openalex.org/W2964077562","https://openalex.org/W2964238766","https://openalex.org/W3021208093","https://openalex.org/W3103759471","https://openalex.org/W4236251699","https://openalex.org/W4298857966","https://openalex.org/W6605295560","https://openalex.org/W6637967152","https://openalex.org/W6679896305","https://openalex.org/W6692405165","https://openalex.org/W6752446230"],"related_works":["https://openalex.org/W2802540229","https://openalex.org/W2135584875","https://openalex.org/W2383775285","https://openalex.org/W2359600231","https://openalex.org/W1965016794","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"Planning":[0],"on":[1],"grids":[2],"and":[3,23,29,44,150,169],"planning":[4,14,70,129],"via":[5],"sampling":[6],"are":[7,21],"the":[8,33,55,61,69,93,98,121,128,133,155,159,183,188],"two":[9],"classical":[10],"mainstreams":[11],"of":[12,64,100,127,148,190],"path":[13,35,53,177],"for":[15],"intelligent":[16],"agents,":[17],"whose":[18],"respective":[19],"representatives":[20],"A*":[22,89],"RRT,":[24],"including":[25],"their":[26],"variants,":[27],"Theta*":[28,43,46,168,171],"RRT*.":[30],"However,":[31],"in":[32],"nonholonomic":[34],"planning,":[36],"such":[37],"us":[38],"being":[39],"under":[40,172],"angle":[41,94,173],"constraints,":[42],"Lazy":[45,170],"may":[47],"fail":[48],"to":[49,91,97,119,182],"generate":[50,154],"a":[51,65,81],"feasible":[52],"because":[54],"line-of-sight":[56],"check":[57],"(LoS-Check)":[58],"will":[59,178],"modify":[60],"original":[62],"orientation":[63],"state,":[66],"which":[67],"makes":[68],"process":[71],"incomplete":[72],"(cannot":[73],"visit":[74],"all":[75],"possible":[76],"states).":[77],"Then,":[78],"we":[79,112,131],"propose":[80,113,132],"more":[82],"delayed":[83],"evaluation":[84],"algorithm":[85],"called":[86],"Late":[87],"LoS-Check":[88,114],"(LLA*)":[90],"relax":[92],"constraints.":[95,174],"Due":[96],"nature":[99],"random":[101],"sampling,":[102],"RRT*":[103,115],"is":[104],"asymptotically":[105],"optimal":[106,184],"but":[107],"still":[108],"not":[109],"optimal,":[110],"then":[111],"(LoS-RRT*).":[116],"In":[117],"order":[118],"solve":[120],"problems":[122],"caused":[123],"by":[124],"improper":[125],"settings":[126],"resolution,":[130],"LoS-Slider":[134],"(LoSS)":[135],"smoothing":[136,189],"method.":[137],"Through":[138],"experimental":[139],"comparison,":[140],"it":[141],"can":[142,152],"be":[143,179],"found":[144],"that":[145,163],"angle-constrained":[146],"versions":[147],"LLA*":[149,164],"LoS-RRT*":[151],"both":[153],"near-optimal":[156],"paths.":[157],"Meanwhile,":[158],"experiment":[160],"result":[161],"shows":[162],"performs":[165],"better":[166],"than":[167],"The":[175],"planned":[176],"even":[180],"closer":[181],"(shortest)":[185],"solution":[186],"after":[187],"LoSS":[191],"algorithm.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}