arXiv subjects

Pantelis Sopasakis

Publications and source records attributed to Pantelis Sopasakis.

34 records · Page 2Linked to original sources

arXiv2019

Visual Area Coverage with Attitude-Dependent Camera Footprints by Particle Harvesting

In aerial visual area coverage missions, the camera footprint changes over time based on the camera position and orientation -- a fact that complicates the whole process of coverage and path planning. This article proposes a solution to the problem of visual coverage by filling the target area with a set of randomly distributed particles and harvesting them by camera footprints. This way, high coverage is obtained at a low computational cost. In this approach, the path planner considers six degrees of freedom (DoF) for the camera movement and commands thrust and attitude references to a lower layer controller, while maximizing the covered area and coverage quality. The proposed method requires a priori information of the boundaries of the target area and can handle areas of very complex and highly non-convex geometry. The effectiveness of the approach is demonstrated in multiple simulations in terms of computational efficiency and coverage.

cs.RO↗

arXiv2019

Risk-Averse Model Predictive Operation Control of Islanded Microgrids

In this paper we present a risk-averse model predictive control (MPC) scheme for the operation of islanded microgrids with very high share of renewable energy sources. The proposed scheme mitigates the effect of errors in the determination of the probability distribution of renewable infeed and load. This allows to use less complex and less accurate forecasting methods and to formulate low-dimensional scenario-based optimisation problems which are suitable for control applications. Additionally, the designer may trade performance for safety by interpolating between the conventional stochastic and worst-case MPC formulations. The presented risk-averse MPC problem is formulated as a mixed-integer quadratically-constrained quadratic problem and its favourable characteristics are demonstrated in a case study. This includes a sensitivity analysis that illustrates the robustness to load and renewable power prediction errors.

math.OC↗

arXiv2019

Model predictive control for offset-free reference tracking of fractional order systems

In this paper an offset-free model predictive control scheme is presented for fractional-order systems using the Grünwald-Letnikov derivative. The infinite-history fractional-order system is approximated by a finite-dimensional state-space system and the modeling error is cast as a bounded disturbance term. Using a state observer, it is shown that the unknown disturbance at steady state can be reconstructed and modeling errors and other persistent disturbances can be attenuated. The effectiveness of the proposed controller-observer ensemble is demonstrated in the optimal administration of an anti-arrhythmic medicine with fractional-order pharmacokinetics.

math.DS↗

arXiv2019

Fractional Calculus in Pharmacokinetics

We are witnessing the birth of a new variety of pharmacokinetics where non-integer-order differential equations are employed to study the time course of drugs in the body: this is dubbed "fractional pharmacokinetics." The presence of fractional kinetics has important clinical implications such as the lack of a half-life, observed, for example with the drug amiodarone and the associated irregular accumulation patterns following constant and multiple-dose administration. Building models that accurately reflect this behaviour is essential for the design of less toxic and more effective drug administration protocols and devices. This article introduces the readers to the theory of fractional pharmacokinetics and the research challenges that arise. After a short introduction to the concepts of fractional calculus, and the main applications that have appeared in literature up to date, we address two important aspects. First, numerical methods that allow us to simulate fractional order systems accurately and second, optimal control methodologies that can be used to design dosing regimens to individuals and populations.

math.DS↗

arXiv2019

Uncertainty-aware demand management of water distribution networks in deregulated energy markets

We present an open-source solution for the operational control of drinking water distribution networks which accounts for the inherent uncertainty in water demand and electricity prices in the day-ahead market of a volatile deregulated economy. As increasingly more energy markets adopt this trading scheme, the operation of drinking water networks requires uncertainty-aware control approaches that mitigate the effect of volatility and result in an economic and safe operation of the network that meets the consumers' need for uninterrupted water supply. We propose the use of scenario-based stochastic model predictive control: an advanced control methodology which comes at a considerable computation cost which is overcome by harnessing the parallelization capabilities of graphics processing units (GPUs) and using a massively parallelizable algorithm based on the accelerated proximal gradient method.

