Search

We present a decentralized reinforcement learning (RL) approach to address the multi-agent shepherding control problem, departing from the conventional assumption of cohesive target groups. Our two-layer control architecture consists of a low-level controller that guides each herder to contain a specific target within a goal region, while a high-level layer dynamically selects from multiple targets the one an herder should aim at corralling and containing. Cooperation emerges naturally, as herders autonomously choose distinct targets to expedite task completion. We further extend this approach to large-scale systems, where each herder applies a shared policy, trained with few agents, while managing a fixed subset of agents.

In this paper, we address the large-scale shepherding control problem using a continuification-based strategy. We consider a scenario in which a large group of follower agents (targets) must be confined within a designated goal region through indirect interactions with a controllable set of leader agents (herders). Our approach transforms the microscopic agent-based dynamics into a macroscopic continuum model via partial differential equations (PDEs). This formulation enables efficient, scalable control design for the herders' behavior, with guarantees of global convergence. Numerical and experimental validations in a mixed-reality swarm robotics framework demonstrate the method's effectiveness.

We present GoRINNs: numerical analysis-informed (shallow) neural networks for the solution of inverse problems of non-linear systems of conservation laws. GoRINNs is a hybrid/blended machine learning scheme based on high-resolution Godunov schemes for the solution of the Riemann problem in hyperbolic Partial Differential Equations (PDEs). In contrast to other existing machine learning methods that learn the numerical fluxes or just parameters of conservative Finite Volume methods, relying on deep neural networks (that may lead to poor approximations due to the computational complexity involved in their training), GoRINNs learn the closures of the conservation laws per se based on "intelligently" numerical-assisted shallow neural networks. Due to their structure, in particular, GoRINNs provide explainable, conservative schemes, that solve the inverse problem for hyperbolic PDEs, on the basis of approximate Riemann solvers that satisfy the Rankine-Hugoniot condition. The performance of GoRINNs is assessed via four benchmark problems, namely the Burgers', the Shallow Water, the Lighthill-Whitham-Richards and the Payne-Whitham traffic flow models. The solution profiles of these PDEs exhibit shock waves, rarefactions and/or contact discontinuities at finite times. We demonstrate that GoRINNs provide a very high accuracy both in the smooth and discontinuous regions., Comment: 29 pages, 6 figures

As interactions with autonomous agents-ranging from robots in physical settings to avatars in virtual and augmented realities-become more prevalent, developing advanced cognitive architectures is critical for enhancing the dynamics of human-avatar groups. This paper presents a reinforcement-learning-based cognitive architecture, trained via a sim-to-real approach, designed to improve synchronization in periodic motor tasks, crucial for applications in group rehabilitation and sports training. Extensive numerical validation consistently demonstrates improvements in synchronization. Theoretical derivations and numerical investigations are complemented by preliminary experiments with real participants, showing that our avatars can integrate seamlessly into human groups, often being indistinguishable from humans.

We address the problem of controlling the density of a large ensemble of follower agents by acting on group of leader agents that interact with them. We formulate the problem as a system of coupled partial integro-differential equations describing for the dynamics of the leaders' and followers' densities. We define feasibility conditions and propose two control architectures for exponential global stability. The first architecture is a feed-forward scheme for the followers. It adjusts the leaders' density via a feedback loop, which leverages information about leaders and a fixed reference density, to direct followers towards a target distribution. The second, dual feedback strategy employs a reference-governor to dynamically adapt the leaders' reference density based on measurements on both leaders and followers. Initially analyzed in one dimension, our methods are expanded to multi-dimensional applications. Numerical validations and an application in continuification-based control of leader-follower multiagent systems confirm the effectiveness of our approaches.

This paper investigates the robustness of a novel high-dimensional continuification control method for complex multi-agent systems. We begin by formulating a partial differential equation describing the spatio-temporal density dynamics of swarming agents. A stable control action for the density is then derived and validated under nominal conditions. Subsequently, we discretize this macroscopic strategy into actionable velocity inputs for the system's agents. Our analysis demonstrates the robustness of the approach beyond idealized assumptions of unlimited sensing and absence of perturbations., Comment: arXiv admin note: text overlap with arXiv:2310.01573

