Search Results for author: Jianing Zhao

Found 5 papers, 1 papers with code

Prioritize Team Actions: Multi-Agent Temporal Logic Task Planning with Ordering Constraints

no code implementations26 Mar 2024 Bowen Ye, Jianing Zhao, ShaoYuan Li, Xiang Yin

Simultaneously, we aim to maintain a pre-determined order in the values of the objective function for each agent, which we refer to as the ordering constraints.

How to Understand "Support"? An Implicit-enhanced Causal Inference Approach for Weakly-supervised Phrase Grounding

no code implementations29 Feb 2024 Jiamin Luo, Jianing Zhao, Jingjing Wang, Guodong Zhou

Weakly-supervised Phrase Grounding (WPG) is an emerging task of inferring the fine-grained phrase-region matching, while merely leveraging the coarse-grained sentence-image pairs for training.

Causal Inference counterfactual +3

Sleep When Everything Looks Fine: Self-Triggered Monitoring for Signal Temporal Logic Tasks

1 code implementation27 Nov 2023 Chuwei Wang, Xinyi Yu, Jianing Zhao, Lars Lindemann, Xiang Yin

Existing works on online monitoring usually assume that the monitor can acquire system information periodically at each time instant.

A Unified Framework for Verification of Observational Properties for Partially-Observed Discrete-Event Systems

no code implementations3 May 2022 Jianing Zhao, Xiang Yin, ShaoYuan Li

However, in contrast to existing results, where different verification procedures are developed for different properties case-by-case, in this work, we provide a unified framework for verifying all these properties by reducing each of them as an instance of HyperLTL model checking.

To Explore or Not to Explore: Regret-Based LTL Planning in Partially-Known Environments

no code implementations1 Apr 2022 Jianing Zhao, Keyi Zhu, Mingyang Feng, Xiang Yin

In contrast to the standard game-based approach that optimizes the worst-case cost, in the paper, we propose to use regret as a new metric for planning in such a partially-known environment.

Cannot find the paper you are looking for? You can Submit a new open access paper.