Searcharxiv⌕ Search

arXiv subjects

Biswadip Dey

Publications and source records attributed to Biswadip Dey.

34 records · Page 2Linked to original sources

Extending Lagrangian and Hamiltonian Neural Networks with Differentiable Contact Models

The incorporation of appropriate inductive bias plays a critical role in learning dynamics from data. A growing body of work has been exploring ways to enforce energy conservation in the learned dynamics by encoding Lagrangian or Hamiltonian dynamics into the neural network architecture. These existing approaches are based on differential equations, which do not allow discontinuity in the states and thereby limit the class of systems one can learn. However, in reality, most physical systems, such as legged robots and robotic manipulators, involve contacts and collisions, which introduce discontinuities in the states. In this paper, we introduce a differentiable contact model, which can capture contact mechanics: frictionless/frictional, as well as elastic/inelastic. This model can also accommodate inequality constraints, such as limits on the joint angles. The proposed contact model extends the scope of Lagrangian and Hamiltonian neural networks by allowing simultaneous learning of contact and system properties. We demonstrate this framework on a series of challenging 2D and 3D physical systems with different coefficients of restitution and friction. The learned dynamics can be used as a differentiable physics simulator for downstream gradient-based optimization tasks, such as planning and control.

cs.RO↗

Topological limits to parallel processing capability of network architectures

The ability to learn new tasks and generalize performance to others is one of the most remarkable characteristics of the human brain and of recent AI systems. The ability to perform multiple tasks simultaneously is also a signature characteristic of large-scale parallel architectures, that is evident in the human brain, and has been exploited effectively more traditional, massively parallel computational architectures. Here, we show that these two characteristics are in tension, reflecting a fundamental tradeoff between interactive parallelism that supports learning and generalization, and independent parallelism that supports processing efficiency through concurrent multitasking. We formally show that, while the maximum number of tasks that can be performed simultaneously grows linearly with network size, under realistic scenarios (e.g. in an unpredictable environment), the expected number that can be performed concurrently grows radically sub-linearly with network size. Hence, even modest reliance on shared representation strictly constrains the number of tasks that can be performed simultaneously, implying profound consequences for the development of artificial intelligence that optimally manages the tradeoff between learning and processing, and for understanding the human brains remarkably puzzling mix of sequential and parallel capabilities.

q-bio.NC↗

Frequency-compensated PINNs for Fluid-dynamic Design Problems

Incompressible fluid flow around a cylinder is one of the classical problems in fluid-dynamics with strong relevance with many real-world engineering problems, for example, design of offshore structures or design of a pin-fin heat exchanger. Thus learning a high-accuracy surrogate for this problem can demonstrate the efficacy of a novel machine learning approach. In this work, we propose a physics-informed neural network (PINN) architecture for learning the relationship between simulation output and the underlying geometry and boundary conditions. In addition to using a physics-based regularization term, the proposed approach also exploits the underlying physics to learn a set of Fourier features, i.e. frequency and phase offset parameters, and then use them for predicting flow velocity and pressure over the spatio-temporal domain. We demonstrate this approach by predicting simulation results over out of range time interval and for novel design conditions. Our results show that incorporation of Fourier features improves the generalization performance over both temporal domain and design space.

cs.LG↗

Dissipative SymODEN: Encoding Hamiltonian Dynamics with Dissipation and Control into Deep Learning

In this work, we introduce Dissipative SymODEN, a deep learning architecture which can infer the dynamics of a physical system with dissipation from observed state trajectories. To improve prediction accuracy while reducing network size, Dissipative SymODEN encodes the port-Hamiltonian dynamics with energy dissipation and external input into the design of its computation graph and learns the dynamics in a structured way. The learned model, by revealing key aspects of the system, such as the inertia, dissipation, and potential energy, paves the way for energy-based controllers.

cs.LG↗

Beacon-referenced Pursuit for Collective Motions in Three Dimensions

Motivated by real-world applications of unmanned aerial vehicles, this paper introduces a decentralized control mechanism to guide steering control of autonomous agents maneuvering in the vicinity of multiple moving entities (e.g. other autonomous agents) and stationary entities (e.g. fixed beacons or points of references) in a three-dimensional environment. The proposed control law, which can be perceived as a modification of the three-dimensional constant bearing (CB) pursuit law, provides a means to allocate simultaneous attention to multiple entities. We investigate the behavior of the closed-loop dynamics for a system with one agent referencing two beacons, as well as a two-agent mutual pursuit system wherein each agent employs the beacon-referenced CB pursuit law with regards to the other agent and a stationary beacon. Under certain assumptions on the associated control parameters, we demonstrate that this problem admits circling equilibria with agents moving on circular orbits with a common radius, in planes perpendicular to a common axis passing through the beacons. As the common radius and distances from the beacon are determined by the choice of parameters in the pursuit law, this approach provides a means to engineer desired formations in a 3-dimensional setting.

