.. toctree:: :hidden: :maxdepth: 1 About Research Teaching Contact Travels About =============== .. container:: clearer .. figure:: data/images/pp.jpg :align: left :width: 222px | | **PhD student** | | |INMA_link| - Mathematical Engineering Department | |ICTEAM_link| - Institute of Information and Communication Technologies, Electronics and Applied Mathematics | |UCLouvain_link| - Université Catholique of Louvain | Work supported by |revealflight_link| | | My advisor is |Julien_link| | | **Quick links** | |scholar_logo| |scholar_link| | |github| |github_link| | |linkedin_logo| |linkedin_link| News ----- + I just presented my second conference paper at the 60th Conference on Decision and Control (2021). Antoine Legat, Julien M. Hendrickx, "**Path-Based Conditions for Local Network Identifiability -- Full Version**", preprint. [`PDF `_, `slides <_static/CDC21-slides.pdf>`_, `video <_static/CDC21-video.mp4>`_] + Along our toolbox to test the local identifiability of a network, we have added a code to check the potential equivalence of decoupled and local identifiability. [|identifiable_link|] Research: Network identifiability --------------------------------- Networked systems consist of the interconnection of several dynamical systems. Applications include for example power networks (smart grids), biochemical networks, neurobiology, transportation networks, multi- agent robotics, or social networks. The network structure, i.e. the graph of the interconnections, has a major impact on the behavior of these systems, but also on our ability to analyze their local dynamics from global observations. In my thesis we propose a new approach to network identification: we determine the conditions under which one can recover the local dynamics from the global input-output behavior of the networked system and the network structure. Graph-theoretical problems play an important role in our work. We focus more particularly on LTI networked systems where a subset of the nodes is measured and a subset of the nodes is subject to external excitation (these subsets may intersect and do not necessary cover the whole network). We suppose that the input-output behavior of the system has been identified and that the network structure is known. We want to determine the conditions under which all or specific local transfer functions can then be re-identified. Here are a `poster <_static/poster.pdf>`_ and a `vulgarized summary <_static/research_vulgarized_summary.pdf>`_ of my research. .. image:: data/images/brain-sketch.png :width: 600 :align: center .. |cdc_link| raw:: html PDF .. |identifiable_link| raw:: html code .. |Julien_link| raw:: html Julien Hendrickx .. |ICTEAM_link| raw:: html ICTEAM .. |UCLouvain_link| raw:: html UCLouvain .. |revealflight_link| raw:: html RevealFlight .. |scholar_link| raw:: html Google Scholar .. |github_link| raw:: html GitHub .. |INMA_link| raw:: html INMA .. |linkedin_link| raw:: html Linkedin .. |linkedin_logo| image:: data/images/linkedin.png :width: 15px :class: no-scaled-link .. |scholar_logo| image:: data/images/Google_Scholar_logo.png :width: 15px :class: no-scaled-link