PLANNING OF COVERING AND MINE SWEEPING OPERATIONS FOR MULTIPLE ROBOTS IN UNKNOWN ENVIRONMENTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MIRDAR HARIJANI A.; MASIHIAN E.

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

Journal Paper

Paper Information

Journal: Advanced Defense Science and Technology Year:2012 | Volume:3 | Issue:1 (7) Page(s): 57-71

Download Full-Text

Persian Verion

View:

836

Download:

Cites:

Information Journal Paper

Title

PLANNING OF COVERING AND MINE SWEEPING OPERATIONS FOR MULTIPLE ROBOTS IN UNKNOWN ENVIRONMENTS

Author(s)

MIRDAR HARIJANI A. | MASIHIAN E. | Issue Writer Certificate

Keywords

COVERINGQ3

MINESWEEPINGQ3

MULTI ROBOT MOTION PLANNINGQ3

TSPQ3

CLUSTERINGQ2

Abstract

In parallel with advances in robots hardware, the motion planning science has become increasingly indispensable and complicated, and enables robots to enhance their capabilities in applications where the presence of humans is impractical or hazardous. The COVERING and MINESWEEPING operations of outdoor areas are examples of such applications. This paper deals with the problem of COVERING and MINESWEEPING of unknown environments by multiple mobile robots which have cooperative interactions. For searching the space, the new method of multi sensor-based random trees (MSRT) is developed, and for planning the robots' paths toward the scattered items and their collection, a mathematical model similar to the multiple traveling salesman problem is proposed, which together with the k-means CLUSTERING, the A* search, and the visibility graph techniques plans the route of each robot. Comparisons with the counterpart mathematic model solved to optimality showed that the proposed method produces suboptimal solutions in much shorter computational times.

Cites

No record.

References

No record.

Cite

APA: Copy

MIRDAR HARIJANI, A., & MASIHIAN, E.. (2012). PLANNING OF COVERING AND MINE SWEEPING OPERATIONS FOR MULTIPLE ROBOTS IN UNKNOWN ENVIRONMENTS. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, 3(1 (7)), 57-71. SID. https://sid.ir/paper/167451/en

Vancouver: Copy

MIRDAR HARIJANI A., MASIHIAN E.. PLANNING OF COVERING AND MINE SWEEPING OPERATIONS FOR MULTIPLE ROBOTS IN UNKNOWN ENVIRONMENTS. (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY[Internet]. 2012;3(1 (7)):57-71. Available from: https://sid.ir/paper/167451/en

IEEE: Copy

A. MIRDAR HARIJANI, and E. MASIHIAN, “PLANNING OF COVERING AND MINE SWEEPING OPERATIONS FOR MULTIPLE ROBOTS IN UNKNOWN ENVIRONMENTS,” (JOURNAL OF ADVANCED DEFENCE SCIENCE AND TECHNOLOGY) JOURNAL OF PASSIVE DEFENCE SCIENCE AND TECHNOLOGY, vol. 3, no. 1 (7), pp. 57–71, 2012, [Online]. Available: https://sid.ir/paper/167451/en

Related Journal Papers