Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 179 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Aperiodic Communication for MPC in Autonomous Cooperative Landing (2102.07403v2)

Published 15 Feb 2021 in eess.SY, cs.SY, and math.OC

Abstract: This paper investigates the rendezvous problem for the autonomous cooperative landing of an unmanned aerial vehicle (UAV) on an unmanned surface vehicle (USV). Such heterogeneous agents, with nonlinear dynamics, are dynamically decoupled but share a common cooperative rendezvous task. The underlying control scheme is based on distributed Model Predictive Control (MPC). The main contribution is a rendezvous algorithm with an online update rule of the rendezvous location. The algorithm only requires the agents to exchange information when they can not guarantee to rendezvous. Hence, the exchange of information occurs aperiodically, which reduces the necessary communication between the agents. Furthermore, we prove that the algorithm guarantees recursive feasibility. The simulation results illustrate the effectiveness of the proposed algorithm applied to the problem of autonomous cooperative landing.

Citations (8)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.