مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

246
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

87
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

DESIGNING SOLVABLE GRAPHS FOR MULTIPLE MOVING AGENTS

Pages

  41-54

Abstract

 SOLVABLE GRAPHS (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding DEADLOCKS (interceptions). In this paper, the properties of SOLVABLE GRAPHS are investigated, and a new concept in multi agent MOTION PLANNING, called Minimal SOLVABLE GRAPHSis introduced. Minimal SOLVABLE GRAPHS are the smallest graphs among SOLVABLE GRAPHS in terms of the number of vertices. Also, for the first time, the problem of deciding whether a graph is Solvable form agents is answered, and a new algorithm is presented for making an existing graph solvable and lean for a given number of agents. Finally, through an industrial example, it is demonstrated that how the findings of this paper can be used in designing and reshaping transportation networks (e.g. railways, traffic roads, AGV routs, robotic workspaces, etc.) for multiple moving agents such as trains, vehicles, and robots.

Cites

  • No record.

    • References

    Cite

    APA: Copy

    MASEHIAN, ELLIPS, & DANESHZAND, FARZANEH. (2009). DESIGNING SOLVABLE GRAPHS FOR MULTIPLE MOVING AGENTS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 2(PRE. NO. 2), 41-54. SID. https://sid.ir/paper/583530/en

    Vancouver: Copy

    MASEHIAN ELLIPS, DANESHZAND FARZANEH. DESIGNING SOLVABLE GRAPHS FOR MULTIPLE MOVING AGENTS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;2(PRE. NO. 2):41-54. Available from: https://sid.ir/paper/583530/en

    IEEE: Copy

    ELLIPS MASEHIAN, and FARZANEH DANESHZAND, “DESIGNING SOLVABLE GRAPHS FOR MULTIPLE MOVING AGENTS,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 2, no. PRE. NO. 2, pp. 41–54, 2009, [Online]. Available: https://sid.ir/paper/583530/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button