Decentralized Receding Horizon Control for Cooperative Multiple Vehicles Subject to Communication Delay
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é
N this paper, a new approach is proposed for the decentralized receding horizon control (DRHC) of multiple cooperative vehicles with the possibility of communication failures leading to large intervehicle communication delay. Such large communication delays can lead to poor performance and even instability. The neighboring vehicles exchange their predicted trajectories at each sampletimetomaintainthecooperationobjectives.Itisassumedthat the communication failure is partial in nature, which in turn leads to large communication delays of the exchanged trajectories. The proposedfault-tolerantDRHCisbasedontwoextensionsofexisting work for the case of large communication delays. The first contributionisthedevelopment ofanewDRHC approachthat estimates thetrajectoryoftheneighboringvehiclesforthetailoftheprediction horizon, which would otherwise not be available due to the communication delay. In this approach, the tail of the cost function is estimated by adding extra decision variables in the cost function. A relatively small amount of existing work has investigated the implementation issues associated with exchange of trajectory information, but so far no work has proposed a tail estimation process to compensate for large delays. For instance, in [1–3], no prediction or estimation for the trajectory of neighboring vehicles is performed, and it is assumed that the neighboring vehicles remain at the last delayed states broadcasted by them. Such assumptions may yield poor performance for large communication delays because the constant state vector is not a good estimation of a trajectory of states in general. Similar issues are also investigated in [4,5]. The second contribution of this paper is an extension of the tubebased model predictive control (MPC) approach [6,7] for the case of thelargecommunicationdelaysinordertoguaranteethesafetyofthe fleet against possible collisions during formation control problems. The concept of the tube MPC [or tube receding horizon control (RHC)] in existing work [6,7] is normally used to calculate a robust bound on the states due to system uncertainty, whereas in this paper, the approach is used to calculate bounds that arise from large communication delays of the exchanged neighbor trajectories. The proposed algorithms in this paper are presented in the context of fault-tolerant control, as the communication delay/break may occur due to any failure and malfunction in the communication devices. Some examples of communication failures for the team of cooperative vehicles can be found in [8–10]. In [8], the wireless communicationpacketloss/delayisconsidered;oncethepacketloss/ delay occurs, the previous available trajectory of the faulty unmanned aerial vehicle (UAV) is extrapolated to predict the future reference trajectory. Also, in [9], the communication failure in formation flight of multiple UAVs leads to a break in the communicated messages that forces the fleet to redefine the communication graph. This paper is organized as follows. Section II deals with a general formulation of the decentralized receding horizon controller, and the corresponding algorithm for a fault-free (delay-free) condition. In Section III, a faulty condition is first defined, and a reconfigurable fault-tolerant controller is developed. A safety guarantee method forthefaultyconditionisalsodevelopedbasedontheconceptoftube RHC. In Section IV, the proposed algorithms are tested through simulation of a leaderless formation controller for a fleet of unmanned vehicles.
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,000 |
| É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