Cooperative Distributed MPC via Decentralized Real-Time Optimization: Implementation Results for Robot Formations
Institute for Energy Systems, Energy Efficiency and Energy Economics, TU Dortmund University（能源系统、能源效率与能源经济学研究所，德累斯顿理工大学）；Institute of Engineering and Computational Mechanics, University of Stuttgart（工程与计算力学研究所，斯图加特大学）
Gösta Stomberg, Henrik Ebel, Timm Faulwasser, Peter Eberhard
发表信息：
Control Engineering Practice, Volume 138, 105579, 2023
Distributed model predictive control (DMPC) is a flexible and scalable feedback control method applicable to a wide range of systems. While the stability analysis of DMPC is quite well understood, there exist only limited implementation results for realistic applications involving distributed computation and networked communication. This article approaches formation control of mobile robots via a cooperative DMPC scheme. We discuss the implementation via decentralized optimization algorithms. To this end, we combine the alternating direction method of multipliers with decentralized sequential quadratic programming to solve the underlying optimal control problem in a decentralized fashion with nominal convergence guarantees. Our approach only requires coupled subsystems to communicate and does not rely on a central coordinator. Our experimental results showcase the efficacy of DMPC for formation control and they demonstrate the real-time feasibility of the considered algorithms.
Max Planck Institute for Intelligent Systems（马克斯·普朗克智能系统研究所）；University of Tübingen（图宾根大学）；International Institute for Information Technology（国际信息技术研究所）
In this work, we consider the problem of decentralized multi-robot target tracking and obstacle avoidance in dynamic environments. Each robot executes a local motion planning algorithm which is based on model predictive control (MPC). The planner is designed as a quadratic program, subject to constraints on robot dynamics and obstacle avoidance. Repulsive potential field functions are employed to avoid obstacles. The novelty of our approach lies in embedding these non-linear potential field functions as constraints within a convex optimization framework. Our method convexifies non-convex const…
ACCESS Linnaeus Center（ACCESS林奈中心）；School of Electrical Engineering, KTH Royal Institute of Technology（瑞典皇家理工学院电气工程学院）；KTH Center for Autonomous Systems（瑞典皇家理工学院自主系统中心）
This paper addresses the problem of cooperative transportation of an object rigidly grasped by N robotic agents. We propose a Nonlinear Model Predictive Control (NMPC) scheme that guarantees the navigation of the object to a desired pose in a bounded workspace with obstacles, while complying with certain input saturations of the agents. The control scheme is based on inter-agent communication and is decentralized in the sense that each agent calculates its own control signal. Moreover, the proposed methodology ensures that the agents do not collide with each other or with the workspace obstacl…
Forecast-Driven MPC for Decentralized Multi-Robot Collision Avoidance
Department of Computer Science（计算机科学系）；Maharishi International University（玛哈里什国际大学）；Electrical Engineering and Computing（电气工程与计算）；University of Zagreb（扎格雷布大学）；Eastern Illinois University（东部伊利诺伊大学）
Virginia Tech（弗吉尼亚理工大学）；California Institute of Technology（加州理工学院）
This paper presents a layered control approach for real-time trajectory planning and control of robust cooperative locomotion by two holonomically constrained quadrupedal robots. A novel interconnected network of reduced-order models, based on the single rigid body (SRB) dynamics, is developed for trajectory planning purposes. At the higher level of the control architecture, two different model predictive control (MPC) algorithms are proposed to address the optimal control problem of the interconnected SRB dynamics: centralized and distributed MPCs. The distributed MPC assumes two local quadra…
The Hong Kong University of Science and Technology（香港科技大学）
Developments in cooperative trajectory planning of connected autonomous vehicles (CAVs) have gathered considerable momentum and research attention. Generally, such problems present strong non-linearity and non-convexity, rendering great difficulties in finding the optimal solution. Existing methods typically suffer from low computational efficiency, and this hinders the appropriate applications in large-scale scenarios involving an increasing number of vehicles. To tackle this problem, we propose a novel decentralized iterative linear quadratic regulator (iLQR) algorithm by leveraging the dual…
Arizona State University（亚利桑那州立大学）；Toyota Research Institute of North America（丰田北美研究院）
In this paper, we present a decentralized control approach based on a Nonlinear Model Predictive Control (NMPC) method that employs barrier certificates for safe navigation of multiple nonholonomic wheeled mobile robots in unknown environments with static and/or dynamic obstacles. This method incorporates a Learned Barrier Function (LBF) into the NMPC design in order to guarantee safe robot navigation, i.e., prevent robot collisions with other robots and the obstacles. We refer to our proposed control approach as NMPC-LBF. Since each robot does not have a priori knowledge about the obstacles a…
In order to collaborate efficiently with unknown partners in cooperative control settings, adaptation of the partners based on online experience is required. The rather general and widely applicable control setting, where each cooperation partner might strive for individual goals while the control laws and objectives of the partners are unknown, entails various challenges such as the non-stationarity of the environment, the multi-agent credit assignment problem, the alter-exploration problem and the coordination problem. We propose new, modular deep decentralized Multi-Agent Reinforcement Lear…
Decentralized conflict resolution for autonomous vehicles is needed in many places where a centralized method is not feasible, e.g., parking lots, rural roads, merge lanes, etc. However, existing methods generally do not fully utilize optimization in decentralized conflict resolution. We propose a decentralized conflict resolution method for autonomous vehicles based on a novel extension to the Alternating Directions Method of Multipliers (ADMM), called Online Adaptive ADMM (OA-ADMM), and on Model Predictive Control (MPC). OA-ADMM is tailored to online systems, where fast and adaptive real-tim…
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…
Cooperative driving, enabled by communication between automated vehicle systems, is expected to significantly contribute to transportation safety and efficiency. Cooperative Adaptive Cruise Control (CACC) and platooning are two of the main cooperative driving applications that are currently under study. These applications offer significant improvements over current advanced driver assistant systems such as adaptive cruise control (ACC). The primary motivation of CACC and Platooning is to reduce traffic congestion and improve traffic flow, traffic throughput, and highway capacity. These applica…
Cooperative Decentralized Multi-agent Control under Local LTL Tasks and Connectivity Constraints
ACCESS Linnaeus Center, School of Electrical Engineering, KTH Royal Institute of Technology（ACCESS林奈中心，电气工程学院，皇家理工学院）；KTH Centre for Autonomous Systems（KTH自主系统中心）
A rapid deployment of renewable generation has led to significant reduction in the rotational system inertia and damping, thus making frequency control in power systems more challenging. This paper proposes a novel control scheme based on Model Predictive Control (MPC) for converter-interfaced generators operating in a grid-forming mode, with the goal of exploiting their fast response capabilities to provide fast frequency control service to the system. The controller manipulates converter power injections to limit the frequency nadir and rate-of-change-of-frequency after a disturbance. Both c…
It is of great challenge, though promising, to coordinate collective robots for hunting an evader in a decentralized manner purely in light of local observations. In this paper, this challenge is addressed by a novel hybrid cooperative pursuit algorithm that combines reinforcement learning with the artificial potential field method. In the proposed algorithm, decentralized deep reinforcement learning is employed to learn cooperative pursuit policies that are adaptive to dynamic environments. The artificial potential field method is integrated into the learning process as predefined rules to im…
Shanghai University（上海大学）；East China Normal University（华东师范大学）
We analyze convergence of decentralized cooperative online estimation algorithms by a network of multiple nodes via information exchanging in an uncertain environment. Each node has a linear observation of an unknown parameter with randomly time-varying observation matrices. The underlying communication network is modeled by a sequence of random digraphs and is subjected to nonuniform random time-varying delays in channels. Each node runs an online estimation algorithm consisting of a consensus term taking a weighted sum of its own estimate and neighbours' delayed estimates, and an innovation …
In this paper we study the problem of cooperative searching and tracking (SAT) of multiple moving targets with a group of autonomous mobile agents that exhibit limited sensing capabilities. We assume that the actual number of targets is not known a priori and that target births/deaths can occur anywhere inside the surveillance region. For this reason efficient search strategies are required to detect and track as many targets as possible. To address the aforementioned challenges we augment the classical Probability Hypothesis Density (PHD) filter with the ability to propagate in time the searc…
McGill University（麦吉尔大学）；Mila；Université de Montréal（蒙特利尔大学）；DeepMind
In this paper, we investigate learning temporal abstractions in cooperative multi-agent systems, using the options framework (Sutton et al, 1999). First, we address the planning problem for the decentralized POMDP represented by the multi-agent system, by introducing a \emph{common information approach}. We use the notion of \emph{common beliefs} and broadcasting to solve an equivalent centralized POMDP problem. Then, we propose the Distributed Option Critic (DOC) algorithm, which uses centralized option evaluation and decentralized intra-option improvement. We theoretically analyze the asympt…
University of Notre Dame（圣母大学）；Stony Brook University（石溪大学）
In decentralized cooperative multi-agent reinforcement learning, agents can aggregate information from one another to learn policies that maximize a team-average objective function. Despite the willingness to cooperate with others, the individual agents may find direct sharing of information about their local state, reward, and value function undesirable due to privacy issues. In this work, we introduce a decentralized actor-critic algorithm with TD error aggregation that does not violate privacy issues and assumes that communication channels are subject to time delays and packet dropouts. The…
Department of Applied Mathematics and Statistics（应用数学与统计学系）；Stony Brook University（石溪大学）；J.P. Morgan AI Research（摩根大通AI研究）；Department of Computer Science（计算机科学系）；University of Colorado Boulder（科罗拉多大学波尔德分校）；Department of Electrical and Computer Engineering（电气与计算机工程系）
