Related papers: Soil searching by an artificial root
We examine the conjectured asymptotic shape of the three dimensional corner growth model [Olejarz et. al.,PRL, 108, 016102 (2012)] by mapping the model onto a restricted solid on solid model on a triangular lattice. By choosing appropriate…
This paper presents a guided tour of some specific problems encountered in the stability analysis of linear dynamical systems including delays in their systems' representation. More precisely, we will address the characterization of…
We present an algorithm to solve the problem of locating the source, or maxima, of a scalar field using a robot swarm. We demonstrate how the robot swarm determines its direction of movement to approach the source using only field intensity…
The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…
Growth pattern dynamics lie at the heart of morphogenesis. Here, we investigate the growth of plant leaves. We compute the conformal transformation that maps the contour of a leaf at a given stage onto the contour of the same leaf at a…
Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design. Solutions based on algorithmic geometry impose constraints on usable model representations…
A method of optimal control computation is proposed for problems with control and state constraints. It uses a sequence of control structure adjustments in the form of generations and reductions of nodes and arcs, which do not change the…
Many policy search algorithms have been proposed for robot learning and proved to be practical in real robot applications. However, there are still hyperparameters in the algorithms, such as the exploration rate, which requires manual…
We survey some of our recent results on inverse problems for evolution equations. The goal is to provide a unified approach to solve various types of evolution equations. The inverse problems we consider consist in determining unknown…
A novel artificial neural network approach to constraint satisfaction problems is presented. Based on information-theoretical considerations, it differs from a conventional mean-field approach in the form of the resulting free energy. The…
We consider a growing planar network where a tip grows at constant speed, branches at constant rate and inactivates when it meets a branch already created. We only consider here orthogonal branching occurring always in the same direction.…
Avraham et al. [AFK+15] presented an alternative approach to parametric search, called \emph{bifurcation}, that performs faster under certain circumstances. Intuitively, when the underlying decider execution can be rolled back cheaply and…
We present a method for solving the coverage problem with the objective of autonomously exploring an unknown environment under mission time constraints. Here, the robot is tasked with planning a path over a horizon such that the accumulated…
Of all the issues discussed at {\em Alife VII: Looking Forward, Looking Backward}, the issue of whether it was possible to create an artificial life system that exhibits {\em open-ended evolution} of novelty is by far the biggest. Of the 14…
Inverse analysis has been utilized to understand unknown underground geological properties by matching the observational data with simulators. To overcome the underconstrained nature of inverse problems and achieve good performance, an…
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between…
Designing neural networks for object recognition requires considerable architecture engineering. As a remedy, neuro-evolutionary network architecture search, which automatically searches for optimal network architectures using evolutionary…
We develop and apply a novel shape optimization exemplified for a two-blade rotor with respect to the figure of merit ($FM$). This topologically assisted optimization (TAO) contains two steps. First a global evolutionary optimization is…
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to the optimal treedepth decomposition problem. Our algorithm makes use of two cheaply-computed lower bound functions to prune the search tree,…
Several algorithms build on the perfect phylogeny model to infer evolutionary trees. This problem is particularly hard when evolutionary trees are inferred from the fraction of genomes that have mutations in different positions, across…