Parallel computation of configuration space on reconfigurable mesh with faults

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2 Citations (Scopus)

Abstract

The reconfigurable mesh (RMESH) can be used to compute robotic paths in presence of obstacles, in which the robot and obstacle images are represented and processed in mesh processors. For a non-point-like robot, we can compute the so-called configuration space to expand the obstacles, so that the robot can be reduced to a reference point to facilitate the robot's motion planning. In this paper, we present algorithms to compute configuration space in a reconfigurable mesh that contains sparsely distributed faulty processors. The robots of rectangular and circular shapes are treated. It will be seen that in terms of computing configuration space, reconfigurable mesh can tolerate faulty processors without much extra cost - the computation takes the optimal 0(1) time in both fault-free and faulty reconfigurable meshes.

Original languageEnglish
Title of host publicationProceedings - 2000 International Workshops on Parallel Processing, ICPP 2000
EditorsP. Sadayappan
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages259-266
Number of pages8
Volume2000-January
ISBN (Electronic)0769507719
DOIs
StatePublished - 1 Jan 2000
EventInternational Workshops on Parallel Processing, ICPP 2000 - Toronto, Canada
Duration: 21 Aug 200024 Aug 2000

Other

OtherInternational Workshops on Parallel Processing, ICPP 2000
CountryCanada
CityToronto
Period21/08/0024/08/00

Fingerprint

Reconfigurable Mesh
Parallel Computation
Configuration Space
Fault
Robot
Robots
Reference Point
Motion Planning
Motion planning
Expand
Robotics
Mesh
Path
Computing
Costs

Cite this

Jenq, J., & Wang, D. (2000). Parallel computation of configuration space on reconfigurable mesh with faults. In P. Sadayappan (Ed.), Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000 (Vol. 2000-January, pp. 259-266). [869111] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.2000.869111
Jenq, John ; Wang, Dajin. / Parallel computation of configuration space on reconfigurable mesh with faults. Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000. editor / P. Sadayappan. Vol. 2000-January Institute of Electrical and Electronics Engineers Inc., 2000. pp. 259-266
@inproceedings{c7eb67cbde2c4d6992960b55c57220b8,
title = "Parallel computation of configuration space on reconfigurable mesh with faults",
abstract = "The reconfigurable mesh (RMESH) can be used to compute robotic paths in presence of obstacles, in which the robot and obstacle images are represented and processed in mesh processors. For a non-point-like robot, we can compute the so-called configuration space to expand the obstacles, so that the robot can be reduced to a reference point to facilitate the robot's motion planning. In this paper, we present algorithms to compute configuration space in a reconfigurable mesh that contains sparsely distributed faulty processors. The robots of rectangular and circular shapes are treated. It will be seen that in terms of computing configuration space, reconfigurable mesh can tolerate faulty processors without much extra cost - the computation takes the optimal 0(1) time in both fault-free and faulty reconfigurable meshes.",
author = "John Jenq and Dajin Wang",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/ICPPW.2000.869111",
language = "English",
volume = "2000-January",
pages = "259--266",
editor = "P. Sadayappan",
booktitle = "Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Jenq, J & Wang, D 2000, Parallel computation of configuration space on reconfigurable mesh with faults. in P Sadayappan (ed.), Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000. vol. 2000-January, 869111, Institute of Electrical and Electronics Engineers Inc., pp. 259-266, International Workshops on Parallel Processing, ICPP 2000, Toronto, Canada, 21/08/00. https://doi.org/10.1109/ICPPW.2000.869111

Parallel computation of configuration space on reconfigurable mesh with faults. / Jenq, John; Wang, Dajin.

Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000. ed. / P. Sadayappan. Vol. 2000-January Institute of Electrical and Electronics Engineers Inc., 2000. p. 259-266 869111.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Parallel computation of configuration space on reconfigurable mesh with faults

AU - Jenq, John

AU - Wang, Dajin

PY - 2000/1/1

Y1 - 2000/1/1

N2 - The reconfigurable mesh (RMESH) can be used to compute robotic paths in presence of obstacles, in which the robot and obstacle images are represented and processed in mesh processors. For a non-point-like robot, we can compute the so-called configuration space to expand the obstacles, so that the robot can be reduced to a reference point to facilitate the robot's motion planning. In this paper, we present algorithms to compute configuration space in a reconfigurable mesh that contains sparsely distributed faulty processors. The robots of rectangular and circular shapes are treated. It will be seen that in terms of computing configuration space, reconfigurable mesh can tolerate faulty processors without much extra cost - the computation takes the optimal 0(1) time in both fault-free and faulty reconfigurable meshes.

AB - The reconfigurable mesh (RMESH) can be used to compute robotic paths in presence of obstacles, in which the robot and obstacle images are represented and processed in mesh processors. For a non-point-like robot, we can compute the so-called configuration space to expand the obstacles, so that the robot can be reduced to a reference point to facilitate the robot's motion planning. In this paper, we present algorithms to compute configuration space in a reconfigurable mesh that contains sparsely distributed faulty processors. The robots of rectangular and circular shapes are treated. It will be seen that in terms of computing configuration space, reconfigurable mesh can tolerate faulty processors without much extra cost - the computation takes the optimal 0(1) time in both fault-free and faulty reconfigurable meshes.

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

U2 - 10.1109/ICPPW.2000.869111

DO - 10.1109/ICPPW.2000.869111

M3 - Conference contribution

VL - 2000-January

SP - 259

EP - 266

BT - Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000

A2 - Sadayappan, P.

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Jenq J, Wang D. Parallel computation of configuration space on reconfigurable mesh with faults. In Sadayappan P, editor, Proceedings - 2000 International Workshops on Parallel Processing, ICPP 2000. Vol. 2000-January. Institute of Electrical and Electronics Engineers Inc. 2000. p. 259-266. 869111 https://doi.org/10.1109/ICPPW.2000.869111