Bayesian Optimization Based Trustworthiness Model for Multi-robot Bounding Overwatch
Huanfei Zheng, Jonathon M. Smereka, Dariusz Mikluski, Yue Wang

TL;DR
This paper introduces a Bayesian optimization-based trustworthiness model for multi-robot bounding overwatch, enabling real-time trust evaluation and dynamic path planning in uncertain environments.
Contribution
It develops a novel computational trustworthiness model using Bayesian optimization to improve multi-robot overwatch path selection and trust assessment.
Findings
Reduces exploration in workspace data collection.
Enhances trustworthiness evaluation accuracy.
Improves multi-robot path planning in dynamic environments.
Abstract
In multi-robot system (MRS) bounding overwatch, it is crucial to determine which point to choose for overwatch at each step and whether the robots' positions are trustworthy so that the overwatch can be performed effectively. In this paper, we develop a Bayesian optimization based computational trustworthiness model (CTM) for the MRS to select overwatch points. The CTM can provide real-time trustworthiness evaluation for the MRS on the overwatch points by referring to the robots' situational awareness information, such as traversability and line of sight. The evaluation can quantify each robot's trustworthiness in protecting its robot team members during the bounding overwatch. The trustworthiness evaluation can generate a dynamic cost map for each robot in the workspace and help obtain the most trustworthy bounding overwatch path. Our proposed Bayesian based CTM and motion planning can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Robotic Path Planning Algorithms · Adversarial Robustness in Machine Learning
