JMJoseph Moyalan

Joseph Moyalan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Joseph Moyalan has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fairness-Aware Management of Electric Vehicle Charging Stations

    by Paulo Bessa Do Rego Monteiro, Chase Williams, Joseph Moyalan, YangQuan Chen, Ricardo de Castro

    This paper presents an optimization framework for scheduling electric vehicle (EV) charging at public stations, with the aim of minimizing overall user dissatisfaction while taking into account arrival time, charging duration, and power demand. To promote fairness, the framework differentiates between high-priority users (those without access to home or workplace charging) and low-priority users (those with such access). In addition, it ensures contiguous charging time slots by incorporating trigger functions into the optimization model. The problem is formulated as a Mixed Integer Linear Program (MILP). The effectiveness of the proposed approach is demonstrated through simulations using EV charger data from the UC Merced campus parking lot.


  • Open Access

    Off-Road Navigation of Legged Robots Using Linear Transfer Operators

    by Joseph Moyalan, Andrew Zheng, Sriram S. K. S Narayanan, Umesh Vaidya

    This paper presents the implementation of off-road navigation on legged robots using convex optimization through linear transfer operators. Given a traversability measure that captures the off-road environment, we lift the navigation problem into the density space using the Perron-Frobenius (P-F) operator. This allows the problem formulation to be represented as a convex optimization. Due to the operator acting on an infinite-dimensional density space, we use data collected from the terrain to get a finite-dimension approximation of the convex optimization. Results of the optimal trajectory for off-road navigation are compared with a standard iterative planner, where we show how our convex optimization generates a more traversable path for the legged robot compared to the suboptimal iterative planner.

  • Convex Approach to Data-Driven Off-Road Navigation via Linear Transfer Operators

    by Joseph Moyalan, Yongxin Chen, Umesh Vaidya

    We consider the problem of optimal control design for navigation on off-road terrain. We use a traversability measure to characterize the difficulty of navigation on off-road terrain. The traversability measure captures terrain properties essential for navigation, such as elevation maps, roughness, slope, and texture. The terrain with the presence or absence of obstacles becomes a particular case of the proposed traversability measure. We provide a convex formulation to the off-road navigation problem by lifting the problem to the density space using the linear Perron-Frobenius (P-F) operator. The convex formulation leads to an infinite-dimensional optimal navigation problem for control synthesis. We construct the finite-dimensional approximation of the optimization problem using data. We use a computational framework based on the data-driven approximation of the Koopman operator. This makes the proposed approach data-driven and applicable to cases where an explicit system model is unavailable. Finally, we apply the proposed navigation framework with single integrator dynamics and Dubin's car model.


  • Open Access

    Navigation with Probabilistic Safety Constraints: Convex Formulation

    by Joseph Moyalan, Yongxin Chen, Umesh Vaidya

    We consider the problem of navigation with safety constraints. The safety constraints are probabilistic, where a given set is assigned a degree of safety, a number between zero and one, with zero being safe and one being unsafe. The deterministic unsafe set will arise as a particular case of the proposed probabilistic description of safety. We provide a convex formulation to the navigation problem with probabilistic safety constraints. The convex formulation is made possible by lifting the navigation problem in the dual space of density using linear transfer operator theory methods involving Perron-Frobenius and Koopman operators. The convex formulation leads to an infinite-dimensional feasibility problem for probabilistic safety verification and control design. The finite-dimensional approximation of the optimization problem relies on the data-driven approximation of the linear transfer operator.

  • Data-Driven Optimal Control of Nonlinear Dynamics Under Safety Constraints

    by Hongzhe Yu, Joseph Moyalan, Umesh Vaidya, Yongxin Chen

    This letter considers the optimal control problem of nonlinear systems under safety constraints with unknown dynamics. Departing from the standard optimal control framework based on dynamic programming, we study its dual formulation over the space of occupancy measures. For control-affine dynamics, with proper reparametrization, the problem can be formulated as an infinite-dimensional convex optimization over occupancy measures. Moreover, the safety constraints can be naturally captured by linear constraints in this formulation. Furthermore, this dual formulation can still be approximately obtained by utilizing the Koopman theory when the underlying dynamics are unknown. Finally, to develop a practical method to solve the resulting convex optimization, we choose a polynomial basis and then relax the problem into a semi-definite program (SDP) using sum-of-square (SOS) techniques. Simulation results are presented to demonstrate the efficacy of the developed framework.


  • Open Access

    Project 1.A75 Agile Modular Cyber-Physical Vehicle Platforms

    by Venkat Krovi, Jake Buzhardt, Umesh Umesh, Melissa Smith, Feng Luo, Ajinkya Joglekar, Ameya Salvi, Max Faykus, Mikaila Gossman, Fei Ding, et al.

    Project 1.A75 Agile Modular Cyber-Physical Vehicle Platforms

  • Open Access

    Vehicle-to-Grid Integration for Enhancement of Grid: A Distributed Resource Allocation Approach

    by Deepak Tiwari, Mohd Adil Anwar Sheikh, Joseph Moyalan, Mayur Sawant, Sarika Khushalani Solanki, Jignesh Solanki

    In the future grids, to reduce greenhouse gas emissions Electric Vehicles (EVs) seems to be an important means of transportation. One of the major disadvantages of the future grid is the demand-supply mismatch which can be mitigated by incorporating the EVs into the grid. The paper introduces the concept of the Distributed Resource Allocation (DRA) approach for incorporating a large number of Plug-in EV (PEVs) with the power grid utilizing the concept of achieving output consensus. The charging/discharging time of all the participating PEVs are separated with respect to time slots and are considered as strategies. The major aim of the paper is to obtain a favorable charging strategy for each grid-connected PEVs in such a way that it satisfies both grid objectives in terms of load profile smoothening and minimizing of load shifting as well as economic and social interests of vehicle owners i.e. a fair share of the rate of charging for all connected PEVs. The three-fold contribution of the paper in smoothening of load profile, load shifting minimization, and fair charging rate is validated using a representative case study. The results confirm improvement in load profile and also highlight a fair deal in the charging rate for each PEV.


  • Optimal Scheduling of TCL and Storage Devices for Demand Side Management: A Game Theoretic Approach

    by U. Bhagyashree, M. Sawant, J. Moyalan, K. Alok, A. Sheikh, S. Wagh

    The future grid encourages the integration of renewable energy sources (RES) with the power grid to mitigate the problem of demand-supply mismatch. However, the stochastic nature of RES along with randomness in load demand gives rise to uncertainties in the grid, in turn, the mismatch in demand-supply, which can deteriorate the voltage profiles and system performance. Flattening of load curve at demand side overcomes this demand-supply mismatch problem. In this paper, the decentralized load control problem is solved by a game theoretic approach where every customer is driven to optimize the use of RES, a battery storage system (BSS), electrical vehicle (EV), and thermostatically controlled loads (TCL), to map the demand-supply requirement. The proposed scheme smoothens the consumers’ load profile, which ensures an optimal solution in real-time.


  • Unit Commitment: An Escort Dynamics Approach

    by U. Suryawanshi, M. Sawant, J. Moyalan, A. Sheikh, S. Bhil

    With stringent restructured power markets, generation units must have the ability to operate under flexible conditions to respond to various market driving forces to be able to earn revenue profitably. The significance of Unit commitment (UC) is enlarged with the ever increasing and varying load demands. Considering this and various other constraints such as power transfer limits, voltage regulation, etc. UC is an optimization problem used to deduce the operation schedule of the generating units at every hour. In order to address this problem, the paper proposes an evolutionary game theoretical approach of Escort Dynamics (ED) which ensures convergence to a stable strategy also referred to as Evolutionary Stable Strategy (ESS). A novel ED implementation approach, Intertwined Escort Dynamics (IED), provide an operational protocol which detects unstable but optimal strategy. In order to validate the proposed method, the same problem has been addressed using Karush-Kuhn-Tucker (KKT) analysis.