scientific article; zbMATH DE number 4020520
[For the entire collection see Zbl 0621.00030.] We propose a recursive algorithm for transforming fixed obstacles in the Cartesian space within the reachable volume of the robot into prohibited volumes in the n-dimensional space of joint-variables \((\theta_ 1,\theta_ 2,...,\theta_ n)\). In view of the fact that the state of the robot in this space is represented by a point, our method simplifies the detection of collisions and the generation of collision-free trajectories. This transformation algorithm is recursive not only from the point of view of joint-variables, but also from the point of view of obstacles to be transformed. Its recursiveness with respect to joint- variables allows us to apply it to the case of a robot with any number of joints. Nevertheless, since the amount of memory taken-up increases very rapidly with the number of joints, it is preferable to limit this number to four. Thus for a robot with six joints, we approximate the last three (and hand plus, eventually, the load) by a sphere. The prohibited volume is calculated in the three-dimensional space of joint-variables \((\theta_ 1,\theta_ 2,\theta_ 3)\) for the simplified robot, and refined when necessary, in the sub-space of joint-variables \((\theta_ 4,\theta_ 5,\theta_ 6).\) The recursiveness of this algorithm from the obstacle point of view allows us to convert the changes of the robot's universe (addition and suppression of obstacles happen often during the execution of an assembly task) into variations of prohibited volumes in the joint-variables space in an ``on-line manner. This permits the ``on-line readjustment of the robot's trajectory, in order to avoid unfore-seen collisions, and to perform the task in optimal time. Two examples are given, one for the RENAULT-ACMA V80 robot with six revolute joints, the other for the RENAULT-ACMA TH8 robot with four revolute and two prismatic joints. The obstacle under consideration has the form of a parallelepiped.
- Trajectory Generation and Obstacle Avoidance
- On the design of an obstacle avoiding trajectory: Method and simulation
- Motion planning in the presence of moving obstacles
- Time-optimal Dubins trajectory for moving obstacle avoidance
- Motion planning among time dependent obstacles
- Trajectory modeling of robot manipulators in the presence of obstacles
- Velocity space based concurrent obstacle avoidance and trajectory tracking for mobile robots
- Navigation of mobile robots in the presence of obstacles
- Optimal trajectory planning of robot manipulators in the presence of moving obstacles
- Motion planning in environments with low obstacle density
- Collision-free Cartesian trajectory generation using raster scanning and genetic algorithms
- Collision-free path planning and modification based on task requirements.
- A recursive algorithm for on-line clustering obstacles cluttered in dynamic environments
- Navigation of a quadratic potential with ellipsoidal obstacles
- Obstacle avoidance via articulation
- Problem of collision avoidance for a team motion with obstacles
- scientific article; zbMATH DE number 4135433 (Why is no real title available?)
- scientific article; zbMATH DE number 5649142 (Why is no real title available?)
- scientific article; zbMATH DE number 4020522 (Why is no real title available?)
- Robot Path Planning in Three-Dimensions Using the Direct Subspace
- Trajectory Generation and Obstacle Avoidance
- Collision-avoidance trajectory planning using tube concept: Analysis and simulation
- scientific article; zbMATH DE number 52637 (Why is no real title available?)
- Kollisionsfreie Bahnen für Industrieroboter. Ein Planungsverfahren. (Collisionfree tracks for industrial robots. A planning method). (Überarb. Fassung der Diss., Univ. Karlsruhe, 1987)
- Obstacle Avoidance for Manipulators
- Boundary Tracking and Obstacle Avoidance Using Gyroscopic Control
- Computer Aided Systems Theory – EUROCAST 2005
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763620)