{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T03:03:35Z","timestamp":1760151815029,"version":"build-2065373602"},"reference-count":51,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e24050580","type":"journal-article","created":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T01:55:51Z","timestamp":1650506151000},"page":"580","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Experimental Validation of Entropy-Driven Swarm Exploration under Sparsity Constraints with Sparse Bayesian Learning"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4851-2622","authenticated-orcid":false,"given":"Christoph","family":"Manss","sequence":"first","affiliation":[{"name":"German Research Center on Artifical Intelligence, Marie-Curie-Stra\u00dfe 1, 26129 Oldenburg, Germany"},{"name":"German Aerospace Center, M\u00fcnchener Stra\u00dfe 22, 82234 Wessling, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8472-3286","authenticated-orcid":false,"given":"Isabel","family":"Kuehner","sequence":"additional","affiliation":[{"name":"German Aerospace Center, M\u00fcnchener Stra\u00dfe 22, 82234 Wessling, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6065-6453","authenticated-orcid":false,"given":"Dmitriy","family":"Shutin","sequence":"additional","affiliation":[{"name":"German Aerospace Center, M\u00fcnchener Stra\u00dfe 22, 82234 Wessling, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/TSMCC.2006.871600","article-title":"Autonomous and Autonomic Systems: A Paradigm for Future Space Exploration Missions","volume":"36","author":"Truszkowski","year":"2006","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"unstructured":"Patten, T., and Fitch, R. (2013, January 2\u20134). Large-Scale Near-Optimal Decentralised Information Gathering with Multiple Mobile Robots. Proceedings of the Australasian Conference on Robotics and Automation, Sydney, Australia.","key":"ref_2"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/JSYST.2019.2927245","article-title":"Online Planning for Multiagent Situational Information Gathering in the Markov Environment","volume":"14","author":"Zhou","year":"2019","journal-title":"IEEE Syst. J."},{"doi-asserted-by":"crossref","unstructured":"Wiedemann, T., Manss, C., Shutin, D., Lilienthal, A.J., Karolj, V., and Viseras, A. (2017, January 6\u20138). Probabilistic Modeling of Gas Diffusion with Partial Differential Equations for Multi-Robot Exploration and Gas Source Localization. Proceedings of the 2017 European Conference on Mobile Robots (ECMR), Paris, France.","key":"ref_4","DOI":"10.1109\/ECMR.2017.8098707"},{"key":"ref_5","first-page":"3","article-title":"Exploring Earth\u2019s Magnetic Field\u2014Three Make a Swarm","volume":"2019","author":"Olsen","year":"2019","journal-title":"Spatium"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2019\/6914212","article-title":"A Swarm Robotic Exploration Strategy Based on an Improved Random Walk Method","volume":"2019","author":"Pang","year":"2019","journal-title":"J. Robot."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"5189","DOI":"10.1007\/s10489-020-02060-0","article-title":"Effect of Random Walk Methods on Searching Efficiency in Swarm Robots for Area Exploration","volume":"51","author":"Pang","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/JPROC.2011.2158377","article-title":"Eyes in the Sky: Decentralized Control for the Deployment of Robotic Camera Networks","volume":"9","author":"Schwager","year":"2011","journal-title":"Proc. IEEE"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/34.584097","article-title":"Autonomous Exploration: Driven by Uncertainty","volume":"19","author":"Whaite","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"Fedorov, V.V. (1972). Theory of Optimal Experiments, Academic Press.","key":"ref_10"},{"key":"ref_11","first-page":"235","article-title":"Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies","volume":"9","author":"Krause","year":"2008","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Cho, D.H., Ha, J.S., Lee, S., Moon, S., and Choi, H.L. (2018). Informative Path Planning and Mapping with Multiple UAVs in Wind Fields. Distributed Autonomous Robotic Systems: The 13th International Symposium, Springer.","key":"ref_12","DOI":"10.1007\/978-3-319-73008-0_19"},{"doi-asserted-by":"crossref","unstructured":"Viseras, A., Shutin, D., and Merino, L. (2019). Robotic Active Information Gathering for Spatial Field Reconstruction with Rapidly-Exploring Random Trees and Online Learning of Gaussian Processes. Sensors, 19.","key":"ref_13","DOI":"10.3390\/s19051016"},{"doi-asserted-by":"crossref","unstructured":"Manss, C., and Shutin, D. (2018). Global-Entropy Driven Exploration with Distributed Models under Sparsity Constraints. Appl. Sci., 8.","key":"ref_14","DOI":"10.3390\/app8101722"},{"doi-asserted-by":"crossref","unstructured":"Manss, C., Shutin, D., and Leus, G. (2018, January 15\u201320). Distributed Splitting-Over-Features Sparse Bayesian Learning with Alternating Direction Method of Multipliers. Proceedings of the 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Calgary, AB, Canada.","key":"ref_15","DOI":"10.1109\/ICASSP.2018.8462229"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2119","DOI":"10.1109\/LSP.2020.3039481","article-title":"Consensus Based Distributed Sparse Bayesian Learning By Fast Marginal Likelihood Maximization","volume":"27","author":"Manss","year":"2020","journal-title":"IEEE Signal Process. Lett."},{"unstructured":"Bishop, C. (2006). Pattern Recognition and Machine Learning, Springer. Information Science and Statistics.","key":"ref_17"},{"key":"ref_18","first-page":"211","article-title":"Sparse Bayesian Learning and the Relevance Vector Machine","volume":"1","author":"Tipping","year":"2001","journal-title":"J. Mach. Learn. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1109\/TSP.2004.831016","article-title":"Sparse Bayesian Learning for Basis Selection","volume":"52","author":"Wipf","year":"2004","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/MSP.2008.929620","article-title":"The Variational Approximation for Bayesian Inference","volume":"25","author":"Tzikas","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3418","DOI":"10.1109\/TSP.2016.2546231","article-title":"Type I and Type II Bayesian Methods for Sparse Signal Recovery Using Scale Mixtures","volume":"64","author":"Giri","year":"2016","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","article-title":"An Introduction To Compressive Sampling","volume":"25","author":"Candes","year":"2008","journal-title":"IEEE Signal Process. Mag."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R., and Yin, W. (April, January 30). Iteratively reweighted algorithms for compressive sensing. Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, USA.","key":"ref_23","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/78.738251","article-title":"An affine scaling methodology for best basis selection","volume":"47","author":"Rao","year":"1999","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"6236","DOI":"10.1109\/TIT.2011.2162174","article-title":"Latent Variable Bayesian Models for Promoting Sparsity","volume":"57","author":"Wipf","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Platt, J.C., Koller, D., Singer, Y., and Roweis, S.T. (2008). A New View of Automatic Relevance Determination. Advances in Neural Information Processing Systems 20, Curran Associates, Inc.","key":"ref_26"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4977","DOI":"10.1109\/TSP.2012.2200478","article-title":"Incremental Reformulated Automatic Relevance Determination","volume":"60","author":"Shutin","year":"2012","journal-title":"IEEE Trans. Signal Process."},{"unstructured":"Tipping, M.E., and Faul, A.C. (2003, January 3\u20136). Fast Marginal Likelihood Maximisation for Sparse Bayesian Models. Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Key West, FL, USA.","key":"ref_28"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"6257","DOI":"10.1109\/TSP.2011.2168217","article-title":"Fast Variational Sparse Bayesian Learning With Automatic Relevance Determination for Superimposed Signals","volume":"59","author":"Shutin","year":"2011","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2511","DOI":"10.1109\/TSP.2018.2807417","article-title":"Superfast Line Spectral Estimation","volume":"66","author":"Hansen","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"doi-asserted-by":"crossref","unstructured":"Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.","key":"ref_31","DOI":"10.1017\/CBO9780511804441"},{"unstructured":"Moon, T., and Stirling, W.C. (2000). Mathematical Methods and Algorithms for Signal Processing, Prentice Hall. Number 621.39: 51 MON.","key":"ref_32"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers","volume":"3","author":"Boyd","year":"2010","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1109\/JPROC.2010.2052531","article-title":"Gossip Algorithms for Distributed Signal Processing","volume":"98","author":"Dimakis","year":"2010","journal-title":"Proc. IEEE"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","article-title":"Constrained Consensus and Optimization in Multi-Agent Networks","volume":"55","author":"Nedic","year":"2010","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"5262","DOI":"10.1109\/TSP.2010.2055862","article-title":"Distributed Sparse Linear Regression","volume":"58","author":"Mateos","year":"2010","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/j.aml.2006.11.016","article-title":"Eigenvalues of Rank-One Updated Matrices with Some Applications","volume":"20","author":"Ding","year":"2007","journal-title":"Appl. Math. Lett."},{"doi-asserted-by":"crossref","unstructured":"Zhang, F. (2005). Schur Complements and Applications in Numerical Analysis. The Schur Complement and Its Applications, Springer. Numerical Methods and Algorithms.","key":"ref_38","DOI":"10.1007\/b105056"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/PROC.1986.13587","article-title":"Generalization of the Matrix Inversion Lemma","volume":"74","author":"Tylavsky","year":"1986","journal-title":"Proc. IEEE"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1109\/TSP.2009.2016247","article-title":"Broadcast Gossip Algorithms for Consensus","volume":"57","author":"Aysal","year":"2009","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/JPROC.2018.2817461","article-title":"Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization","volume":"106","author":"Olshevsky","year":"2018","journal-title":"Proc. IEEE"},{"doi-asserted-by":"crossref","unstructured":"Marder-Eppstein, E., Berger, E., Foote, T., Gerkey, B., and Konolige, K. (2010, January 3\u20137). The Office Marathon: Robust Navigation in an Indoor Office Environment. Proceedings of the 2010 IEEE International Conference on Robotics and Automation, Anchorage, Alaska.","key":"ref_42","DOI":"10.1109\/ROBOT.2010.5509725"},{"doi-asserted-by":"crossref","unstructured":"R\u00f6smann, C., Hoffmann, F., and Bertram, T. (2015, January 2\u20134). Planning of Multiple Robot Trajectories in Distinctive Topologies. Proceedings of the 2015 European Conference on Mobile Robots (ECMR), Lincoln, UK.","key":"ref_43","DOI":"10.1109\/ECMR.2015.7324179"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10514-012-9321-0","article-title":"OctoMap: An Efficient Probabilistic 3D Mapping Framework Based on Octrees","volume":"34","author":"Hornung","year":"2013","journal-title":"Auton. Robot."},{"doi-asserted-by":"crossref","unstructured":"Dub\u00e9, R., Gawel, A., Sommer, H., Nieto, J., Siegwart, R., and Cadena, C. (2017, January 24\u201328). An Online Multi-Robot SLAM System for 3D LiDARs. Proceedings of the 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Vancouver, BC, Canada.","key":"ref_45","DOI":"10.1109\/IROS.2017.8202268"},{"doi-asserted-by":"crossref","unstructured":"Vallv\u00e9, J., and Andrade-Cetto, J. (2013, January 25\u201327). Mobile Robot Exploration with Potential Information Fields. Proceedings of the 2013 European Conference on Mobile Robots, Barcelona, Spain.","key":"ref_46","DOI":"10.1109\/ECMR.2013.6698846"},{"key":"ref_47","first-page":"3388","article-title":"Localization with Magnetic Field Distortions and Simultaneous Magnetometer Calibration","volume":"21","author":"Siebler","year":"2020","journal-title":"IEEE Sens. J."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.sna.2009.10.008","article-title":"Calibration Methods for Inertial and Magnetic Sensors","volume":"156","author":"Bonnet","year":"2009","journal-title":"Sens. Actuators A Phys."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/13658810801949850","article-title":"Finding Shortest Paths on Real Road Networks: The Case for A","volume":"23","author":"Zeng","year":"2009","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1008090503603","article-title":"Plan-N-Scan: A Robotic System for Collision-Free Autonomous Exploration and Workspace Mapping","volume":"24","author":"Renton","year":"1999","journal-title":"J. Intell. Robot. Syst."},{"doi-asserted-by":"crossref","unstructured":"Manss, C., Shutin, D., and Leus, G. (2019, January 15\u201318). Coordination Methods for Entropy-Based Multi-Agent Exploration under Sparsity Constraints. Proceedings of the 2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), Le Gosier, Guadeloupe.","key":"ref_51","DOI":"10.1109\/CAMSAP45676.2019.9022453"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/5\/580\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:57:43Z","timestamp":1760137063000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/5\/580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,20]]},"references-count":51,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2022,5]]}},"alternative-id":["e24050580"],"URL":"https:\/\/doi.org\/10.3390\/e24050580","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,4,20]]}}}