Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.
IEEE Computer Graphics and Applications
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Introduction to algorithms
A general algorithm for dynamic control of multilink robots
International Journal of Robotics Research
On-line robot motion planning in dynamic environments
On-line robot motion planning in dynamic environments
On-line manipulation planning for two robot arms in a dynamic environment
International Journal of Robotics Research
An effective way to represent quadtrees
Communications of the ACM
Robot Analysis and Design: The Mechanics of Serial and Parallel Manipulators
Robot Analysis and Design: The Mechanics of Serial and Parallel Manipulators
Robot Motion Planning
Practical Motion Planning in Robotics: Current Approaches and Future Directions
Practical Motion Planning in Robotics: Current Approaches and Future Directions
Modeling, Identification and Control of Robots
Modeling, Identification and Control of Robots
Motion Planning in Dynamic Environments
Motion Planning in Dynamic Environments
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Recent Developments in Motion Planning
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
3-D path planning in a dynamic environment using an octree and an artificial potential field
IROS '95 Proceedings of the International Conference on Intelligent Robots and Systems-Volume 2 - Volume 2
Planning Algorithms
Roadmap-based motion planning in dynamic environments
IEEE Transactions on Robotics
Path planning algorithm for bending robots
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Hi-index | 0.00 |
In this paper, the on-line motion planning of articulated robots in dynamic environment is investigated. We propose a practical on-line robot motion planning approach that is based upon pre-computing the global configuration space (C-space) connectivity with respect to all possible obstacle positions. The proposed motion planner consists of an off-line stage and an on-line stage. In the off-line stage, the obstacles in the C-space (C-obstacle) with respect to the obstacle positions in the workspace are computed, which are then stored using a hierarchical data structure with non-uniform 2^m trees. In the on-line stage, the real obstacle cells in the workspace are identified and the corresponding 2^m trees from the pre-computed database are superposed to construct the real-time C-space. The collision-free path is then searched in this C-space by using the A* algorithm under a multi-resolution strategy which has excellent computational efficiency. In this approach, the most time-consuming operation is performed in the off-line stage, while the on-line computing only need to deal with the real-time obstacles occurring in the dynamic environment. The minimized on-line computational cost makes it feasible for real-time on-line motion planning. The validity and efficiency of this approach is demonstrated using manipulator prototypes with 5 and 7 degree-of-freedom.