Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julia T. Ebert

dblp:223/0224 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0002-1975-772XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Systems, architecture and hardware · 4 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 50% Probabilistic and Bayesian machine learning · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
bayesian decision theory
0.412020
Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms · ICRA 2020
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.412020
Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms · ICRA 2020
Knowledge, reasoning and agents › Multi-agent systems › multi-agent decision making
collective decision-making
0.412020
Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms · ICRA 2020
Knowledge, reasoning and agents › Multi-agent systems
swarm robotics
0.412020
Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms · ICRA 2020

Methods — techniques the papers use, named apart from their topics

prior and decision threshold · 0.4positive feedback · 0.4
YearPublicationVenuePosition
2022 Impressionist Algorithms for Autonomous Multi-Robot Systems: Flocking as a Case Study
abstract
Robot swarms have the potential to revolutionize areas ranging from warehouse management and agriculture to underwater and space exploration. However, there remains a substantial gap between theory and robot implementation. While algorithms might assume reliable communication, perfect sensing, and instantaneous cognition, most robots have lossy or even no communication, imperfect sensing, and limited cognition speed. In our previous work on implicit vision-based coordination, we demonstrated autonomous three-dimensional behaviors underwater by removing the need for radio communication between robots. Here we explore impressionist algorithms, capable of working with even more minimal information where traditional algorithms are prone to fail. Our case study focuses on classic flocking behaviors, where a robot swarm must coordinate group motion. We demonstrate that reliable alignment, dispersion, and milling can be achieved with only infrequent and imperfect sensory impressions. In simulation studies and theoretical analyses, we investigate the effect of systematically reducing spatial and temporal fidelity of individual information on the success metrics for the group; we also demonstrate physical experiments with Blueswarm robots using simple color detection. Our results show the potential of impressionist algorithms that operate on simpler neighborhood-awareness metrics and still achieve desired global goals.
Florian Berlinger, Julia T. Ebert, Radhika Nagpal
IROS2
2022 A Hybrid PSO Algorithm for Multi-robot Target Search and Decision Awareness
abstract
Groups of robots can be tasked with identifying a location in an environment where a feature cue is past a threshold, then disseminating this information throughout the group – such as identifying a high-enough elevation location to place a communications tower. This is a continuous-cue target search, where multi-robot search algorithms like particle swarm optimization (PSO) can improve search time through parallelization. However, many robots lack global communication in large spaces, and PSO-based algorithms often fail to consider how robots disseminate target knowledge after a single robot locates it. We present a two-stage hybrid algorithm to solve this task: (1) locating a target with a variation of PSO, and (2) moving to maximize target knowledge across the group. We conducted parameter sweep simulations of up to 32 robots in a grid-based grayscale environment. Pre-decision, we find that PSO with a variable velocity update interval improves target localization. In the post-decision phase, we show that dispersion is the fastest strategy to communicate with all other robots. Our algorithm is also competitive with a coverage sweep benchmark, while requiring significantly less inter-individual coordination.
Julia T. Ebert, Florian Berlinger, Bahar Haghighat, Radhika Nagpal
IROS1
2020 Bayes Bots: Collective Bayesian Decision-Making in Decentralized Robot Swarms
abstract
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.
Julia T. Ebert, Melvin Gauci, Frederik Mallmann-Trenn, Radhika Nagpal
ICRA1
2018 Stability and Predictability in Dynamically Complex Physical Interactions
abstract
This study examines human control of physical interaction with objects that exhibit complex (nonlinear, chaotic, underactuated) dynamics. We hypothesized that humans exploited stability properties of the human-object interaction. Using a simplified 2D model for carrying a "cup of coffee", we developed a virtual implementation to identify human control strategies. Transporting a cup of coffee was modeled as a cart with a suspended pendulum, where humans moved the cart on a horizontal line via a robotic manipulandum. The specific task was to transport the cart-pendulum system to a target, as fast as possible, while accommodating assistive and resistive perturbations. To assess trajectory stability, we applied contraction analysis. We showed that when the perturbation was assistive, humans absorbed the perturbation by controlling cart trajectories into a contraction region prior to the perturbation. When the perturbation was resistive, subjects passed through a contraction region following the perturbation. Entering a contraction region stabilizes performance and makes the dynamics more predictable. This human control strategy could inspire more robust control strategies for physical interaction in robots.
Salah Bazzi, Julia T. Ebert, Neville Hogan, Dagmar Sternad
ICRA2