42 research outputs found

    SDK: A proposal of a general and efficient deterministic sampling sequence

    Get PDF
    Previous works have already demonstrated that deterministic sampling can be competitive with respect to probabilistic sampling in sampling-based path planners. Nevertheless, the definition of a general sampling sequence for any d-dimensional Configuration Space satisfying the requirements needed for path planning is not a trivial issue, over a multi-grid cell decomposition, of the ordering of the 2d descendant cells of any parent cell. This ordering is generated by the digital construction method using a d x d matrix Td. A general expression of this matrix (i.e. for any d) is introduced and its performance analyzed in terms of the mutual distance. The paper ends with a performance evaluation of the use of the proposed deterministic sampling sequence in different well know path planner

    A novel path planning proposal based on the combination of deterministic sampling and harmonic functions

    Get PDF
    The sampling-based approach is currently the most successful and yet more promising approach to path planning problems. Sampling-based methods are demonstrated to be probabilistic complete, being their performance reliant on the generation of samples. To obtain a good set of samples, this paper proposes a new sampling paradigm based on deterministic sampling paradigm based on a deterministic sampling sequence guided by an harmonic potential function computed on a hierarchical cell decomposition of C-space. In the proposed method, known as Kautham sampler, samples are not isolated configurations but parts of a whole. As samples are generated they are dynamically grouped into cells that capture the C-space structure. This allows the use of harmonic functions to share information and guide further sampling towards more promising regions of C-space. Finally, using the samples obtained, a roadmap is easily built taking advantage of the known neighbourhood relationships

    Planning maximum-manipulability cutting paths

    Get PDF
    This paper presents a method for constrained motion planning from vision, which enables a robot to move its end-effector over an observed surface, given start and destination points. The robot has no prior knowledge of the surface shape but observes it from a noisy point cloud. We consider the multi-objective optimisation problem of finding robot trajectories which maximise the robot’s manipulability throughout the motion, while also minimising surface-distance travelled between the two points. This work has application in industrial problems of rough robotic cutting, e.g., demolition of the legacy nuclear plant, where the cut path needs not be precise as long as it achieves dismantling. We show how detours in the path can be leveraged to increase the manipulability of the robot at all points along the path. This helps to avoid singularities while maximising the robot’s capability to make small deviations during task execution. We show how a sampling-based planner can be projected onto the Riemannian manifold of a curved surface, and extended to include a term which maximises manipulability. We present the results of empirical experiments, with both simulated and real robots, which are tasked with moving over a variety of different surface shapes. Our planner enables successful task completion while ensuring significantly greater manipulability when compared against a conventional RRT* planner

    Automatic motion of manipulator using sampling based motion planning algorithms - application in service robotics

    Get PDF
    The thesis presents new approaches for autonomous motion execution of a robotic arm. The calculation of the motion is called motion planning and requires the computation of robot arm's path. The text covers the calculation of the path and several algorithms have been therefore implemented and tested in several real scenarios. The work focuses on sampling based planners, which means that the path is created by connecting explicitly random generated points in the free space. The algorithms can be divided into three categories: those that are working in configuration space(C-Space)(C- Space is the set of all possible joint angles of a robotic arm) , the mixed approaches using both Cartesian and C-Space and those that are using only the Cartesian space. Although Cartesian space seems more appropriate, due to dimensionality, this work illustrates that the C-Space planners can achieve comparable or better results. Initially an enhanced approach for efficient collision detection in C-Space, used by the planners, is presented. Afterwards the N dimensional cuboid region, notated as Rq, is defined. The Rq configures the C-Space so that the sampling is done close to a selected, called center, cell. The approach is enhanced by the decomposition of the Cartesian space into cells. A cell is selected appropriately if: (a) is closer to the target position and (b) lies inside the constraints. Inverse kinematics(IK) are applied to calculate a centre configuration used later by the Rq. The CellBiRRT is proposed and combines all the features. Continuously mixed approaches that do not require goal configuration or an analytic solution of IK are presented. Rq regions as well as Cells are also integrated in these approaches. A Cartesian sampling based planner using quaternions for linear interpolation is also proposed and tested. The common feature of the so far algorithms is the feasibility which is normally against the optimality. Therefore an additional part of this work deals with the optimality of the path. An enhanced approach of CellBiRRT, called CellBiRRT*, is developed and promises to compute shorter paths in a reasonable time. An on-line method using both CellBiRRT and CellBiRRT* is proposed where the path of the robot arm is improved and recalculated even if sudden changes in the environment are detected. Benchmarking with the state of the art algorithms show the good performance of the proposed approaches. The good performance makes the algorithms suitable for real time applications. In this work several applications are described: Manipulative skills, an approach for an semi-autonomous control of the robot arm and a motion planning library. The motion planning library provides the necessary interface for easy use and further development of the motion planning algorithms. It can be used as the part connecting the manipulative skill designing and the motion of a robotic arm

    On learning task-directed motion plans

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Includes bibliographical references (p. 119-129).Robotic motion planning is a hard problem for robots with more than just a few degrees of freedom. Modern probabilistic planners are able to solve many problems very quickly, but for difficult problems, they are still unacceptably slow for many applications. This thesis concerns the use of previous planning experience to allow the agent to generate motion plans very quickly when faced with new but related problems. We first investigate a technique for learning from previous experience by simply remembering past solutions and applying them where relevant to new problems. We find that this approach is useful in environments with very low variability in obstacle placement and task endpoints, and that it is important to keep the set of stored plans small to improve performance. However, we would like to be able to better generalize our previous experience so we next investigate a technique for learning parameterized motion plans. A parameterized motion plan is a function from planning problem parameters to a motion plan. In our approach, we learn a set of parameterized subpaths, which we can use as suggestions for a probabilistic planner, leading to substantially reduced planning times. We find that this technique is successful in several standard motion planning domains. However, as the domains get more complex, the technique produces less of an advantage. We discover that the learning problem as we have posed it is likely to be intractible, and that the complexity of the problem is due to the redundancy of the robotics platform. We suggest several possible approaches for addressing this problem as future work.by Sarah J. Finney.Ph.D

    A planning method for safe interaction between human arms and robot manipulators

    Full text link
    This paper presents a planning method based on mapping moving obstacles into C-space for safe interaction between human arms and robot manipulators. In pre-processing phase, a hybrid distance metric is defined to select neighboring sampled nodes in C-space to construct a roadmap. Then, two kinds of mapping are constructed to determine invalid and dangerous edges in the roadmap for each basic cell decomposed in workspace. For updating the roadmap when an obstacle is moving, basic cells covering the obstacle's surfaces are mapped into the roadmap by using new positions of the surfaces points sampled on the obstacle. In query phase, in order to predict and avoid coming collisions and reach the goal efficiently, an interaction strategy with six kinds of planning actions of searching, updating, walking, waiting, dodging and pausing are designed. Simulated experiments show that the proposed method is efficient for safe interaction between two working robot manipulators and two randomly moving human arms.Computer Science, Artificial IntelligenceRoboticsCPCI-S(ISTP)

    iDRM: Humanoid motion planning with realtime end-pose selection in complex environments

    Get PDF
    In this paper, we propose a novel inverse Dynamic Reachability Map (iDRM) that allows a floating base system to find valid end-poses in complex and dynamically changing environments in real-time. End-pose planning for valid stance pose and collision-free configuration is an essential problem for humanoid applications, such as providing goal states for walking and motion planners. However, this is non-trivial in complex environments, where standing locations and reaching postures are restricted by obstacles. Our proposed iDRM customizes the robot-to-workspace occupation list and uses an online update algorithm to enable efficient reconstruction of the reachability map to guarantee that the selected end-poses are always collision-free. The iDRM was evaluated in a variety of reaching tasks using the 38 degree-of-freedom (DoF) humanoid robot Valkyrie. Our results show that the approach is capable of finding valid end-poses in a fraction of a second. Significantly, we also demonstrate that motion planning algorithms integrating our end-pose planning method are more efficient than those not utilizing this technique.Comment: 8 pages, 9 figure

    Collaborative Motion Planning

    Get PDF
    Planning motion is an essential component for any autonomous robotic system. An intelligent agent must be able to efficiently plan collision-free paths in order to move through its world. Despite its importance, this problem is PSPACE-Hard which means that even planning motions for simple robots is computationally difficult. State-of-the-art approaches trade completeness (always able to provide a solution if one exists or report none exists) for probabilistic completeness (probabilistically guaranteed to find a solution if one exists but cannot report if none exists) and improved efficiency. These methods use sampling-based techniques to design a sequence of motions for the robot. However, as these methods are random in nature, the probability of their success is directly related to the expansiveness, or openness, of the underlying planning space. In other words, narrow passages, complex systems, and various constraints make planning with these methods difficult. On the other hand, humans can often determine approximate solutions for these difficult solutions quickly. In this research, we explore user-guided planning in which a human operator works together with a sampling-based motion planner. By having a human-in-the-loop, a human can steer a sampling-based planner towards a solution. This strategy can provide benefits to many applications such as computer-aided design and virtual prototyping, to name a few. We begin by classifying and creating simple models of common user-guided and heuristic-guided motion planning methods. Our models encompass three forms of user input: configuration-based, path-based, and region-based input. We compare and contrast these approaches and motivate our choice of a region-based collaborative framework. Through this analysis, we gain insight into user-guided planning and further motivate methods that harness low interface complexity and work entirely in workspace, which is most natural to a human operator. Further, we extend the theory of expansiveness to analyze the various types of user inputs. Our novel region-based collaboration framework takes advantage of human intuition by allowing a user to define regions in the workspace to bias and/or constrain the search space of a sampling-based motion planner. This approach allows a user to bias a high dimensional search with low dimensional input, supports intermittent user hints, and empowers a user to customize motion solutions. Finally, we extend region steering to both non-holonomic robotic systems and a human-inspired approach to motion planning. Our results show that this region-based framework can aid many variants of sampling-based planning, reduce computation time, support solution customization, and can be used to develop advanced heuristic methods for solving motion planning problems. We provide experiments exemplifying our approach in planning motions for complex robotic applications such as mobile manipulators, car-like, and free-flying robots

    Control of a hybrid robotic system for computer-assisted interventions in dynamic environments

    Get PDF
    International audiencePurpose Minimally invasive surgery is becoming the standard treatment of care for a variety of procedures. Surgeons need to display a high level of proficiency to overcome the challenges imposed by the minimal access. Especially when operating on a dynamic organ, it becomes very difficult to align instruments reliably and precisely. In this paper, a hybrid ro-botic system and a dedicated robotic control approach are proposed to assist the surgeon performing complex surgical gestures in a dynamic environment. Methods The proposed hybrid robotic system consists of a rigid robot arm on top of which a continuum robot is mounted in series. The continuum robot is locally actuated with McKibben muscles. A control scheme is adopted based on quadratic programming framework. It is shown that this framework allows enforcing a set of constraints on the pose of the tip, as well as of the instrument shaft, which is commanded to slide in and out through the entry point. Results Through simulation and experiments it is shown how the robot tool-tip is able to follow sinus-oidal trajectories of 0.37 Hz and 2 Hz, corresponding to motion due to breathing and heartbeat respectively, while maintaining the instrument shaft pivoting nicely about the entry point. The positioning and tracking accuracy of such system is shown to lie below 3mm in position and 5 • in angle. Herbert De Praetere is with UZ Leuven, Cardiac surgery, Conclusion The results suggest a good potential for applying the proposed technology to assist the surgeon during complex robot-assisted interventions. It is also illustrated that even when using flexible hence relatively safe end-effectors, it is possible to reach acceptable tracking behaviour at relatively high frequencies
    corecore