default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhishek Ninad Kulkarni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i17]Hazhar Rahmani, Abhishek Ninad Kulkarni, Jie Fu:
Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policies. CoRR abs/2403.18212 (2024)- [i16]Abhishek Ninad Kulkarni, Matthew S. Cohen, Charles A. Kamhoua, Jie Fu:
Integrated Resource Allocation and Strategy Synthesis in Safety Games on Graphs with Deception. CoRR abs/2407.14436 (2024) - [i15]Abhishek Ninad Kulkarni, Jie Fu, Ufuk Topcu:
Nash Equilibrium in Games on Graphs with Incomplete Preferences. CoRR abs/2408.02860 (2024) - 2023
- [j3]Sumukha Udupa
, Abhishek Ninad Kulkarni, Shuo Han, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Synthesizing Attack-Aware Control and Active Sensing Strategies Under Reactive Sensor Attacks. IEEE Control. Syst. Lett. 7: 265-270 (2023) - [j2]Lening Li, Haoxiang Ma, Abhishek Ninad Kulkarni, Jie Fu:
Dynamic Hypergames for Synthesis of Deceptive Strategies With Temporal Logic Objectives. IEEE Trans Autom. Sci. Eng. 20(1): 334-345 (2023) - [c8]Abhishek Ninad Kulkarni, Jie Fu:
Opportunistic Qualitative Planning in Stochastic Systems with Incomplete Preferences over Reachability Objectives. ACC 2023: 3541-3547 - [c7]Chongyang Shi, Abhishek Ninad Kulkarni, Hazhar Rahmani, Jie Fu:
Synthesis of Opacity-Enforcing Winning Strategies Against Colluded Opponent. CDC 2023: 7240-7246 - [c6]Hazhar Rahmani, Abhishek Ninad Kulkarni, Jie Fu:
Probabilistic Planning with Partially Ordered Preferences over Temporal Goals. ICRA 2023: 5702-5708 - [i14]Chongyang Shi, Abhishek Ninad Kulkarni, Hazhar Rahmani, Jie Fu:
Synthesis of Opacity-Enforcing Winning Strategies Against Colluded Opponent. CoRR abs/2304.01286 (2023) - 2022
- [i13]Abhishek Ninad Kulkarni, Jie Fu:
Opportunistic Qualitative Planning in Stochastic Systems with Preferences over Temporal Logic Objectives. CoRR abs/2203.13803 (2022) - [i12]Sumukha Udupa, Abhishek Ninad Kulkarni, Shuo Han, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Synthesizing Attack-Aware Control and Active Sensing Strategies under Reactive Sensor Attacks. CoRR abs/2204.01584 (2022) - [i11]Hazhar Rahmani, Abhishek Ninad Kulkarni, Jie Fu:
Probabilistic Planning with Partially Ordered Preferences over Temporal Goals. CoRR abs/2209.12267 (2022) - [i10]Abhishek Ninad Kulkarni, Jie Fu:
Opportunistic Qualitative Planning in Stochastic Systems with Incomplete Preferences over Reachability Objectives. CoRR abs/2210.01878 (2022) - 2021
- [j1]Abhishek Ninad Kulkarni, Huan Luo, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Deceptive Labeling: Hypergames on Graphs for Stealthy Deception. IEEE Control. Syst. Lett. 5(3): 977-982 (2021) - [c5]Abhishek Ninad Kulkarni, Shuo Han, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Qualitative Planning in Imperfect Information Games with Active Sensing and Reactive Sensor Attacks: Cost of Unawareness. CDC 2021: 586-592 - [i9]Abhishek Ninad Kulkarni, Shuo Han, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Qualitative Planning in Imperfect Information Games with Active Sensing and Reactive Sensor Attacks: Cost of Unawareness. CoRR abs/2104.00176 (2021) - [i8]Abhishek Ninad Kulkarni, Jie Fu:
Synthesis of Deceptive Strategies in Reachability Games with Action Misperception (Technical Report). CoRR abs/2104.11676 (2021) - 2020
- [c4]Abhishek Ninad Kulkarni, Jie Fu, Huan Luo, Charles A. Kamhoua, Nandi O. Leslie:
Decoy Allocation Games on Graphs with Temporal Logic Objectives. GameSec 2020: 168-187 - [c3]Abhishek Ninad Kulkarni, Jie Fu:
Synthesis of Deceptive Strategies in Reachability Games with Action Misperception. IJCAI 2020: 217-223 - [i7]Jie Fu, Abhishek Ninad Kulkarni, Huan Luo, Nandi O. Leslie, Charles A. Kamhoua:
Secure-by-synthesis network with active deception and temporal logic specifications. CoRR abs/2002.07025 (2020) - [i6]Abhishek Ninad Kulkarni, Jie Fu:
Synthesis of Deceptive Strategies in Reachability Games with Action Misperception. CoRR abs/2002.07045 (2020) - [i5]Abhishek Ninad Kulkarni, Huan Luo, Nandi O. Leslie, Charles A. Kamhoua, Jie Fu:
Deceptive Labeling: Hypergames on Graphs for Stealthy Deception. CoRR abs/2004.05213 (2020) - [i4]Lening Li, Haoxiang Ma, Abhishek Ninad Kulkarni, Jie Fu:
Dynamic Hypergames for Synthesis of Deceptive Strategies with Temporal Logic Objectives. CoRR abs/2007.15726 (2020) - [i3]Abhishek Ninad Kulkarni, Jie Fu:
A Theory of Hypergames on Graphs for Synthesizing Dynamic Cyber Defense with Deception. CoRR abs/2008.03210 (2020) - [i2]Abhishek Ninad Kulkarni, Jie Fu, Huan Luo, Charles A. Kamhoua, Nandi O. Leslie:
Decoy Allocation Games on Graphs with Temporal Logic Objectives. CoRR abs/2010.01208 (2020)
2010 – 2019
- 2019
- [c2]Abhishek Ninad Kulkarni, Jie Fu:
Opportunistic Synthesis in Reactive Games under Information Asymmetry. CDC 2019: 5323-5329 - [i1]Abhishek Ninad Kulkarni, Jie Fu:
Opportunistic Synthesis in Reactive Games under Information Asymmetry. CoRR abs/1906.05847 (2019) - 2018
- [c1]Abhishek Ninad Kulkarni, Jie Fu:
A Compositional Approach to Reactive Games under Temporal Logic Specifications. ACC 2018: 2356-2362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
