Nonlinear distributed model predictive flocking with obstacle avoidance

In this paper, we present a framework for nonlinear distributed model predictive flocking with obstacle avoidance, the pursuit of group objectives, and input constraints. While most existing predictive flocking frameworks are only applicable to agents with double-integrator dynamics, we propose a general framework for nonlinear agents that furthermore allows for the independent tuning of cohesive and repulsive inter-agent forces. To reduce the computational complexity, the resulting nonlinear program is solved as a sequential quadratic program with a limited number of iterations. The performance of the proposed algorithms is demonstrated in simulation and compared to a non-predictive flocking algorithm.

Subjects

Consensus

Control over networks

Graph-based methods for networked systems

Multi-agent systems |Time-varying systems

Networked systems

DDC Class

620: Engineering

Publication version

publishedVersion

Lizenz

https://creativecommons.org/licenses/by-nc-nd/4.0/

Name

1-s2.0-S2405896323017123-main.pdf

Size

522.82 KB

Format

Adobe PDF

Options

Nonlinear distributed model predictive flocking with obstacle avoidance