### Refine

#### Year of publication

#### Document Type

- Article (42) (remove)

#### Keywords

- AG-RESY (41)
- PARO (29)
- SKALP (14)
- HANDFLEX (8)
- Robotik (5)
- motion planning (5)
- SIMERO (4)
- industrial robots (4)
- parallel processing (4)
- safe human robot cooperation (4)
- Kooperation (3)
- LOADBAL (3)
- Mensch-Roboter-Kooperation (3)
- search algorithms (3)
- CODET (2)
- RODEO (2)
- SWEEPING (2)
- human robot cooperation (2)
- load balancing (2)
- on-line algorithms (2)
- parallel algorithms (2)
- path planning (2)
- Assembly (1)
- Bewegungsplanung (1)
- Force-Torque (1)
- Fräsen (1)
- GRAPHICS (1)
- Hybridregler (1)
- Kollisionserkennung (1)
- Kraftregelung (1)
- Manipulation skills (1)
- Mensch-Roboter-Koexistenz (1)
- Netz-Architekturen (1)
- Netzwerkmanagement (1)
- Operationsroboter (1)
- PC-based robot control (1)
- PI-Regler (1)
- PVM (1)
- Parallel Virtual Machines (1)
- RONAF (1)
- Regler (1)
- Reglerentwurf (1)
- Robotics (1)
- SIMD architectures (1)
- Schädelbasis (1)
- Sicherheit (1)
- Suchve (1)
- VIROP (1)
- Workstation-Cluster (1)
- autonomous systems (1)
- bi-directional search (1)
- branch-and-bound (1)
- client/server-architecture (1)
- collision detection (1)
- combinatorial algorithms (1)
- deformable objects (1)
- discretization (1)
- display algorithms (1)
- distributed and parallel processing (1)
- distributed computing (1)
- distributed control system (1)
- distributed processing (1)
- efficiency (1)
- force control (1)
- force following (1)
- frame buffer operations (1)
- graph search (1)
- graphic processors (1)
- hybrid control (1)
- hypercubes (1)
- idle times (1)
- kraftbasiertes Führen (1)
- load sharing (1)
- local communication (1)
- off-line programming (1)
- operations research (1)
- optimization (1)
- parallelism and concurrency (1)
- programming by demonstration (1)
- raster graphics (1)
- Review (1)
- rings (1)
- robot calibration (1)
- robot control architectures (1)
- robot motion planning (1)
- robotergestützt (1)
- robotics (1)
- safe human robot coexistence (1)
- search algorithm (1)
- search alogorithms (1)
- seed filling (1)
- sensor fusion (1)
- shortest sequence (1)
- static load balancing (1)
- tori (1)
- trajectory optimization (1)
- traveling salesman problem (1)
- virtual programming (1)

For the online collision detection with a multi-arm robot a fast method for computing the so-called collision vector is presented. Manipulators and obstacles are modelled by sets of convex polytopes. Known distance algorithms serve as a foundation. To speed up the collision detection dynamic obstacles are approximated by geometric primitives and organized in hierarchies. On-line, the here introduced Dynamic Hierarchies are adjusted to the current arm configuration. A comparison with previous methods shows an increased acceleration of the computations.

Four different initialization methods for parallel Branch-and-bound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search tree. Furthermore, the fourth method offers the best efficiency of the overall algorithm when a centralized OPEN set is used. Experimental results by a PRAM simulation support these statements.

This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms require only a constant size working memory. The methods presented are based on the so-called "seed fill" algorithms using the internal connectivity of the region with a given inner point. Basic methods as well as additional heuristics for speeding up the algorithm are described and verified. For different classes of regions, the time complexity of the algorithms is compared using empirical results.

