2026-09-19T09:26:00Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1541662024-04-17T03:37:50Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

How, Jonathan, P. Rober, Nicholas Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 2024-04-16T19:05:03Z 2024-04-16T19:05:03Z 2023-06 2024-04-16T15:11:49.788Z https://hdl.handle.net/1721.1/154166 0000-0002-6274-7527 Neural networks (NNs) can be used to solve a wide variety of robotics problems ranging from computer vision to control. However, while NNs often work well in nominal scenarios, their performance can decrease significantly in scenarios that they were not trained for. Thus, as we move toward real-world deployment of neural feedback loops (NFLs), i.e., closed-loop systems containing NNs, it is critical that we develop methods to verify that these systems are safe. Previous works have developed forward reachability techniques to verify safety for NFLs, but these techniques can be prohibitively conservative in non-convex settings such as obstacle avoidance. To enable safety verificaiton in non-convex settings, this thesis proposes BReach-LP: a set of techniques to conduct backward reachability analysis for NFLs. While backward reachability analysis has been studied for systems not containing NNs, the general noninvertability of NNs makes backward reachability analysis for NFLs a challenging problem. Thus, our approach leverages existing forward NN analysis tools to find affine bounds on the control inputs and solve a series of linear programs to efficiently find an approximation of the backprojection sets, i.e., the set of states for which an NN control policy will drive the system to a given target set. This thesis outlines four variations of BReach-LP, including proofs of their soundness and numerical results demonstrating their application. S.M. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/ BReach-LP: a Framework for Backward Reachability Analysis of Neural Feedback Loops Thesis application/pdf Master Master of Science in Aeronautics and Astronautics Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="75b4a56c-354b-4753-a089-c099157b117b"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>BReach-LP: a Framework for Backward Reachability Analysis of Neural Feedback Loops</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2023-06</PublicationDate> <Authors> <Author> <DisplayName>Rober, Nicholas</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>Neural networks (NNs) can be used to solve a wide variety of robotics problems ranging from computer vision to control. However, while NNs often work well in nominal scenarios, their performance can decrease significantly in scenarios that they were not trained for. Thus, as we move toward real-world deployment of neural feedback loops (NFLs), i.e., closed-loop systems containing NNs, it is critical that we develop methods to verify that these systems are safe. Previous works have developed forward reachability techniques to verify safety for NFLs, but these techniques can be prohibitively conservative in non-convex settings such as obstacle avoidance. To enable safety verificaiton in non-convex settings, this thesis proposes BReach-LP: a set of techniques to conduct backward reachability analysis for NFLs. While backward reachability analysis has been studied for systems not containing NNs, the general noninvertability of NNs makes backward reachability analysis for NFLs a challenging problem. Thus, our approach leverages existing forward NN analysis tools to find affine bounds on the control inputs and solve a series of linear programs to efficiently find an approximation of the backprojection sets, i.e., the set of states for which an NN control policy will drive the system to a given target set. This thesis outlines four variations of BReach-LP, including proofs of their soundness and numerical results demonstrating their application.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>