arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2108.01320cs.ROcs.SYeess.SY
收藏

多Agent DynamicalSystems在目标达成任务中基于优化的冲突避免

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

Indian Institute of Technology Kharagpur(印度理工学院卡拉格普尔分校)

Adarsh Patnaik, Ashish Ranjan Hota

摘要:

本文提出了一种基于分布式MPC的方法来解决多智能体点到点的过渡问题,并基于优化的碰撞避免。制定的问题,动机的工作,避免碰撞的多智能体系统和动态障碍。通过对公式的修改,将问题转化为具有可分离目标和耦合约束的分布式问题。该问题被划分为局部子问题,并使用交替方向乘法(ADMM)应用于增广的局部lagrangian objectives.This工作的目的是了解多智能体点到点的过渡问题的扩展优化为基础的碰撞避免和分析方面的计算时间,可靠性和最优性的解决方案。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