{"id":"https://openalex.org/W2563971745","doi":"https://doi.org/10.1109/itsc.2016.7795697","title":"Locally Growing Rapid Tree (LGRT) motion planning for autonomous driving","display_name":"Locally Growing Rapid Tree (LGRT) motion planning for autonomous driving","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2563971745","doi":"https://doi.org/10.1109/itsc.2016.7795697","mag":"2563971745"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2016.7795697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","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/A5088490426","display_name":"Francesco Alesiani","orcid":"https://orcid.org/0000-0003-4413-7247"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Francesco Alesiani","raw_affiliation_strings":["NEC Laboratories Europe, Heidelberg, Germany"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories Europe, Heidelberg, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064118161","display_name":"Chairit Wuthishuwong","orcid":"https://orcid.org/0000-0003-0778-7355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chairit Wuthishuwong","raw_affiliation_strings":["NEC Laboratories Europe, Heidelberg, Germany"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories Europe, Heidelberg, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088490426"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.142615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"124","issue":null,"first_page":"1120","last_page":"1125"},"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9965000152587891,"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/motion-planning","display_name":"Motion planning","score":0.8279699087142944},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7006862163543701},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6967679262161255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6762723922729492},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.639610767364502},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.6332244277000427},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5720965266227722},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5093411207199097},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.5059627890586853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47250425815582275},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.46763375401496887},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4456605315208435},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43236786127090454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35720789432525635},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33161377906799316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.213223397731781},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11000782251358032}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8279699087142944},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7006862163543701},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6967679262161255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6762723922729492},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.639610767364502},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.6332244277000427},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5720965266227722},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5093411207199097},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.5059627890586853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47250425815582275},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.46763375401496887},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4456605315208435},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43236786127090454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35720789432525635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33161377906799316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.213223397731781},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11000782251358032},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2016.7795697","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","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.7599999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W64833366","https://openalex.org/W101508493","https://openalex.org/W198732646","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2040064798","https://openalex.org/W2102121543","https://openalex.org/W2103120971","https://openalex.org/W2112271657","https://openalex.org/W2112930335","https://openalex.org/W2116455087","https://openalex.org/W2128990851","https://openalex.org/W2135682541","https://openalex.org/W2141664020","https://openalex.org/W2145205920","https://openalex.org/W6608150121"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2372633663","https://openalex.org/W2863424594","https://openalex.org/W4388720133","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2371294653"],"abstract_inverted_index":{"A":[0],"motion":[1,59,109,156],"planning":[2,60,110],"is":[3,96,121],"an":[4,122],"essential":[5],"part":[6],"of":[7,33,50,56,92,116,124,148,169],"autonomous":[8],"driving.":[9],"It":[10,102],"determines":[11],"a":[12,18,69,77,107,113,164],"safe":[13],"driving":[14,83],"course":[15],"to":[16,23,130,145],"control":[17],"vehicle":[19],"from":[20],"starting":[21],"location":[22],"the":[24,34,40,48,54,90,146,149,170,179],"desired":[25],"destination.":[26],"To":[27],"compute":[28],"this":[29,65],"trajectory,":[30],"several":[31],"state":[32,147],"art":[35,150],"algorithms":[36],"were":[37],"proposed;":[38],"however,":[39],"computation":[41,141],"time":[42,58],"and":[43,94],"error":[44],"exponentially":[45],"grows":[46,76],"with":[47,143],"complexity":[49],"environment.":[51,63,101],"This":[52],"limits":[53],"deployment":[55],"real":[57],"in":[61,88,98,138,167,178],"complex":[62,100,139],"In":[64],"paper,":[66],"we":[67],"propose":[68],"heuristic":[70,125],"exploring":[71,79,152],"tree":[72,80],"algorithm":[73,128],"that":[74],"locally":[75],"random":[78],"within":[81],"potential":[82],"area.":[84],"With":[85],"our":[86],"method,":[87],"particular,":[89],"number":[91],"iterations":[93],"accuracy":[95,180],"improved":[97,136],"high":[99],"can":[103],"provide":[104],"not":[105],"only":[106],"real-time":[108],"but":[111],"also":[112],"prediction":[114],"horizon":[115],"future":[117],"motion.":[118],"The":[119,133],"method":[120],"extension":[123],"A*":[126],"search":[127],"applied":[129],"continuous":[131],"domain.":[132],"simulation":[134],"shows":[135],"results":[137],"path":[140],"scenarios":[142],"respect":[144],"Rapid":[151,160],"Random":[153],"Tree":[154,161],"(RRT)":[155],"planning.":[157],"Local":[158],"Growing":[159],"(LGRT)":[162],"gives":[163],"better":[165],"performance":[166],"quality":[168],"solution":[171],"showing":[172],"more":[173],"than":[174],"10":[175],"\u00d7":[176],"improvement":[177],"-":[181],"iteration":[182],"ratio.":[183]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}