Online Defensive Motion Planning Against Adversarial Swarm Attacks using Bernstein Polynomials-Based Model Predictive Control

This paper proposes an online motion planning algorithm for defender drones to protect a High-Value Unit (HVU) against a swarm of attacker drones. We formulate an optimal motion planning problem and approximate its solutions using Bernstein polynomials. The favorable geometric properties of the polynomials allow to compute the cost function and constraints efficiently. Since the attackers' dynamics are generally imperfectly known, we resort to model predictive control (MPC) approach. By predicting future trajectories of the attackers over a short time interval, we calculate optimal trajectories for the defenders to shoot down the attackers and maintain the survival probability of the HVU close to one. This optimization problem is solved recursively with a receding time horizon until the attackers are incapacitated.

Authors

Institutions

Publication Details

Published
2025-05-14
DOI
https://doi.org/10.1109/icuas65942.2025.11007829
Citations
1
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
1.21

Funders

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

Online Defensive Motion Planning Against Adversarial Swarm Attacks using Bernstein Polynomials-Based Model Predictive Control

Hyungsoo Kang, Naira Hovakimyan, Christoph Aoun, Isaac Kaminer
1 citations
Advanced Control Systems Optimization
1.21
article

Online Defensive Motion Planning Against Adversarial Swarm Attacks using Bernstein Polynomials-Based Model Predictive Control

Hyungsoo Kang, Naira Hovakimyan, Christoph Aoun, Isaac Kaminer
article en
1 citations

Abstract

This paper proposes an online motion planning algorithm for defender drones to protect a High-Value Unit (HVU) against a swarm of attacker drones. We formulate an optimal motion planning problem and approximate its solutions using Bernstein polynomials. The favorable geometric properties of the polynomials allow to compute the cost function and constraints efficiently. Since the attackers' dynamics are generally imperfectly known, we resort to model predictive control (MPC) approach. By predicting future trajectories of the attackers over a short time interval, we calculate optimal trajectories for the defenders to shoot down the attackers and maintain the survival probability of the HVU close to one. This optimization problem is solved recursively with a receding time horizon until the attackers are incapacitated.

University of Illinois Urbana-Champaign (US), Naval Postgraduate School (US)
National Aeronautics and Space Administration, Air Force Office of Scientific Research
Openalex Percentile: Top 21%
Advanced Control Systems Optimization
1.21
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.