相关论文: Stick-Breaking Model for Variable-Range Hopping
The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two-dimensional bounded Euclidean space is developed, which can…
We derive an anomalous, sub-diffusive scaling limit for a one-dimensional version of the Mott random walk. The limiting process can be viewed heuristically as a one-dimensional diffusion with an absolutely continuous speed measure and a…
We study the navigation problem for a robot moving amidst static and dynamic obstacles and rely on a hierarchical approach to solve it. First, the reference trajectory is planned by the safe interval path planning algorithm that is capable…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
We investigate a stochastic process where a rectangle breaks into smaller rectangles through a series of horizontal and vertical fragmentation events. We focus on the case where both the vertical size and the horizontal size of a rectangle…
This study presents the formulation, the numerical solution, and the validation of a theoretical framework based on the concept of variable-order mechanics and capable of modeling dynamic fracture in brittle and quasi-brittle solids. More…
Floating-base multi-link robots can change their shape during flight, making them well-suited for applications in confined environments such as autonomous inspection and search and rescue. However, trajectory planning for such systems…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
In this article we derive rigorously a nonlinear, steady, bifurcation through spectral bifurcation (i.e., eigenvalues of the linearized equation crossing the imaginary axis) for a class of hyperbolic-parabolic model in a strip. This is…
A continuum model of crack propagation is presented and discussed. We obtain steady state solutions with a self-consistently selected propagation velocity and shape of the crack, provided that elastodynamic and viscoelastic effects are…
There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
A dynamic crack will travel in a straight path up to a material-dependent critical speed beyond which its path becomes erratic. Predicting this critical speed and discovering the origin of this instability are two outstanding problems in…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Creep failure of hierarchical materials is investigated by simulation of beam network models. Such models are idealizations of hierarchical fibrous materials where bundles of load-carrying fibers are held together by multi-level…
In this paper we design throughput-optimal dynamic broad- cast algorithms for multi-hop networks with arbitrary topolo- gies. Most of the previous broadcast algorithms route pack- ets along spanning trees, rooted at the source node. For…
Given a graph $G=(V,E)$, the minimum branch vertices problem consists in finding a spanning tree $T=(V,E')$ of $G$ minimizing the number of vertices with degree greater than two. We consider a simple combinatorial lower bound for the…
An optimal control problem for longitudinal motions of a thin elastic rod is considered. We suppose that a normal force, which changes piecewise constantly along the rod's length, is applied to the cross-section so that the positions of…
This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a…