We present a data-driven control architecture for modifying the kinematics of robots and artificial avatars to encode specific information such as the presence or not of an emotion in the movements of an avatar or robot driven by a human operator. We validate our approach on an experimental dataset obtained during the reach-to-grasp phase of a pick-and-place task.

A key problem toward the use of microorganisms as bio-factories is reaching and maintaining cellular communities at a desired density and composition so that they can efficiently convert their biomass into useful compounds. Promising technological platforms for the real time, scalable control of cellular density are bioreactors. In this work, we developed a learning-based strategy to expand the toolbox of available control algorithms capable of regulating the density of a \textit{single} bacterial population in bioreactors. Specifically, we used a sim-to-real paradigm, where a simple mathematical model, calibrated using a few data, was adopted to generate synthetic data for the training of the controller. The resulting policy was then exhaustively tested in vivo using a low-cost bioreactor known as Chi.Bio, assessing performance and robustness. In addition, we compared the performance with more traditional controllers (namely, a PI and an MPC), confirming that the learning-based controller exhibits similar performance in vivo. Our work showcases the viability of learning-based strategies for the control of cellular density in bioreactors, making a step forward toward their use for the control of the composition of microbial consortia., Comment: 13 pages, 4 figures

In addressing control problems such as regulation and tracking through reinforcement learning, it is often required to guarantee that the acquired policy meets essential performance and stability criteria such as a desired settling time and steady-state error prior to deployment. Motivated by this necessity, we present a set of results and a systematic reward shaping procedure that (i) ensures the optimal policy generates trajectories that align with specified control requirements and (ii) allows to assess whether any given policy satisfies them. We validate our approach through comprehensive numerical experiments conducted in two representative environments from OpenAI Gym: the Inverted Pendulum swing-up problem and the Lunar Lander. Utilizing both tabular and deep reinforcement learning methods, our experiments consistently affirm the efficacy of our proposed framework, highlighting its effectiveness in ensuring policy adherence to the prescribed control requirements.

Many new methodologies for the control of large-scale multi-agent systems are based on macroscopic representations of the emerging system dynamics, in the form of continuum approximations of large ensembles. These techniques, that are developed in the limit case of an infinite number of agents, are usually validated only through numerical simulations. In this paper, we introduce a mixed reality set-up for testing swarm robotics techniques, focusing on the macroscopic collective motion of robotic swarms. This hybrid apparatus combines both real differential drive robots and virtual agents to create a heterogeneous swarm of tunable size. We also extend continuification-based control methods for swarms to higher dimensions, and assess experimentally their validity in the new platform. Our study demonstrates the effectiveness of the platform for conducting large-scale swarm robotics experiments, and it contributes new theoretical insights into control algorithms exploiting continuification approaches.

We consider the problem of optimizing the interconnection graphs of complex networks to promote synchronization. When traditional optimization methods are inapplicable, due to uncertain or unknown node dynamics, we propose a data-driven approach leveraging datasets of relevant examples. We analyze two case studies, with linear and nonlinear node dynamics. First, we show how including node dynamics in the objective function makes the optimal graphs heterogeneous. Then, we compare various design strategies, finding that the best either utilize data samples close to a specific Pareto front or a combination of a neural network and a genetic algorithm, with statistically better performance than the best examples in the datasets.

We study the shepherding control problem where a group of "herders" need to orchestrate their collective behaviour in order to steer the dynamics of a group of "target" agents towards a desired goal. We relax the strong assumptions of targets showing cohesive collective behavior in the absence of the herders, and herders owning global sensing capabilities. We find scaling laws linking the number of targets and minimum herders needed, and we unveil the existence of a critical threshold of the density of the targets, below which the number of herders needed for success significantly increases. We explain the existence of such a threshold in terms of the percolation of a suitably defined herdability graph and support our numerical evidence by deriving and analysing a PDE describing the herders dynamics in a simplified one-dimensional setting. Extensive numerical experiments validate our methodology.

