No Arabic abstract
This paper describes an adaptive method in continuous time for the estimation of external fields by a team of $N$ agents. The agents $i$ each explore subdomains $Omega^i$ of a bounded subset of interest $Omegasubset X := mathbb{R}^d$. Ideal adaptive estimates $hat{g}^i_t$ are derived for each agent from a distributed parameter system (DPS) that takes values in the scalar-valued reproducing kernel Hilbert space $H_X$ of functions over $X$. Approximations of the evolution of the ideal local estimate $hat{g}^i_t$ of agent $i$ is constructed solely using observations made by agent $i$ on a fine time scale. Since the local estimates on the fine time scale are constructed independently for each agent, we say that the method is strictly decentralized. On a coarse time scale, the individual local estimates $hat{g}^i_t$ are fused via the expression $hat{g}_t:=sum_{i=1}^NPsi^i hat{g}^i_t$ that uses a partition of unity ${Psi^i}_{1leq ileq N}$ subordinate to the cover ${Omega^i}_{i=1,ldots,N}$ of $Omega$. Realizable algorithms are obtained by constructing finite dimensional approximations of the DPS in terms of scattered bases defined by each agent from samples along their trajectories. Rates of convergence of the error in the finite dimensional approximations are derived in terms of the fill distance of the samples that define the scattered centers in each subdomain. The qualitative performance of the convergence rates for the decentralized estimation method is illustrated via numerical simulations.
We study the problem of estimating the parameters (i.e., infection rate and recovery rate) governing the spread of epidemics in networks. Such parameters are typically estimated by measuring various characteristics (such as the number of infected and recovered individuals) of the infected populations over time. However, these measurements also incur certain costs, depending on the population being tested and the times at which the tests are administered. We thus formulate the epidemic parameter estimation problem as an optimization problem, where the goal is to either minimize the total cost spent on collecting measurements, or to optimize the parameter estimates while remaining within a measurement budget. We show that these problems are NP-hard to solve in general, and then propose approximation algorithms with performance guarantees. We validate our algorithms using numerical examples.
Human impedance parameters play an integral role in the dynamics of strength amplification exoskeletons. Many methods are used to estimate the stiffness of human muscles, but few are used to improve the performance of strength amplification controllers for these devices. We propose a compliance shaping amplification controller incorporating an accurate online human stiffness estimation from surface electromyography (sEMG) sensors and stretch sensors connected to the forearm and upper arm of the human. These sensor values along with exoskeleton position and velocity are used to train a random forest regression model that accurately predicts a persons stiffness despite varying movement, relaxation, and muscle co-contraction. Our models accuracy is verified using experimental test data and the model is implemented into the compliance shaping controller. Ultimately we show that the online estimation of stiffness can improve the bandwidth and amplification of the controller while remaining robustly stable.
Requirements are investigated in this paper for each descriptor form subsystem, with which a causal/impulse free networked dynamic system (NDS) can be constructed. For this purpose, a matrix rank based necessary and sufficient condition is at first derived for the causality/impulse freeness of an NDS, in which the associated matrix depends affinely on subsystem connections. From this result, a necessary and sufficient condition is derived for each subsystem, such that there exists a subsystem connection matrix that leads to a causal/impulse free NDS. This condition further leads to a necessary and sufficient condition for the existence of a local static output feedback that guarantees the construction of a causal/impulse free NDS. A prominent property of these conditions are that all the involved numerical computations are performed independently on each individual subsystem, which is quite attractive in reducing computation costs and improving numerical stability for large scale NDS analysis and synthesis. Situations have also been clarified in which NDS causality/impulse freeness is independent of subsystem connections. It has also been made clear that under some situations, local static output feedbacks are not helpful in constructing a causal NDS.
Decentralized conflict resolution for autonomous vehicles is needed in many places where a centralized method is not feasible, e.g., parking lots, rural roads, merge lanes, etc. However, existing methods generally do not fully utilize optimization in decentralized conflict resolution. We propose a decentralized conflict resolution method for autonomous vehicles based on a novel extension to the Alternating Directions Method of Multipliers (ADMM), called Online Adaptive ADMM (OA-ADMM), and on Model Predictive Control (MPC). OA-ADMM is tailored to online systems, where fast and adaptive real-time optimization is crucial, and allows the use of safety information about the physical system to improve safety in real-time control. We prove convergence in the static case and give requirements for online convergence. Combining OA-ADMM and MPC allows for robust decentralized motion planning and control that seamlessly integrates decentralized conflict resolution. The effectiveness of our proposed method is shown through simulations in CARLA, an open-source vehicle simulator, resulting in a reduction of 47.93% in mean added delay compared with the next best method.
We consider the problem of asymptotic reconstruction of the state and parameter values in systems of ordinary differential equations. A solution to this problem is proposed for a class of systems of which the unknowns are allowed to be nonlinearly parameterized functions of state and time. Reconstruction of state and parameter values is based on the concepts of weakly attracting sets and non-uniform convergence and is subjected to persistency of excitation conditions. In absence of nonlinear parametrization the resulting observers reduce to standard estimation schemes. In this respect, the proposed method constitutes a generalization of the conventional canonical adaptive observer design.