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 2

Search for: All records

Award ID contains: 2144113

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. ; ; (, 16th ACM/IEEE International Conference on Cyber-Physical Systems)
    Free, publicly-accessible full text available May 6, 2026
  2. ; ; ; ; (, Transactions on machine learning research)
    Free, publicly-accessible full text available March 28, 2026
  3. ; (, IEEE)
    Free, publicly-accessible full text available December 16, 2025
  4. ; ; (, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI-24))
    Accepted Manuscript Full Text Available
  5. ; ; ; (, IEEE Control Systems Letters)
    Full Text Available 
  6. ; ; ; (, Decision and Game Theory for Security)
    Fu, J. (Ed.)
    Full Text Available 
  7. ; ; (, Conference on Decision and Game Theory for Security)
    Accepted Manuscript Full Text Available
  8. ; ; ; (, 2023 62nd IEEE Conference on Decision and Control (CDC))
    This paper studies language-based opacity enforcement in a two-player, zero-sum game on a graph. In this game, player 1 (P1) wins if he can achieve a secret temporal goal described by the language of a finite automaton, no matter what strategy the opponent player 2 (P2) selects. In addition, P1 aims to win while making its goal opaque to a passive observer with imperfect information. However, P2 colludes with the observer to reveal P1's secret whenever P2 cannot prevent P1 from achieving its goal, and therefore, opacity must be enforced against P2. We show that a winning and opacity-enforcing strategy for P1 can be computed by reducing the problem to solving a reachability game augmented with the observer's belief states. Furthermore, if such a strategy does not exist, winning for P1 must entail the price of revealing his secret to the observer. We demonstrate our game-theoretic solution of opacity-enforcement control through a small illustrative example and in a robot motion planning problem. 
    more » « less
  9. ; ; ; (, IEEE)
  10. ; ; (, International Joint Conferences on Artificial Intelligence)
    Accepted Manuscript Full Text Available