Yagiz Savas

Yagiz Savas

Auto-generated profile, based on publicly available information

Yagiz Savas

University of Texas at Austin, Austin, TX, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YSYagiz Savas
Yagiz Savas
MOMelkior Ornik
Melkior Ornik
MCMurat Cubuktepe
Murat Cubuktepe
MKMustafa O. Karabag
Mustafa O. Karabag
UTUfuk Topcu
Ufuk Topcu
We study the problem of synthesizing a policy that maximizes the entropy of a Markov decision process (MDP) subject to a temporal logic constraint. Such a policy minimizes the predictability of the paths it generates, or dually, maximizes the exploration of different paths in an MDP while ensuring the satisfaction of a temporal logic specification. We first show that the maximum entropy of an MDP can be finite, infinite or unbounded. We provide necessary and sufficient conditions under which the maximum entropy of an MDP is finite, infinite or unbounded. We then present an algorithm which is based on a convex optimization problem to synthesize a policy that maximizes the entropy of an MDP. We also show that maximizing the entropy of an MDP is equivalent to maximizing the entropy of the paths that reach a certain set of states in the MDP. Finally, we extend the algorithm to an MDP subject to a temporal logic specification. In numerical examples, we demonstrate the proposed method on different motion planning scenarios and illustrate the relation between the restrictions imposed on the paths by a specification, the maximum entropy, and the predictability of paths.

6 November 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
NLNiklas Lauffer
Niklas Lauffer
MGMahsa Ghasemi
Mahsa Ghasemi
AHAbolfazl Hashemi
Abolfazl Hashemi
YSYagiz Savas
Yagiz Savas
UTUfuk Topcu
Ufuk Topcu
In a Stackelberg game , a leader commits to a randomized strategy, and a follower chooses their best strategy in response. We consider an extension of a standard Stackelberg game, called a discrete-time dynamic Stackelberg game , that has an underlying state space that affects the leader's rewards and available strategies and evolves in a Markovian manner depending on both the leader and follower's selected strategies. Although standard Stackelberg games have been utilized to improve scheduling in security domains, their deployment is often limited by requiring complete information of the follower's utility function. In contrast, we consider scenarios where the follower's utility function is unknown to the leader; however, it can be linearly parameterized. Our objective then is to provide an algorithm that prescribes a randomized strategy to the leader at each step of the game based on observations of how the follower responded in previous steps. We design an online learning algorithm that, with high probability, is no-regret , i.e., achieves a regret bound (when compared to the best policy in hindsight) which is sublinear in the number of timesteps; the degree of sublinearity depends on the number of features representing the follower's utility function. The regret of the proposed learning algorithm is independent of the size of the state space and polynomial in the rest of the parameters of the game. We show that the proposed learning algorithm outperforms existing model-free reinforcement learning approaches.

16 June 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YSYagiz Savas
Yagiz Savas
MHMichael Hibbard
Michael Hibbard
BWBo Wu
Bo Wu
TTTakashi Tanaka
Takashi Tanaka
UTUfuk Topcu
Ufuk Topcu
We study the problem of synthesizing a controller that maximizes the entropy of a partially observable Markov decision process (POMDP) subject to a constraint on the expected total reward. Such a controller minimizes the predictability of an agent’s trajectories to an outside observer while guaranteeing the completion of a task expressed by a reward function. Focusing on finite-state controllers (FSCs) with deterministic memory transitions, we show that the maximum entropy of a POMDP is lower bounded by the maximum entropy of the parametric Markov chain (pMC) induced by such FSCs. This relationship allows us to recast the entropy maximization problem as a so-called parameter synthesis problem for the induced pMC. We then present an algorithm to synthesize an FSC that locally maximizes the entropy of a POMDP over FSCs with the same number of memory states. In a numerical example, we highlight the benefit of using an entropy-maximizing FSC compared to an FSC that simply finds a feasible policy for accomplishing a task.

6 June 2021
Verified
Conference Paper
Open access
YSYagiz Savas
Yagiz Savas
AHAbolfazl Hashemi
Abolfazl Hashemi
AVAbraham P. Vinod
Abraham P. Vinod
BSBrian M Sadler
Brian M Sadler
UTUfuk Topcu
Ufuk Topcu
We study the problem of securely communicating a sequence of information bits with a client in the presence of multiple adversaries at unknown locations in the environment. We assume that the client and the adversaries are located in the far-field region, and all possible directions for each adversary can be expressed as a continuous interval of directions. In such a setting, we develop a periodic transmission strategy, i.e., a sequence of joint beamforming gain and artificial noise pairs, that prevents the adversaries from decreasing their uncertainty on the information sequence by eavesdropping on the transmission. We formulate a series of nonconvex semi-infinite optimization problems to synthesize the transmission strategy. We show that the semi-definite program (SDP) relaxations of these nonconvex problems are exact under an efficiently verifiable sufficient condition. We approximate the SDP relaxations, which are subject to infinitely many constraints, by randomly sampling a finite subset of the constraints and establish the probability with which optimal solutions to the obtained finite SDPs and the semi-infinite SDPs coincide. We demonstrate with numerical simulations that the proposed periodic strategy can ensure the security of communication in scenarios in which all stationary strategies fail to guarantee security.

1 January 2020 in IFAC-PapersOnLine
Verified
Journal Article
Closed access
MHMichael Hibbard
Michael Hibbard
YSYagiz Savas
Yagiz Savas
ZXZhe Xu
Zhe Xu
UTUfuk Topcu
Ufuk Topcu

3 April 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YSYagiz Savas
Yagiz Savas
CVChristos Verginis
Christos Verginis
MHMichael Hibbard
Michael Hibbard
UTUfuk Topcu
Ufuk Topcu
We study the synthesis of a policy in a Markov decision process (MDP) following which an agent reaches a target state in the MDP while minimizing its total discounted cost. The problem combines a reachability criterion with a discounted cost criterion and naturally expresses the completion of a task with probabilistic guarantees and optimal transient performance. We first establish that an optimal policy for the considered formulation may not exist but that there always exists a near-optimal stationary policy. We additionally provide a necessary and sufficient condition for the existence of an optimal policy. We then restrict our attention to stationary deterministic policies and show that the decision problem associated with the synthesis of an optimal stationary deterministic policy is NP-complete. Finally, we provide an exact algorithm based on mixed-integer linear programming and propose an efficient approximation algorithm based on linear programming for the synthesis of an optimal stationary deterministic policy.