Searcharxiv⌕ Search

arXiv subjects

Naira Hovakimyan

Publications and source records attributed to Naira Hovakimyan.

142 records · Page 8Linked to original sources
arXiv2019

Proximity Queries for Absolutely Continuous Parametric Curves

In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is generally non-convex and serves as a significant computational bottleneck for motion planning algorithms. In this paper, we present methods for a general class of absolutely continuous parametric curves to compute: (i) the minimum separating distance, (ii) tolerance verification, and (iii) collision detection. Our methods efficiently compute bounds on obstacle proximity by bounding the curve in a convex region. This bound is based on an upper bound on the curve arc length that can be expressed in closed form for a useful class of parametric curves including curves with trigonometric or polynomial bases. We demonstrate the computational efficiency and accuracy of our approach through numerical simulations of several proximity problems.

cs.RO↗
arXiv2019

Towards Resilient UAV: Escape Time in GPS Denied Environment with Sensor Drift

This paper considers a resilient state estimation framework for unmanned aerial vehicles (UAVs) that integrates a Kalman filter-like state estimator and an attack detector. When an attack is detected, the state estimator uses only IMU signals as the GPS signals do not contain legitimate information. This limited sensor availability induces a sensor drift problem questioning the reliability of the sensor estimates. We propose a new resilience measure, escape time, as the safe time within which the estimation errors remain in a tolerable region with high probability. This paper analyzes the stability of the proposed resilient estimation framework and quantifies a lower bound for the escape time. Moreover, simulations of the UAV model demonstrate the performance of the proposed framework and provide analytical results.

eess.SY↗
arXiv2019

Intent-Aware Probabilistic Trajectory Estimation for Collision Prediction with Uncertainty Quantification

Collision prediction in a dynamic and unknown environment relies on knowledge of how the environment is changing. Many collision prediction methods rely on deterministic knowledge of how obstacles are moving in the environment. However, complete deterministic knowledge of the obstacles' motion is often unavailable. This work proposes a Gaussian process based prediction method that replaces the assumption of deterministic knowledge of each obstacle's future behavior with probabilistic knowledge, to allow a larger class of obstacles to be considered. The method solely relies on position and velocity measurements to predict collisions with dynamic obstacles. We show that the uncertainty region for obstacle positions can be expressed in terms of a combination of polynomials generated with Gaussian process regression. To control the growth of uncertainty over arbitrary time horizons, a probabilistic obstacle intention is assumed as a distribution over obstacle positions and velocities, which can be naturally included in the Gaussian process framework. Our approach is demonstrated in two case studies in which (i), an obstacle overtakes the agent and (ii), an obstacle crosses the agent's path perpendicularly. In these simulations we show that the collision can be predicted despite having limited knowledge of the obstacle's behavior.

cs.RO↗
arXiv2019

A Path Planning Framework for a Flying Robot in Close Proximity of Humans

We present a path planning framework that takes into account the human's safety perception in the presence of a flying robot. The framework addresses two objectives: (i) estimation of the uncertain parameters of the proposed safety perception model based on test data collected using Virtual Reality (VR) testbed, and (ii) offline optimal control computation using the estimated safety perception model. Due to the unknown factors in the human tests data, it is not suitable to use standard regression techniques that minimize the mean squared error (MSE). We propose to use a Hidden Markov model (HMM) approach where human's attention is considered as a hidden state to infer whether the data samples are relevant to learn the safety perception model. The HMM approach improved log-likelihood over the standard least squares solution. For path planning, we use Bernstein polynomials for discretization, as the resulting path remains within the convex hull of the control points, providing guarantees for deconfliction with obstacles at low computational cost. An example of optimal trajectory generation using the learned human model is presented. The optimal trajectory generated using the proposed model results in reasonable safety distance from the human. In contrast, the paths generated using the standard regression model have undesirable shapes due to overfitting. The example demonstrates that the HMM approach has robustness to the unknown factors compared to the standard MSE model.

cs.RO↗
arXiv2019

L1 Adaptive Output Feedback for Non-square Systems with Arbitrary Relative Degree

This paper considers the problem of output feedback control for non-square multi-input multi-output systems with arbitrary relative degree. The proposed controller, based on the L1 adaptive control architecture, is designed using the right interactor matrix and a suitably defined projection matrix. A state-output predictor, a low-pass filter, and adaptive laws are introduced that achieve output tracking of a desired reference signal. It is shown that the proposed control strategy guarantees closed-loop stability with arbitrarily small steady-state errors. The transient performance in the presence of non-zero initialization errors is quantified in terms of decreasing functions. Rigorous mathematical analysis and illustrative examples are provided to validate the theoretical claims.

math.OC↗
arXiv2018

Bernstein approximation of optimal control problems

Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been made. Perhaps they will find application when the properties of the approximant in the large are of more importance than the closeness of the approximation." -- has remarked P.J. Davis in his 1963 book Interpolation and Approximation. This paper presents a direct approximation method for nonlinear optimal control problems with mixed input and state constraints based on Bernstein polynomial approximation. We provide a rigorous analysis showing that the proposed method yields consistent approximations of time continuous optimal control problems. Furthermore, we demonstrate that the proposed method can also be used for costate estimation of the optimal control problems. This latter result leads to the formulation of the Covector Mapping Theorem for Bernstein polynomial approximation. Finally, we explore the numerical and geometric properties of Bernstein polynomials, and illustrate the advantages of the proposed approximation method through several numerical examples.

math.OC↗
arXiv2018

