PARALLEL PROCESSING OF ROBOT-ARM CONTROL COMPUTATION ON A MULTIMICROPROCESSOR SYSTEM.

Hironori Kasahara, Seinosuke Narita

    Research output: Contribution to journalArticle

    101 Citations (Scopus)

    Abstract

    A parallel-processing scheme is described for robot-arm control computation on any number of parallel processors. The scheme uses two multiprocessor scheduling algorithms recently developed by the authors and called, respectively, depth first/implicit heuristic search (DF/IHS) and critial path/most immediate successors first (CP/MISF). The scheme is applied to the parallel processing of dynamic control computation for the Stanford manipulator. In particular, the proposed algorithms are applied to the computation of the Newton-Euler equations of motion for the Stanford manipulator and implemented on a multimicroprocessor system. The test result was so successful that the use of six processor pairs in parallel could attain the processing time of 5. 37 ms. It is also shown that the proposed parallel-processing scheme is applicable to an arbitrary number of processors.

    Original languageEnglish
    Pages (from-to)104-113
    Number of pages10
    JournalIEEE journal of robotics and automation
    VolumeRA-1
    Issue number2
    Publication statusPublished - 1985 Jun

    Fingerprint

    Robots
    Processing
    Manipulators
    Euler equations
    Scheduling algorithms
    Equations of motion

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    PARALLEL PROCESSING OF ROBOT-ARM CONTROL COMPUTATION ON A MULTIMICROPROCESSOR SYSTEM. / Kasahara, Hironori; Narita, Seinosuke.

    In: IEEE journal of robotics and automation, Vol. RA-1, No. 2, 06.1985, p. 104-113.

    Research output: Contribution to journalArticle

    @article{bb17daf41b874af6a7dc8f28063d2339,
    title = "PARALLEL PROCESSING OF ROBOT-ARM CONTROL COMPUTATION ON A MULTIMICROPROCESSOR SYSTEM.",
    abstract = "A parallel-processing scheme is described for robot-arm control computation on any number of parallel processors. The scheme uses two multiprocessor scheduling algorithms recently developed by the authors and called, respectively, depth first/implicit heuristic search (DF/IHS) and critial path/most immediate successors first (CP/MISF). The scheme is applied to the parallel processing of dynamic control computation for the Stanford manipulator. In particular, the proposed algorithms are applied to the computation of the Newton-Euler equations of motion for the Stanford manipulator and implemented on a multimicroprocessor system. The test result was so successful that the use of six processor pairs in parallel could attain the processing time of 5. 37 ms. It is also shown that the proposed parallel-processing scheme is applicable to an arbitrary number of processors.",
    author = "Hironori Kasahara and Seinosuke Narita",
    year = "1985",
    month = "6",
    language = "English",
    volume = "RA-1",
    pages = "104--113",
    journal = "IEEE journal of robotics and automation",
    issn = "0882-4967",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - PARALLEL PROCESSING OF ROBOT-ARM CONTROL COMPUTATION ON A MULTIMICROPROCESSOR SYSTEM.

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    PY - 1985/6

    Y1 - 1985/6

    N2 - A parallel-processing scheme is described for robot-arm control computation on any number of parallel processors. The scheme uses two multiprocessor scheduling algorithms recently developed by the authors and called, respectively, depth first/implicit heuristic search (DF/IHS) and critial path/most immediate successors first (CP/MISF). The scheme is applied to the parallel processing of dynamic control computation for the Stanford manipulator. In particular, the proposed algorithms are applied to the computation of the Newton-Euler equations of motion for the Stanford manipulator and implemented on a multimicroprocessor system. The test result was so successful that the use of six processor pairs in parallel could attain the processing time of 5. 37 ms. It is also shown that the proposed parallel-processing scheme is applicable to an arbitrary number of processors.

    AB - A parallel-processing scheme is described for robot-arm control computation on any number of parallel processors. The scheme uses two multiprocessor scheduling algorithms recently developed by the authors and called, respectively, depth first/implicit heuristic search (DF/IHS) and critial path/most immediate successors first (CP/MISF). The scheme is applied to the parallel processing of dynamic control computation for the Stanford manipulator. In particular, the proposed algorithms are applied to the computation of the Newton-Euler equations of motion for the Stanford manipulator and implemented on a multimicroprocessor system. The test result was so successful that the use of six processor pairs in parallel could attain the processing time of 5. 37 ms. It is also shown that the proposed parallel-processing scheme is applicable to an arbitrary number of processors.

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

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

    M3 - Article

    AN - SCOPUS:0022074147

    VL - RA-1

    SP - 104

    EP - 113

    JO - IEEE journal of robotics and automation

    JF - IEEE journal of robotics and automation

    SN - 0882-4967

    IS - 2

    ER -