Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For points in convex position we obtain a new realization of the associahedron, i.e., a geometric representation of the set of triangulations of an n-gon, or of the set of binary trees on n vertices, or of many other combinatorial objects that are counted by the Catalan numbers. By considering the 1-dimensional version of the polytope of constrained expansive motions we obtain a second distinct realization of the associahedron as a perturbation of the positive cell in a Coxeter arrangement. Our methods produce as a by-product a new proof that every simple polygon or polygonal arc in the plane has expansive motions, a key step in the proofs of the Carpenter's Rule Theorem by Connelly, Demaine and Rote (2000) and by Streinu (2000).Comment: 40 pages, 7 figures. Changes from v1: added some comments (specially to the "Further remarks" in Section 5) + changed to final book format. This version is to appear in "Discrete and Computational Geometry -- The Goodman-Pollack Festschrift" (B. Aronov, S. Basu, J. Pach, M. Sharir, eds), series "Algorithms and Combinatorics", Springer Verlag, Berli

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time

The Stability of Heavy Objects with Multiple Contacts

In both robot grasping and robot locomotion, we wish to hold objects stably in the presence of gravity. We present a derivation of second-order stability conditions for a supported heavy object, employing the tool of Stratified Morse theory. We then apply these general results to the case of objects in the plane

Path planning and collision avoidance for robots

An optimal control problem to find the fastest collision-free trajectory of a robot surrounded by obstacles is presented. The collision avoidance is based on linear programming arguments and expressed as state constraints. The optimal control problem is solved with a sequential programming method. In order to decrease the number of unknowns and constraints a backface culling active set strategy is added to the resolution technique

Efficient contact determination between geometric models

http://archive.org/details/efficientcontact00linmN

High-Dimensional Design Evaluations For Self-Aligning Geometries

Physical connectors with self-aligning geometry aid in the docking process for many robotic and automatic control systems such as robotic self-reconfiguration and air-to-air refueling. This self-aligning geometry provides a wider range of acceptable error tolerance in relative pose between the two rigid objects, increasing successful docking chances. In a broader context, mechanical alignment properties are also useful for other cases such as foot placement and stability, grasping or manipulation. Previously, computational limitations and costly algorithms prevented high-dimensional analysis. The algorithms presented in this dissertation will show a reduced computational time and improved resolution for this kind of problem. This dissertation reviews multiple methods for evaluating modular robot connector geometries as a case study in determining alignment properties. Several metrics are introduced in terms of the robustness of the alignment to errors across the full dimensional range of possible offsets. Algorithms for quantifying error robustness will be introduced and compared in terms of accuracy, reliability, and computational cost. Connector robustness is then compared across multiple design parameters to find trends in alignment behavior. Methods developed and compared include direct simulation and contact space analysis algorithms (geometric by a \u27pre-partitioning\u27 method, and discrete by flooding). Experimental verification for certain subsets is also performed to confirm the results. By evaluating connectors using these algorithms we obtain concrete metric values. We then quantitatively compare their alignment capabilities in either SE(2) or SE(3) under a pseudo-static assumption

Wheeled Mobile Robots: State of the Art Overview and Kinematic Comparison Among Three Omnidirectional Locomotion Strategies

In the last decades, mobile robotics has become a very interesting research topic in the feld of robotics, mainly because of population ageing and the recent pandemic emergency caused by Covid-19. Against this context, the paper presents an overview on wheeled mobile robot (WMR), which have a central role in nowadays scenario. In particular, the paper describes the most commonly adopted locomotion strategies, perception systems, control architectures and navigation approaches. After having analyzed the state of the art, this paper focuses on the kinematics of three omnidirectional platforms: a four mecanum wheels robot (4WD), a three omni wheel platform (3WD) and a two swerve-drive system (2SWD). Through a dimensionless approach, these three platforms are compared to understand how their mobility is afected by the wheel speed limitations that are present in every practical application. This original comparison has not been already presented by the literature and it can be used to improve our understanding of the kinematics of these mobile robots and to guide the selection of the most appropriate locomotion system according to the specifc application