Results 1 - 10 of 4,867

Robotic Path Planning

by Barbara T. Switzer, Barbara T. Switzer, Walter A. Wolf, Feredoun Kazemian, Al Biles , 1993
"... Planning can be used in a variety of applications. In this paper we will discuss those planning techniques that ^PPly to the task of robotic path planning- Here a planner is used to generate "paths " which a robot can follow to maneuver from some point A to another point B, while at the sa ..."
Abstract - Add to MetaCart
Planning can be used in a variety of applications. In this paper we will discuss those planning techniques that ^PPly to the task of robotic path planning- Here a planner is used to generate "paths " which a robot can follow to maneuver from some point A to another point B, while

Vision-Based Robot Path Planning

by Ales Ude, Rüdiger Dillmann - IN ADVANCES IN ROBOT KINEMATICS AND COMPUTATIONAL GEOMETRY , 1994
"... We present a vision-based approach to robot path planning. The programmer demonstrates a desired motion by moving an object to be manipulated with his own hand. His performance is measured with a stereo vision system. The demonstrated motion is reconstructed with the help of a non-parametric regress ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
We present a vision-based approach to robot path planning. The programmer demonstrates a desired motion by moving an object to be manipulated with his own hand. His performance is measured with a stereo vision system. The demonstrated motion is reconstructed with the help of a non

BENCHMARKING ROBOT PATH PLANNING

by Andrew N. Hand, Jagruthi Godugu, Kaveh Ashenayi, Theodore W. Manikas, Roger L. Wainwright
"... The University of Tulsa, among other research institutions, performs research exploring the possibility of using Genetic Algorithms (GA’s) to develop an algorithm for autonomous robot navigation. We have achieved significant success in this area. However, we encountered a problem. We realized there ..."
Abstract - Add to MetaCart
The University of Tulsa, among other research institutions, performs research exploring the possibility of using Genetic Algorithms (GA’s) to develop an algorithm for autonomous robot navigation. We have achieved significant success in this area. However, we encountered a problem. We realized

Vision-Based Robot Path Planning

by unknown authors
"... Abstract { We present a vision-based approach to robot path planning. The programmer demon-strates a desired motion by moving an object to be manipulated with his own hand. His performance is measured with a stereo vision system. The demonstrated motion is reconstructed with the help of a non-parame ..."
Abstract - Add to MetaCart
Abstract { We present a vision-based approach to robot path planning. The programmer demon-strates a desired motion by moving an object to be manipulated with his own hand. His performance is measured with a stereo vision system. The demonstrated motion is reconstructed with the help of a non

Analog VLSI for Robot Path Planning

by Mircea Stan, Wayne P. Burleson, Christopher I. Connolly, Roderic A. Grupen - Journal of VLSI Signal Processing , 1994
"... : Analog VLSI provides a convenient and high-performance engine for robot path planning. Laplace's equation is a useful formulation of the path planning problem; however, digital solutions are very expensive. Since high precision is not required an analog approach is attractive. A resistive net ..."
Abstract - Cited by 16 (3 self) - Add to MetaCart
: Analog VLSI provides a convenient and high-performance engine for robot path planning. Laplace's equation is a useful formulation of the path planning problem; however, digital solutions are very expensive. Since high precision is not required an analog approach is attractive. A resistive

Probabilistic Roadmaps for Robot Path Planning

by Lydia E. Kavraki, Jean-Claude Latombe , 1998
"... The Probabilistic RoadMap planner (PRM) has been applied with success to multiple planning problems involving robots with 3 to 16 degrees of freedom (dof) operating in known static environments. This paper describes the planner and reports on experimental and theoretical results related to its perfo ..."
Abstract - Cited by 67 (5 self) - Add to MetaCart
of the robot to two nodes of the roadmap and computes a path through the roadmap between these two nodes. The planner is able to find paths involving robots with 10 dof in a fraction of a second after relatively short times for preprocessing (a few dozen seconds). Theoretical analysis of the PRM algorithm

Metaheuristic Algorithm for Robotic Path Planning

by Yogita Gigras, Kusum Gupta
"... This paper presents a metaheuristic optimization algorithm for mobile robot path planning problem. A comparative study between particle swarm and ant colony optimization algorithm is conducted. The experimental study shows that the ant colony optimization algorithm outperforms over particle swarm op ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper presents a metaheuristic optimization algorithm for mobile robot path planning problem. A comparative study between particle swarm and ant colony optimization algorithm is conducted. The experimental study shows that the ant colony optimization algorithm outperforms over particle swarm

Modeling Robot Path Planning with CD++

by Gabriel Wainer
"... Abstract. Robotic systems are usually built as independent agents that collaborate to accomplish a specific task. Analysis of robot path planning consists of route planning and path generation. We will show how to apply the Cell-DEVS formalism and the CD++ toolkit for these tasks. We present a Cell- ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Robotic systems are usually built as independent agents that collaborate to accomplish a specific task. Analysis of robot path planning consists of route planning and path generation. We will show how to apply the Cell-DEVS formalism and the CD++ toolkit for these tasks. We present a Cell

Exact Collision Checking Of Robot Paths

by Fabian Schwarzer, Mitul Saha, Jean-claude Latombe , 2002
"... This paper describes a new efficient collision checker to test single straight-line segments in c-space, sequences of such segments, or more complex paths. This checker is particularly suited for probabilistic roadmap (PRM) planners applied to manipulator arms and multi-robot systems. Such planners ..."
Abstract - Cited by 34 (5 self) - Add to MetaCart
This paper describes a new efficient collision checker to test single straight-line segments in c-space, sequences of such segments, or more complex paths. This checker is particularly suited for probabilistic roadmap (PRM) planners applied to manipulator arms and multi-robot systems. Such planners

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces

by Lydia Kavraki, Petr Svestka, Jean-claude Latombe, Mark Overmars - 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 collision-free configurations and whose edg ..."
Abstract - Cited by 1277 (120 self) - Add to MetaCart
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
Results 1 - 10 of 4,867