arXiv subjects

Ilya Kolmanovsky

Publications and source records attributed to Ilya Kolmanovsky.

At least 55 records · Page 3Linked to original sources

arXiv2023

Interaction-Aware Decision-Making for Autonomous Vehicles in Forced Merging Scenario Leveraging Social Psychology Factors

Understanding the intention of vehicles in the surrounding traffic is crucial for an autonomous vehicle to successfully accomplish its driving tasks in complex traffic scenarios such as highway forced merging. In this paper, we consider a behavioral model that incorporates both social behaviors and personal objectives of the interacting drivers. Leveraging this model, we develop a receding-horizon control-based decision-making strategy, that estimates online the other drivers' intentions using Bayesian filtering and incorporates predictions of nearby vehicles' behaviors under uncertain intentions. The effectiveness of the proposed decision-making strategy is demonstrated and evaluated based on simulation studies in comparison with a game theoretic controller and a real-world traffic dataset.

cs.AI↗

arXiv2023

Constrained reaction wheel desaturation and attitude control of spacecraft with four reaction wheels

The paper addresses a problem of constrained spacecraft attitude stabilization with simultaneous reaction wheel (RW) desaturation. The spacecraft has a reaction wheel array (RWA) consisting of four RWs in a pyramidal configuration. The developments exploit a spacecraft dynamics model with gravity gradient torques. The linearized dynamics are shown to be controllable at almost all RWA configurations. Configurations that result in the highest Degree of Controllability are elucidated. A strategy that combines an incremental reference governor and time-distributed model predictive control is proposed to perform constrained RW desaturation at low computational cost. Simulation results of successful RW desaturation maneuvers subject to spacecraft pointing constraints, RW zero-speed crossing avoidance and limits on control moments are reported.

eess.SY↗

arXiv2023

A Unified Safety Protection and Extension Governor

In this paper, we propose a supervisory control scheme that unifies the abilities of safety protection and safety extension. It produces a control that is able to keep the system safe indefinitely when such a control exists. When such a control does not exist due to abnormal system states, it optimizes the control to maximize the time before any safety violation, which translates into more time to seek recovery and/or mitigate any harm. We describe the scheme and develop an approach that integrates the two capabilities into a single constrained optimization problem with only continuous variables. For linear systems with convex constraints, the problem reduces to a convex quadratic program and is easy to solve. We illustrate the proposed safety supervisor with an automotive example.

eess.SY↗

arXiv2023

Scheduling Dosage of Proton Pump Inhibitors Using Constrained Optimization With Gastric Acid Secretion Model

Dosage schedule of the Proton Pump Inhibitors (PPIs) is critical for gastric acid disorder treatment. In this paper, we develop a constrained optimization based approach for scheduling the PPIs dosage. In particular, we exploit a mathematical prediction model describing the gastric acid secretion, and use it within the optimization algorithm to predict the acid level. The dosage of the PPIs which is used to enforce acid level constraints is computed by solving a constrained optimization problem. Simulation results show that the proposed approach can successfully suppress the gastric acid level with less PPIs intake compared with the conventional fixed PPIs dosage regimen, which may reduce the long-term side effects of the PPIs.

eess.SY↗

arXiv2023

On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems

Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for discrete-time, linear, time-invariant, stable, observable systems with polytopic constraints, this set is a polytope described by a finite number of inequalities (i.e., has finite complexity). However, it is not possible to know the number of inequalities apriori from problem data. To address this gap, this contribution presents two computationally efficient methods to obtain upper bounds on the complexity of the MAS. The first method is algebraic and is based on matrix power series, while the second is geometric and is based on Lyapunov analysis. The two methods are rigorously introduced, a detailed numerical comparison between the two is provided, and an extension to systems with constant inputs is presented. Knowledge of such upper bounds can speed up the computation of MAS, and can be beneficial for defining the memory and computational requirements for storing and processing the MAS, as well as the control algorithms that leverage the MAS.

eess.SY↗

arXiv2022

Reference Governor for Constrained Spacecraft Orbital Transfers

