Motion planning among time dependent obstacles
Acta Informatica
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
A neighbor-finding algorithm for bincode-based images on reconfigurable meshes
The Computer Journal
Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Computing the configuration space for a convex robot on hypercube multiprocessors
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Parallel Computation of Configuration Space on Reconfigurable Mesh with Faults
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Efficient parallel algorithms on reconfiguration mesh architectures
Efficient parallel algorithms on reconfiguration mesh architectures
Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer
IEEE Transactions on Pattern Analysis and Machine Intelligence
Two algorithms for a reachability problem in one-dimensional space
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
The reconfigurable mesh (RMESH) is an array of mesh-connected processors equipped with a reconfigurable bus system, which can dynamically connect the processors in various patterns. A 2D reconfigurable mesh can be used to solve motion planning problems in robotics research, in which the 2D image of robot and obstacles are digitized and represented one pixel per processor. In this paper, we present an algorithm to compute a collision-free path between two points in an environment containing obstacles. The time complexity of the algorithm is O(k) for each pair of source/destination points, with O(log^2N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.