eess.SY↗

A Conditional Generative Model for Predicting Material Microstructures from Processing Methods

Microstructures of a material form the bridge linking processing conditions - which can be controlled, to the material property - which is the primary interest in engineering applications. Thus a critical task in material design is establishing the processing-structure relationship, which requires domain expertise and techniques that can model the high-dimensional material microstructure. This work proposes a deep learning based approach that models the processing-structure relationship as a conditional image synthesis problem. In particular, we develop an auxiliary classifier Wasserstein GAN with gradient penalty (ACWGAN-GP) to synthesize microstructures under a given processing condition. This approach is free of feature engineering, requires modest domain knowledge and is applicable to a wide range of material systems. We demonstrate this approach using the ultra high carbon steel (UHCS) database, where each microstructure is annotated with a label describing the cooling method it was subjected to. Our results show that ACWGAN-GP can synthesize high-quality multiphase microstructures for a given cooling method.

eess.IV↗

Social decision-making driven by artistic explore-exploit tension

We studied social decision-making in the rule-based improvisational dance $There$ $Might$ $Be$ $Others$, where dancers make in-the-moment compositional choices. Rehearsals provided a natural test-bed with communication restricted to non-verbal cues. We observed a key artistic explore-exploit tension in which the dancers switched between exploitation of existing artistic opportunities and riskier exploration of new ones. We investigated how the rules influenced the dynamics using rehearsals together with a model generalized from evolutionary dynamics. We tuned the rules to heighten the tension and modeled nonlinear fitness and feedback dynamics for mutation rate to capture the observed temporal phasing of the dancers' exploration-versus-exploitation. Using bifurcation analysis, we identified key controls of the tension and showed how they could shape the decision-making dynamics of the model much like turning a "dial" in the instructions to the dancers could shape the dance. The investigation became an integral part of the development of the dance.

physics.soc-ph↗

Mixed mode oscillations and phase locking in coupled FitzHugh-Nagumo model neurons

We study the dynamics of a low-dimensional system of coupled model neurons as a step towards understanding the vastly complex network of neurons in the brain. We analyze the bifurcation structure of a system of two model neurons with unidirectional coupling as a function of two physiologically relevant parameters: the external current input only to the first neuron and the strength of the coupling from the first to the second neuron. Leveraging a timescale separation, we prove necessary conditions for multiple timescale phenomena observed in the coupled system, including canard solutions and mixed mode oscillations. For a larger network of model neurons, we present a sufficient condition for phase locking when external inputs are heterogeneous. Finally, we generalize our results to directed trees of model neurons with heterogeneous inputs.

math.DS↗

Collective Motion under Beacon-referenced Cyclic Pursuit

Cyclic pursuit frameworks, which are built upon pursuit interactions between neighboring agents in a cycle graph, provide an efficient way to create useful global behaviors in a collective of autonomous robots. Previous work had considered cyclic pursuit with a constant bearing (CB) pursuit law, and demonstrated the existence of circling equilibria for the corresponding dynamics. In this work, we propose a beacon-referenced version of the CB pursuit law, wherein a stationary beacon provides an additional reference for the individual agents in a collective. When implemented in a cyclic framework, we show that the resulting dynamics admit relative equilibria corresponding to a circling orbit around the beacon, with the circling radius and the distribution of agents along the orbit determined by parameters of the proposed pursuit law. We also derive necessary conditions for stability of the circling equilibria, which provides a guide for parameter selection. Finally, by introducing a change of variables, we demonstrate the existence of a family of invariant manifolds related to spiraling motions around the beacon which preserve the "pure shape" of the collective, and study the reduced dynamics on a representative manifold.

eess.SY↗

Beacon-referenced Mutual Pursuit in Three Dimensions

Motivated by station-keeping applications in various unmanned settings, this paper introduces a steering control law for a pair of agents operating in the vicinity of a fixed beacon in a three-dimensional environment. This feedback law is a modification of the previously studied three-dimensional constant bearing (CB) pursuit law, in the sense that it incorporates an additional term to allocate attention to the beacon. We investigate the behavior of the closed-loop dynamics for a two agent mutual pursuit system in which each agent employs the beacon-referenced CB pursuit law with regards to the other agent and a stationary beacon. Under certain assumptions on the associated control parameters, we demonstrate that this problem admits circling equilibria wherein the agents move on circular orbits with a common radius, in planes perpendicular to a common axis passing through the beacon. As the common radius and distances from the beacon are determined by choice of parameters in the feedback law, this approach provides a means to engineer desired formations in a three-dimensional setting.