The paper considers the application of feedback control to orbital transfer maneuvers subject to constraints on the spacecraft thrust and on avoiding the collision with the primary body. Incremental reference governor (IRG) strategies are developed to complement the nominal Lyapunov controller, derived based on Gauss Variational Equations, and enforce the constraints. Simulation results are reported that demonstrate the successful constrained orbital transfer maneuvers with the proposed approach. A Lyapunov function based IRG and a prediction-based IRG are compared. While both implementations successfully enforce the constraints, a prediction-based IRG is shown to result in faster maneuvers.

math.OC↗

arXiv2022

Reference Governor for Input-Constrained MPC to Enforce State Constraints at Lower Computational Cost

In this paper, a control scheme is developed based on an input constrained Model Predictive Controller (MPC) and the idea of modifying the reference command to enforce constraints, usual of Reference Governors (RG). The proposed scheme, referred to as the RGMPC, requires optimization for MPC with input constraints for which fast algorithms exist, and can handle (possibly nonlinear) state and input constraints. Conditions are given that ensure recursive feasibility of the RGMPC scheme and finite-time convergence of the modified command to the the desired reference command. Simulation results for a spacecraft rendezvous maneuver with linear and nonlinear constraints demonstrate that the RGMPC scheme has lower average computational time as compared to state and input constrained MPC with similar performance.

eess.SY↗

arXiv2022

Set-theoretic Localization for Mobile Robots with Infrastructure-based Sensing

In this paper, we introduce a set-theoretic approach for mobile robot localization with infrastructure-based sensing. The proposed method computes sets that over-bound the robot body and orientation under an assumption of known noise bounds on the sensor and robot motion model. We establish theoretical properties and computational approaches for this set-theoretic localization approach and illustrate its application to an automated valet parking example in simulations and to omnidirectional robot localization problems in real-world experiments. We demonstrate that the set-theoretic localization method can perform robustly against uncertainty set initialization and sensor noises compared to the FastSLAM.

cs.RO↗

arXiv2022

Integrated Adaptive Control and Reference Governors for Constrained Systems with State-Dependent Uncertainties

This paper presents an adaptive reference governor (RG) framework for a linear system with matched nonlinear uncertainties that can depend on both time and states, subject to both state and input constraints. The proposed framework leverages an L1 adaptive controller (L1AC) that estimates and compensates for the uncertainties, and provides guaranteed transient performance, in terms of uniform bounds on the error between actual states and inputs and those of a nominal (i.e., uncertainty-free) system. The uniform performance bounds provided by the L1AC are used to tighten the pre-specified state and control constraints. A reference governor is then designed for the nominal system using the tightened constraints, and guarantees robust constraint satisfaction. Moreover, the conservatism introduced by the constraint tightening can be systematically reduced by tuning some parameters within the L1AC. Compared with existing solutions, the proposed adaptive RG framework can potentially yield less conservative results for constraint enforcement due to the removal of uncertainty propagation along a prediction horizon, and improved tracking performance due to the inherent uncertainty compensation mechanism. Simulation results for a flight control example illustrate the efficacy of the proposed framework.

eess.SY↗

arXiv2022

Robust Action Governor for Uncertain Piecewise Affine Systems with Non-convex Constraints and Safe Reinforcement Learning

The action governor is an add-on scheme to a nominal control loop that monitors and adjusts the control actions to enforce safety specifications expressed as pointwise-in-time state and control constraints. In this paper, we introduce the Robust Action Governor (RAG) for systems the dynamics of which can be represented using discrete-time Piecewise Affine (PWA) models with both parametric and additive uncertainties and subject to non-convex constraints. We develop the theoretical properties and computational approaches for the RAG. After that, we introduce the use of the RAG for realizing safe Reinforcement Learning (RL), i.e., ensuring all-time constraint satisfaction during online RL exploration-and-exploitation process. This development enables safe real-time evolution of the control policy and adaptation to changes in the operating environment and system parameters (due to aging, damage, etc.). We illustrate the effectiveness of the RAG in constraint enforcement and safe RL using the RAG by considering their applications to a soft-landing problem of a mass-spring-damper system.

eess.SY↗

arXiv2022

