Related papers: Dynamic Space Packing
The dynamic mode decomposition (DMD) is a data-driven approach that extracts the dominant features from spatiotemporal data. In this work, we introduce sparse-mode DMD, a new variant of the optimized DMD framework that specifically…
We provide a complete thermodynamic solution of a 1D hopping model in the presence of a random potential by obtaining the density of states. Since the partition function is related to the density of states by a Laplace transform, the…
We study the size of \emph{dynamical covering sets} on a self-similar set. Dynamical covering sets are limsup sets generated by placing shrinking target sets around points along an orbit in a dynamical system. In the case when the target…
Reconstructing intricate, ever-changing environments remains a central ambition in computer vision, yet existing solutions often crumble before the complexity of real-world dynamics. We present DynaSplat, an approach that extends Gaussian…
In this paper, we investigate the problem of source recovery in a dynamical system utilizing space-time samples. This is a specific issue within the broader field of dynamical sampling, which involves collecting samples from solutions to a…
We discuss a reaction-diffusion model in one dimension subjected to an external driving force. Each lattice site may be occupied by at most one particle. The particles hop with asymmetric rates (the sum of which is one) to the right or left…
Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static…
The diffusion and flow of amorphous materials, such as glasses and granular materials, has resisted a simple microscopic description, analogous to defect theories for crystals. Early models were based on either gas-like inelastic collisions…
Rearranging objects in cluttered tabletop environments remains a long-standing challenge in robotics. Classical planners often generate inefficient, high-cost plans by shuffling objects individually and using fixed buffers--temporary spaces…
Unraveling the complexities of random packing in three dimensions has long puzzled physicists. While both experiments and simulations consistently show a maximum density of 64 percent for tightly packed random spheres, we still lack an…
We study kinetic and jamming properties of a space covering process in one dimension. The stochastic process is defined as follows: Seeds are nucleated randomly in space and produce rays which grow with a constant velocity. The growth stops…
In the field of freezing colloidal suspensions, it is important to understand the particle-scale behavior of particle packing. Here, we reveal the dynamics of particle packing by identifying the behavior of each single particle in situ. The…
An algorithm is proposed for finding numerical solutions of a kinetic equation that describes an infinite system of point articles placed in $\mathbb{R}^d (d \geq 1)$. The particles perform random jumps with pair wise repulsion, in the…
We study stochastic motion planning problems which involve a controlled process, with possibly discontinuous sample paths, visiting certain subsets of the state-space while avoiding others in a sequential fashion. For this purpose, we first…
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
Robotic bin packing is very challenging, especially when considering practical needs such as object variety and packing compactness. This paper presents SDF-Pack, a new approach based on signed distance field (SDF) to model the geometric…
Spatially localized structures are key components of turbulence and other spatio-temporally chaotic systems. From a dynamical systems viewpoint, it is desirable to obtain corresponding exact solutions, though their existence is not…
Research in combinatorics has often explored the asymmetric simple exclusion process (ASEP). The ASEP, inspired by examples from statistical mechanics, involves particles of various species moving around a lattice. With the traditional ASEP…
Sampling-based methods for motion planning, which capture the structure of the robot's free space via (typically random) sampling, have gained popularity due to their scalability, simplicity, and for offering global guarantees, such as…
This research paper focuses on the problem of dynamic objects and their impact on effective motion planning and localization. The paper proposes a two-step process to address this challenge, which involves finding the dynamic objects in the…