A linear-time algorithm for computing collision-free path on reconfigurable mesh

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)

Abstract

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 (log2 N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.

Original languageEnglish
Pages (from-to)487-496
Number of pages10
JournalParallel Computing
Volume34
Issue number9
DOIs
StatePublished - 1 Sep 2008

Fingerprint

Motion planning
Robotics
Pixels
Robots

Keywords

  • Image processing
  • Motion planning
  • Parallel algorithms
  • Path planning
  • Reconfigurable mesh
  • Robotics

Cite this

@article{86c7f39d091c4cd4b82eff2d8b4d7aa3,
title = "A linear-time algorithm for computing collision-free path on reconfigurable mesh",
abstract = "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 (log2 N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.",
keywords = "Image processing, Motion planning, Parallel algorithms, Path planning, Reconfigurable mesh, Robotics",
author = "Dajin Wang",
year = "2008",
month = "9",
day = "1",
doi = "10.1016/j.parco.2008.03.002",
language = "English",
volume = "34",
pages = "487--496",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "9",

}

A linear-time algorithm for computing collision-free path on reconfigurable mesh. / Wang, Dajin.

In: Parallel Computing, Vol. 34, No. 9, 01.09.2008, p. 487-496.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - A linear-time algorithm for computing collision-free path on reconfigurable mesh

AU - Wang, Dajin

PY - 2008/9/1

Y1 - 2008/9/1

N2 - 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 (log2 N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.

AB - 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 (log2 N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.

KW - Image processing

KW - Motion planning

KW - Parallel algorithms

KW - Path planning

KW - Reconfigurable mesh

KW - Robotics

UR - http://www.scopus.com/inward/record.url?scp=50049115548&partnerID=8YFLogxK

U2 - 10.1016/j.parco.2008.03.002

DO - 10.1016/j.parco.2008.03.002

M3 - Article

VL - 34

SP - 487

EP - 496

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 9

ER -