HEURISTIC OPTIMIZATION OF MULTI-AGENT PERSISTENT SURVEILLANCE REVISIT TIME BY MINIMUM DISTANCE WEIGHT FUNCTIONS

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.

HAGHIGHI HASAN; SADATI SEYED HOSSEIN; Karimi Jalal; DEHGHAN BNADAKI SEYED MOHAMMAD MEHDI

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

Journal Paper

Paper Information

Journal: AEROSPACE KNOWLEDGE AND TECHNOLOGY JOURNAL Year:2018 | Volume:6 | Issue:2 Page(s): 129-141

Download Full-Text

Persian Verion

View:

525

Download:

Cites:

Information Journal Paper

Title

HEURISTIC OPTIMIZATION OF MULTI-AGENT PERSISTENT SURVEILLANCE REVISIT TIME BY MINIMUM DISTANCE WEIGHT FUNCTIONS

Author(s)

HAGHIGHI HASAN | SADATI SEYED HOSSEIN | Karimi Jalal | DEHGHAN BNADAKI SEYED MOHAMMAD MEHDI | Issue Writer Certificate

Keywords

PERSISTENT SURVEILLANCEQ1

MULTI-AGENT TRAVELINGQ1

BORDER PATROLLINGQ1

REVISIT TIMEQ1

HURISTIC FUNCTIONQ1

Abstract

PERSISTENT SURVEILLANCE is one of an important problem in the field of aerial investigation, BORDER PATROLLING, surveillance and search, Which distinguishes it from other matters by REVISIT TIME of major area. The main point of our problem is the minimizing of the time interval between two consecutive hits for a particular area that makes the details and dynamics tracking with higher accuracy. In this paper in order to achieve the minimum REVISIT TIME, the heuristic function based on the waypoints time age was used. This function defines the value of each point with the weight functions that optimized by genetic algorithm in several successive iterations. These optimal values are dependent on the position of major point and number of UAV. In multi-agent problems, the patrolling pattern is determined by heuristic weight function in several iterations. Some basic patterns such as lawn mover and spiral are organized to calculate the minimum traveling distance in the search area and obtain the comparative criteria for the results. The paper results lead to improved the navigation during aerial patrolling the area with the graded region, with respect to the UAV dynamics and minimum REVISIT TIME.

Cites

No record.

References

No record.

Cite

APA: Copy

HAGHIGHI, HASAN, SADATI, SEYED HOSSEIN, Karimi, Jalal, & DEHGHAN BNADAKI, SEYED MOHAMMAD MEHDI. (2018). HEURISTIC OPTIMIZATION OF MULTI-AGENT PERSISTENT SURVEILLANCE REVISIT TIME BY MINIMUM DISTANCE WEIGHT FUNCTIONS. AEROSPACE KNOWLEDGE AND TECHNOLOGY JOURNAL, 6(2 ), 129-141. SID. https://sid.ir/paper/264203/en

Vancouver: Copy

HAGHIGHI HASAN, SADATI SEYED HOSSEIN, Karimi Jalal, DEHGHAN BNADAKI SEYED MOHAMMAD MEHDI. HEURISTIC OPTIMIZATION OF MULTI-AGENT PERSISTENT SURVEILLANCE REVISIT TIME BY MINIMUM DISTANCE WEIGHT FUNCTIONS. AEROSPACE KNOWLEDGE AND TECHNOLOGY JOURNAL[Internet]. 2018;6(2 ):129-141. Available from: https://sid.ir/paper/264203/en

IEEE: Copy

HASAN HAGHIGHI, SEYED HOSSEIN SADATI, Jalal Karimi, and SEYED MOHAMMAD MEHDI DEHGHAN BNADAKI, “HEURISTIC OPTIMIZATION OF MULTI-AGENT PERSISTENT SURVEILLANCE REVISIT TIME BY MINIMUM DISTANCE WEIGHT FUNCTIONS,” AEROSPACE KNOWLEDGE AND TECHNOLOGY JOURNAL, vol. 6, no. 2 , pp. 129–141, 2018, [Online]. Available: https://sid.ir/paper/264203/en

Related Journal Papers