{"id":"https://openalex.org/W2927564896","doi":"https://doi.org/10.1109/tnnls.2019.2899311","title":"Kinodynamic Motion Planning With Continuous-Time Q-Learning: An Online, Model-Free, and Safe Navigation Framework","display_name":"Kinodynamic Motion Planning With Continuous-Time Q-Learning: An Online, Model-Free, and Safe Navigation Framework","publication_year":2019,"publication_date":"2019-03-29","ids":{"openalex":"https://openalex.org/W2927564896","doi":"https://doi.org/10.1109/tnnls.2019.2899311","mag":"2927564896","pmid":"https://pubmed.ncbi.nlm.nih.gov/30946679"},"language":"en","primary_location":{"id":"doi:10.1109/tnnls.2019.2899311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnnls.2019.2899311","pdf_url":null,"source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5039559939","display_name":"George P. Kontoudis","orcid":"https://orcid.org/0000-0003-2193-7700"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George P. Kontoudis","raw_affiliation_strings":["Kevin T. Crofton Department of Aerospace and Ocean Engineering, Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0000-0003-2193-7700","affiliations":[{"raw_affiliation_string":"Kevin T. Crofton Department of Aerospace and Ocean Engineering, Virginia Tech, Blacksburg, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040301558","display_name":"Kyriakos G. Vamvoudakis","orcid":"https://orcid.org/0000-0003-1978-4848"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kyriakos G. Vamvoudakis","raw_affiliation_strings":["Daniel Guggenheim School of Aerospace Engineering, Georgia Tech, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0003-1978-4848","affiliations":[{"raw_affiliation_string":"Daniel Guggenheim School of Aerospace Engineering, Georgia Tech, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0703,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.94715089,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"30","issue":"12","first_page":"3803","last_page":"3817"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9987000226974487,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9959999918937683,"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/motion-planning","display_name":"Motion planning","score":0.7186391353607178},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6322839260101318},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.5536089539527893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5502200722694397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5463422536849976},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.545975387096405},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5382828712463379},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.44640302658081055},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4206163287162781},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.34198200702667236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3323718011379242},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2112092673778534}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7186391353607178},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6322839260101318},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.5536089539527893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5502200722694397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5463422536849976},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.545975387096405},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5382828712463379},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.44640302658081055},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4206163287162781},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.34198200702667236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3323718011379242},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2112092673778534},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnnls.2019.2899311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnnls.2019.2899311","pdf_url":null,"source":{"id":"https://openalex.org/S4210175523","display_name":"IEEE Transactions on Neural Networks and Learning Systems","issn_l":"2162-237X","issn":["2162-237X","2162-2388"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Neural Networks and Learning Systems","raw_type":"journal-article"},{"id":"pmid:30946679","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/30946679","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on neural networks and learning systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2895467463","display_name":null,"funder_award_id":"SPS G5176","funder_id":"https://openalex.org/F4320307849","funder_display_name":"North Atlantic Treaty Organization"},{"id":"https://openalex.org/G4265967193","display_name":null,"funder_award_id":"N00014-18-1-2160","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G7346973694","display_name":"CAREER: Towards an Intermittent Learning Framework for Smart and Efficient Cyber-Physical Autonomy","funder_award_id":"1851588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307849","display_name":"North Atlantic Treaty Organization","ror":"https://ror.org/05xagc088"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W234738007","https://openalex.org/W1493395914","https://openalex.org/W1513689897","https://openalex.org/W1601081659","https://openalex.org/W1626155273","https://openalex.org/W1963548912","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2024303516","https://openalex.org/W2030033366","https://openalex.org/W2048820947","https://openalex.org/W2054585537","https://openalex.org/W2067603665","https://openalex.org/W2081173707","https://openalex.org/W2097415784","https://openalex.org/W2100538121","https://openalex.org/W2115055600","https://openalex.org/W2121863487","https://openalex.org/W2124972241","https://openalex.org/W2128990851","https://openalex.org/W2132990760","https://openalex.org/W2141664020","https://openalex.org/W2143346970","https://openalex.org/W2148439597","https://openalex.org/W2152161277","https://openalex.org/W2157577161","https://openalex.org/W2160698719","https://openalex.org/W2166077797","https://openalex.org/W2173248099","https://openalex.org/W2314983263","https://openalex.org/W2317831939","https://openalex.org/W2335799662","https://openalex.org/W2484646121","https://openalex.org/W2487144912","https://openalex.org/W2564717627","https://openalex.org/W2595897327","https://openalex.org/W2604410735","https://openalex.org/W2772589676","https://openalex.org/W2794029453","https://openalex.org/W2822752092","https://openalex.org/W2907275873","https://openalex.org/W2951930445","https://openalex.org/W2962822210","https://openalex.org/W2962917939","https://openalex.org/W2963641660","https://openalex.org/W2963864421","https://openalex.org/W4214717370"],"related_works":["https://openalex.org/W3125761283","https://openalex.org/W2164081328","https://openalex.org/W1976722080","https://openalex.org/W3092556108","https://openalex.org/W2117372696","https://openalex.org/W3152831473","https://openalex.org/W3044931971","https://openalex.org/W3002854867","https://openalex.org/W4211055164","https://openalex.org/W2288650507"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"online":[4,44,87],"kinodynamic":[5],"motion":[6],"planning":[7],"algorithmic":[8],"framework":[9],"using":[10],"asymptotically":[11],"optimal":[12,48,52],"rapidly-exploring":[13],"random":[14],"tree":[15],"(RRT*)":[16],"and":[17,32,50,95,112,119],"continuous-time":[18,55],"Q-learning,":[19],"which":[20,71,100],"we":[21,33,59],"term":[22],"as":[23],"RRT-Q*.":[24],"We":[25,89,116],"formulate":[26],"a":[27,91,96,120],"model-free":[28],"Q-based":[29],"advantage":[30],"function":[31],"utilize":[34],"integral":[35],"reinforcement":[36],"learning":[37],"to":[38,84,106,123],"develop":[39],"tuning":[40],"laws":[41],"for":[42,64],"the":[43,47,51,65,68,86,109,125,128],"approximation":[45],"of":[46,54,67,127],"cost":[49],"policy":[53],"linear":[56],"systems.":[57],"Moreover,":[58],"provide":[60],"rigorous":[61],"Lyapunov-based":[62],"proofs":[63],"stability":[66],"equilibrium":[69],"point,":[70],"results":[72],"in":[73],"asymptotic":[74],"convergence":[75],"properties.":[76],"A":[77],"terminal":[78],"state":[79],"evaluation":[80],"procedure":[81],"is":[82],"introduced":[83],"facilitate":[85],"implementation.":[88],"propose":[90],"static":[92],"obstacle":[93],"augmentation":[94],"local":[97],"replanning":[98],"framework,":[99],"are":[101],"based":[102],"on":[103],"topological":[104],"connectedness,":[105],"locally":[107],"recompute":[108],"robot's":[110],"path":[111],"ensure":[113],"collision-free":[114],"navigation.":[115],"perform":[117],"simulations":[118],"qualitative":[121],"comparison":[122],"evaluate":[124],"efficacy":[126],"proposed":[129],"methodology.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}