Cooperative Localization in Mobile Robots Using Event-Triggered Mechanism: Theory and Experiments
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This article addresses a new cooperative localization problem for a team of mobile robots subject to limited communication resources. First, we develop a decentralized event-triggered cooperative localization (DECL) algorithm for multirobot system such that each robot localizes itself with minimum communication exchange between robots. Then, using an event-triggered mechanism we propose an optimization framework to achieve a balance between estimation performance and communication rate. Simulation results show the main benefits of the event-triggered mechanism. Also, experimental results using four e-puck2 mobile robots demonstrate the effectiveness of the proposed method. Note to Practitioners—Multiple mobile robots are able to implement certain tasks that are beyond the capabilities of individual robots. In multirobot system, the accurate localization of each robot in the team is essential for a successful operation. Existing cooperative localization approaches neglect some realistic limitations of mobile robots, such as battery capacity and communication bandwidth. Especially, this issue is important when the number of sensors, actuators, and robots in the team increases. This article was motivated by these realistic limitations of mobile robots and it suggests a new approach for cooperative localization based on event-triggered mechanism. Motived by the aforementioned discussion, our objective is to design and implement the event-triggered cooperative localization for a group of e-puck2 robots. Our theoretical analysis and experimental results show that we achieve a tradeoff between localization accuracy and communication resources.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it