eess.SY↗

Constant Bearing Pursuit on Branching Graphs

Cyclic pursuit frameworks provide an efficient way to create useful global behaviors out of pairwise interactions in a collective of autonomous robots. Earlier work studied cyclic pursuit with a constant bearing (CB) pursuit law, and has demonstrated the existence of a variety of interesting behaviors for the corresponding dynamics. In this work, by attaching multiple branches to a single cycle, we introduce a modified version of this framework which allows us to consider any weakly connected pursuit graph where each node has an outdegree of 1. This provides a further generalization of the cyclic pursuit setting. Then, after showing existence of relative equilibria (rectilinear or circling motion), pure shape equilibria (spiraling motion) and periodic orbits, we also derive necessary conditions for stability of a 3-agent collective. By paving a way for individual agents to join or leave a collective without perturbing the motion of others, our approach leads to improved reliability of the overall system.

eess.SY↗

Cluster synchronization of diffusively-coupled nonlinear systems: A contraction based approach

Finding the conditions that foster synchronization in networked oscillatory systems is critical to understanding a wide range of biological and mechanical systems. However, the conditions proved in the literature for synchronization in nonlinear systems with linear coupling, such as has been used to model neuronal networks, are in general not strict enough to accurately determine the system behavior. We leverage contraction theory to derive new sufficient conditions for cluster synchronization in terms of the network structure, for a network where the intrinsic nonlinear dynamics of each node may differ. Our result requires that network connections satisfy a cluster-input-equivalence condition, and we explore the influence of this requirement on network dynamics. For application to networks of nodes with neuronal spiking dynamics, we show that our new sufficient condition is tighter than those found in previous analyses which used nonsmooth Lyapunov functions. Improving the analytical conditions for when cluster synchronization will occur based on network configuration is a significant step toward facilitating understanding and control of complex oscillatory systems.

eess.SY↗

A Graph-Theoretic Approach to Multitasking

A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off against the ability of a network to simultaneously carry out multiple independent processes -- a salient limitation in many domains of human cognition -- remains largely unexplored. In this paper we use a graph-theoretic analysis of network architecture to address this question, where tasks are represented as edges in a bipartite graph $G=(A \cup B, E)$. We define a new measure of multitasking capacity of such networks, based on the assumptions that tasks that \emph{need} to be multitasked rely on independent resources, i.e., form a matching, and that tasks \emph{can} be multitasked without interference if they form an induced matching. Our main result is an inherent tradeoff between the multitasking capacity and the average degree of the network that holds \emph{regardless of the network architecture}. These results are also extended to networks of depth greater than $2$. On the positive side, we demonstrate that networks that are random-like (e.g., locally sparse) can have desirable multitasking properties. Our results shed light into the parallel-processing limitations of neural systems and provide insights that may be useful for the analysis and design of parallel architectures.

cs.DM↗

A Formal Approach to Modeling the Cost of Cognitive Control

This paper introduces a formal method to model the level of demand on control when executing cognitive processes. The cost of cognitive control is parsed into an intensity cost which encapsulates how much additional input information is required so as to get the specified response, and an interaction cost which encapsulates the level of interference between individual processes in a network. We develop a formal relationship between the probability of successful execution of desired processes and the control signals (additive control biases). This relationship is also used to specify optimal control policies to achieve a desired probability of activation for processes. We observe that there are boundary cases when finding such control policies which leads us to introduce the interaction cost. We show that the interaction cost is influenced by the relative strengths of individual processes, as well as the directionality of the underlying competition between processes.

q-bio.NC↗

Biomimetic Algorithms for Coordinated Motion: Theory and Implementation

Drawing inspiration from flight behavior in biological settings (e.g. territorial battles in dragonflies, and flocking in starlings), this paper demonstrates two strategies for coverage and flocking. Using earlier theoretical studies on mutual motion camouflage, an appropriate steering control law for area coverage has been implemented in a laboratory test-bed equipped with wheeled mobile robots and a Vicon high speed motion capture system. The same test-bed is also used to demonstrate another strategy (based on local information), termed topological velocity alignment, which serves to make agents move in the same direction. The present work illustrates the applicability of biological inspiration in the design of multi-agent robotic collectives.

cs.RO↗

Station Keeping through Beacon-referenced Cyclic Pursuit

This paper investigates a modification of cyclic constant bearing (CB) pursuit in a multi-agent system in which each agent pays attention to a neighbor and a beacon. The problem admits shape equilibria with collective circling about the beacon, with the circling radius and angular separation of agents determined by choice of parameters in the feedback law. Stability of circling shape equilibria is shown for a 2-agent system, and the results are demonstrated on a collective of mobile robots tracked by a motion capture system.

eess.SY↗