math.OC↗

arXiv2019

Embedded nonlinear model predictive control for obstacle avoidance using PANOC

We employ the proximal averaged Newton-type method for optimal control (PANOC) to solve obstacle avoidance problems in real time. We introduce a novel modeling framework for obstacle avoidance which allows us to easily account for generic, possibly nonconvex, obstacles involving polytopes, ellipsoids, semialgebraic sets and generic sets described by a set of nonlinear inequalities. PANOC is particularly well-suited for embedded applications as it involves simple steps, its implementation comes with a low memory footprint and its fast convergence meets the tight runtime requirements of fast dynamical systems one encounters in modern mechatronics and robotics. The proposed obstacle avoidance scheme is tested on a lab-scale autonomous vehicle.

math.OC↗

arXiv2019

SuperSCS: fast and accurate large-scale conic optimization

We present SuperSCS: a fast and accurate method for solving large-scale convex conic problems. SuperSCS combines the SuperMann algorithmic framework with the Douglas-Rachford splitting which is applied on the homogeneous self-dual embedding of conic optimization problems: a model for conic optimization problems which simultaneously encodes the optimality conditions and infeasibility/unboundedness certificates for the original problem. SuperMann allows the use of fast quasi-Newtonian directions such as a modified restarted Broyden-type direction and Anderson's acceleration.

math.OC↗

arXiv2019

Risk-averse risk-constrained optimal control

Multistage risk-averse optimal control problems with nested conditional risk mappings are gaining popularity in various application domains. Risk-averse formulations interpolate between the classical expectation-based stochastic and minimax optimal control. This way, risk-averse problems aim at hedging against extreme low-probability events without being overly conservative. At the same time, risk-based constraints may be employed either as surrogates for chance (probabilistic) constraints or as a robustification of expectation-based constraints. Such multistage problems, however, have been identified as particularly hard to solve. We propose a decomposition method for such nested problems that allows us to solve them via efficient numerical optimization methods. Alongside, we propose a new form of risk constraints which accounts for the propagation of uncertainty in time.

math.OC↗

arXiv2018

Aerial navigation in obstructed environments with embedded nonlinear model predictive control

We propose a methodology for autonomous aerial navigation and obstacle avoidance of micro aerial vehicles (MAV) using nonlinear model predictive control (NMPC) and we demonstrate its effectiveness with laboratory experiments. The proposed methodology can accommodate obstacles of arbitrary, potentially non-convex, geometry. The NMPC problem is solved using PANOC: a fast numerical optimization method which is completely matrix-free, is not sensitive to ill conditioning, involves only simple algebraic operations and is suitable for embedded NMPC. A C89 implementation of PANOC solves the NMPC problem at a rate of 20Hz on board a lab-scale MAV. The MAV performs smooth maneuvers moving around an obstacle. For increased autonomy, we propose a simple method to compensate for the reduction of thrust over time, which comes from the depletion of the MAV's battery, by estimating the thrust constant.

math.OC↗

arXiv2018

Risk-averse model predictive control

Risk-averse model predictive control (MPC) offers a control framework that allows one to account for ambiguity in the knowledge of the underlying probability distribution and unifies stochastic and worst-case MPC. In this paper we study risk-averse MPC problems for constrained nonlinear Markovian switching systems using generic cost functions, and derive Lyapunov-type risk-averse stability conditions by leveraging the properties of risk-averse dynamic programming operators. We propose a controller design procedure to design risk-averse stabilizing terminal conditions for constrained nonlinear Markovian switching systems. Lastly, we cast the resulting risk-averse optimal control problem in a favorable form which can be solved efficiently and thus deems risk-averse MPC suitable for applications.

math.OC↗

arXiv2017

A Simple and Efficient Algorithm for Nonlinear Model Predictive Control

