Probabilistic Roadmaps with Higher Expressive Power

2016 ◽  
Vol 25 (04) ◽  
pp. 1650027
Author(s):  
Amol D. Mali

Sampling-based motion planning had an enormous impact on robot motion planning because of its efficiency and scalability. Many sampling-based motion planners construct a probabilistic roadmap (PRM) that captures the connectivity of the robot's free configuration space. A valid node of a PRM contains a collision-free robot configuration (also known as a sample) and a valid edge of a PRM connects two valid nodes with a collision-free path. Nodes connected by an edge are usually also required to satisfy additional requirements based on the distance between them. PRM planners use PRMs. Increasing the expressive power will allow PRMs to be used for a wider set of motion planning problems. In this paper we report on increasing the expressive power of PRMs by including the following five features in PRMs-nodes with multiple samples that need not be organized as a graph, temporal intervals of validity of nodes and edges, nodes with samples of multiple robots, special edges for the state transitions performed by humans sharing a workspace with robots, and conditional validity of samples and edges. We report on motion planning problems solvable using these new features.

2018 ◽  
Vol 37 (13-14) ◽  
pp. 1796-1825 ◽  
Author(s):  
Caelan Reed Garrett ◽  
Tomás Lozano-Pérez ◽  
Leslie Pack Kaelbling

This paper presents a general-purpose formulation of a large class of discrete-time planning problems, with hybrid state and control-spaces, as factored transition systems. Factoring allows state transitions to be described as the intersection of several constraints each affecting a subset of the state and control variables. Robotic manipulation problems with many movable objects involve constraints that only affect several variables at a time and therefore exhibit large amounts of factoring. We develop a theoretical framework for solving factored transition systems with sampling-based algorithms. The framework characterizes conditions on the submanifold in which solutions lie, leading to a characterization of robust feasibility that incorporates dimensionality-reducing constraints. It then connects those conditions to corresponding conditional samplers that can be composed to produce values on this submanifold. We present two domain-independent, probabilistically complete planning algorithms that take, as input, a set of conditional samplers. We demonstrate the empirical efficiency of these algorithms on a set of challenging task and motion planning problems involving picking, placing, and pushing.


Author(s):  
David Hägele ◽  
Moataz Abdelaal ◽  
Ozgur S. Oguz ◽  
Marc Toussaint ◽  
Daniel Weiskopf

Abstract Nonlinear programming is a complex methodology where a problem is mathematically expressed in terms of optimality while imposing constraints on feasibility. Such problems are formulated by humans and solved by optimization algorithms. We support domain experts in their challenging tasks of understanding and troubleshooting optimization runs of intricate and high-dimensional nonlinear programs through a visual analytics system. The system was designed for our collaborators’ robot motion planning problems, but is domain agnostic in most parts of the visualizations. It allows for an exploration of the iterative solving process of a nonlinear program through several linked views of the computational process. We give insights into this design study, demonstrate our system for selected real-world cases, and discuss the extension of visualization and visual analytics methods for nonlinear programming. Graphic abstract


Sign in / Sign up

Export Citation Format

Share Document