skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2008957

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Conference on Decision and Control)
    Free, publicly-accessible full text available December 20, 2026
  2. ; (, Conference on Decision and Control)
    Free, publicly-accessible full text available December 15, 2026
  3. ; (, ACM Transactions on Embedded Computing Systems)
    In this article, we consider the problem of reachable set computation of a closed-loop system with anytime sensor and a neural network controller. We provide a star set data structure-based forward propagation algorithm that uses existing efficient operations on star-sets and a novel convex hull construction. We present rigorous analysis of the space-complexity of the star sets generated during the propagation. Our experimental results show significant improvement with respect to existing methods that use vertex-based representation of polyhedral sets for propagation through closed-loop systems with anytime sensing, as well as the feasibility of the approach on different types of dynamics, control and sensors. 
    more » « less
    Free, publicly-accessible full text available November 30, 2026
  4. ; ; ; ; ; ; ; ; (, Springer Nature Switzerland)
    Full Text Available 
  5. ; ; (, IEEE)
    Full Text Available 
  6. ; (, IEEE)
    Full Text Available 
  7. ; (, IEEE)
    Full Text Available 
  8. ; (, IFAC-PapersOnLine)
    null (Ed.)
    Full Text Available 
  9. ; ; ; ; (, International Conference on Computer Aided Verification)
    null (Ed.)
    Full Text Available