We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of a quadratic program at every iteration and, consequently, inner iterative procedures. As a result, when the problem is ill-conditioned or the prediction horizon is large, each outer iteration becomes computationally very expensive. We propose a line-search algorithm that combines forward-backward iterations (FB) and Newton-type steps over the recently introduced forward-backward envelope (FBE), a continuous, real-valued, exact merit function for the original problem. The curvature information of Newton-type methods enables asymptotic superlinear rates under mild assumptions at the limit point, and the proposed algorithm is based on very simple operations: access to first-order information of the cost and dynamics and low-cost direct linear algebra. No inner iterative procedure nor Hessian evaluation is required, making our approach computationally simpler than SQP methods. The low-memory requirements and simple implementation make our method particularly suited for embedded NMPC applications.

math.OC↗

arXiv2017

Modeling and administration scheduling of fractional-order pharmacokinetic systems

Fractional-order dynamical systems were recently introduced in the field of pharmacokinetics where they proved powerful tools for modeling the absorption, disposition, distribution and excretion of drugs which are liable to anomalous diffusion, deep tissue trapping and other nonlinear phenomena. In this paper we present several ways to simulate such fractional-order pharmacokinetic models and we evaluate their accuracy and complexity on a fractional-order pharmacokinetic model of Amiodarone, an anti-arrhythmic drug. We then propose an optimal administration scheduling scheme and evaluate it on a population of patients.

math.DS↗

arXiv2016

Stochastic economic model predictive control for Markovian switching systems

The optimization of process economics within the model predictive control (MPC) formulation has given rise to a new control paradigm known as economic MPC (EMPC). Several authors have discussed the closed-loop properties of EMPC-controlled deterministic systems, however, little have uncertain systems been studied. In this paper we propose EMPC formulations for nonlinear Markovian switching systems which guarantee recursive feasibility, asymptotic performance bounds and constrained mean square (MS) stability.

math.OC↗

arXiv2016

Stabilising Model Predictive Control for Discrete-time Fractional-order Systems

In this paper we propose a model predictive control scheme for constrained fractional-order discrete-time systems. We prove that all constraints are satisfied at all time instants and we prescribe conditions for the origin to be an asymptotically stable equilibrium point of the controlled system. We employ a finite-dimensional approximation of the original infinite-dimensional dynamics for which the approximation error can become arbitrarily small. We use the approximate dynamics to design a tube-based model predictive controller which steers the system state to a neighbourhood of the origin of controlled size. We finally derive stability conditions for the MPC-controlled system which are computationally tractable and account for the infinite dimensional nature of the fractional-order system and the state and input constraints. The proposed control methodology guarantees asymptotic stability of the discrete-time fractional order system, satisfaction of the prescribed constraints and recursive feasibility.

math.OC↗

arXiv2016

Accelerated reconstruction of a compressively sampled data stream

The traditional compressed sensing approach is naturally offline, in that it amounts to sparsely sampling and reconstructing a given dataset. Recently, an online algorithm for performing compressed sensing on streaming data was proposed: the scheme uses recursive sampling of the input stream and recursive decompression to accurately estimate stream entries from the acquired noisy measurements. In this paper, we develop a novel Newton-type forward-backward proximal method to recursively solve the regularized Least-Squares problem (LASSO) online. We establish global convergence of our method as well as a local quadratic convergence rate. Our simulations show a substantial speed-up over the state of the art which may render the proposed method suitable for applications with stringent real-time constraints.

math.OC↗

arXiv2016

GPU-accelerated stochastic predictive control of drinking water networks

Despite the proven advantages of scenario-based stochastic model predictive control for the operational control of water networks, its applicability is limited by its considerable computational footprint. In this paper we fully exploit the structure of these problems and solve them using a proximal gradient algorithm parallelizing the involved operations. The proposed methodology is applied and validated on a case study: the water network of the city of Barcelona.

math.OC↗