We present preliminary results on the problem of driving the dynamics of a group of agents, the herders, so as to steer the collective behaviour of another group of agents, the targets, interacting with them. We define this problem as the multiagent herding control problem and study the herdability of the target agents by relaxing some strong assumptions often made in the existing literature, namely that targets are cohesive in the absence of herders and that herders possess global information. We find that scaling laws exist linking crucial parameters such as the herders' sensing radius and the targets density with the herdability of the system. Our most surprising observation, supported by exhaustive numerical experiments, is that the crucial effect of limited sensing is that the minimum number of herders required to solve the problem significantly increases below a critical minimum density of the target agents., Comment: An updated version is available at arXiv:2307.16797

We investigate the stability and robustness properties of a continuification-based strategy for the control of large-scale multiagent systems. Within continuation-based strategy, one transforms the microscopic, agent-level description of the system dynamics into a macroscopic continuum-level, for which a control action can be synthesized to steer the macroscopic dynamics towards a desired distribution. Such an action is ultimately discretized to obtain a set of deployable control inputs for the agents to achieve the goal. The mathematical proof of convergence toward the desired distribution typically relies on the assumptions that no disturbance is present and that each agent possesses global knowledge of all the others' positions. Here, we analytically and numerically address the possibility of relaxing these assumptions for the case of a one-dimensional system of agents moving in a ring. We offer compelling evidence in favor of the use of a continuification-based strategy when agents only possess a finite sensing capability and spatio-temporal perturbations affect the macroscopic dynamics of the ensemble. We also discuss some preliminary results about the role of an integral action in the macroscopic control solution.

Geometric pattern formation is an important emergent behavior in many applications involving large-scale multi-agent systems, such as sensor networks deployment and collective transportation. Attraction/repulsion virtual forces are the most common control approach to achieve such behavior in a distributed and scalable manner. Nevertheless, for most existing solutions only numerical and/or experimental evidence of their convergence is available. Here, we revisit the problem of achieving pattern formation giving sufficient conditions to prove analytically that under the influence of appropriate virtual forces, a large-scale multi-agent swarming system locally converges towards a stable and robust triangular lattice configuration. Specifically, the proof is carried out using LaSalle's invariance principle and geometry-based arguments. Our theoretical results are complemented by exhaustive numerical simulations confirming their effectiveness and estimating the region of asymptotic stability of the triangular configuration.

The problem of partitioning a power grid into a set of islands can be a solution to restore power dispatchment in sections of a grid affected by an extreme failure. Current solutions to this problem usually involve finding the partition of the grid into islands that minimizes the sum of their absolute power imbalances. This combinatorial problem is often solved through heuristic offline methods. In this paper, we propose instead a distributed online algorithm through which nodes can migrate among islands, self-organizing the network into a suitable partition. We prove that, under a set of appropriate assumptions, the proposed solution yields a partition whose absolute power imbalance falls within a given bound of the optimal solution. We validate our analytical results by testing our partitioning strategy on the IEEE 118 and 300 benchmark problems.

One of the major challenges in Deep Reinforcement Learning for control is the need for extensive training to learn the policy. Motivated by this, we present the design of the Control-Tutored Deep Q-Networks (CT-DQN) algorithm, a Deep Reinforcement Learning algorithm that leverages a control tutor, i.e., an exogenous control law, to reduce learning time. The tutor can be designed using an approximate model of the system, without any assumption about the knowledge of the system's dynamics. There is no expectation that it will be able to achieve the control objective if used stand-alone. During learning, the tutor occasionally suggests an action, thus partially guiding exploration. We validate our approach on three scenarios from OpenAI Gym: the inverted pendulum, lunar lander, and car racing. We demonstrate that CT-DQN is able to achieve better or equivalent data efficiency with respect to the classic function approximation solutions.

