Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking
Agent-based source seeking problem is addressed in this paper. This problem is relevant in, e.g., in hazardous gas leak in a chemical disaster. In the cooperative search, agents develop a formation to effectively search the source by communicating one to another via a communication topology. The so...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Institut Teknologi Sepuluh Nopember
2017-10-01
|
Series: | JAREE (Journal on Advanced Research in Electrical Engineering) |
Online Access: | http://jaree.its.ac.id/index.php/jaree/article/view/21 |
id |
doaj-d69e970a805f47629c30546083dab815 |
---|---|
record_format |
Article |
spelling |
doaj-d69e970a805f47629c30546083dab8152020-11-25T00:12:01ZengInstitut Teknologi Sepuluh NopemberJAREE (Journal on Advanced Research in Electrical Engineering)2580-03612579-62162017-10-011217Comparison of Gradient Estimation in Cooperative Multi-Agent Source SeekingMochammad SahalAgent-based source seeking problem is addressed in this paper. This problem is relevant in, e.g., in hazardous gas leak in a chemical disaster. In the cooperative search, agents develop a formation to effectively search the source by communicating one to another via a communication topology. The source, or the search target, is represented by a scalar field y which might describe a temperature level, hazardous concentration of substances or vapor. Every agent has the information on its own position and the value of y at any instance. The agents are identical modeled as single and double integrator. Consensus filter is used to control the agent formation and comparison three types of gradient estimation are employed to search the source. Experiments show that the proposed schemes give good performance to solve cooperative search for source seeking problemhttp://jaree.its.ac.id/index.php/jaree/article/view/21 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Mochammad Sahal |
spellingShingle |
Mochammad Sahal Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking JAREE (Journal on Advanced Research in Electrical Engineering) |
author_facet |
Mochammad Sahal |
author_sort |
Mochammad Sahal |
title |
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking |
title_short |
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking |
title_full |
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking |
title_fullStr |
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking |
title_full_unstemmed |
Comparison of Gradient Estimation in Cooperative Multi-Agent Source Seeking |
title_sort |
comparison of gradient estimation in cooperative multi-agent source seeking |
publisher |
Institut Teknologi Sepuluh Nopember |
series |
JAREE (Journal on Advanced Research in Electrical Engineering) |
issn |
2580-0361 2579-6216 |
publishDate |
2017-10-01 |
description |
Agent-based source seeking problem is addressed in this paper. This problem is relevant in, e.g., in hazardous gas leak in a chemical disaster. In the cooperative search, agents develop a formation to effectively search the source by communicating one to another via a communication topology. The source, or the search target, is represented by a scalar field y which might describe a temperature level, hazardous concentration of substances or vapor. Every agent has the information on its own position and the value of y at any instance. The agents are identical modeled as single and double integrator. Consensus filter is used to control the agent formation and comparison three types of gradient estimation are employed to search the source. Experiments show that the proposed schemes give good performance to solve cooperative search for source seeking problem |
url |
http://jaree.its.ac.id/index.php/jaree/article/view/21 |
work_keys_str_mv |
AT mochammadsahal comparisonofgradientestimationincooperativemultiagentsourceseeking |
_version_ |
1725401683216826368 |