Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning

Increasing the autonomy of multi-agent systems or swarms for exploration missions requires tools for efficient information gathering. This work studies this problem from theoretical and experimental perspectives and evaluates an exploration system for multiple ground robots that cooperatively explor...

Full description

Bibliographic Details
Main Authors: Christoph Manss, Isabel Kuehner, Dmitriy Shutin
Format: Article
Language:English
Published: MDPI AG 2022-04-01
Series:Entropy
Subjects:
Online Access:https://www.mdpi.com/1099-4300/24/5/580
_version_ 1797500065146732544
author Christoph Manss
Isabel Kuehner
Dmitriy Shutin
author_facet Christoph Manss
Isabel Kuehner
Dmitriy Shutin
author_sort Christoph Manss
collection DOAJ
description Increasing the autonomy of multi-agent systems or swarms for exploration missions requires tools for efficient information gathering. This work studies this problem from theoretical and experimental perspectives and evaluates an exploration system for multiple ground robots that cooperatively explore a stationary spatial process. For the distributed model, two conceptually different distribution paradigms are considered. The exploration is based on fusing distributively gathered information using Sparse Bayesian Learning (SBL), which permits representing the spatial process in a compressed manner and thus reduces the model complexity and communication load required for the exploration. An entropy-based exploration criterion is formulated to guide the agents. This criterion uses an estimation of a covariance matrix of the model parameters, which is then quantitatively characterized using a D-optimality criterion. The new sampling locations for the agents are then selected to minimize this criterion. To this end, a distributed optimization of the D-optimality criterion is derived. The proposed entropy-driven exploration is then presented from a system perspective and validated in laboratory experiments with two ground robots. The experiments show that SBL together with the distributed entropy-driven exploration is real-time capable and leads to a better performance with respect to time and accuracy compared with similar state-of-the-art algorithms.
first_indexed 2024-03-10T03:56:29Z
format Article
id doaj.art-c8f121c52d85460397eaa94dd91d799c
institution Directory Open Access Journal
issn 1099-4300
language English
last_indexed 2024-03-10T03:56:29Z
publishDate 2022-04-01
publisher MDPI AG
record_format Article
series Entropy
spelling doaj.art-c8f121c52d85460397eaa94dd91d799c2023-11-23T10:54:09ZengMDPI AGEntropy1099-43002022-04-0124558010.3390/e24050580Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian LearningChristoph Manss0Isabel Kuehner1Dmitriy Shutin2German Research Center on Artifical Intelligence, Marie-Curie-Straße 1, 26129 Oldenburg, GermanyGerman Aerospace Center, Münchener Straße 22, 82234 Wessling, GermanyGerman Aerospace Center, Münchener Straße 22, 82234 Wessling, GermanyIncreasing the autonomy of multi-agent systems or swarms for exploration missions requires tools for efficient information gathering. This work studies this problem from theoretical and experimental perspectives and evaluates an exploration system for multiple ground robots that cooperatively explore a stationary spatial process. For the distributed model, two conceptually different distribution paradigms are considered. The exploration is based on fusing distributively gathered information using Sparse Bayesian Learning (SBL), which permits representing the spatial process in a compressed manner and thus reduces the model complexity and communication load required for the exploration. An entropy-based exploration criterion is formulated to guide the agents. This criterion uses an estimation of a covariance matrix of the model parameters, which is then quantitatively characterized using a D-optimality criterion. The new sampling locations for the agents are then selected to minimize this criterion. To this end, a distributed optimization of the D-optimality criterion is derived. The proposed entropy-driven exploration is then presented from a system perspective and validated in laboratory experiments with two ground robots. The experiments show that SBL together with the distributed entropy-driven exploration is real-time capable and leads to a better performance with respect to time and accuracy compared with similar state-of-the-art algorithms.https://www.mdpi.com/1099-4300/24/5/580distributed estimationSparse Bayesian Learningexplorationswarmmulti-agent systemsconsensus
spellingShingle Christoph Manss
Isabel Kuehner
Dmitriy Shutin
Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
Entropy
distributed estimation
Sparse Bayesian Learning
exploration
swarm
multi-agent systems
consensus
title Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
title_full Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
title_fullStr Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
title_full_unstemmed Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
title_short Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning
title_sort experimental validation of entropy driven swarm exploration under sparsity constraints with sparse bayesian learning
topic distributed estimation
Sparse Bayesian Learning
exploration
swarm
multi-agent systems
consensus
url https://www.mdpi.com/1099-4300/24/5/580
work_keys_str_mv AT christophmanss experimentalvalidationofentropydrivenswarmexplorationundersparsityconstraintswithsparsebayesianlearning
AT isabelkuehner experimentalvalidationofentropydrivenswarmexplorationundersparsityconstraintswithsparsebayesianlearning
AT dmitriyshutin experimentalvalidationofentropydrivenswarmexplorationundersparsityconstraintswithsparsebayesianlearning