Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/92756
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Aeronautical and Aviation Engineeringen_US
dc.creatorSavkin, AVen_US
dc.creatorHuang, Hen_US
dc.date.accessioned2022-05-16T09:07:34Z-
dc.date.available2022-05-16T09:07:34Z-
dc.identifier.issn1932-8184en_US
dc.identifier.urihttp://hdl.handle.net/10397/92756-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.rightsThe following publication A. V. Savkin and H. Huang, "Asymptotically Optimal Path Planning for Ground Surveillance by a Team of UAVs," in IEEE Systems Journal, vol. 16, no. 2, pp. 3446-3449, June 2022 is available at https://dx.doi.org/10.1109/JSYST.2021.3117850.en_US
dc.subjectAerial dronesen_US
dc.subjectAerial surveillanceen_US
dc.subjectCoverage controlen_US
dc.subjectMarine surface vehiclesen_US
dc.subjectMobile robotsen_US
dc.subjectNavigationen_US
dc.subjectPath planningen_US
dc.subjectSweep coverageen_US
dc.subjectUnmanned aerial vehicles (UAVs)en_US
dc.titleAsymptotically optimal path planning for ground surveillance by a team of UAVsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage3446en_US
dc.identifier.epage3449en_US
dc.identifier.volume16en_US
dc.identifier.issue2en_US
dc.identifier.doi10.1109/JSYST.2021.3117850en_US
dcterms.abstractThis letter addresses a path planning problem for a team of mobile robots, such as unmanned aerial vehicles, patrolling a ground region for surveillance. An effective navigation algorithm is developed and proved to be asymptotically optimal in the sense that the ratio of the revisit period of the algorithm and the minimum possible revisit period converges to one as the area of the region tends to infinity. Illustrative examples and comparisons with an existing method show the efficiency of the developed approach.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE systems journal, June 2022, v. 16, no. 2, p. 3446-3449en_US
dcterms.isPartOfIEEE systems journalen_US
dcterms.issued2022-06-
dc.identifier.scopus2-s2.0-85118265385-
dc.identifier.eissn1937-9234en_US
dc.description.validate202205 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberAAE-0014-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextAustralian Government; ONR MURI; Australian Research Councilen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS57563116-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Savkin_Asymptotically_Optimal_Path.pdfPre-Published version1.36 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

43
Last Week
0
Last month
Citations as of May 19, 2024

Downloads

35
Citations as of May 19, 2024

SCOPUSTM   
Citations

8
Citations as of May 16, 2024

WEB OF SCIENCETM
Citations

10
Citations as of May 16, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.