In this paper we propose an algorithm for distributed optimization in mobile nodes. Compared with many published works, an important consideration here is that the nodes do not know the cost function beforehand. Instead of decision-making based on linear combination of the neighbor estimates, the proposed algorithm relies on information-rich nodes that are iteratively identified. To quickly find these nodes, the algorithm adopts a larger step size during the initial iterations. The proposed algorithm can be used in many different applications, such as distributed odor source localization and mobile robots. Comparative simulation results are presented to support the proposed algorithm.
|Number of pages
|Conference proceedings : ... Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Conference
|Published - 2013
|2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2013 - Osaka, Japan
Duration: Jul 3 2013 → Jul 7 2013
PubMed: MeSH publication types
- Journal Article