698 research outputs found
Non-homogeneous polygonal Markov fields in the plane: graphical representations and geometry of higher order correlations
We consider polygonal Markov fields originally introduced by Arak and
Surgailis (1989). Our attention is focused on fields with nodes of order two,
which can be regarded as continuum ensembles of non-intersecting contours in
the plane, sharing a number of features with the two-dimensional Ising model.
We introduce non-homogeneous version of polygonal fields in anisotropic
enviroment. For these fields we provide a class of new graphical constructions
and random dynamics. These include a generalised dynamic representation,
generalised and defective disagreement loop dynamics as well as a generalised
contour birth and death dynamics. Next, we use these constructions as tools to
obtain new exact results on the geometry of higher order correlations of
polygonal Markov fields in their consistent regime.Comment: 54 page
Motion Planning
Motion planning is a fundamental function in robotics and numerous intelligent machines. The global concept of planning involves multiple capabilities, such as path generation, dynamic planning, optimization, tracking, and control. This book has organized different planning topics into three general perspectives that are classified by the type of robotic applications. The chapters are a selection of recent developments in a) planning and tracking methods for unmanned aerial vehicles, b) heuristically based methods for navigation planning and routes optimization, and c) control techniques developed for path planning of autonomous wheeled platforms
A Topological Approach to Workspace and Motion Planning for a Cable-controlled Robot in Cluttered Environments
There is a rising demand for multiple-cable controlled robots in stadiums or warehouses due to its low cost, longer operation time, and higher safety standards. In a cluttered environment the cables can wrap around obstacles. Careful choice needs to be made for the initial cable congurations to ensure that the workspace of the robot is optimized. The presence of cables makes it imperative to consider the homotopy classes of the cables both in the design and motion planning problems. In this thesis we study the problem of workspace planning for multiple-cable controlled robots in an environment with polygonal obstacles. This goal of this thesis is to establish a relationship between the workspace\u27s boundary and cable congurations of such robots, and solve related optimization and motion planning problems. We rst analyze the conditions under which a conguration of a cable-controlled robot can be considered valid, then discuss the relationship between cable conguration, the robot\u27s workspace and its motion state, and finally use graph search based motion planning in h-augmented graph to perform workspace optimization and to compute optimal paths for the robot. We demonstrated corresponding algorithms in simulations
IST Austria Thesis
This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.
For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.
In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars
A differential approach to Maxwell-Cremona liftings
In 1864, J. C. Maxwell introduced a link between self-stressed frameworks in
the plane and piecewise linear liftings to 3-space. This connection has found
numerous applications in areas such as discrete geometry, control theory and
structural engineering. While there are some generalisations of this theory to
liftings of -complexes in -space, extensions for liftings of frameworks
in -space for have been missing. In this paper, we introduce and
study differential liftings on general graphs using differential forms
associated with the elements of the homotopy groups of the complements to the
frameworks. Such liftings play the role of integrands for the classical notion
of liftings for planar frameworks. We show that these differential liftings
have a natural extension to self-stressed frameworks in higher dimensions. As a
result we generalise the notion of classical liftings to both graphs and
multidimensional -complexes in -space (). Finally we
discuss a natural representation of generalised liftings as real-valued
functions on Grassmannians.Comment: 26 pages, 11 figure
Locked and unlocked smooth embeddings of surfaces
We study the continuous motion of smooth isometric embeddings of a planar
surface in three-dimensional Euclidean space, and two related discrete
analogues of these embeddings, polygonal embeddings and flat foldings without
interior vertices, under continuous changes of the embedding or folding. We
show that every star-shaped or spiral-shaped domain is unlocked: a continuous
motion unfolds it to a flat embedding. However, disks with two holes can have
locked embeddings that are topologically equivalent to a flat embedding but
cannot reach a flat embedding by continuous motion.Comment: 8 pages, 8 figures. To appear in 34th Canadian Conference on
Computational Geometr
- …