Antonis Papachristodoulou

Antonis Papachristodoulou

Auto-generated profile, based on publicly available information

Antonis Papachristodoulou

Department of Engineering Science, University of Oxford, Parks Road, Oxford OX1 3PJ, United Kingdom

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
28 October 2016 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
Alejandro Fernández VillaverdeAlejandro Fernández Villaverde
Alejandro Fernández Villaverde
ABAntonio Barreiro
Antonio Barreiro
APAntonis Papachristodoulou
Antonis Papachristodoulou
A powerful way of gaining insight into biological systems is by creating a nonlinear differential equation model, which usually contains many unknown parameters. Such a model is called structurally identifiable if it is possible to determine the values of its parameters from measurements of the model outputs. Structural identifiability is a prerequisite for parameter estimation, and should be assessed before exploiting a model. However, this analysis is seldom performed due to the high computational cost involved in the necessary symbolic calculations, which quickly becomes prohibitive as the problem size increases. In this paper we show how to analyse the structural identifiability of a very general class of nonlinear models by extending methods originally developed for studying observability. We present results about models whose identifiability had not been previously determined, report unidentifiabilities that had not been found before, and show how to modify those unidentifiable models to make them identifiable. This method helps prevent problems caused by lack of identifiability analysis, which can compromise the success of tasks such as experiment design, parameter estimation, and model-based optimization. The procedure is called STRIKE-GOLDD (STRuctural Identifiability taKen as Extended-Generalized Observability with Lie Derivatives and Decomposition), and it is implemented in a MATLAB toolbox which is available as open source software. The broad applicability of this approach facilitates the analysis of the increasingly complex models used in systems biology and other areas. Advances in computing power have facilitated the development of increasingly larger dynamic models of biological processes, which usually have many unknown parameters. Often times, such models contain parameters that are structurally unidentifiable, i.e., they cannot be uniquely determined from experiments. Any parameter estimation algorithm will fail when trying to estimate unidentifiable parameters, leading to waste of resources and possibly wrong model predictions. Hence, it is essential to assess structural identifiability before exploiting a model. However, performing such analysis can be hard, especially as models become increasingly complicated. To address this challenge, we developed a methodology for structural identifiability analysis that aims at generality—it can handle any analytic model written as a set of ordinary differential equations—and computational efficiency—it includes features that facilitate the analysis of large systems. We provide an implementation of the methodology as a MATLAB toolbox called STRIKE-GOLDD. We illustrate its applicability to systems biology models of genetic, signalling, metabolic, and pharmacokinetic networks, showing which of them are unidentifiable and how they can be made identifiable.

27 August 2003
Verified
Conference Paper
Closed access
SPS. Prajna
S. Prajna
APA. Papachristodoulou
A. Papachristodoulou
PPP.A. Parrilo
P.A. Parrilo
SOSTOOLS is a MATLAB toolbox for constructing and solving sum of squares programs. It can be used in combination with semidefinite programming soft- ware, such as SeDuMi, to solve many continuous and combinatorial optimization problems, as well as vari- ous control-related problems. This paper provides an overview on sum of squares programming, describes the primary features of SOSTOOLS, and shows how SOS- TOOLS is used to solve sum of squares programs. Some applications from different areas are presented to show the wide applicability of sum of squares programming in general and SOSTOOLS in particular.

27 August 2003
Verified
Conference Paper
Closed access
APA. Papachristodoulou
A. Papachristodoulou
SPS. Prajna
S. Prajna
A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic construction of Lyapunov functions to prove stability of equilibria in nonlinear systems, but the search is restricted to systems with polynomial vector fields. In the paper, the above technique is extended to include systems with equality, inequality, and integral constraints. This allows certain non-polynomial nonlinearities in the vector field to be handled exactly and the constructed Lyapunov functions to contain non-polynomial terms. It also allows robustness analysis to be performed. Some examples are given to illustrate how this is done.

1 August 2010 in Automatica
Verified
Journal Article
Closed access
UMUlrich Münz
Ulrich Münz
APAntonis Papachristodoulou
Antonis Papachristodoulou
FAFrank Allgöwer
Frank Allgöwer

30 June 2011 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
UMUlrich Munz
Ulrich Munz
APAntonis Papachristodoulou
Antonis Papachristodoulou
FAFrank Allgower
Frank Allgower
The robustness of consensus in single integrator multi-agent systems (MAS) to coupling delays and switching topologies is investigated. It is shown that consensus is reached for arbitrarily large constant, time-varying, or distributed delays if consensus is reached without delays. This delay robustness holds under the weakest possible connectivity assumptions on the underlying graph, i.e., as long as the graph is uniformly quasi-strongly connected and switches with a dwell-time. The proof is based on a contraction argument and allows to remove technical assumptions that were used in previous publications. Moreover, the result also applies to non-scalar single integrators, an important extension toward consensus and rendezvous in higher dimensions.

1 March 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
APAntonis Papachristodoulou
Antonis Papachristodoulou
AJAli Jadbabaie
Ali Jadbabaie
UMUlrich Münz
Ulrich Münz
The coordinated motion of multi-agent systems and oscillator synchronization are two important examples of networked control systems. In this technical note, we consider what effect multiple, non-commensurate (heterogeneous) communication delays can have on the consensus properties of large-scale multi-agent systems endowed with nonlinear dynamics. We show that the structure of the delayed dynamics allows functionality to be retained for arbitrary communication delays, even for switching topologies under certain connectivity conditions. The results are extended to the related problem of oscillator synchronization.