{"id":"https://openalex.org/W2313978041","doi":"https://doi.org/10.1177/0278364915602958","title":"Asymptotically optimal feedback planning using a numerical Hamilton-Jacobi-Bellman solver and an adaptive mesh refinement","display_name":"Asymptotically optimal feedback planning using a numerical Hamilton-Jacobi-Bellman solver and an adaptive mesh refinement","publication_year":2015,"publication_date":"2015-10-25","ids":{"openalex":"https://openalex.org/W2313978041","doi":"https://doi.org/10.1177/0278364915602958","mag":"2313978041"},"language":"en","primary_location":{"id":"doi:10.1177/0278364915602958","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364915602958","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5048111092","display_name":"Dmitry Yershov","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dmitry S. Yershov","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emilio Frazzoli","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048111092"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.9437,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81595384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"35","issue":"5","first_page":"565","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9919999837875366,"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"}},{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.9851999878883362,"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/discretization","display_name":"Discretization","score":0.7585604190826416},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5918077826499939},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5917577743530273},{"id":"https://openalex.org/keywords/fast-marching-method","display_name":"Fast marching method","score":0.5629369020462036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.554904580116272},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5157678127288818},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.49027207493782043},{"id":"https://openalex.org/keywords/viscosity-solution","display_name":"Viscosity solution","score":0.46458107233047485},{"id":"https://openalex.org/keywords/hamilton\u2013jacobi\u2013bellman-equation","display_name":"Hamilton\u2013Jacobi\u2013Bellman equation","score":0.44710028171539307},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.43209031224250793},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4227049946784973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40510761737823486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3139410614967346},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.309039831161499},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10306000709533691},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.08336684107780457},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.07501482963562012}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7585604190826416},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5918077826499939},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5917577743530273},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.5629369020462036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.554904580116272},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5157678127288818},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.49027207493782043},{"id":"https://openalex.org/C88731125","wikidata":"https://www.wikidata.org/wiki/Q7935676","display_name":"Viscosity solution","level":2,"score":0.46458107233047485},{"id":"https://openalex.org/C196978813","wikidata":"https://www.wikidata.org/wiki/Q3302775","display_name":"Hamilton\u2013Jacobi\u2013Bellman equation","level":3,"score":0.44710028171539307},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.43209031224250793},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4227049946784973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40510761737823486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3139410614967346},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.309039831161499},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10306000709533691},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.08336684107780457},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.07501482963562012},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364915602958","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364915602958","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":74,"referenced_works":["https://openalex.org/W140055736","https://openalex.org/W216510049","https://openalex.org/W300028405","https://openalex.org/W1424654272","https://openalex.org/W1572617741","https://openalex.org/W1585104299","https://openalex.org/W1605600765","https://openalex.org/W1935926926","https://openalex.org/W1963991060","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1978455689","https://openalex.org/W1979039823","https://openalex.org/W1982809790","https://openalex.org/W1985030613","https://openalex.org/W1988044952","https://openalex.org/W1989594010","https://openalex.org/W1990466879","https://openalex.org/W1990984956","https://openalex.org/W1999244633","https://openalex.org/W1999690352","https://openalex.org/W2003522422","https://openalex.org/W2004100691","https://openalex.org/W2011172397","https://openalex.org/W2017474342","https://openalex.org/W2017646611","https://openalex.org/W2018347014","https://openalex.org/W2019850144","https://openalex.org/W2024693023","https://openalex.org/W2027438381","https://openalex.org/W2028094691","https://openalex.org/W2028145673","https://openalex.org/W2035314061","https://openalex.org/W2042491177","https://openalex.org/W2054113582","https://openalex.org/W2054585537","https://openalex.org/W2058510050","https://openalex.org/W2062105084","https://openalex.org/W2071401582","https://openalex.org/W2081357081","https://openalex.org/W2084501107","https://openalex.org/W2088963353","https://openalex.org/W2091701965","https://openalex.org/W2096545304","https://openalex.org/W2103120971","https://openalex.org/W2108232656","https://openalex.org/W2108567935","https://openalex.org/W2110144538","https://openalex.org/W2110762409","https://openalex.org/W2116731623","https://openalex.org/W2124214067","https://openalex.org/W2138403771","https://openalex.org/W2144393541","https://openalex.org/W2145089737","https://openalex.org/W2157124127","https://openalex.org/W2161076907","https://openalex.org/W2163178194","https://openalex.org/W2166077797","https://openalex.org/W2167427782","https://openalex.org/W2169528473","https://openalex.org/W2170220350","https://openalex.org/W2289940311","https://openalex.org/W2294808847","https://openalex.org/W2341171179","https://openalex.org/W2521581510","https://openalex.org/W2525579820","https://openalex.org/W2561843528","https://openalex.org/W2570852788","https://openalex.org/W2611243847","https://openalex.org/W2889299146","https://openalex.org/W3103644247","https://openalex.org/W3103759471","https://openalex.org/W4256361765","https://openalex.org/W4293078920"],"related_works":["https://openalex.org/W1995876016","https://openalex.org/W3163590623","https://openalex.org/W4226087321","https://openalex.org/W2991352819","https://openalex.org/W2754120543","https://openalex.org/W2962695587","https://openalex.org/W2799410897","https://openalex.org/W2623995997","https://openalex.org/W2951537741","https://openalex.org/W2144074296"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,31,35,63,72,78,92,97,104,109,121,128,131],"first":[3],"asymptotically":[4,147],"optimal":[5,132,148],"feedback":[6],"planning":[7,111,149],"algorithm":[8,17,59,144],"for":[9,51],"nonholonomic":[10],"systems":[11],"and":[12,54,70,140,155],"additive":[13],"cost":[14,107],"functionals.":[15],"Our":[16],"is":[18,40,117],"based":[19],"on":[20],"three":[21],"well-established":[22],"numerical":[23,28,74,87],"practices:":[24],"1)":[25],"positive":[26],"coefficient":[27],"approximations":[29],"of":[30,65,86,96,108,130],"Hamilton-Jacobi-Bellman":[32,98],"equations;":[33],"2)":[34],"Fast":[36],"Marching":[37],"Method,":[38],"which":[39],"a":[41,84,124],"fast":[42],"nonlinear":[43],"solver":[44],"that":[45,89,115,142],"utilizes":[46],"Bellman\u2019s":[47],"dynamic":[48],"programming":[49],"principle":[50],"efficient":[52],"computations;":[53],"3)":[55],"an":[56,66],"adaptive":[57],"mesh-refinement":[58],"designed":[60],"to":[61,91,102,119],"improve":[62],"resolution":[64],"initial":[67],"simplicial":[68],"mesh":[69,80],"reduce":[71,103],"solution":[73,95],"error.":[75],"By":[76],"refining":[77],"discretization":[79,122],"globally,":[81],"we":[82,113],"compute":[83],"sequence":[85],"solutions":[88],"converges":[90],"true":[93],"viscosity":[94],"equations.":[99],"In":[100],"order":[101],"total":[105],"computational":[106],"proposed":[110],"algorithm,":[112],"find":[114],"it":[116],"sufficient":[118],"refine":[120],"within":[123],"small":[125],"region":[126],"in":[127],"vicinity":[129],"trajectory.":[133],"Numerical":[134],"experiments":[135],"confirm":[136],"our":[137,143],"theoretical":[138],"findings":[139],"establish":[141],"outperforms":[145],"previous":[146],"algorithms,":[150],"such":[151],"as":[152],"PRM":[153],"*":[154,157],"RRT":[156],".":[158]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}