Related papers: Dynamic Space Packing
Motivated by a variety of online matching platforms, we consider demand and supply units which are located i.i.d. in [0,1]^d, and each demand unit needs to be matched with a supply unit. The goal is to minimize the expected average distance…
In this short note, we discuss the basic approach to computational modeling of dynamical systems. If a dynamical system contains multiple time scales, ranging from very fast to slow, computational solution of the dynamical system can be…
Object rearrangement is a widely-applicable and challenging task for robots. Geometric constraints must be carefully examined to avoid collisions and combinatorial issues arise as the number of objects increases. This work studies the…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…
A one dimensional exclusion process is introduced where particles hop to a neighbouring vacant site with a rate that depends on the size of the block they belong to. This model is equivalent to a zero range process (ZRP) and shares the same…
We study the adsorption and desorption kinetics of interacting particles moving on a one-dimensional lattice. Confinement is introduced by limiting the number of particles on a lattice site. Adsorption and desorption are found to proceed at…
We present and analyze mechanisms for the patterned deposition of particles in a spatio-temporally driven lattice. The working principle is based on the breaking of the spatio-temporal translation symmetry, which is responsible for the…
We present a multiscale simulation algorithm for amorphous materials, which we illustrate and validate in a canonical case of dense granular flow. Our algorithm is based on the recently proposed Spot Model, where particles in a dense random…
Dynamical maps describe general transformations of the state of a physical system, and their iteration can be interpreted as generating a discrete time evolution. Prime examples include classical nonlinear systems undergoing transitions to…
We present a time-dependent density-matrix renormalization group investigation of the quantum distillation process within the Fermi--Hubbard model on a quasi-1D ladder geometry. The term distillation refers to the dynamical, spatial…
We introduce dynamic nested sampling: a generalisation of the nested sampling algorithm in which the number of "live points" varies to allocate samples more efficiently. In empirical tests the new method significantly improves calculation…
A core capability for robot manipulation is reasoning over where and how to stably place objects in cluttered environments. Traditionally, robots have relied on object-specific, hand-crafted heuristics in order to perform such reasoning,…
The recently developed dynamic discretization discovery (DDD) is a powerful method that allows many time-dependent problems to become more tractable. While DDD has been applied to a variety of problems, one particular challenge has been to…
We consider a composite medium, which consists of a homogeneous matrix containing a statistically homogeneous set of multimodal spherical inclusions. This model is used to represent the morphology of heterogeneous solid propellants (HSP)…
In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find a way to place these items that can minimize the…
Diffusion policies generate robot motions by learning to denoise action-space trajectories conditioned on observations. These observations are commonly streams of RGB images, whose high dimensionality includes substantial task-irrelevant…
The vision-based semantic scene completion task aims to predict dense geometric and semantic 3D scene representations from 2D images. However, the presence of dynamic objects in the scene seriously affects the accuracy of the model…
A one-dimensional driven diffusive system with two types of particles and nearest neighbors interactions has been considered on a finite lattice with open boundaries. The particles can enter and leave the system from both ends of the…
We investigate the utility of employing multiple buffers in solving a class of rearrangement problems with pick-n-swap manipulation primitives. In this problem, objects stored randomly in a lattice are to be sorted using a robot arm with…
The spatial logistic model is a system of point entities (particles) in $\mathbb{R}^d$ which reproduce themselves at distant points (dispersal) and die, also due to competition. The states of such systems are probability measures on the…