Sadra Sadraddini
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
Research Subjects
Research Interests
Sadra Sadraddini has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Calin Belta
Department of Mechanical Engineering, Boston University, Boston, MA, USA
7 shared publications- Albert Wu
Stanford University, United States of America
1 shared publication - Calin Belta
University of Maryland, College Park, MD, USA
1 shared publication Iman Haghighi
Division of Systems Engineering, Boston University, MA, USA
1 shared publicationRuss Tedrake
Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology, Cambridge, MA
1 shared publication- S. Sivaranjani
Edwardson School of Industrial Engineering, Purdue University, West Lafayette, IN, USA
1 shared publication
Latest Publications
- Open Access
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1815-1822
The Nearest Polytope Problem: Algorithms and Application to Controlling Hybrid Systems
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1815-1822
Open AccessThe Nearest Polytope Problem: Algorithms and Application to Controlling Hybrid Systems
- Open Access
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1782-1787
Formal methods for adaptive control of dynamical systems
We develop a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications. We introduce the notions of (non-deterministic) parametric and adaptive transition systems and show how to use tools from formal methods to compute adaptive control strategies for finite systems. For infinite systems, we first compute abstractions in the form of parametric finite quotient transition systems and then apply the techniques for finite systems. Unlike traditional adaptive control techniques, our method is correct-by-design, does not require a reference model, and can handle a much wider range of systems and specifications. Illustrative examples are included.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1782-1787
Open AccessFormal methods for adaptive control of dynamical systems
We develop a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications. We introduce the notions of (non-deterministic) parametric and adaptive transition systems and show how to use tools from formal methods to compute adaptive control strategies for finite systems. For infinite systems, we first compute abstractions in the form of parametric finite quotient transition systems and then apply the techniques for finite systems. Unlike traditional adaptive control techniques, our method is correct-by-design, does not require a reference model, and can handle a much wider range of systems and specifications. Illustrative examples are included.
- Open Access
- 8 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 1 (2) , 262-267
Provably Safe Cruise Control of Vehicular Platoons
We synthesize performance-aware safe cruise control policies for longitudinal motion of platoons of autonomous vehicles. Using set-invariance theories, we guarantee infinite-time collision avoidance in the presence of bounded additive disturbances, while ensuring that the length and the cruise speed of the platoon are bounded within specified ranges. We propose: 1) a centralized control policy and 2) a distributed control policy, where each vehicle's control decision depends solely on its relative kinematics with respect to the platoon leader. Numerical examples are included.
- 8 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 1 (2) , 262-267
Open AccessProvably Safe Cruise Control of Vehicular Platoons
We synthesize performance-aware safe cruise control policies for longitudinal motion of platoons of autonomous vehicles. Using set-invariance theories, we guarantee infinite-time collision avoidance in the presence of bounded additive disturbances, while ensuring that the length and the cruise speed of the platoon are bounded within specified ranges. We propose: 1) a centralized control policy and 2) a distributed control policy, where each vehicle's control decision depends solely on its relative kinematics with respect to the platoon leader. Numerical examples are included.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5708-5713
Robotic swarm control from spatio-temporal specifications
In this paper, we study the problem of controlling a two-dimensional robotic swarm with the purpose of achieving high level and complex spatio-temporal patterns. We use a rich spatio-temporal logic that is capable of describing a wide range of time varying and complex spatial configurations, and develop a method to encode such formal specifications as a set of mixed integer linear constraints, which are incorporated into a mixed integer linear programming problem. We plan trajectories for each individual robot such that the whole swarm satisfies the spatio-temporal requirements, while optimizing total robot movement and/or a metric that shows how strongly the swarm trajectory resembles given spatio-temporal behaviors. An illustrative case study is included.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5708-5713
Robotic swarm control from spatio-temporal specifications
In this paper, we study the problem of controlling a two-dimensional robotic swarm with the purpose of achieving high level and complex spatio-temporal patterns. We use a rich spatio-temporal logic that is capable of describing a wide range of time varying and complex spatial configurations, and develop a method to encode such formal specifications as a set of mixed integer linear constraints, which are incorporated into a mixed integer linear programming problem. We plan trajectories for each individual robot such that the whole swarm satisfies the spatio-temporal requirements, while optimizing total robot movement and/or a metric that shows how strongly the swarm trajectory resembles given spatio-temporal behaviors. An illustrative case study is included.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4874-4879
Safety control of monotone systems with bounded uncertainties
Monotone systems are prevalent in models of engineering applications such as transportation and biological networks. In this paper, we investigate the problem of finding a control strategy for a discrete time positive monotone system with bounded uncertainties such that the evolution of the system is guaranteed to be confined to a safe set in the state space for all times. By exploiting monotonicity, we propose an approach to this problem which is based on constraint programming. We find control strategies that are based on repetitions of finite sequences of control actions. We show that, under assumptions made in the paper, safety control of monotone systems does not require state measurement. We demonstrate the results on a signalized urban traffic network, where the safety objective is to keep the traffic flow free of congestion.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4874-4879
Safety control of monotone systems with bounded uncertainties
Monotone systems are prevalent in models of engineering applications such as transportation and biological networks. In this paper, we investigate the problem of finding a control strategy for a discrete time positive monotone system with bounded uncertainties such that the evolution of the system is guaranteed to be confined to a safe set in the state space for all times. By exploiting monotonicity, we propose an approach to this problem which is based on constraint programming. We find control strategies that are based on repetitions of finite sequences of control actions. We show that, under assumptions made in the paper, safety control of monotone systems does not require state measurement. We demonstrate the results on a signalized urban traffic network, where the safety objective is to keep the traffic flow free of congestion.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 35, 5732-5737
Feasibility envelopes for metric temporal logic specifications
Designing control policies from complex specifications has drawn significant attention in recent years. Metric temporal logic (MTL) is a specification formalism for describing a wide range of temporal properties with specific timing constraints. In this paper, we focus on discrete time linear control systems and specifications given as MTL formulas over linear predicates in the states. We present a method based on polyhedral projection to find the set of all initial states from which all trajectories satisfying MTL formulas can be generated. An illustrative example is included.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 35, 5732-5737
Feasibility envelopes for metric temporal logic specifications
Designing control policies from complex specifications has drawn significant attention in recent years. Metric temporal logic (MTL) is a specification formalism for describing a wide range of temporal properties with specific timing constraints. In this paper, we focus on discrete time linear control systems and specifications given as MTL formulas over linear predicates in the states. We present a method based on polyhedral projection to find the set of all initial states from which all trajectories satisfying MTL formulas can be generated. An illustrative example is included.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1679-1684
A provably correct MPC approach to safety control of urban traffic networks
Model predictive control (MPC) is a popular strategy for urban traffic management that is able to incorporate physical and user defined constraints. However, the current MPC methods rely on finite horizon predictions that are unable to guarantee desirable behaviors over long periods of time. In this paper we design an MPC strategy that is guaranteed to keep the evolution of a network in a desirable yet arbitrary -safe- set, while optimizing a finite horizon cost function. Our approach relies on finding a robust controlled invariant set inside the safe set that provides an appropriate terminal constraint for the MPC optimization problem. An illustrative example is included.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1679-1684
A provably correct MPC approach to safety control of urban traffic networks
Model predictive control (MPC) is a popular strategy for urban traffic management that is able to incorporate physical and user defined constraints. However, the current MPC methods rely on finite horizon predictions that are unable to guarantee desirable behaviors over long periods of time. In this paper we design an MPC strategy that is guaranteed to keep the evolution of a network in a desirable yet arbitrary -safe- set, while optimizing a finite horizon cost function. Our approach relies on finding a robust controlled invariant set inside the safe set that provides an appropriate terminal constraint for the MPC optimization problem. An illustrative example is included.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 881
Model predictive control of urban traffic networks with temporal logic constraints
Model predictive control (MPC) is a popular method for urban traffic management. Apart from physical constraints, traffic networks are amenable to an extra layer of objectives that uphold certain behaviors for the vehicular flow. In this presentation, we survey the recent results on developing MPC strategies from signal temporal logic (STL) specifications. A wide range of desirable behaviors in urban traffic networks such as avoidance of gridlocks, liveness of vehicular flows and sequentiality of traffic lights can be expressed by STL formulas. By translating STL specifications to mixed integer constraints, traffic network control synthesis is formulated as a mixed integer linear programming (MILP) problem. In addition, STL quantitative semantics (robustness) provides a numerical measure of the distance to satisfaction (violation) of the evolution of a traffic network. We will also discuss robustness maximization policies in the context of traffic control.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 881
Model predictive control of urban traffic networks with temporal logic constraints
Model predictive control (MPC) is a popular method for urban traffic management. Apart from physical constraints, traffic networks are amenable to an extra layer of objectives that uphold certain behaviors for the vehicular flow. In this presentation, we survey the recent results on developing MPC strategies from signal temporal logic (STL) specifications. A wide range of desirable behaviors in urban traffic networks such as avoidance of gridlocks, liveness of vehicular flows and sequentiality of traffic lights can be expressed by STL formulas. By translating STL specifications to mixed integer constraints, traffic network control synthesis is formulated as a mixed integer linear programming (MILP) problem. In addition, STL quantitative semantics (robustness) provides a numerical measure of the distance to satisfaction (violation) of the evolution of a traffic network. We will also discuss robustness maximization policies in the context of traffic control.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 772-779
Robust temporal logic model predictive control
Control synthesis from temporal logic specifications has gained popularity in recent years. In this paper, we use a model predictive approach to control discrete time linear systems with additive bounded disturbances subject to constraints given as formulas of signal temporal logic (STL). We introduce a (conservative) computationally efficient framework to synthesize control strategies based on mixed integer programs. The designed controllers satisfy the temporal logic requirements, are robust to all possible realizations of the disturbances, and optimal with respect to a cost function. In case the temporal logic constraint is infeasible, the controller satisfies a relaxed, minimally violating constraint. An illustrative case study is included.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 772-779
Robust temporal logic model predictive control
Control synthesis from temporal logic specifications has gained popularity in recent years. In this paper, we use a model predictive approach to control discrete time linear systems with additive bounded disturbances subject to constraints given as formulas of signal temporal logic (STL). We introduce a (conservative) computationally efficient framework to synthesize control strategies based on mixed integer programs. The designed controllers satisfy the temporal logic requirements, are robust to all possible realizations of the disturbances, and optimal with respect to a cost function. In case the temporal logic constraint is infeasible, the controller satisfies a relaxed, minimally violating constraint. An illustrative case study is included.