Deadlock-Resistant Safety-Critical Mobile Robot Navigation Using Guiding Vector Fields and Model Predictive Control

This paper investigates the safe navigation of mobile robots in complex-static-obstacle environments and proposes a deadlock-resistant navigation control method. First, convex polygonal obstacles are modeled using the Log-Sum-Exp (LSE) function. Goal and obstacle avoidance guiding vector fields (GVFs) are then constructed, and an obstacle-bypassing method is developed using the goal direction and local obstacle geometry. The goal and obstacle avoidance GVFs are further blended to construct a navigation GVF, for which a regional sufficient condition excluding complete cancellation is established. On this basis, a safe robot navigation controller is designed by combining the navigation GVF with a model predictive control (MPC) framework incorporating discrete-time control barrier function (DCBF) constraints. We also give conditions for obstacle avoidance throughout each sampling interval under bounded one-step position prediction errors. Numerical simulations show that, in the tested scenarios, wherethe tested artificial potential field (APF) and conventional MPC-DCBF configurations fail to complete the navigation task, the proposed methodcan bypass obstacles and reach the goal. Hardware experiments further validate the effectiveness of the proposed method on a physical robot platform in a preconfigured environment.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2026-10-06
DOI
https://doi.org/10.3390/s26196304
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

Deadlock-Resistant Safety-Critical Mobile Robot Navigation Using Guiding Vector Fields and Model Predictive Control

Yongfeng Gao, Yuhu Wu, Xuefeng Li, Liang Gao et al.
Sensors
Robotic Path Planning Algorithms
article

Deadlock-Resistant Safety-Critical Mobile Robot Navigation Using Guiding Vector Fields and Model Predictive Control

Yongfeng Gao, Yuhu Wu, Xuefeng Li, Liang Gao, Xinhui Zhao, Mingde He
article en

Abstract

This paper investigates the safe navigation of mobile robots in complex-static-obstacle environments and proposes a deadlock-resistant navigation control method. First, convex polygonal obstacles are modeled using the Log-Sum-Exp (LSE) function. Goal and obstacle avoidance guiding vector fields (GVFs) are then constructed, and an obstacle-bypassing method is developed using the goal direction and local obstacle geometry. The goal and obstacle avoidance GVFs are further blended to construct a navigation GVF, for which a regional sufficient condition excluding complete cancellation is established. On this basis, a safe robot navigation controller is designed by combining the navigation GVF with a model predictive control (MPC) framework incorporating discrete-time control barrier function (DCBF) constraints. We also give conditions for obstacle avoidance throughout each sampling interval under bounded one-step position prediction errors. Numerical simulations show that, in the tested scenarios, wherethe tested artificial potential field (APF) and conventional MPC-DCBF configurations fail to complete the navigation task, the proposed methodcan bypass obstacles and reach the goal. Hardware experiments further validate the effectiveness of the proposed method on a physical robot platform in a preconfigured environment.

SensorsVol. 26(19)
Liaoning Normal University (CN), Dalian University of Technology (CN)
Openalex Percentile: Top 14%
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.