In this paper, we propose a method to control large-scale multiagent systems swarming in a ring. Specifically, we use a continuification-based approach that transforms the microscopic, agent-level description of the system dynamics into a macroscopic, continuum-level representation, which we employ to synthesize a control action towards a desired distribution of the agents. The continuum-level control action is then discretized at the agent-level in order to practically implement it. To confirm the effectiveness and the robustness of the proposed approach, we complement theoretical derivations with a series of numerical simulations.

Geometric pattern formation is crucial in many tasks involving large-scale multi-agent systems. Examples include mobile agents performing surveillance, swarm of drones or robots, or smart transportation systems. Currently, most control strategies proposed to achieve pattern formation in network systems either show good performance but require expensive sensors and communication devices, or have lesser sensor requirements but behave more poorly. Also, they often require certain prescribed structural interconnections between the agents (e.g., regular lattices, all-to-all networks etc). In this paper, we provide a distributed displacement-based control law that allows large group of agents to achieve triangular and square lattices, with low sensor requirements and without needing communication between the agents. Also, a simple, yet powerful, adaptation law is proposed to automatically tune the control gains in order to reduce the design effort, while improving robustness and flexibility. We show the validity and robustness of our approach via numerical simulations and experiments, comparing it with other approaches from the existing literature.

This study uses supervised machine learning (SML) and explainable artificial intelligence (AI) to model, predict and understand human decision-making during skillful joint-action. Long short-term memory networks were trained to predict the target selection decisions of expert and novice actors completing a dyadic herding task. Results revealed that the trained models were expertise specific and could not only accurately predict the target selection decisions of expert and novice herders but could do so at timescales that preceded an actor's conscious intent. To understand what differentiated the target selection decisions of expert and novice actors, we then employed the explainable-AI technique, SHapley Additive exPlanation, to identify the importance of informational features (variables) on model predictions. This analysis revealed that experts were more influenced by information about the state of their co-herders compared to novices. The utility of employing SML and explainable-AI techniques for investigating human decision-making is discussed.

We investigate the problem of using a learning-based strategy to stabilize a synthetic toggle switch via an external control approach. To overcome the data efficiency problem that would render the algorithm unfeasible for practical use in synthetic biology, we adopt a sim-to-real paradigm where the policy is learnt via training on a simplified model of the toggle switch and it is then subsequently exploited to control a more realistic model of the switch parameterized from in-vivo experiments. Our in-silico experiments confirm the viability of the approach suggesting its potential use for in-vivo control implementations.

Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid.

Shimmy is a dangerous phenomenon that occurs when aircraft's nose landing gears oscillate in a rapid and uncontrollable fashion. In this paper, we propose the use of two nonlinear control approaches (zero average control and model reference adaptive control based on minimal control synthesis) as simple yet effective strategies to suppress undesired oscillations, even in the presence of uncertainties and partial state measurements. Numerical results are presented to validate the proposed control approaches.

We study convergence in networks of piecewise-smooth (PWS) systems that commonly arise in applications to model dynamical systems whose evolution is affected by macroscopic events such as switches and impacts. Existing approaches were typically oriented toward guaranteeing global bounded synchronizability, local stability of the synchronization manifold, or achieving synchronization by exerting a control action on each node. Here we start by generalizing existing results on QUAD systems to the case of PWS systems, accounting for a large variety of nonlinear coupling laws. Then, we propose that a discontinuous coupling can be used to guarantee global synchronizability of a network of N PWS agents under mild assumptions on the individual dynamics. We provide extensive numerical simulations to gain insights on larger networks.

The problem of partitioning a power grid into a set of microgrids, or islands, is of interest for both the design of future smart grids, and as a last resort to restore power dispatchment in sections of a grid affected by an extreme failure. In the literature this problem is usually solved by turning it into a combinatorial optimization problem, often solved through generic heruristic methods such as Genetic Algorithms or Tabu Search. In this paper, we take a different route and obtain the grid partition by exploiting the synchronization dynamics of a cyberlayer of Kuramoto oscillators, each parameterized as a rough approximation of the dynamics of the grid's node it corresponds to. We present first a centralised algorithm and then a decentralised strategy. In the former, nodes are aggregated based on their internode synchronization times while in the latter they exploit synchronization of the oscillators in the cyber layer to selforganise into islands. Our preliminary results show that the heuristic synchronization based algorithms do converge towards partitions that are comparable to those obtained via other more cumbersome and computationally expensive optimization-based methods., Comment: 6 pages, 4 figures

