TY - GEN
T1 - Bayes Bots
T2 - 2020 IEEE International Conference on Robotics and Automation, ICRA 2020
AU - Ebert, Julia T.
AU - Gauci, Melvin
AU - Mallmann-Trenn, Frederik
AU - Nagpal, Radhika
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/5
Y1 - 2020/5
N2 - We present a distributed Bayesian algorithm for robot swarms to classify a spatially distributed feature of an environment. This type of go/no-go decision appears in applications where a group of robots must collectively choose whether to take action, such as determining if a farm field should be treated for pests. Previous bio-inspired approaches to decentralized decision-making in robotics lack a statistical foundation, while decentralized Bayesian algorithms typically require a strongly connected network of robots. In contrast, our algorithm allows simple, sparsely distributed robots to quickly reach accurate decisions about a binary feature of their environment. We investigate the speed vs. accuracy tradeoff in decision-making by varying the algorithm's parameters. We show that making fewer, less-correlated observations can improve decision-making accuracy, and that a well-chosen combination of prior and decision threshold allows for fast decisions with a small accuracy cost. Both speed and accuracy also improved with the addition of bio-inspired positive feedback. This algorithm is also adaptable to the difficulty of the environment. Compared to a fixed-time benchmark algorithm with accuracy guarantees, our Bayesian approach resulted in equally accurate decisions, while adapting its decision time to the difficulty of the environment.
AB - We present a distributed Bayesian algorithm for robot swarms to classify a spatially distributed feature of an environment. This type of go/no-go decision appears in applications where a group of robots must collectively choose whether to take action, such as determining if a farm field should be treated for pests. Previous bio-inspired approaches to decentralized decision-making in robotics lack a statistical foundation, while decentralized Bayesian algorithms typically require a strongly connected network of robots. In contrast, our algorithm allows simple, sparsely distributed robots to quickly reach accurate decisions about a binary feature of their environment. We investigate the speed vs. accuracy tradeoff in decision-making by varying the algorithm's parameters. We show that making fewer, less-correlated observations can improve decision-making accuracy, and that a well-chosen combination of prior and decision threshold allows for fast decisions with a small accuracy cost. Both speed and accuracy also improved with the addition of bio-inspired positive feedback. This algorithm is also adaptable to the difficulty of the environment. Compared to a fixed-time benchmark algorithm with accuracy guarantees, our Bayesian approach resulted in equally accurate decisions, while adapting its decision time to the difficulty of the environment.
UR - http://www.scopus.com/inward/record.url?scp=85092704983&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85092704983&partnerID=8YFLogxK
U2 - 10.1109/ICRA40945.2020.9196584
DO - 10.1109/ICRA40945.2020.9196584
M3 - Conference contribution
AN - SCOPUS:85092704983
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 7186
EP - 7192
BT - 2020 IEEE International Conference on Robotics and Automation, ICRA 2020
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 31 May 2020 through 31 August 2020
ER -