Results 1  10
of
114
The quadtree and related hierarchical data structures
 ACM Computing Surveys
, 1984
"... A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics ..."
Abstract

Cited by 453 (11 self)
 Add to MetaCart
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics. There is a greater emphasis on region data (i.e., twodimensional shapes) and to a lesser extent on point, curvilinear, and threedimensional data. A number of operations in which such data structures find use are examined in greater detail.
A fast procedure for computing the distance between complex objects in three space
 in Proc. IEEE Int. Conf. on Robotics and Automation
, 1987
"... AbstractAn efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R3 shows that the computational cost is approximately linear in the total number of vertices specifyi ..."
Abstract

Cited by 298 (8 self)
 Add to MetaCart
AbstractAn efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R3 shows that the computational cost is approximately linear in the total number of vertices specifying the two polytopes. The algorithm has special features which makes its application in a variety of robotics problems attractive. These are discussed and an example of collision detection is given. I.
The partigame algorithm for variable resolution reinforcement learning in multidimensional statespaces
 MACHINE LEARNING
, 1995
"... Partigame is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous statespaces. In high dimensions it is essential that learning does not plan uniformly over a statespace. Partigame maintains a decisiontree partitioning of statespace and applies tec ..."
Abstract

Cited by 238 (8 self)
 Add to MetaCart
(Show Context)
Partigame is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous statespaces. In high dimensions it is essential that learning does not plan uniformly over a statespace. Partigame maintains a decisiontree partitioning of statespace and applies techniques from gametheory and computational geometry to efficiently and adaptively concentrate high resolution only on critical areas. The current version of the algorithm is designed to find feasible paths or trajectories to goal regions in high dimensional spaces. Future versions will be designed to find a solution that optimizes a realvalued criterion. Many simulated problems have been tested, ranging from twodimensional to ninedimensional statespaces, including mazes, path planning, nonlinear dynamics, and planar snake robots in restricted spaces. In all cases, a good solution is found in less than ten trials and a few minutes.
On multiple moving objects
 Algorithmica
, 1987
"... This paper explores the motion planning problem for multiple mov ing objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration spacetime that represents the timevarying co ..."
Abstract

Cited by 184 (0 self)
 Add to MetaCart
This paper explores the motion planning problem for multiple mov ing objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration spacetime that represents the timevarying constraints im posed on the moving object by the other moving and stationary objects. The planner represents this spacetime approximately, using twodimensional slices. The spacetime is then searched for a collisionfree path. The paper demonstrates this approach in two domains. One domain consists of translating planar objects; the other domain consists of twolink planar articulated arms.
A Simple MotionPlanning Algorithm for General Robot Manipulators
 IEEE J. of
, 1987
"... AbstrctA simple and efficient algorithm is presented, using configuration space, to plan collisionfree motions for general manipulators. An implementation of the algorithm for manipulators made up of revolute joints is also presented. The configurationspace obstacles for an n degreeoffreedom ma ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
AbstrctA simple and efficient algorithm is presented, using configuration space, to plan collisionfree motions for general manipulators. An implementation of the algorithm for manipulators made up of revolute joints is also presented. The configurationspace obstacles for an n degreeoffreedom manipulator are approximated by sets of n 1dimensional slices, recursively built up from onedimensional slices. This obstacle representation leads to an efficient approximation of the free space outside of the configurationspace obstacles. T I.
A Search Algorithm for Motion Planning with Six Degrees of Freedom
 ARTIFICIAL INTELLIGENCE
, 1987
"... The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given highlevel specifications of tasks and geometric models of the robot and obstacles. The "Mover ..."
Abstract

Cited by 82 (4 self)
 Add to MetaCart