This paper is concerned with the design of intermittent non-pharmaceutical strategies to mitigate the spread of the COVID-19 epidemic exploiting network epidemiological models. Specifically, by studying a variational equation for the dynamics of the infected in a network model of the epidemic spread, we derive, using contractivity arguments, a condition that can be used to guarantee that, in epidemiological terms, the effective reproduction number is less than unity. This condition has three advantages: (i) it is easily computable; (ii) it is directly related to the model parameters; (iii) it can be used to enforce a scalability condition that prohibits the amplification of disturbances within the network system. We then include satisfaction of such a condition as a constraint in a Model Predictive Control problem so as to mitigate (or suppress) the spread of the epidemic while minimizing the economic impact of the interventions. A data-driven model of Italy as a network of three macro-regions (North, Center, and South), whose parameters are identified from real data, is used to illustrate and evaluate the effectiveness of the proposed control strategy., Comment: Accepted by Control and Decision Conference 2021

We introduce a control-tutored reinforcement learning (CTRL) algorithm. The idea is to enhance tabular learning algorithms by means of a control strategy with limited knowledge of the system model. By tutoring the learning process, the learning rate can be substantially reduced. We use the classical problem of stabilizing an inverted pendulum as a benchmark to numerically illustrate the advantages and disadvantages of the approach.

In this Paper we propose a simple yet effective set of local control rules to make a group of "herder agents" collect and contain in a desired region an ensemble of non-cooperative stochastic "target agents" in the plane. We investigate the robustness of the proposed strategies to variations of the number of target agents and the strength of the repulsive force they feel when in proximity of the herders. Extensive numerical simulations confirm the effectiveness of the approach and are complemented by a more realistic validation on commercially available robotic agents via ROS.

The COVID-19 epidemic that emerged in Wuhan China at the end of 2019 hit Italy particularly hard, yielding the implementation of strict national lockdown rules (Phase 1). There is now a hot ongoing debate in Italy and abroad on what the best strategy is to restart a country to exit a national lockdown (Phase 2). Previous studies have focused on modelling possible restarting scenarios at the national level, overlooking the fact that Italy, as other nations around the world, is divided in administrative regions who can independently oversee their own share of the Italian National Health Service. In this study, we show that regionalism, and heterogeneity between regions, is essential to understand the spread of the epidemic and, more importantly, to design effective post Lock-Down strategies to control the disease. To achieve this, we model Italy as a network of regions and parameterize the model of each region on real data spanning almost two months from the initial outbreak. Using the model, we confirm the effectiveness at the regional level of the national lockdown strategy implemented so far by the Italian government to mitigate the spread of the disease and show its efficacy at the regional level. We also propose that differentiated, albeit coordinated, regional interventions can be effective in Phase 2 to restart the country and avoid future recurrence of the epidemic, while avoiding saturation of the regional health systems and mitigating impact on costs. Our study and methodology can be easily extended to other levels of granularity (provinces or counties in the same region or states in other federal countries, etc.) to support policy- and decision-makers., Comment: 35 pages

Synchronization is a crucial phenomenon in many natural and artificial complex network systems. Applications include neuronal networks, formation control and coordination in robotics, and frequency synchronization in electrical power grids. In this paper, we propose the use of a distributed discontinuous coupling protocol to achieve convergence and synchronization in networks of non-identical nonlinear dynamical systems. We show that the synchronous dynamics is a solution to the average of the nodes' vector fields, and derive analytical estimates of the critical coupling gains required to achieve convergence. Numerical simulations are used to illustrate and validate the theoretical results.

We introduce a control-tutored reinforcement learning (CTRL) algorithm. The idea is to enhance tabular learning algorithms so as to improve the exploration of the state-space, and substantially reduce learning times by leveraging some limited knowledge of the plant encoded into a tutoring model-based control strategy. We illustrate the benefits of our novel approach and its effectiveness by using the problem of controlling one or more agents to herd and contain within a goal region a set of target free-roving agents in the plane.

