A family of skeletons for motion planning and geometric reasoning applications

Author(s):  
Ata A. Eftekharian ◽  
Horea T. Ilieş

AbstractThe task of planning a path between two spatial configurations of an artifact moving among obstacles is an important problem in practically all geometrically intensive applications. Despite the ubiquity of the problem, the existing approaches make specific limiting assumptions about the geometry and mobility of the obstacles, or those of the environment in which the motion of the artifact takes place. We present a strategy to construct a family of paths, or roadmaps, for two- and three-dimensional solids moving in an evolving environment that can undergo drastic topological changes. Our approach is based on a potent paradigm for constructing geometric skeletons that relies on constructive representations of shapes with R-functions that operate on real-valued half-spaces as logic operations. We describe a family of skeletons that have the same homotopy as that of the environment and contains the medial axis as a special case. Of importance, our skeletons can be designed so that they are “attracted to” or “repulsed by” prescribed spatial sites of the environment. Moreover, the R-function formulation suggests the new concept of a medial zone, which can be thought of as a “thick” skeleton with significant applications for motion planning and other geometric reasoning applications. Our approach can handle problems in which the environment is not fully known a priori, and intrinsically supports local and parallel skeleton computations for domains with rigid or evolving boundaries. Furthermore, our path planning algorithm can be implemented in any commercial geometric kernel, and has attractive computational properties. The capability of the proposed technique are explored through several examples designed to simulate highly dynamic environments.

Author(s):  
Ata A. Eftekharian ◽  
Horea T. Ilies¸

The task of planning a path between two spatial configurations of an artifact moving among obstacles is an important problem in many geometrically-intensive applications. Despite the ubiquity of the problem, the existing approaches make specific limiting assumptions about the geometry and mobility of the obstacles, or those of the environment in which the motion of the artifact takes place. In this paper we propose a powerful approach for 2D path planning in a dynamic environment that can undergo drastic topological changes. Our algorithm is based on a potent paradigm for medial axis computation that relies on constructive representations of shapes with R-functions that operate on real-valued half-spaces as logic operations. Our approach can handle problems in which the environment is not fully known a priori, intrinsically supports local and parallel skeleton computations for domains with rigid or evolving boundaries, and appears to extend naturally to 3D domains. Furthermore, our path planning algorithm can be implemented in any commercial geometric kernel, and has attractive computational properties. The capability of the proposed technique are explored through several examples designed to resemble highly dynamic environments.


2021 ◽  
Vol 18 (4) ◽  
pp. 172988142110192
Author(s):  
Ben Zhang ◽  
Denglin Zhu

Innovative applications in rapidly evolving domains such as robotic navigation and autonomous (driverless) vehicles rely on motion planning systems that meet the shortest path and obstacle avoidance requirements. This article proposes a novel path planning algorithm based on jump point search and Bezier curves. The proposed algorithm consists of two main steps. In the front end, the improved heuristic function based on distance and direction is used to reduce the cost, and the redundant turning points are trimmed. In the back end, a novel trajectory generation method based on Bezier curves and a straight line is proposed. Our experimental results indicate that the proposed algorithm provides a complete motion planning solution from the front end to the back end, which can realize an optimal trajectory from the initial point to the target point used for robot navigation.


Author(s):  
Raffaele Di Gregorio

A novel type of parallel wrist (PW) is proposed which, differently from previously presented PWs, features a single-loop architecture and only one nonholonomic constraint. Due to the presence of a nonholonomic constraint, the proposed PW type is under-actuated, that is, it is able to control the platform orientation in a three-dimensional workspace by employing only two actuated pairs, one prismatic (P) and the other revolute (R); and it cannot perform tracking tasks. Position analysis and path planning of this novel PW are studied. In particular, all the relevant position analysis problems are solved in closed form, and, based on these closed-form solutions, a path-planning algorithm is built.


1992 ◽  
Vol 4 (5) ◽  
pp. 378-385
Author(s):  
Hiroshi Noborio ◽  
◽  
Motohiko Watanabe ◽  
Takeshi Fujii

In this paper, we propose a feasible motion planning algorithm for a robotic manipulator and its obstacles. The algorithm quickly selects a feasible sequence of collision-free motions while adaptively expanding a graph in the implicit configuration joint-space. In the configuration graph, each arc represents an angle difference of the manipulator joint; therefore, an arc sequence represents a continuous sequence of robot motions. Thus, the algorithm can execute a continuous sequence of collision-free motions. Furthermore, the algorithm expands the configuration graph only in space which is to be cluttered in the implicit configuration joint-space and which is needed to select a collision-free sequence between the initial and target positions/orientations. The algorithm maintains the configuration graph in a small size and quickly selects a collision-free sequence from the configuration graph, whose shape is to be simple enough to move the manipulator in practical applications.


2014 ◽  
Vol 1049-1050 ◽  
pp. 833-837
Author(s):  
Peng Yang ◽  
Dong Xing Hui ◽  
Zheng Kai ◽  
Li Shu Tian

A path planning algorithm based on B-spline interpolation techniques was constructed for automatic welding system.The system used a B-spline curve to reconstruct the weld,it was achieved by reversing the control points of B-spline curve through the prescribed date points. The weld posture model was then obtained from the osculating plane and normal plane of B-spline curve. By taking a series coordinate transformation to the weld posture model, the torch posture model based on control terminal was provided.Experiments show that the new algorithm can readily be used for various three-dimensional welding tasks.


Author(s):  
K Jiang ◽  
L D Seneviratne ◽  
S W E Earles

This paper presents a new motion planning approach, including reversal manoeuvres, for car-like robots subject to non-holonomic constraints. The paper presents a complete path planning algorithm and describes the procedure for constructing a collision-free path for a mobile robot constrained by its rectangular shape and kinematics. Emphasis is made on the techniques of reversal transfers, which are used to compensate the limited manoeuvrability of a car-like robot. The approach works entirely in the workspace, as opposed to building a higher dimensional configuration space (C-space). It starts by constructing a visibility graph and finding the shortest path for a point robot and then detects areas where collision may occur by minimum distance calculations between obstacles and between the selected path and obstacles. Robot configurations are placed along the shortest path and lemmas are developed for ascertaining transfers from one robot configuration to another. The transfer techniques include direct, indirect and reversal manoeuvres, and ensure that the path is feasible for the robot to travel with a given steering limit. The process runs in time O(nk + n log n) for k obstacles and n vertices. The algorithm is tested in computer simulations and results are given, demonstrating the versatility of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document