z-logo
Premium
Decentralized receding horizon control with communication bandwidth allocation for multiple vehicle systems
Author(s) -
Izadi H. A.,
Gordon B. W.,
Rabbath C. A.
Publication year - 2010
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.973
Subject(s) - bandwidth (computing) , dynamic bandwidth allocation , computer science , bandwidth allocation , control theory (sociology) , channel allocation schemes , trajectory , horizon , communications system , telecommunications network , control (management) , computer network , telecommunications , artificial intelligence , mathematics , wireless , geometry , physics , astronomy
SUMMARY In this paper, a decentralized receding horizon control (DRHC) for a group of cooperative vehicles is investigated where the communication bandwidth is limited. This gives rise to a DRHC problem with communication delays. A new approach is proposed to vary the communication bandwidth for each vehicle, subject to network bandwidth constraints, in order to improve the cooperation performance. In the DRHC approach, each vehicle predicts its future trajectory over a prediction horizon and the neighboring vehicles exchange their predicted trajectories at each sample time to maintain the cooperation objectives. A delayed DRHC architecture is formulated that explicitly accounts for the inter‐vehicle communication delays. Then a bandwidth allocation algorithm is proposed for the delayed DRHC formulation. The key idea with the proposed approach is that each vehicle minimizes an error bound due to the mismatch between the delayed and updated neighbor's trajectories. This allows a dynamic bandwidth allocation to optimize the group performance. Simulation of formation of a group of vehicles is used to demonstrate the effectiveness of the approach. Copyright © 2010 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here