Robot Safe Planning in Dynamic Environments Based on MPC Using Control Barrier Function

Implementing obstacle avoidance in dynamic environments is a challenging problem for robots. Model predictive control (MPC) is a popular strategy for dealing with this type of problem, and recent work mainly uses control barrier function (CBF) as hard constraints to ensure that the system state remains in the safe set. However, in crowded scenarios, effective solutions may not be obtained due to infeasibility problems, resulting in degraded controller performance. We propose a new MPC framework that integrates CBF to tackle the issue of obstacle avoidance in dynamic environments, in which the infeasibility problem induced by hard constraints operating over the whole prediction horizon is solved by softening the constraints and introducing exact penalty, prompting the robot to actively seek out new paths. The efficacy of the proposed method is first shown through simulation experiments, in which a double-integrator system and a unicycle system are employed, and the proposed method outperforms other controllers in terms of safety, feasibility, and navigation efficiency.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10864636
Citations
2
Primary Topic
Modular Robots and Swarm Intelligence
Type
article
Field-Weighted Citation Impact
0.43

Funders

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

Robot Safe Planning in Dynamic Environments Based on MPC Using Control Barrier Function

Jun Xu, Zetao Lu, Kaijun Feng
2 citations
Modular Robots and Swarm Intelligence
0.43
article

Robot Safe Planning in Dynamic Environments Based on MPC Using Control Barrier Function

Jun Xu, Zetao Lu, Kaijun Feng
article en
2 citations

Abstract

Implementing obstacle avoidance in dynamic environments is a challenging problem for robots. Model predictive control (MPC) is a popular strategy for dealing with this type of problem, and recent work mainly uses control barrier function (CBF) as hard constraints to ensure that the system state remains in the safe set. However, in crowded scenarios, effective solutions may not be obtained due to infeasibility problems, resulting in degraded controller performance. We propose a new MPC framework that integrates CBF to tackle the issue of obstacle avoidance in dynamic environments, in which the infeasibility problem induced by hard constraints operating over the whole prediction horizon is solved by softening the constraints and introducing exact penalty, prompting the robot to actively seek out new paths. The efficacy of the proposed method is first shown through simulation experiments, in which a double-integrator system and a unicycle system are employed, and the proposed method outperforms other controllers in terms of safety, feasibility, and navigation efficiency.

Shenzhen Institute of Information Technology (CN), Harbin Institute of Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province
Sustainable cities and communities
Openalex Percentile: Top 40%
Modular Robots and Swarm Intelligence
0.43
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.