Benefits of Feedforward for Model Predictive Airpath Control of Diesel Engines

This paper investigates options to complement a diesel engine airpath feedback controller with a feedforward. The control objective is to track the intake manifold pressure and exhaust gas recirculation (EGR) rate targets by manipulating the EGR valve and variable geometry turbine (VGT) while satisfying state and input constraints. The feedback controller is based on rate-based Model Predictive Control (MPC) that provides integral action for tracking. Two options for the feedforward are considered one based on a look-up table that specifies the feedforward as a function of engine speed and fuel injection rate, and another one based on a (non-rate-based) MPC that generates dynamic feedforward trajectories. The controllers are designed and verified using a high-fidelity engine model in GT-Power and exploit a low-order rate-based linear parameter-varying (LPV) model for prediction which is identified from transient response data generated by the GT-Power model. It is shown that the combination of feedforward and feedback MPC has the potential to improve the performance and robustness of the control design. In particular, the feedback MPC without feedforward can lose stability at low engine speeds, while MPC-based feedforward results in the best transient response. Mechanisms by which feedforward is able to assist in stabilization and improve performance are discussed.

eess.SY↗

arXiv2022

A Computationally Governed Log-domain Interior-point Method for Model Predictive Control

This paper introduces a computationally efficient approach for solving Model Predictive Control (MPC) reference tracking problems with state and control constraints. The approach consists of three key components: First, a log-domain interior-point quadratic programming method that forms the basis of the overall approach; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a computational governor that bounds the suboptimality of the warm-start by altering the reference command provided to the MPC problem. As a result, the closed-loop system is altered in a manner so that MPC solutions can be computed using fewer optimizer iterations per timestep. In a numerical experiment, the computational governor reduces the worst-case computation time of a standard MPC implementation by 90, while maintaining good closed-loop performance.

math.OC↗

arXiv2022

MPC-Based Emergency Vehicle-Centered Multi-Intersection Traffic Control

This paper proposes a traffic control scheme to alleviate traffic congestion in a network of interconnected signaled lanes/roads. The proposed scheme is emergency vehicle-centered, meaning that it provides an efficient and timely routing for emergency vehicles. In the proposed scheme, model predictive control is utilized to control inlet traffic flows by means of network gates, as well as configuration of traffic lights across the network. Two schemes are considered in this paper: i) centralized; and ii) decentralized. In the centralized scheme, a central unit controls the entire network. This scheme provides the optimal solution, even though it might not fulfil real-time computation requirements for large networks. In the decentralized scheme, each intersection has its own control unit, which sends local information to an aggregator. The main responsibility of this aggregator is to receive local information from all control units across the network as well as the emergency vehicle, to augment the received information, and to share it with the control units. Since the decision-making in decentralized scheme is local and the aggregator should fulfil the above-mentioned tasks during a traffic cycle which takes a long period of time, the decentralized scheme is suitable for large networks, even though it may provide a sub-optimal solution. Extensive simulation studies are carried out to validate the proposed schemes, and assess their performance. Notably, the obtained results reveal that traveling times of emergency vehicles can be reduced up to ~50% by using the centralized scheme and up to ~30% by using the decentralized scheme, without causing congestion in other lanes.

math.OC↗

arXiv2022

Implementing Optimization-Based Control Tasks in Cyber-Physical Systems With Limited Computing Capacity

A common aspect of today's cyber-physical systems is that multiple optimization-based control tasks may execute in a shared processor. Such control tasks make use of online optimization and thus have large execution times; hence, their sampling periods must be large as well to satisfy real-time schedulability condition. However, larger sampling periods may cause worse control performance. The goal of our work is to develop a robust to early termination optimization approach that can be used to effectively solve onboard optimization problems involved in controlling the system despite the presence of unpredictable, variable, and limited computing capacity. The significance of the developed approach is that the optimization iterations can be stopped at any time instant with a guaranteed feasible solution; as a result, optimization-based control tasks can be implemented with a small sampling period (and consequently with a minimum degradation in the control performance).

math.OC↗

arXiv2022

