<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahrood University of Technology</PublisherName>
				<JournalTitle>Journal of Solid and Fluid Mechanics</JournalTitle>
				<Issn>2251-9475</Issn>
				<Volume>12</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>03</Month>
					<Day>21</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Distributed Coverage Control of a Multi Agent System in a Disaster Area and Localizing the Stationary Probable Targets in the Environment</ArticleTitle>
<VernacularTitle>Distributed Coverage Control of a Multi Agent System in a Disaster Area and Localizing the Stationary Probable Targets in the Environment</VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>20</LastPage>
			<ELocationID EIdType="pii">2420</ELocationID>
			
<ELocationID EIdType="doi">10.22044/jsfm.2022.11058.3442</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Aminzadeh</LastName>
<Affiliation>Aerospace , KNTU</Affiliation>

</Author>
<Author>
					<FirstName>Abdolmajid</FirstName>
					<LastName>Khoshnood</LastName>
<Affiliation>K.N. Toosi university of technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>08</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>This paper is dedicated to a cooperative search and coverage problem in which we applied a distributed coverage control algorithm for automated victim search using a cooperative multi-UAVs system. Disaster management is a competition with time. So, fast response to disaster can significantly decrease damages and losses. It is obvious that a comprehensive map of the affected area immediately after disaster occurred, helps disaster control unit to quickly and initially evaluate the degree of damages, amount of economic losses and casualties. Therefore, they can plan for disaster management operations with more and detailed information. We considered a rectangular surveillance region in which four fixed-wing UAVs fly over the affected area to exactly localize the 18 stationary targets randomly distributed in the environment, as well as maximizing the coverage. For this purpose, UAVs cooperatively build the cognitive maps including Target Probability Map and Uncertainty Map. Then based on cognitive map and also their prediction from three steps ahead of their own and also neighboring agents moves, UAVs decide about their optimal collision-free paths. Comparison between cooperative and non-cooperative methods indicates that in cooperative distributed scheme, coverage percentage and global average uncertainty converges to their admissible maximum and minimum value in a considerably less time, respectively.</Abstract>
			<OtherAbstract Language="FA">This paper is dedicated to a cooperative search and coverage problem in which we applied a distributed coverage control algorithm for automated victim search using a cooperative multi-UAVs system. Disaster management is a competition with time. So, fast response to disaster can significantly decrease damages and losses. It is obvious that a comprehensive map of the affected area immediately after disaster occurred, helps disaster control unit to quickly and initially evaluate the degree of damages, amount of economic losses and casualties. Therefore, they can plan for disaster management operations with more and detailed information. We considered a rectangular surveillance region in which four fixed-wing UAVs fly over the affected area to exactly localize the 18 stationary targets randomly distributed in the environment, as well as maximizing the coverage. For this purpose, UAVs cooperatively build the cognitive maps including Target Probability Map and Uncertainty Map. Then based on cognitive map and also their prediction from three steps ahead of their own and also neighboring agents moves, UAVs decide about their optimal collision-free paths. Comparison between cooperative and non-cooperative methods indicates that in cooperative distributed scheme, coverage percentage and global average uncertainty converges to their admissible maximum and minimum value in a considerably less time, respectively.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Cooperative Coverage Control</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Distributed Control</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Planning Tree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Disaster recovery</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Receding Horizon Control Scheme</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jsfm.shahroodut.ac.ir/article_2420_8d1fa726c39425c5906c7a53a78a9fb8.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