The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given highlevel specifications of tasks and geometric models of the robot and obstacles. The "Movers'" problem is to find a continuous, collisionfree path for a moving object through an environment containing obstacles. We present an implemented algorithm for the classical formulation of the threedimensional Movers' problem: Given an arbitrary rigid polyhedral moving object P with three translational and three rotational degrees of freedom, find a continuous, collisionfree path taking P from some initial configuration to a desired goal configuration. This paper describes an implementation of a complete algorithm (at a given resolution)for the full six degree of freedom Movers' problem. The algorithm transforms the six degree of freedom planning problem into a point navigation problem in a sixdimensional configuration space (called Cspace). The Cspace obstacles, which characterize the physically unachievable configurations, are directly represented by sixdimensional manifolds whose boundaries are fivedimensional Csurfaces. By characterizing these surfaces and their intersections, collisionfree paths may be found by the
Motion planning: A journey of robots, molecules, digital actors, and other artifacts
 International Journal of Robotics Research
, 1999
"... During the last three decades motion planning has emerged as a crucial and productive research area in robotics. In the mid80's the most advanced planners were barely able to compute collisionfree paths for objects crawling in planar workspaces. Today, planners e ciently deal with robots with ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
(Show Context)
During the last three decades motion planning has emerged as a crucial and productive research area in robotics. In the mid80's the most advanced planners were barely able to compute collisionfree paths for objects crawling in planar workspaces. Today, planners e ciently deal with robots with many degrees of freedom in complex environments. Techniques also exist to generate quasioptimal trajectories, coordinate multiple robots, deal with dynamic and kinematic constraints, and handle dynamic environments. This paper describes some of these achievements, presents new problems that have recently emerged, discusses applications likely to motivate future research, and nally gives expectations for the coming years. It stresses the fact that nonrobotics applications (e.g., graphic animation, surgical planning, computational biology) are growing in importance and are likely to shape future motion planning research more than robotics itself. 1
A Study of the Clash Detection Problem in Robotics
 In Int. Conf. Robotics & Automation
, 1985
"... To solve the clash detection problem we must decide whether a collision will occur between any pair of objects from a set of objects with known shapes and motions. We have considered three methods for performing clash detection: in the first we sample the motion at a finite number of times and perfo ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
To solve the clash detection problem we must decide whether a collision will occur between any pair of objects from a set of objects with known shapes and motions. We have considered three methods for performing clash detection: in the first we sample the motion at a finite number of times and perform interference detection at each time; in the second we create models of the shapes and their motions in spacetime, and look for intersections between these fourdimensional entities; and in the third we create models of the volumes swept out by the objects. This paper is a brief, comparative study of these three methods, and includes some details of our experiments with the first two methods as implemented in a geometric modelling system. This paper originally appeared in Int. Conf. Robotics & Automation, St. Louis, March 1985, pages 488493. c flIEEE 1985. It was reformatted using L a T E X in September 1996. Contact address: Oxford University Computing Laboratory, Wolfson Building, Par...
A Survey of Motion Planning and Related Geometric Algorithms
 Artificial Intelligence
, 1988
"... to a future generation of robots substantially more autonomous than present robotic systems, whose algorithmic and software capabilities remain rather primitive. The capabilities which this research aims to create can be grouped into three broad categories: sensing, planning, and control. Of these ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
to a future generation of robots substantially more autonomous than present robotic systems, whose algorithmic and software capabilities remain rather primitive. The capabilities which this research aims to create can be grouped into three broad categories: sensing, planning, and control. Of these three, plan
Stereo Vision Based Mapping and Navigation for Mobile Robots
, 1997
"... This paper describes a visually guided robot that can plan paths, construct maps and explore an indoor environment. The robot uses a trinocular stereo vision system to produce highly accurate depth images at 2 Hz allowing it to safely travel through the environment at 0.5 m/s. The algorithm integrat ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
This paper describes a visually guided robot that can plan paths, construct maps and explore an indoor environment. The robot uses a trinocular stereo vision system to produce highly accurate depth images at 2 Hz allowing it to safely travel through the environment at 0.5 m/s. The algorithm integrates stereo vision, occupancy grid mapping, and potential field path planning techniques to form a robust and cohesive robotic system for mapping and navigation. Stereo vision is shown to be a viable alternative to active sensing devices such as sonar and laser range finders.