Load balancing is one of the central problems that have to be solved in parallel computation. Here, the problem of distributed, dynamic load balancing for massive parallelism is addressed. A new local method, which realizes a physical analogy to equilibrating liquids in multi-dimensional tori or hypercubes, is presented. It is especially suited for communication mechanisms with low set-up to transfer ratio occurring in tightly-coupled or SIMD systems. By successive shifting single load elements to the direct neighbors, the load is automatically transferred to lightly loaded processors. Compared to former methods, the proposed Liquid model has two main advantages. First, the task of load sharing is combined with the task of load balancing, where the former has priority. This property is valuable in many applications and important for highly dynamic load distribution. Second, the Liquid model has high efficiency. Asymptotically, it needs O(D . K . Ldiff ) load transfers to reach the balanced state in a D-dimensional torus with K processors per dimension and a maximum initial load difference of Ldiff . The Liquid model clearly outperforms an earlier load balancing approach, the nearest-neighbor-averaging. Besides a survey of related research, analytical results within a formal framework are derived. These results are validated by worst-case simulations in one-and two-dimensional tori with up to two thousand processors.

One of the many features needed to support the activities of autonomous systems is the ability of motion planning. It enables robots to move in their environment securely and to accomplish given tasks. Unfortunately, the control loop comprising sensing, planning, and acting has not yet been closed for robots in dynamic environments. One reason involves the long execution times of the motion planning component. A solution for this problem is offered by the use of highly computational parallelism. Thus, an important task is the parallelization of existing motion planning algorithms for robots so that they are suitable for highly computational parallelism. In several cases, completely new algorithms have to be designed, so that a parallelization is feasible. In this survey, we review recent approaches to motion planning using parallel computation.

We have presented a novel approach to parallel motion planning for robot manipulators in 3D workspaces. The approach is based on arandomized parallel search algorithm and focuses on solving the path planning problem for industrial robot arms working in a reasonably cluttered workspace. The path planning system works in the discretized con guration space, which needs not to be represented explicitly. The parallel search is conducted by a number of rule-based sequential search processes, which work to find a path connecting the initial con guration to the goal via a number of randomly generated subgoal con gurations. Since the planning performs only on-line collision tests with proper proximity information without using pre-computed information, the approach is suitable for planning problems with multirobot or dynamic environments. The implementation has been carried outontheparallel virtual machine (PVM) of a cluster of SUN4 workstations and SGI machines. The experimental results have shown that the approach works well for a 6-dof robot arm in a reasonably cluttered environment, and that parallel computation increases the e ciency of motion planning signi cantly.

The paper presents a novel approach to parallel motion planning for robot manipulators in 3D workspaces. The approach is based on a randomized parallel search algorithm and focuses on solving the path planning problem for industrial robot arms working in a reasonably cluttered workspace. The path planning system works in the discretized configuration space which needs not to be represented explicitly. The parallel search is conducted by a number of rule-based sequential search processes, which work to nd a path connecting the initial configuration to the goal via a number of randomly generated subgoal configurations. Since the planning performs only on-line collision tests with proper proximity information without using pre-computed information, the approach is suitable for planning problems with multirobot or dynamic environments. The implementation has been carried out on the parallel virtual machine (PVM) of a cluster of SUN4 workstations and SGI machines. The experimental results have shown that the approach works well for a 6-dof robot arm in a reasonably cluttered environment, and that parallel computation increases the efficiency of motion planning significantly.

One of the many features needed to support the activities of autonomous systems is the ability of motion planning. It enables robots to move in their environment securely and to accomplish given tasks. Unfortunately, the control loop comprising sensing, planning, and acting has not yet been closed for robots in dynamic environments. One reason involves the long execution times of the motion planning component. A solution for this problem is offered by the use of highly computational parallelism. Thus, an important task is the parallelization of existing motion planning algorithms for robots so that they are suitable for highly computational parallelism. In several cases, completely new algorithms have to be designed, so that a parallelization is feasible. In this survey, we review recent approaches to motion planning using parallel computation. As a classification scheme, we use the structure given by the different approaches to the robot's motion planning. For each approach, the available parallel processing methods are discussed. Each approach is uniquely assigned a class. Finally, for each referenced research work, a list of keywords is given.