Arvind U. Raghunathan

Arvind U. Raghunathan

Auto-generated profile, based on publicly available information

Arvind U. Raghunathan

Mitsubishi Electric Research Laboratories, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 March 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
DBDavid Bergman
David Bergman
THTeng Huang
Teng Huang
PBPhilip Brooks
Philip Brooks
ALAndrea Lodi
Andrea Lodi
ARArvind U. Raghunathan
Arvind U. Raghunathan
Business research practice is witnessing a surge in the integration of predictive modeling and prescriptive analysis. We describe a modeling framework JANOS that seamlessly integrates the two streams of analytics, allowing researchers and practitioners to embed machine learning models in an end-to-end optimization framework. JANOS allows for specifying a prescriptive model using standard optimization modeling elements such as constraints and variables. The key novelty lies in providing modeling constructs that enable the specification of commonly used predictive models within an optimization model, have the features of the predictive model as variables in the optimization model, and incorporate the output of the predictive models as part of the objective. The framework considers two sets of decision variables: regular and predicted. The relationship between the regular and the predicted variables is specified by the user as pretrained predictive models. JANOS currently supports linear regression, logistic regression, and neural network with rectified linear activation functions. In this paper, we demonstrate the flexibility of the framework through an example on scholarship allocation in a student enrollment problem and provide a numeric performance evaluation.Summary of Contribution. This paper describes a new software tool, JANOS, that integrates predictive modeling and discrete optimization to assist decision making. Specifically, the proposed solver takes as input user-specified pretrained predictive models and formulates optimization models directly over those predictive models by embedding them within an optimization model through linear transformations.

22 July 2020 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ACAnkush Chakrabarty
Ankush Chakrabarty
CDClaus Danielson
Claus Danielson
SCStefano Di Cairano
Stefano Di Cairano
ARArvind Raghunathan
Arvind Raghunathan
This article presents a data-driven method for computing reachable sets where active learning (AL) is used to reduce the computational burden. Set-based methods used to estimate reachable sets typically do not scale well with the state-space dimension, or rely heavily on the existence of a model. If such a model is not available, it is simple to generate state trajectory data by numerically simulating black-box oracles of systems (whose dynamics are unknown) from sampled initial conditions. Using these data samples, the estimation of reachable sets can be posed as a classification problem, wherein AL can intelligently select samples that are most informative and least similar to previously labeled samples. By exploiting submodularity, the actively learned samples can be selected efficiently, with bounded suboptimality. Our proposed framework is illustrated by estimating the domains of attractions of model predictive controllers (MPCs) and reinforcement learners. We also consider a scenario where there are two oracles that differ with respect to evaluation costs and labeling accuracy. We propose a framework to reduce the dependency of the expensive oracle in labeling samples using disagreement-based AL (DBAL). The potential of the DBAL algorithm is demonstrated on a solver selection problem for real-time MPC.

12 January 2021 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
CNCarlos J. Nohra
Carlos J. Nohra
ARArvind U. Raghunathan
Arvind U. Raghunathan
NSNikolaos Sahinidis
Nikolaos Sahinidis
We consider the global optimization of nonconvex (mixed-integer) quadratic programs. We present a family of convex quadratic relaxations derived by convexifying nonconvex quadratic functions throug...

1 March 2024 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
ARArvind U. Raghunathan
Arvind U. Raghunathan
DBDavid Bergman
David Bergman
JHJohn N. Hooker
John N. Hooker
TSThiago Serra
Thiago Serra
SKShingo Kobori
Shingo Kobori

2 July 2024 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
YSYuki Shirai
Yuki Shirai
DJDevesh K. Jha
Devesh K. Jha
ARArvind U. Raghunathan
Arvind U. Raghunathan
Generalizable manipulation requires that robots be able to interact with novel objects and environment. This requirement makes manipulation extremely challenging as a robot has to reason about complex frictional interactions with uncertainty in physical properties of the object and the environment. In this paper, we study robust optimization for planning of pivoting manipulation in the presence of uncertainties. We present insights about how friction can be exploited to compensate for inaccuracies in the estimates of the physical properties during manipulation. Under certain assumptions, we derive analytical expressions for stability margin provided by friction during pivoting manipulation. This margin is then used in a Contact Implicit Bilevel Optimization (CIBO) framework to optimize a trajectory that maximizes this stability margin to provide robustness against uncertainty in several physical parameters of the object. We present analysis of the stability margin with respect to several parameters involved in the underlying bilevel optimization problem. We demonstrate our proposed method using a 6 DoF manipulator for manipulating several different objects. We also design and validate an MPC controller using the proposed algorithm which can track and regulate the position of the object during manipulation.

1 January 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
TSThiago Serra
Thiago Serra
THTeng Huang
Teng Huang
ARArvind U. Raghunathan
Arvind U. Raghunathan
DBDavid Bergman
David Bergman
Quantum annealing (QA) can be used to quickly obtain near-optimal solutions for quadratic unconstrained binary optimization (QUBO) problems. In QA hardware, each decision variable of a QUBO should be mapped to one or more adjacent qubits in such a way that pairs of variables defining a quadratic term in the objective function are mapped to some pair of adjacent qubits. However, qubits have limited connectivity in existing QA hardware. This has spurred work on preprocessing algorithms for embedding the graph representing problem variables with quadratic terms into the hardware graph representing qubits adjacencies, such as the Chimera graph in hardware produced by D-Wave Systems. In this paper, we use integer linear programming to search for an embedding of the problem graph into certain classes of minors of the Chimera graph, which we call template embeddings. One of these classes corresponds to complete bipartite graphs, for which we show the limitation of the existing approach based on minimum odd cycle transversals (OCTs). One of the formulations presented is exact and thus can be used to certify the absence of a minor embedding using that template. On an extensive test set consisting of random graphs from five different classes of varying size and sparsity, we can embed more graphs than a state-of-the-art OCT-based approach, our approach scales better with the hardware size, and the runtime is generally orders of magnitude smaller. Summary of Contribution: Our work combines classical and quantum computing for operations research by showing that integer linear programming can be successfully used as a preprocessing step for adiabatic quantum optimization. We use it to determine how a quadratic unconstrained binary optimization problem can be solved by a quantum annealer in which the qubits are coupled as in a Chimera graph, such as in the quantum annealers currently produced by D-Wave Systems. The paper also provides a timely introduction to adiabatic quantum computing and related work on minor embeddings.