In this extended abstract we introduce a novel control-tutored Q-learning approach (CTQL) as part of the ongoing effort in developing model-based and safe RL for continuous state spaces. We validate our approach by applying it to a challenging multi-agent herding control problem.

The Painlev\'e paradox is a phenomenon that causes instability in mechanical systems subjects to unilateral constraints. While earlier studies were mostly focused on abstract theoretical settings, recent work confirmed the occurrence of the paradox in realistic set-ups. In this paper, we investigate the dynamics and presence of the Painlev\'e phenomenon in a twolinks robot in contact with a moving belt, through a bifurcation study. Then, we use the results of this analysis to inform the design of control strategies able to keep the robot sliding on the belt and avoid the onset of undesired lift-off. To this aim, through numerical simulations, we synthesise and compare a PID strategy and a hybrid force/motion control scheme, finding that the latter is able to guarantee better performance and avoid the onset of bouncing motion due to the Painlev\'e phenomenon.

In many joint-action scenarios, humans and robots have to coordinate their movements to accomplish a given shared task. Lifting an object together, sawing a wood log, transferring objects from a point to another are all examples where motor coordination between humans and machines is a crucial requirement. While the dyadic coordination between a human and a robot has been studied in previous investigations, the multi-agent scenario in which a robot has to be integrated into a human group still remains a less explored field of research. In this paper we discuss how to synthesise an artificial agent able to coordinate its motion in human ensembles. Driven by a control architecture based on deep reinforcement learning, such an artificial agent will be able to autonomously move itself in order to synchronise its motion with that of the group while exhibiting human-like kinematic features. As a paradigmatic coordination task we take a group version of the so-called mirror-game which is highlighted as a good benchmark in the human movement literature.

Complex networks are a successful framework to describe collective behaviour in many applications, but a notable gap remains in the current literature, that of proving asymptotic convergence in networks of piecewise-smooth systems. Indeed, a wide variety of physical systems display discontinuous dynamics that change abruptly, including dry friction mechanical oscillators, electrical power converters, and biological neurons. In this paper, we study how to enforce global asymptotic state-synchronization in these networks. Specifically, we propose the addition of a distributed discontinuous coupling action to the commonly used diffusive coupling protocol. Moreover, we provide analytical estimates of the thresholds on the coupling gains required for convergence, and highlight the importance of a new connectivity measure, which we named minimum density. The theoretical results are illustrated by a set of representative examples.

We consider the problem of regulating by means of external control inputs the ratio of two cell populations. Specifically, we assume that these two cellular populations are composed of cells belonging to the same strain which embeds some bistable memory mechanism, e.g. a genetic toggle switch, allowing them to switch role from one population to another in response to some inputs. We present three control strategies to regulate the populations' ratio to arbitrary desired values which take also into account realistic physical and technological constraints occurring in experimental microfluidic platforms. The designed controllers are then validated in-silico using stochastic agent-based simulations., Comment: Accepted to CDC'2019

The synthetic toggle switch, first proposed by Gardner & Collins [1] is a MIMO control system that can be controlled by varying the concentrations of two inducer molecules, aTc and IPTG, to achieve a desired level of expression of the two genes it comprises. It has been shown [2] that this can be accomplished through an open-loop external control strategy where the two inputs are selected as mutually exclusive periodic pulse waves of appropriate amplitude and duty-cycle. In this paper, we use a recently derived average model of the genetic toggle switch subject to these inputs to synthesize new feedback control approaches that adjust the inputs duty-cycle in real-time via two different possible strategies, a model based hybrid PI-PWM approach and a so-called Zero-Average dynamics (ZAD) controller. The controllers are validated in-silico via both deterministic and stochastic simulations (SSA) illustrating the advantages and limitations of each strategy, Comment: Preprint Submitted to ECC 2019

