Multi-Robot Shepherding: A CLF-CBF Approach

This paper presents a control scheme for multirobot shepherding of non-cooperative agents, using a framework based on control barrier function and control Lyapunov function. The proposed control design guarantees the feasibility of the CLF-CBF quadratic optimization problem, even when the number of non-cooperative agents significantly exceeds the number of robots. This scheme supports distributed implementation with distributed sensing, leveraging the consensus alternating direction method of multipliers. Unlike previous works, the presented method does not impose constraints on the maximum velocities or sensing ranges of non-cooperative agents. Simulation results demonstrate that the controller can successfully shepherd large numbers of non-cooperative agents even without aggregation behaviors using teams as small as two robots.

Authors

Institutions

Publication Details

Published
2025-06-30
DOI
https://doi.org/10.1109/ur65550.2025.11078054
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Robot Shepherding: A CLF-CBF Approach

Kiju Lee, A. Alharbi
Robotic Path Planning Algorithms
article

Multi-Robot Shepherding: A CLF-CBF Approach

Kiju Lee, A. Alharbi
article en

Abstract

This paper presents a control scheme for multirobot shepherding of non-cooperative agents, using a framework based on control barrier function and control Lyapunov function. The proposed control design guarantees the feasibility of the CLF-CBF quadratic optimization problem, even when the number of non-cooperative agents significantly exceeds the number of robots. This scheme supports distributed implementation with distributed sensing, leveraging the consensus alternating direction method of multipliers. Unlike previous works, the presented method does not impose constraints on the maximum velocities or sensing ranges of non-cooperative agents. Simulation results demonstrate that the controller can successfully shepherd large numbers of non-cooperative agents even without aggregation behaviors using teams as small as two robots.

Texas A&M University (US)
Openalex Percentile: Top 82%
Robotic Path Planning Algorithms
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.