We propose a distributed control algorithm for a multi-agent network whose agents deploy over a cluttered region in accordance with a time-varying coverage density function while avoiding collisions with all obstacles they encounter. Our algorithm is built on a two-level characterization of the network. The first level treats the multi-agent network as a whole based on the distribution of the locations of its agents over the spatial domain. In the second level, the network is described in terms of the individual positions of its agents. The aim of the multi-agent network is to attain a spatial distribution that resembles that of a reference coverage density function (high-level problem) by means of local (microscopic) interactions of its agents (low-level problem). In addition, as the agents deploy, they must avoid collisions with all the obstacles in the region at all times. Our approach utilizes a modified version of Voronoi tessellations which are comprised of what we refer to as Obstacle-Aware Voronoi Cells (OAVC) in order to enable coverage control while ensuring obstacle avoidance. We consider two control problems. The first problem which we refer to as the high-level coverage control problem corresponds to an interpolation problem in the class of Gaussian mixtures (no collision avoidance requirement), which we solve analytically. The second problem which we refer to as the low-level coverage control problem corresponds to a distributed control problem (collision avoidance requirement is now enforced at all times) which is solved by utilizing Lloyd's algorithm together with the modified Voronoi tessellation (OAVC) and a time-varying coverage density function which corresponds to the solution of the high-level coverage control problem. Finally, simulation results for coverage in a cluttered environment are provided to demonstrate the efficacy of the proposed approach.
NeuroHJR: Hamilton-Jacobi Reachability-based Obstacle Avoidance in Complex Environments with Physics-Informed Neural Networks
Department of Physical Science, Indian Institute of Science Education and Research(物理科学系,印度科学教育与研究学院);Department of Aerospace Engineering, Indian Institute of Science(航空航天工程系,印度科学研究院);Department of Computer Science and Engineering, Shiv Nadar University(计算机科学与工程系,施瓦斯纳大学)
Decentralized Multi-Robot Encirclement of a 3D Target with Guaranteed Collision Avoidance
A. Franchi CNRS, LAAS, 7 Avenue du Colonel Roche, F-31400 Toulouse, France. Univ de Toulouse, LAAS, F-31400 Toulouse, France P. Stegagno Max Planck Institute for Biological Cybernetics, Spemanstra e 38, 72076 T\"ubingen, Germany G. Oriolo Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\`a di Roma, Via Ariosto 25, 00185 Roma, Italy
An MPC framework for efficient navigation of mobile robots in cluttered environments
Institute for Dynamic Systems and Control, ETH Zurich(苏黎世联邦理工学院动态系统与控制研究所);Department of Mechanical Engineering, Imperial College London(伦敦帝国理工学院机械工程系);ETH Zurich(苏黎世联邦理工学院);Automatic Control Laboratory, ETH Zurich(苏黎世联邦理工学院自动控制实验室)
Hybrid Feedback Control for Global Navigation with Locally Optimal Obstacle Avoidance in n-Dimensional Spaces
Department of Electrical Engineering, Lakehead University(电气工程系,拉科夫大学);Department of Computer Science and Engineering, University of Quebec in Outaouais(计算机科学与工程系,魁北克大学瓦省分校)
Stigmergy-based collision-avoidance algorithm for self-organising swarms
Coventry University(考文垂大学);Autonomous Vehicles & Artificial Intelligence Laboratory (AVAILab), Centre for Future Transport and Cities(自动驾驶车辆与人工智能实验室(AVAILab)、未来交通与城市中心)
Risk-Averse MPC via Visual-Inertial Input and Recurrent Networks for Online Collision Avoidance
University of California, Los Angeles(加利福尼亚大学洛杉矶分校);UCLA Vision Lab(加州大学洛杉矶分校视觉实验室);Robotics and Mechanisms Laboratory(机器人与机械实验室);Laboratory for Embedded Machines and Ubiquitous Robots(嵌入式机器与普适机器人实验室)
School of Automation and Intelligent Sensing, Shanghai Jiao Tong University(自动化与智能感知学院,上海交通大学);Institute of Medical Robotics, Shanghai Jiao Tong University(医学机器人研究所,上海交通大学);Key Laboratory of System Control and Information Processing, Ministry of Education of China(教育部系统控制与信息处理重点实验室);Shanghai Engineering Research Center of Intelligent Control and Management, Shanghai(智能控制与管理上海工程研究中心)
MC-Swarm: Minimal-Communication Multi-Agent Trajectory Planning and Deadlock Resolution for Quadrotor Swarm
AI Institute of Seoul National University(首尔国立大学人工智能研究所);Carnegie Mellon University(卡内基梅隆大学);Department of Mechanical System Design Engineering, Seoul National University of Science and Technology (SEOULTECH)(首尔科学技术大学机械系统设计工程系)