Designing artificial cyber-agents able to interact with human safely, smartly and in a natural way is a current open problem in control. Solving such an issue will allow the design of cyber-agents capable of co-operatively interacting with people in order to fulfil common joint tasks in a multitude of different applications. This is particularly relevant in the context of healthcare applications. Indeed, the use has been proposed of artificial agents interacting and coordinating their movements with those of a patient suffering from social or motor disorders. Specifically, it has been shown that an artificial agent exhibiting certain kinematic properties could provide innovative and efficient rehabilitation strategies for these patients. Moreover, it has also been shown that the level of motor coordination is enhanced if these kinematic properties are similar to those of the individual it is interacting with. In this paper we discuss, first, a new method based on Markov Chains to confer "human motor characteristics" on a virtual agent, so as that it can coordinate its motion with that of a target individual while exhibiting specific kinematic properties. Then, we embed such synthetic model in a control architecture based on reinforcement learning to synthesize a cyber-agent able to mimic the behaviour of a specific human performing a joint motor task with one or more individuals., Comment: 16 pages, 13 figures

In this letter, we analyze a genetic toggle switch recently studied in the literature where the expression of two repressor proteins can be tuned by controlling two different inputs, namely the concentration of two inducer molecules in the growth medium of the cells. Specifically, we investigate the dynamics of this system when subject to pulse-width modulated (PWM) input. We provide an analytical model that captures qualitatively the experimental observations reported in the literature and approximates its asymptotic behavior. We also discuss the effect that the system parameters have on the prediction accuracy of the model. Moreover, we propose a possible external control strategy to regulate the mean value of the fluorescence of the reporter proteins when the cells are subject to such periodic forcing., Comment: Preprint accepted for publication on L-CSS (First submission 31.05.2018, accepted 21.08.2018)

Extensive experiments in Human Movement Science suggest that solo motions are characterized by unique features that define the individuality or motor signature of people. While interacting with others, humans tend to spontaneously coordinate their movement and unconsciously give rise to joint improvisation. However, it has yet to be shed light on the relationship between individuality and joint improvisation. By means of an ad-hoc virtual agent, in this work we uncover the internal mechanisms of the transition from solo to joint improvised motion in the mirror game, a simple yet effective paradigm for studying interpersonal human coordination. According to the analysis of experimental data, normalized segments of velocity in solo motion are regarded as individual motor signature, and the existence of velocity segments possessing a prescribed signature is theoretically guaranteed. In this work, we first develop a systematic approach based on velocity segments to generate \emph{in-silico} trajectories of a given human participant playing solo. Then we present an online algorithm for the virtual player to produce joint improvised motion with another agent while exhibiting some desired kinematic characteristics, and to account for movement coordination and mutual adaptation during joint action tasks. Finally, we demonstrate that the proposed approach succeeds in revealing the kinematic features transition from solo to joint improvised motions, thus revealing the existence of a tight relationship between individuality and joint improvisation.

The formalism of complex networks is extensively employed to describe the dynamics of interacting agents in several applications. The features of the connections among the nodes in a network are not always provided beforehand, hence the problem of appropriately inferring them often arises. Here, we present a method to reconstruct directed and weighted topologies (REDRAW) of networks of heterogeneous phase-locked nonlinear oscillators. We ultimately plan on using REDRAW to infer the interaction structure in human ensembles engaged in coordination tasks, and give insights into the overall behavior.

The aim of this paper is to present the application of an approach to study contraction theory recently developed for piecewise smooth and switched systems. The approach that can be used to analyze incremental stability properties of so-called Filippov systems (or variable structure systems) is based on the use of regularization, a procedure to make the vector field of interest differentiable before analyzing its properties. We show that by using this extension of contraction theory to nondifferentiable vector fields, it is possible to design observers for a large class of piecewise smooth systems using not only Euclidean norms, as also done in previous literature, but also non-Euclidean norms. This allows greater flexibility in the design and encompasses the case of both piecewise-linear and piecewise-smooth (nonlinear) systems. The theoretical methodology is illustrated via a set of representative examples., Comment: Preprint accepted to IFAC World Congress 2017