Results 1  10
of
391
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two nodes. The method is general and easy to implement. It can be applied to virtually any type of holonomic robot. It requires selecting certain parameters (e.g., the duration of the learning phase) whose values depend on the scene, that is the robot and its workspace. But these values turn out to be relatively easy to choose, Increased efficiency can also be achieved by tailoring some components of the method (e.g., the local planner) to the considered robots. In this paper the method is applied to planar articulated robots with many degrees of freedom. Experimental results show that path planning can be done in a fraction of a second on a contemporary workstation (=150 MIPS), after learning for relatively short periods of time (a few dozen seconds)
Vision for Mobile Robot Navigation: A Survey
 IEEE, TRANS. PAMI
, 2002
"... This paper surveys the developments of the last 20 years in the area of vision for mobile robot navigation. Two major components of the paper deal with indoor navigation and outdoor navigation. For each component, we have further subdivided our treatment of the subject on the basis of structured an ..."
Abstract

Cited by 216 (4 self)
 Add to MetaCart
This paper surveys the developments of the last 20 years in the area of vision for mobile robot navigation. Two major components of the paper deal with indoor navigation and outdoor navigation. For each component, we have further subdivided our treatment of the subject on the basis of structured and unstructured environments. For indoor robots in structured environments, we have dealt separately with the cases of geometrical and topological models of space. For unstructured environments, we have discussed the cases of navigation using optical flows, using methods from the appearancebased paradigm, and by recognition of specific objects in the environment.
A Fast Algorithm for Incremental Distance Calculation
 In IEEE International Conference on Robotics and Automation
, 1991
"... A simple and efficient algorithm for finding the closest points between two convex polyhedra is described here. Data from numerous experiments tested on a broad set of convex polyhedra on ! 3 show that the running time is roughly constant for finding closest points when nearest points are approxim ..."
Abstract

Cited by 191 (5 self)
 Add to MetaCart
(Show Context)
A simple and efficient algorithm for finding the closest points between two convex polyhedra is described here. Data from numerous experiments tested on a broad set of convex polyhedra on ! 3 show that the running time is roughly constant for finding closest points when nearest points are approximately known and is linear in total number of vertices if no special initialization is done. This algorithm can be used for collision detection, computation of the distance between two polyhedra in threedimensional space, and other robotics problems. It forms the heart of the motion planning algorithm of [1]. 1 Introduction In this paper we present a simple method for finding and tracking the closest points on a pair of convex polyhedra. The method is generally applicable, but is especially well suited to repetitive distance calculation as the objects move in a sequence of small, discrete steps. The method works by finding and maintaining the pair of closest features (vertex, edge, or face)...
Pathplanning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
 ALGORITHMICA
, 1987
"... The problem of path planning for an automaton moving in a twodimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is impos ..."
Abstract

Cited by 189 (3 self)
 Add to MetaCart
The problem of path planning for an automaton moving in a twodimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's "'tactile sensor. " This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worstcase lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worstcase upper bounds on the length of generated paths are produced.
Solving geometric problems with the rotating calipers
, 1983
"... Shamos [1] recently showed that the diameter of a convex nsided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several se ..."
Abstract

Cited by 151 (14 self)
 Add to MetaCart
(Show Context)
Shamos [1] recently showed that the diameter of a convex nsided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be used on several convex polygons simultaneously. We then show that these generalizations allow us to obtain simple O(n) algorithms for solving a variety of problems defined on convex polygons. Such problems include (1) finding the minimumarea rectangle enclosing a polygon, (2) computing the maximum distance between two polygons, (3) performing the vectorsum of two polygons, (4) merging polygons in a convex hull finding algorithms, and (5) finding the critical support lines between two polygons. Finding the critical support lines, in turn, leads to obtaining solutions to several additional problems concerned with visibility, collision, avoidance, range fitting, linear separability, and computing the Grenander distance between sets. 1.
Mechanics and planning of manipulator pushing operations
 International Journal of Robotics Research
, 1986
"... Pushing is an essential component of many manipulator operations. This paper presents a theoretical exploration of the mechanics of pushing and demonstrates application of the theory to analysis and synthesis of robotic manipulator operations. 1. ..."
Abstract

Cited by 139 (20 self)
 Add to MetaCart
Pushing is an essential component of many manipulator operations. This paper presents a theoretical exploration of the mechanics of pushing and demonstrates application of the theory to analysis and synthesis of robotic manipulator operations. 1.
Efficient Collision Detection for Animation and Robotics
, 1993
"... We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two ..."
Abstract

Cited by 126 (18 self)
 Add to MetaCart
(Show Context)
We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two convex polyhedra. It utilizes convexity to establish some local applicability criteria for verifying the closest features. A preprocessing procedure is used to subdivide each feature's neighboring features to a constant size and thus guarantee expected constant running time for each test. The expected constant time performance is an attribute from exploiting the geometric coherence and locality. Let n be the total number of features, the expected run time is between O( p n) and O(n) ...
Assembly Maintainability Study with Motion Planning", presented at
 IEEE International Conference on Robotics and Automation
, 1995
"... ..."
Intelligent Camera Control in a Virtual Environment
 In Proceedings of Graphics Interface ’94
, 1994
"... problematic and forces the human VE participant to attend to the interface and its control knobs in addition to or instead of the goals and constraints of the task at hand. If the intention of the human VE participant is, e.g., to observe some object X, then allowing him or her to simply tell the ..."
Abstract

Cited by 86 (1 self)
 Add to MetaCart
(Show Context)
problematic and forces the human VE participant to attend to the interface and its control knobs in addition to or instead of the goals and constraints of the task at hand. If the intention of the human VE participant is, e.g., to observe some object X, then allowing him or her to simply tell the system, Show me object X is a more direct and productive interface. This is an instance of task level interaction. In earlier work we characterized the levels of abstraction at which one can interact with virtual objects and processes, and we described the varying access panels one obtains (5). Here we will describe a system for specifying behaviors for virtual cameras in terms of task level goals and constraints. As in our earlier work on camera control (6, 7), we make task level control available as well as enabling various direct manipulation metaphors. This paper describes a framework for exploring intelligent camera controls in a 3D virtual environment. It presents a methodology for ...