{"id":"https://openalex.org/W2968646325","doi":"https://doi.org/10.1109/icra.2019.8793919","title":"A Classification-based Approach for Approximate Reachability","display_name":"A Classification-based Approach for Approximate Reachability","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2968646325","doi":"https://doi.org/10.1109/icra.2019.8793919","mag":"2968646325"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2019.8793919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8793919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.03237","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Vicenc Rubies-Royo","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vicenc Rubies-Royo","raw_affiliation_strings":["Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":null,"display_name":"David Fridovich-Keil","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Fridovich-Keil","raw_affiliation_strings":["Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sylvia Herbert","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sylvia Herbert","raw_affiliation_strings":["Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":null,"display_name":"Claire J. Tomlin","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Claire J. Tomlin","raw_affiliation_strings":["Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Sciences Dept., University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.5308,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.8787614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"7697","last_page":"7704"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9969000220298767,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9883999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9757000207901001},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.555400013923645},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5539000034332275},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5160999894142151},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4733000099658966},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3962000012397766},{"id":"https://openalex.org/keywords/controller","display_name":"Controller (irrigation)","score":0.3824000060558319}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9757000207901001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6542999744415283},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.555400013923645},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5539000034332275},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5160999894142151},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4733000099658966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43309998512268066},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.36980000138282776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3073999881744385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26460000872612}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2019.8793919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8793919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1803.03237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.03237","pdf_url":"https://arxiv.org/pdf/1803.03237","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1803.03237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.03237","pdf_url":"https://arxiv.org/pdf/1803.03237","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W172589331","https://openalex.org/W1964345118","https://openalex.org/W1975236902","https://openalex.org/W1986571762","https://openalex.org/W1998452137","https://openalex.org/W2000290212","https://openalex.org/W2001331101","https://openalex.org/W2020254113","https://openalex.org/W2057789475","https://openalex.org/W2085744412","https://openalex.org/W2098073114","https://openalex.org/W2109569369","https://openalex.org/W2110073061","https://openalex.org/W2116364955","https://openalex.org/W2139132599","https://openalex.org/W2153012550","https://openalex.org/W2164090329","https://openalex.org/W2176215692","https://openalex.org/W2298907094","https://openalex.org/W2336607923","https://openalex.org/W2604410735","https://openalex.org/W2962822327","https://openalex.org/W2964040381","https://openalex.org/W2964070888","https://openalex.org/W2964187480","https://openalex.org/W2964310440","https://openalex.org/W3135791089","https://openalex.org/W4210875302","https://openalex.org/W6633055989","https://openalex.org/W6643454687","https://openalex.org/W6650403833","https://openalex.org/W6676768001","https://openalex.org/W6680450860","https://openalex.org/W6682849425","https://openalex.org/W6726601795","https://openalex.org/W6730978344","https://openalex.org/W6731923558","https://openalex.org/W6737066570","https://openalex.org/W6738637039","https://openalex.org/W6741302124","https://openalex.org/W6742380005"],"related_works":[],"abstract_inverted_index":{"Hamilton-Jacobi":[0],"(HJ)":[1],"reachability":[2,27,58,98,131,156],"analysis":[3],"has":[4,49],"been":[5,50],"developed":[6],"over":[7],"the":[8,92,96,130],"past":[9],"decades":[10],"into":[11],"a":[12,37,87,105,127,137,140,165],"widely-applicable":[13],"tool":[14],"for":[15,40,90,100],"determining":[16],"goal":[17],"satisfaction":[18],"and":[19,134,157],"safety":[20],"verification":[21],"in":[22,154],"nonlinear":[23],"systems.":[24,102],"While":[25,103],"HJ":[26,97,155],"can":[28,35,78,116],"be":[29,36,79,117],"formulated":[30],"very":[31,69],"generally,":[32],"computational":[33],"complexity":[34],"serious":[38],"impediment":[39],"many":[41,61,109],"systems":[42,111],"of":[43,62,95,112,129,142],"practical":[44],"interest.":[45],"Much":[46],"prior":[47],"work":[48],"devoted":[51],"to":[52,56,68,150],"computing":[53],"approximate":[54],"solutions":[55],"large":[57],"problems,":[59],"yet":[60],"these":[63],"methods":[64],"may":[65],"only":[66],"apply":[67],"restrictive":[70],"problem":[71,99,107],"classes,":[72],"do":[73],"not":[74],"generate":[75],"controllers,":[76],"and/or":[77],"extremely":[80],"conservative.":[81],"In":[82],"this":[83],"paper,":[84],"we":[85],"present":[86],"new":[88],"method":[89],"approximating":[91],"optimal":[93],"controller":[94,138],"control-affine":[101,121],"also":[104],"specific":[106],"class,":[108],"dynamical":[110],"interest":[113],"are,":[114],"or":[115],"well":[118],"approximated,":[119],"by":[120],"models.":[122],"We":[123,146],"explicitly":[124],"avoid":[125],"storing":[126],"representation":[128],"value":[132],"function,":[133],"instead":[135],"learn":[136],"as":[139],"sequence":[141],"simple":[143],"binary":[144],"classifiers.":[145],"compare":[147],"our":[148],"approach":[149],"existing":[151],"grid-based":[152],"methodologies":[153],"demonstrate":[158],"its":[159],"utility":[160],"on":[161],"several":[162],"examples,":[163],"including":[164],"physical":[166],"quadrotor":[167],"navigation":[168],"task.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2019-08-22T00:00:00"}
