Distributed Leader-Assistive Localization Method for a Heterogeneous Multirobotic System
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
This paper presents a distributed leader-assistive localization approach for a heterogeneous multirobotic system (MRS). The localization algorithm is formulated to estimate the position and orientation (pose) of a group of robots in a given reference coordinate frame (or global coordinate frame). It is assumed that the heterogeneous-MRS has one or a group of robots (which we refer as leader robots) with higher sensor payload, higher processing power, and larger memory capacity, enabling accurate self-localization capabilities. Robots with limited resources (which we refer as child robots) rely on leader robots, and inter-robot observations between leaders and themselves for localization. Finite-range sensing is a key challenge for such leader-assistive localization. This study presents a sensor sharing technique which virtually enhances the sensing range of leader robots. In the proposed method, each robot locally runs a cubature Kalman filter to estimate its own pose and hosts a low cost, lightweight, and low-power sensory system to periodically measure relative pose of neighbors. Each robot transmits these relative pose measurements to leader robots. Leader robots then combine available relative observations in order to synthesise global pose measurements and associated noise covariances for child robots. Child robots are acknowledged by the leader robots with the synthesized global pose measurements and fuse these measurements with their local belief in order to improve their localization. Theoretical developments are presented to virtually enhance the leader robots' sensing range. The performance of the proposed distributed leader-assistive localization algorithm is evaluated on a multirobot simulation test-bed and on a publicly available multirobot localization and mapping data-set. The results illustrate that the proposed algorithm is capable of establishing accurate and consistent localization for the child robots even when they operate beyond the sensing range of the leader robots. Note to Practitioners-MRS can be used to perform environmental monitoring, exploration tasks, and search and rescue missions. Accurate localization is a critical factor that governs the success of the autonomous mobile robots-based missions. In order to improve the localization accuracy, robots can be equipped with advanced sensory systems which will increase the cost. Additionally, robots can execute advanced localization algorithms to generate an accurate localization which entails higher processing capabilities and higher memory capacity. Most of the robotic systems do not possess sufficient resources to host advanced sensory systems and execute advanced localization algorithms. In a heterogeneousMRS, robots with more accurate localization capabilities (leader robots) can assist robot with limited resources (child robots) for localization. Available leader-assistive localization approaches demand child robots to operate within the sensing range of the leader robots. This constraint limits the teammates' maneuverability, reduces the area covered by the robots, and demands a complex algorithm to avoid collisions among teammates. We address this limitation and propose a novel leader-assistive localization framework. The proposed framework is capable of establishing an accurate and consistent pose estimation for child robots even when they operate beyond the sensing range of leader robots.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle