Abstract
Inspired by the concept of recently proposed dual control for exploration and exploitation, this article presents a multistep dual control for exploration and exploitation with guaranteed convergence in search for autonomous sources. To deal with an unknown source position and environment, the proposed dual control algorithm faces significant challenges in demonstrating its recursive feasibility and convergence. With the help of the properties of Bayesian estimators, we redesign a multistep dual control for exploitation and exploration algorithm with necessary terminal ingredients and show that the recursive feasibility and the convergence of the modified dual control algorithm are guaranteed. Two simulation scenarios are conducted, which demonstrate that the proposed algorithm outperforms the stochastic model-predictive control approach and the informative path planning approach in terms of searching successful rates and efficiency.
Original language | English |
---|---|
Pages (from-to) | 8207-8217 |
Number of pages | 11 |
Journal | IEEE Transactions on Industrial Informatics |
Volume | 20 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1 Jun 2024 |
Keywords
- Autonomous search
- exploration and exploitation
- path planning
- recursive feasibility and convergence
ASJC Scopus subject areas
- Control and Systems Engineering
- Information Systems
- Computer Science Applications
- Electrical and Electronic Engineering