Related papers: Exact sampling of self-avoiding paths via discrete…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
Over the last 20 years significant effort has been dedicated to the development of sampling-based motion planning algorithms such as the Rapidly-exploring Random Trees (RRT) and its asymptotically optimal version (e.g. RRT*). However,…
Slow self-avoiding adaptive walks by an infinite radius search algorithm (Limax) are analyzed as themselves, and as the network they form. The study is conducted on several NK problems and two HIFF problems. We find that examination of such…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A…
The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…
Prudent walks are self-avoiding walks which cannot step towards an already occupied vertex. We introduce a new model of adsorbing prudent walks on the square lattice, which start on an impenetrable surface and accrue a fugacity $a$ with…
The scaling limit of the two-dimensional self-avoiding walk (SAW) is believed to be given by the Schramm-Loewner evolution (SLE) with the parameter kappa equal to 8/3. The scaling limit of the SAW has a natural parameterization and SLE has…
Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also…
We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that,…
It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
This paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised comparison-based adaptive search algorithm, on a simple constraint optimisation problem. The algorithm uses resampling to handle the constraint and optimizes a linear…
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
We review two numerical methods related to the Schramm-Loewner evolution (SLE). The first simulates SLE itself. More generally, it finds the curve in the half-plane that results from the Loewner equation for a given driving function. The…
In this master thesis, a new approximation scheme to non-relativistic potential scattering is developed and discussed. The starting points are two exact path integral representations of the T-matrix, which permit the application of the…
In this paper, we propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a given environment. The algorithm has…
Formation flight has a vast potential for aerial robot swarms in various applications. However, existing methods lack the capability to achieve fully autonomous large-scale formation flight in dense environments. To bridge the gap, we…
In this paper, we analyse a sub-class of two-dimensional homogeneous nearest neighbour (simple) random walk restricted on the lattice using the matrix geometric approach. In particular, we first present an alternative approach for the…
We present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…