Papers
Topics
Authors
Recent
2000 character limit reached

Optimization Based Collision Avoidance for Multi-Agent DynamicalSystems in Goal Reaching Task

Published 3 Aug 2021 in cs.RO, cs.SY, and eess.SY | (2108.01320v1)

Abstract: This work presents a distributed MPC-based approach to solving the problem of multi-agent point-to-point transition with optimization-based collision avoidance. The problem is formulated, motivated by the work on collision avoidance for multi-agent systems and dynamic obstacles. With modifications to the formulation, the problem is converted into a distributed problem with a separable objective and coupled constraints. The problem is divided into local sub-problems and solved using Alternating Directions Method of Multipliers(ADMM) applied on an augmented local lagrangian objective.This work aims to understand the multi-agent point-to-point transition problem as an extension of optimization-based collision avoidance and analyze the aspects of computational times, reliability, and optimality of the solution obtained.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Collections

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