Yasin Yazicioglu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yasin Yazicioglu has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Waseem Abbas
Department of Systems Engineering, The University of Texas at Dallas, Richardson, TX, USA
9 shared publications - Mudassir Shabbir
Computer Science Department, Information Technology University, Lahore, Pakistan
6 shared publications - Derya Aksaray
Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA
5 shared publications - Magnus Egerstedt
Department of Electrical Engineering and Computer Science, University of California, Irvine, CA, USA
4 shared publications - Munther A. Dahleh
Massachusetts Institute of Technology
4 shared publications - Xenofon Koutsoukos
Vanderbilt University Nashville TN USA
4 shared publications
Latest Publications
- Open Access
- 26 June 2026
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
RSPECT: Robust and Scalable Planner for Energy-Aware Coordination of UAV-UGV Teams in Aerial Monitoring
We consider the robust planning of energy-constrained unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs), which act as mobile charging stations, to perform long-horizon aerial monitoring missions. More specifically, given a set of points to be visited by the UAVs and desired final positions of the UAV-UGV teams, the objective is to find a robust plan (the vehicle trajectories) that can be realized without a major revision in the face of uncertainty (e.g., unknown obstacles/terrain, wind) to complete this mission in minimum time. We provide a formal description of this problem as a mixed-integer program (MIP), which is NP-hard. Since exact solution methods are computationally intractable for such problems, we propose RSPECT, a scalable and efficient heuristic. We provide theoretical results on the complexity of our algorithm and the feasibility and robustness of resulting plans. We also demonstrate the performance of our method via simulations and experiments.
- 26 June 2026
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
Open AccessRSPECT: Robust and Scalable Planner for Energy-Aware Coordination of UAV-UGV Teams in Aerial Monitoring
We consider the robust planning of energy-constrained unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs), which act as mobile charging stations, to perform long-horizon aerial monitoring missions. More specifically, given a set of points to be visited by the UAVs and desired final positions of the UAV-UGV teams, the objective is to find a robust plan (the vehicle trajectories) that can be realized without a major revision in the face of uncertainty (e.g., unknown obstacles/terrain, wind) to complete this mission in minimum time. We provide a formal description of this problem as a mixed-integer program (MIP), which is NP-hard. Since exact solution methods are computationally intractable for such problems, we propose RSPECT, a scalable and efficient heuristic. We provide theoretical results on the complexity of our algorithm and the feasibility and robustness of resulting plans. We also demonstrate the performance of our method via simulations and experiments.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 3476-3481
Multi-Robot Coverage Control With Bounded Suboptimality Guarantees
We consider a coverage control problem, where a team of robots move in a convex domain to minimize a standard coverage cost. One prevalent approach to solve this problem is to use a gradient based controller (e.g., Lloyd’s algorithm), which stabilizes the local minima of such a coverage cost function. However, to the best of our knowledge, there are no formal results on how suboptimal these local minima can be. In this paper, we first show the existence of arbitrarily bad local minima. We then prove that a local search based approximation algorithm, which was originally developed for other location optimization problems (k-means/medians), can be adapted to the coverage control problem to stabilize configurations with bounded suboptimality in a decentralized manner. We also support our theoretical results with experiments on robots.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 3476-3481
Multi-Robot Coverage Control With Bounded Suboptimality Guarantees
We consider a coverage control problem, where a team of robots move in a convex domain to minimize a standard coverage cost. One prevalent approach to solve this problem is to use a gradient based controller (e.g., Lloyd’s algorithm), which stabilizes the local minima of such a coverage cost function. However, to the best of our knowledge, there are no formal results on how suboptimal these local minima can be. In this paper, we first show the existence of arbitrarily bad local minima. We then prove that a local search based approximation algorithm, which was originally developed for other location optimization problems (k-means/medians), can be adapted to the coverage control problem to stabilize configurations with bounded suboptimality in a decentralized manner. We also support our theoretical results with experiments on robots.
- 11 March 2024
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 176
Sequential control barrier functions for mobile robots with dynamic temporal logic specifications
- 11 March 2024
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 176
Sequential control barrier functions for mobile robots with dynamic temporal logic specifications
- Open Access
Reinforcement Learning Under Probabilistic Spatio-Temporal Constraints with Time Windows
We propose an automata-theoretic approach for reinforcement learning (RL) under complex spatio-temporal constraints with time windows. The problem is formulated using a Markov decision process under a bounded temporal logic constraint. Different from existing RL methods that can eventually learn optimal policies satisfying such constraints, our proposed approach enforces a desired probability of constraint satisfaction throughout learning. This is achieved by translating the bounded temporal logic constraint into a total automaton and avoiding "unsafe" actions based on the available prior information regarding the transition probabilities, i.e., a pair of upper and lower bounds for each transition probability. We provide theoretical guarantees on the resulting probability of constraint satisfaction. We also provide numerical results in a scenario where a robot explores the environment to discover high-reward regions while fulfilling some periodic pick-up and delivery tasks that are encoded as temporal logic constraints.
Open AccessReinforcement Learning Under Probabilistic Spatio-Temporal Constraints with Time Windows
We propose an automata-theoretic approach for reinforcement learning (RL) under complex spatio-temporal constraints with time windows. The problem is formulated using a Markov decision process under a bounded temporal logic constraint. Different from existing RL methods that can eventually learn optimal policies satisfying such constraints, our proposed approach enforces a desired probability of constraint satisfaction throughout learning. This is achieved by translating the bounded temporal logic constraint into a total automaton and avoiding "unsafe" actions based on the available prior information regarding the transition probabilities, i.e., a pair of upper and lower bounds for each transition probability. We provide theoretical guarantees on the resulting probability of constraint satisfaction. We also provide numerical results in a scenario where a robot explores the environment to discover high-reward regions while fulfilling some periodic pick-up and delivery tasks that are encoded as temporal logic constraints.
- 13 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 11 (1) , 402-413
On Zero Forcing Sets and Network Controllability—Computation and Edge Augmentation
This paper studies the problem of computing a minimum zero forcing set (ZFS) in undirected graphs and presents new approaches to reducing the size of the minimum ZFS via edge augmentation. The minimum ZFS problem has numerous applications; for instance, it relates to the minimum leader selection problem for the strong structural controllability of networks defined over graphs. Computing a minimum ZFS is an NP-hard problem in general. We show that the greedy heuristic for the ZFS computation, though it typically performs well, could give arbitrarily bad solutions for some graphs. We provide a linear-time algorithm to compute a minimum ZFS in trees and a complete characterization of minimum ZFS in the clique chain graphs. We also present a game-theoretic solution for general graphs by formalizing the minimum ZFS problem as a potential game. In addition, we consider the effect of edge augmentation on the size of the ZFS. Adding edges could improve network robustness; however, it could increase the size of the ZFS. We show that adding a set of carefully selected missing edges to a graph may actually reduce the size of the minimum ZFS. Finally, we numerically evaluate our results on random graphs.
- 13 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 11 (1) , 402-413
On Zero Forcing Sets and Network Controllability—Computation and Edge Augmentation
This paper studies the problem of computing a minimum zero forcing set (ZFS) in undirected graphs and presents new approaches to reducing the size of the minimum ZFS via edge augmentation. The minimum ZFS problem has numerous applications; for instance, it relates to the minimum leader selection problem for the strong structural controllability of networks defined over graphs. Computing a minimum ZFS is an NP-hard problem in general. We show that the greedy heuristic for the ZFS computation, though it typically performs well, could give arbitrarily bad solutions for some graphs. We provide a linear-time algorithm to compute a minimum ZFS in trees and a complete characterization of minimum ZFS in the clique chain graphs. We also present a game-theoretic solution for general graphs by formalizing the minimum ZFS problem as a potential game. In addition, we consider the effect of edge augmentation on the size of the ZFS. Adding edges could improve network robustness; however, it could increase the size of the ZFS. We show that adding a set of carefully selected missing edges to a graph may actually reduce the size of the minimum ZFS. Finally, we numerically evaluate our results on random graphs.
- 18 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (3) , 1768-1775
Computation of the Distance-Based Bound on Strong Structural Controllability in Networks
In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vectors containing the distances between leaders (nodes with external inputs) and followers (remaining nodes) in the underlying network graph. Such vectors are referred to as the distance-to-leaders vectors. {We give exact and approximate algorithms to compute the longest sequences of distance-to-leaders vectors, which directly provide distance-based bounds on the dimension of SSCS. The distance-based bound is known to outperform the other known bounds (for instance, based on zero-forcing sets), especially when the network is partially strong structurally controllable. Using these results, we discuss an application of the distance-based bound in solving the leader selection problem for strong structural controllability. Further, we characterize strong structural controllability in path and cycle graphs with a given set of leader nodes using sequences of distance-to-leaders vectors. Finally, we numerically evaluate our results on various graphs.
- 18 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (3) , 1768-1775
Computation of the Distance-Based Bound on Strong Structural Controllability in Networks
In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vectors containing the distances between leaders (nodes with external inputs) and followers (remaining nodes) in the underlying network graph. Such vectors are referred to as the distance-to-leaders vectors. {We give exact and approximate algorithms to compute the longest sequences of distance-to-leaders vectors, which directly provide distance-based bounds on the dimension of SSCS. The distance-based bound is known to outperform the other known bounds (for instance, based on zero-forcing sets), especially when the network is partially strong structurally controllable. Using these results, we discuss an application of the distance-based bound in solving the leader selection problem for strong structural controllability. Further, we characterize strong structural controllability in path and cycle graphs with a given set of leader nodes using sequences of distance-to-leaders vectors. Finally, we numerically evaluate our results on various graphs.
- Top Cited Papers
- 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (2) , 4157-4164
Robust Planning for Persistent Surveillance With Energy-Constrained UAVs and Mobile Charging Stations
We consider persistent (long-horizon) surveillance over an environment by using energy-constrained unmanned aerial vehicles (UAVs), which are supported by unmanned ground vehicles (UGVs) serving as mobile charging stations. The goal is to periodically visit a set of monitoring points by the UAVs while minimizing the maximum time between the consecutive visits to any of those points. In general, the optimal planning of UAVs and UGVs in such a persistent surveillance scenario is an NP-hard combinatorial optimization problem. Furthermore, the problem also demands a solution strategy that can successfully handle obstacles, especially on the ground, that are unknown a priori in many real-life scenarios. We present a scalable and robust approximate algorithm that is based on 1) forming uniform UAV-UGV teams, 2) decomposing the environment into maximal partitions that can be covered by the UAVs in a single fuel cycle as long as the UAVs are released sufficiently close to the centers of the partitions, 3) maintaining the teams uniformly distributed over a cyclic path traversing those partitions, and 4) having the UAVs in each team cover their current partition and be transported to the next partition while being recharged by the UGV. We support our proposed algorithm with some theoretical results and simulations.
- 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (2) , 4157-4164
Top Cited PapersRobust Planning for Persistent Surveillance With Energy-Constrained UAVs and Mobile Charging Stations
We consider persistent (long-horizon) surveillance over an environment by using energy-constrained unmanned aerial vehicles (UAVs), which are supported by unmanned ground vehicles (UGVs) serving as mobile charging stations. The goal is to periodically visit a set of monitoring points by the UAVs while minimizing the maximum time between the consecutive visits to any of those points. In general, the optimal planning of UAVs and UGVs in such a persistent surveillance scenario is an NP-hard combinatorial optimization problem. Furthermore, the problem also demands a solution strategy that can successfully handle obstacles, especially on the ground, that are unknown a priori in many real-life scenarios. We present a scalable and robust approximate algorithm that is based on 1) forming uniform UAV-UGV teams, 2) decomposing the environment into maximal partitions that can be covered by the UAVs in a single fuel cycle as long as the UAVs are released sufficiently close to the centers of the partitions, 3) maintaining the teams uniformly distributed over a cyclic path traversing those partitions, and 4) having the UAVs in each team cover their current partition and be transported to the next partition while being recharged by the UGV. We support our proposed algorithm with some theoretical results and simulations.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (6) , 2024-2029
High Dimensional Robust Consensus Over Networks With Limited Capacity
We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge capacities are small compared to the dimensionality of the state vectors, it is not possible to instantaneously communicate full state information over every edge. We investigate how robust consensus (small steady state variance of the states) can be achieved within a linear time-invariant setting by optimally assigning edges to state-dimensions. We show that a finite steady state variance of the states can be achieved if and only if the minimum cut capacity of the network is not smaller than the dimensionality of the state vectors. Optimal and approximate solutions are provided for some special classes of graphs. We also consider the related problem of optimally allocating additional capacity on a feasible initial solution. We show that this problem corresponds to the maximization of a submodular function subject to a matroid constraint, which can be approximated via a greedy algorithm.
- 1 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (6) , 2024-2029
High Dimensional Robust Consensus Over Networks With Limited Capacity
We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge capacities are small compared to the dimensionality of the state vectors, it is not possible to instantaneously communicate full state information over every edge. We investigate how robust consensus (small steady state variance of the states) can be achieved within a linear time-invariant setting by optimally assigning edges to state-dimensions. We show that a finite steady state variance of the states can be achieved if and only if the minimum cut capacity of the network is not smaller than the dimensionality of the state vectors. Optimal and approximate solutions are provided for some special classes of graphs. We also consider the related problem of optimally allocating additional capacity on a feasible initial solution. We show that this problem corresponds to the maximization of a submodular function subject to a matroid constraint, which can be approximated via a greedy algorithm.
- 11 September 2021
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 103 (2) , 1-19
Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach
- 11 September 2021
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 103 (2) , 1-19
Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach
- Open Access
Probabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning
We propose a novel constrained reinforcement learning method for finding optimal policies in Markov Decision Processes while satisfying temporal logic constraints with a desired probability throughout the learning process. An automata-theoretic approach is proposed to ensure the probabilistic satisfaction of the constraint in each episode, which is different from penalizing violations to achieve constraint satisfaction after a sufficiently large number of episodes. The proposed approach is based on computing a lower bound on the probability of constraint satisfaction and adjusting the exploration behavior as needed. We present theoretical results on the probabilistic constraint satisfaction achieved by the proposed approach. We also numerically demonstrate the proposed idea in a drone scenario, where the constraint is to perform periodically arriving pick-up and delivery tasks and the objective is to fly over high-reward zones to simultaneously perform aerial monitoring.
Open AccessProbabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning
We propose a novel constrained reinforcement learning method for finding optimal policies in Markov Decision Processes while satisfying temporal logic constraints with a desired probability throughout the learning process. An automata-theoretic approach is proposed to ensure the probabilistic satisfaction of the constraint in each episode, which is different from penalizing violations to achieve constraint satisfaction after a sufficiently large number of episodes. The proposed approach is based on computing a lower bound on the probability of constraint satisfaction and adjusting the exploration behavior as needed. We present theoretical results on the probabilistic constraint satisfaction achieved by the proposed approach. We also numerically demonstrate the proposed idea in a drone scenario, where the constraint is to perform periodically arriving pick-up and delivery tasks and the objective is to fly over high-reward zones to simultaneously perform aerial monitoring.