Flocking Control for Multiple Convex Polygonal Agents with Obstacle Avoidance

This paper addresses the distributed flocking control for second-order convex polygonal multiagent systems with obstacle avoidance.Typically, agent shapes are reduced to mere points or circles in existing research.Overlooking the actual geometries of entities such as autonomous ships and vehicles may lead to suboptimal utilization of spatial resources.To rectify this, the paper introduces an approach for calculating the relative distance between two convex polygonal agents.A potential function, which balances attractive and repulsive forces, is designed based on these calculated distances.A flocking trajectory guides collective motion, and a separate obstacle-avoidance trajectory is activated when the agent's proximity to an obstacle falls below a specified safety threshold.The proposed control strategy integrates potential function and reference trajectory is designed to achieve flocking behavior and obstacle avoidance.Stability analysis proves the effectiveness of the algorithm.

Authors

Institutions

Publication Details

Journal
Proceedings of International Conference on Artificial Life and Robotics
Published
2025-02-13
DOI
https://doi.org/10.5954/icarob.2025.os19-4
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flocking Control for Multiple Convex Polygonal Agents with Obstacle Avoidance

Yaxin Li, Yingmin Jia
Proceedings of International Conference on Artificial Life and Robotics
Distributed Control Multi-Agent Systems
article

Flocking Control for Multiple Convex Polygonal Agents with Obstacle Avoidance

Yaxin Li, Yingmin Jia
article en

Abstract

This paper addresses the distributed flocking control for second-order convex polygonal multiagent systems with obstacle avoidance.Typically, agent shapes are reduced to mere points or circles in existing research.Overlooking the actual geometries of entities such as autonomous ships and vehicles may lead to suboptimal utilization of spatial resources.To rectify this, the paper introduces an approach for calculating the relative distance between two convex polygonal agents.A potential function, which balances attractive and repulsive forces, is designed based on these calculated distances.A flocking trajectory guides collective motion, and a separate obstacle-avoidance trajectory is activated when the agent's proximity to an obstacle falls below a specified safety threshold.The proposed control strategy integrates potential function and reference trajectory is designed to achieve flocking behavior and obstacle avoidance.Stability analysis proves the effectiveness of the algorithm.

Proceedings of International Conference on Artificial Life and RoboticsVol. 30
Beihang University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 67%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.