This work analyzes how multi-agent reinforcement learning can bridge the gap to reality in distributed multi-robot systems.
problem Collaborative learning in distributed multi-robot systems with varying sensors and actuators.
method Simulation-based analysis using PPO and Bullet physics engine, considering different types of perturbations.
result PPO's robustness is affected by the presence of different types of perturbations and the number of agents experiencing them.
DistGP models multi-robot mapping with distributed Gaussian process learning.
problem Collaborative mapping by multiple robots with limited local data.
method Sparse Gaussian process with factorisation and distributed training via GBP.
result DistGP achieves superior accuracy and robustness compared to DiNNO.
Algorithm balances learning and coverage for multi-robots over unknown fields.
problem Balancing learning and coverage for multi-robots over unknown, nonuniform sensory fields.
method DSLC algorithm that schedules learning and coverage epochs, using Gaussian Process modeling and coverage regret analysis.
result Upper bound on expected cumulative coverage regret provided for DSLC.
A new network learns to prioritize messages for efficient multi-robot path planning.
problem Efficient path planning and coordination for large-scale multi-robot systems.
method Message-Aware Graph Attention Network (MAGAT) incorporating attention mechanisms.
result MAGAT achieves performance close to a coupled centralized expert algorithm.
Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail…
Motion planning for robots of high degrees-of-freedom (DOFs) is an important problem in robotics with sampling-based methods in configuration space C as one popular solution. Recently, machine learning methods have been introduced into sampling-based motion planning methods, which train a classifier to distinguish coll…
Swarm systems constitute a challenging problem for reinforcement learning (RL) as the algorithm needs to learn decentralized control policies that can cope with limited local sensing and communication abilities of the agents. While it is often difficult to directly define the behavior of the agents, simple communicatio…
A decentralized routing framework for lunar exploration robots.
problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.
This paper explores the possibility of near-optimally solving multi-agent, multi-task NP-hard planning problems with time-dependent rewards using a learning-based algorithm. In particular, we consider a class of robot/machine scheduling problems called the multi-robot reward collection problem (MRRC). Such MRRC problem…
Paper develops a scalable distributed inference algorithm for sensor networks.
problem Efficient inference in intelligent sensor networks for location, tracking, and mapping.
method Distributed variational inference algorithm for continuous variables and large-scale data.
result Derives a separable lower bound for distributed variational inference with one-hop communication.
A novel neural network training method reduces gradient variance for faster and better reinforcement learning.
problem Improving convergence and generalization in deep reinforcement learning.
method Gradient Monitoring (GM) approach to dynamically adjust the learning process based on feedback.
result The proposed methods, especially AM-WGM, significantly enhance model performance and generalization.
Overview of integrable systems with symmetries, focusing on toric and semitoric systems.
problem Classifying and understanding integrable systems with symmetries.
method Using decorated polygons and controlled bifurcations in one-parameter families of systems.
result Construction of explicit semitoric systems with prescribed invariants.
New method to derive integrable systems from existing Lax systems.
problem Deriving new integrable systems from existing ones.
method Systematic method of deriving new integrable systems from a given one.
result Examples of new integrable systems derived, including the dispersionless Hirota equation, the general heavenly equation, and the web equations.
Learning to control linear systems is statistically hard, especially for underactuated systems.
problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.
Discrete-time systems can be characterized by simple flat coordinates and their shifts.
problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.
The paper explores when linear system identification is hard or easy, especially for under-actuated systems.
problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.
This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.
problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an ℓ1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension. result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.
In integrable hydrodynamic systems, coordinates exist where generators and symmetries are simple.
problem Existence of Riemannian invariants for integrable systems of hydrodynamic type.
method Finding coordinates where the generator and all symmetries are diagonal.
result In integrable hydrodynamic systems, there exist coordinates where the generator and all symmetries are diagonal.
This paper studies nonholonomic constraints in Hamiltonian systems, deriving equations and theorems.
problem Analyzing nonholonomic constraints in Hamiltonian systems.
method Deriving distributional RCH systems, geometric constraint conditions, and Hamilton-Jacobi theorems.
result Derives precise geometric constraint conditions and Hamilton-Jacobi theorems for nonholonomic systems.
New method models unknown systems with hidden parameters using neural networks.
problem Modeling unknown dynamical systems with hidden parameters.
method Training a deep neural network (DNN) model using trajectory data of the unknown system.
result DNN model accurately predicts unknown dynamical systems with new initial conditions.
Study absolute equivalence for Pfaffian systems, applying to control systems.
problem Absolute equivalence of Pfaffian systems with specific independence conditions.
method Structural results for Pfaffian systems of corank 3, applied to control systems.
result Dynamic feedback linearization of control systems with 2 inputs.
Solves selecting the best optimizing system problems.
problem Selecting the best system among contenders with unknown performance.
method Adaptive algorithms integrating stochastic gradient descent and sequential elimination.
result Exponential rates of convergence to zero for false selection probability.
This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of systems includes mechanical systems subject to holonomic and nonholonomic const…
Superintegrable systems on curved manifolds found to have Hessian structures.
problem Characterizing superintegrable systems on curved manifolds.
method Identifying and computing Hessian coordinates for superintegrable systems.
result Examples of superintegrable systems in 2D and 3D have natural Hessian coordinates.
Systemic risk refers to the risk that the financial system is susceptible to failures due to the characteristics of the system itself. The tremendous cost of systemic risk requires the design and implementation of tools for the efficient macroprudential regulation of financial institutions. The current paper proposes a…
Researchers solve boundary and scattering rigidity problems for magnetic systems.
problem Recovering magnetic systems from boundary or scattering data.
method Reduced to magnetic systems and applied results from [DPSU07].
result Recovering MP-system up to a gauge. The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.
problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.
Paper develops reduction theory for controlled Lagrangian systems with symmetry and momentum map.
problem Reduction of controlled Lagrangian systems with symmetry and momentum map.
method Using Legendre transformation and Euler-Lagrange vector field, the paper extends symmetric reduction theory.
result Established regular reduction theory for RCL systems with symmetry and momentum map.
The paper studies connections in superintegrable systems, revealing geometric insights.
problem Understanding non- and semi-degenerate superintegrable systems.
method Analyzes two torsion-free connections associated with superintegrable systems.
result Semi-degenerate secondary structure tensor is the Ricci curvature of a natural torsion-free connection.
This paper proposes a system-agnostic policy for dynamic scheduling.
problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.
Learn dynamics of a system using auxiliary data from similar systems.
problem Learning dynamics of a linear system with limited data.
method Weighted least squares approach, incorporating auxiliary data.
result Auxiliary data can help reduce intrinsic error due to noise.
The inability to see and quantify systemic financial risk comes at an immense social cost. Systemic risk in the financial system arises to a large extent as a consequence of the interconnectedness of its institutions, which are linked through networks of different types of financial contracts, such as credit, derivativ…
Abstract reviews geometric theories of smooth and F-smooth systems.
problem Geometric theories of smooth and F-smooth systems.
method Reviews geometric theories of smooth and F-smooth systems.
result Discusses geometric theories of smooth and F-smooth systems.
New Lie systems derived from Goursat distributions with applications to differential equations.
problem Analyzing Lie systems associated with Goursat distributions and their applications.
method Analyzing bracket-generating distributions and their relation to Lie systems, focusing on reductions and reconstructions.
result Lie systems associated with Goursat distributions can be reduced and solutions reconstructed from reduced systems.
Elliptic systems are characterized by Darboux integrability.
problem Characterizing elliptic differential systems with holomorphic solutions.
method Using a complex manifold and associated holomorphic Pfaffian system.
result Elliptic systems are Darboux integrable under generic conditions.
The study analyzes stochastic Lie systems and their applications in various models.
problem Analyzing stochastic differential equations on manifolds.
method Coalgebra method for Hamiltonian stochastic Lie systems.
result New examples of stochastic Lie systems and Hamiltonian stochastic Lie systems are analyzed.
Reduces multisymplectic Lie systems through symmetry analysis.
problem Solving multisymplectic Lie systems using symmetry reduction.
method Using momentum maps for reduction and reconstruction of multisymplectic Lie systems.
result Solves the original problem by analyzing simpler multisymplectic Lie systems.
Study integrable discretizations of cyclic systems with circular coordinate lines.
problem Integrable discretizations of 3D cyclic systems with circular coordinate lines.
method Investigate circle congruences and flat connections in the context of discrete cyclic systems.
result Characterization of circle congruences and existence of certain flat connections.
A new chaotic financial system is proposed by considering ethics involvement in a four-dimensional financial system with market confidence. A five-dimensional conformable derivative financial system is presented by introducing conformable fractional calculus to the integer-order system. A discretization scheme is propo…
A distributed system identification method for LTI systems using reverse experience replay.
problem Online system identification of LTI systems over multi-agent networks.
method DSGD-RER, a distributed variant of SGD-RER with backward updates.
result The estimation error decreases as the network size grows.
This work extends reduction processes for nonholonomic discrete mechanical systems.
problem Nonholonomic discrete mechanical systems and their reductions.
method Introduces a category LDPd of discrete-time dynamical systems and a two-stage reduction process. result Two-stage reduction process produces systems isomorphic to one-stage reduction.
Unified approach to deform Lie-Hamilton systems using Poisson-Hopf algebra.
problem Deforming Lie systems with quantum algebras.
method Poisson-Hopf algebra deformations applied to Lie-Hamilton systems.
result Unified approach to deformations of Lie-Hamilton systems on the real plane.
In this paper, we first study the Poisson reductions of controlled Hamiltonian (CH) system and symmetric CH system by controllability distributions. These reductions are the extension of Poisson reductions by distribution for Poisson manifolds to that for phase spaces of CH systems with external force and control. We g…
Maps dBKP solutions to MS system solutions, defining Einstein-Weyl structures.
problem Constructing solutions and structures for dBKP and MS systems.
method Map construction and spectral characterisation of reductions.
result Defines Einstein-Weyl structures for dBKP and BMS systems.
Proposes a RL method using simulators for stabilizing uncertain systems.
problem Limited experiences and potential dangerous actions during RL learning of real systems.
method Two-stage approach: virtual systems for Q-function learning, real system interactions for final policy.
result Proposed method improves RL performance in uncertain discrete-time systems.
New method for constructing contact Lie systems on various spaces.
problem Constructing contact Lie systems on Riemannian and Lorentzian spaces.
method Adaptation of scaling symmetries to Lie-Hamilton systems, leading to contact Lie systems.
result Curvature-dependent reductions of contact Lie systems on Cayley-Klein spaces.
Conformal predictive systems are a recent modification of conformal predictors that output, in regression problems, probability distributions for labels of test observations rather than set predictions. The extra information provided by conformal predictive systems may be useful, e.g., in decision making problems. Conf…
New model stabilizes asynchronous LTI systems, independent of synchronous stability.
problem Stability of asynchronous LTI systems under randomization and asynchrony.
method Introduced a new model for random asynchronous LTI systems and developed a method for system identification.
result Stability of random asynchronous LTI systems is independent of synchronous stability.