首页> 外文会议>IEEE International Conference on Control Automation >Distributed sourcing seeking via stochastic approximation algorithm with expanding truncations
【24h】

Distributed sourcing seeking via stochastic approximation algorithm with expanding truncations

机译:通过具有扩展截断的随机逼近算法进行分布式寻源

获取原文

摘要

We investigate the problem of distributed source seeking with velocity actuated and force actuated vehicles by developing distributed Kiefer-Wolfowitz algorithm. First, based on stochastic approximation algorithm with expanding truncations, we present the distributed Kiefer-Wolfowitz algorithm, in which two noisy observations of each agent's objective function is used to estimate its gradient and for each agent, a new iterative estimation is produced by its and its neighbors' measurements. Then, we present source seeking algorithms for velocity actuated and force actuated vehicles without no exact form of objective function. The convergence of the algorithm is proven and compared with the existing similar work, boundedness condition for convergence is eliminate and more kinds of measurement noise can be allowed. Finally, numerical simulations are given to illustrate the effectiveness of the proposed algorithm.
机译:通过开发分布式Kiefer-Wolfowitz算法,我们研究了速度驱动和力驱动车辆的分布式源搜索问题。首先,基于具有截断扩展的随机逼近算法,我们提出了分布式Kiefer-Wolfowitz算法,其中使用每个代理的目标函数的两个嘈杂观测值来估计其梯度,并且对于每个代理,由其和生成新的迭代估计它的邻居的测量。然后,我们提出了没有精确形式的目标函数的速度驱动和力驱动车辆的源搜索算法。证明了该算法的收敛性,并且与现有的类似工作相比,消除了收敛的有界条件,可以允许更多种测量噪声。最后,通过数值仿真说明了该算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号