Development of a Model Predictive Airpath Controller for a Diesel Engine on a High-Fidelity Engine Model with Transient Thermal Dynamics

This paper presents the results of a model predictive controller (MPC) development for diesel engine air-path regulation. The control objective is to track the intake manifold pressure and exhaust gas recirculation (EGR) rate targets by manipulating the EGR valve and variable geometry turbine (VGT) while satisfying state and control constraints. The MPC controller is designed and verified using a high-fidelity engine model in GT-Power. The controller exploits a low-order rate-based linear parameter-varying (LPV) model for prediction which is identified from transient response data generated by the GT-Power model. It is shown that transient engine thermal dynamics influence the airpath dynamics, specifically the intake manifold pressure response, however, MPC demonstrates robustness against inaccuracies in modeling these thermal dynamics. In particular, we show that MPC can be successfully implemented using a rate-based prediction model with two inputs (EGR and VGT positions) identified from data with steady-state wall temperature dynamics, however, closed-loop performance can be improved if a prediction model (i) is identified from data with transient thermal dynamics, and (ii) has the fuel injection rate as extra model input. Further, the MPC calibration process across the engine operating range to achieve improved performance is addressed. As the MPC calibration is shown to be sensitive to the operating conditions, a fast calibration process is proposed.

eess.SY↗

arXiv2022

ROTEC: Robust to Early Termination Command Governor for Systems with Limited Computing Capacity

A Command Governor (CG) is an optimization-based add-on scheme to a nominal closed-loop system. It is used to enforce state and control constraints by modifying reference commands. This paper considers the implementation of a CG on embedded processors that have limited computing resources and must execute multiple control and diagnostics functions; consequently, the time available for CG computations is limited and may vary over time. To address this issue, a robust to early termination command governor is developed which embeds the solution of a CG problem into the internal states of a virtual continuous-time dynamical system which runs in parallel to the process. This virtual system is built so that its trajectory converges to the optimal solution (with a tunable convergence rate), and provides a sub-optimal but feasible solution whenever its evolution is terminated. This allows the designer to implement a CG strategy with a small sampling period (and consequently with a minimum degradation in its performance), while maintaining its constraint-handling capabilities. Simulations are carried out to assess the effectiveness of the developed scheme in satisfying performance requirements and real-time schedulability conditions for a practical vehicle rollover example.

math.OC↗

arXiv2021

Continuous Optimization-Based Drift Counteraction Optimal Control: A Spacecraft Attitude Control Case Study

This paper presents a continuous optimization approach to DCOC and its application to spacecraft high-precision attitude control. The approach computes a control input sequence that maximizes the time-before-exit by solving a nonlinear programming problem with an exponentially weighted cost function and purely continuous variables. Based on results from sensitivity analysis and exact penalty method, we prove the optimality guarantee of our approach. The practical application of our approach is demonstrated through a spacecraft high-precision attitude control example. A nominal case with three functional reaction wheels (RWs) and an underactuated case with only two functional RWs were considered. Simulation results illustrate the effectiveness of our approach as a contingency method for extending spacecraft's effective mission time in the case of RW failures.

math.OC↗

arXiv2021

Interaction-Aware Trajectory Prediction and Planning for Autonomous Vehicles in Forced Merge Scenarios

Merging is, in general, a challenging task for both human drivers and autonomous vehicles, especially in dense traffic, because the merging vehicle typically needs to interact with other vehicles to identify or create a gap and safely merge into. In this paper, we consider the problem of autonomous vehicle control for forced merge scenarios. We propose a novel game-theoretic controller, called the Leader-Follower Game Controller (LFGC), in which the interactions between the autonomous ego vehicle and other vehicles with a priori uncertain driving intentions is modeled as a partially observable leader-follower game. The LFGC estimates the other vehicles' intentions online based on observed trajectories, and then predicts their future trajectories and plans the ego vehicle's own trajectory using Model Predictive Control (MPC) to simultaneously achieve probabilistically guaranteed safety and merging objectives. To verify the performance of LFGC, we test it in simulations and with the NGSIM data, where the LFGC demonstrates a high success rate of 97.5% in merging.

eess.SY↗