Learning to Communicate: A Machine Learning Framework for Heterogeneous Multi-Agent Robotic Systems

We present a machine learning framework for multi-agent systems to learn both the optimal policy for maximizing the rewards and the encoding of the high dimensional visual observation. The encoding is useful for sharing local visual observations with other agents under communication resource constraints. The actor-encoder encodes the raw images and chooses an action based on local observations and messages sent by the other agents. The machine learning agent generates not only an actuator command to the physical device, but also a communication message to the other agents. We formulate a reinforcement learning problem, which extends the action space to consider the communication action as well. The feasibility of the reinforcement learning framework is demonstrated using a 3D simulation environment with two collaborating agents. The environment provides realistic visual observations to be used and shared between the two agents.

cs.RO↗
arXiv2018

Sensitivity Analysis of Continuous-Time Linear Control Systems subject to Control and Measurement Noise: An Information-Theoretic Approach

Sensitivity of linear continuous-time control systems, subject to control and measurement noise, is analyzed by deriving the lower bounds of Bode-like integrals via an information-theoretic approach. Bode integrals of four different sensitivity-like functions are employed to gauge the control trade-offs. When the signals of the control system are stationary Gaussian, these four different Bode-like integrals can be represented as differences between mutual information rates. These mutual information rates and hence the corresponding Bode-like integrals are proven to be bounded below by the unstable poles and zeros of the plant model, if the signals of the control system are wide-sense stationary.

eess.SY↗
arXiv2018

A Simplified Approach to Analyze Complementary Sensitivity Trade-offs in Continuous-Time and Discrete-Time Systems

A simplified approach is proposed to investigate the continuous-time and discrete-time complementary sensitivity Bode integrals (CSBIs) in this note. For continuous-time feedback systems with unbounded frequency domain, the CSBI weighted by $1/ω^2$ is considered, where this simplified method reveals a more explicit relationship between the value of CSBI and the structure of the open-loop transfer function. With a minor modification of this method, the CSBI of discrete-time system is derived, and illustrative examples are provided. Compared with the existing results on CSBI, neither Cauchy integral theorem nor Poisson integral formula are used throughout the analysis, and the analytic constraint on the integrand is removed.

eess.SY↗
arXiv2018

Hidden Markov Model Estimation-Based Q-learning for Partially Observable Markov Decision Process

The objective is to study an on-line Hidden Markov model (HMM) estimation-based Q-learning algorithm for partially observable Markov decision process (POMDP) on finite state and action sets. When the full state observation is available, Q-learning finds the optimal action-value function given the current action (Q function). However, Q-learning can perform poorly when the full state observation is not available. In this paper, we formulate the POMDP estimation into a HMM estimation problem and propose a recursive algorithm to estimate both the POMDP parameter and Q function concurrently. Also, we show that the POMDP estimation converges to a set of stationary points for the maximum likelihood estimate, and the Q function estimation converges to a fixed point that satisfies the Bellman optimality equation weighted on the invariant distribution of the state belief determined by the HMM estimation process.

cs.LG↗
arXiv2018

Sensitivity Analysis of Continuous-Time Systems based on Power Spectral Density

Bode integrals of sensitivity and sensitivity-like functions along with complementary sensitivity and complementary sensitivity-like functions are conventionally used for describing performance limitations of a feedback control system. In this paper, we show that in the case when the disturbance is a wide sense stationary process the (complementary) sensitivity Bode integral and the (complementary) sensitivity-like Bode integral are identical. A lower bound of the continuous-time complementary sensitivity-like Bode integral is also derived and examined with the linearized flight-path angle tracking control problem of an F-16 aircraft.

eess.SY↗
arXiv2018

Primal-Dual Algorithm for Distributed Reinforcement Learning: Distributed GTD

The goal of this paper is to study a distributed version of the gradient temporal-difference (GTD) learning algorithm for multi-agent Markov decision processes (MDPs). The temporal difference (TD) learning is a reinforcement learning (RL) algorithm which learns an infinite horizon discounted cost function (or value function) for a given fixed policy without the model knowledge. In the distributed RL case each agent receives local reward through a local processing. Information exchange over sparse communication network allows the agents to learn the global value function corresponding to a global reward, which is a sum of local rewards. In this paper, the problem is converted into a constrained convex optimization problem with a consensus constraint. Then, we propose a primal-dual distributed GTD algorithm and prove that it almost surely converges to a set of stationary points of the optimization problem.

math.OC↗
arXiv2006

Guaranteed Transient Performance with $\mathcal{L}_1$ Adaptive Controller for Systems with Unknown Time-varying Parameters: Part I

This paper presents a novel adaptive control methodology for uncertain systems with time-varying unknown parameters and time-varying bounded disturbance. The adaptive controller ensures uniformly bounded transient and asymptotic tracking for system's both signals, input and output, simultaneously. The performance bounds can be systematically improved by increasing the adaptation gain. Simulations of a robotic arm with time-varying friction verify the theoretical findings.

math.OC↗
arXiv2006

Stability Margins of $\mathcal{L}_1$ Adaptive Controller: Part II

In Part I of this paper, we have developed a novel $\mathcal{L}_1$ adaptive control architecture that enables fast adaptation and leads to uniformly bounded transient and asymptotic tracking for system's both signals, input and output, simultaneously. In this paper, we derive the stability margins of $\mathcal{L}_1$ adaptive control architecture, including time-delay and gain margins in the presence of time-varying bounded disturbance. Simulations verify the theoretical findings.

math.OC↗