# Safe and Robust Motion Planning for Dynamic Robotics via Control Barrier Functions

Source: [Safe and Robust Motion Planning for Dynamic Robotics via Control Barrier Functions](<https://www.sota2.com/research/paper/68fa6b0f1e209131cea2bd39>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T23:39:16.015Z

Authors: Aniketh Manjunath, Quan Nguyen

Published: 2020-11-13T04:00:28.000Z

## Abstract

Control Barrier Functions (CBF) are widely used to enforce the safety-critical constraints on nonlinear systems. Recently, these functions are being incorporated into a path planning framework to design safety-critical path planners. However, these methods fall short of providing a realistic path considering both the algorithm's run-time complexity and enforcement of the safety-critical constraints. This paper proposes a novel motion planning approach using the well-known Rapidly Exploring Random Trees (RRT) algorithm that enforces both CBF and the robot Kinodynamic constraints to generate a safety-critical path. The proposed algorithm also outputs the corresponding control signals that resulted in the obstacle-free path. The approach also allows considering model uncertainties by incorporating the robust CBF constraints into the proposed framework. Thus, the resulting path is free of any obstacles and accounts for the model uncertainty from robot dynamics and perception. Result analysis indicates that the proposed method outperforms various conventional RRT-based path planners, guaranteeing a safety-critical path with minimal computational overhead. We present numerical validation of the algorithm on the Hamster V7 robot car, a micro autonomous Unmanned Ground Vehicle that performs dynamic navigation on an obstacle-ridden path with various uncertainties in perception noises and robot dynamics.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Quadrotor Motion Planning on Quadrotor Simulation 100 randomized dynamic environments 5–50 moving obstacles](<https://www.sota2.com/research/sota/quadrotor-motion-planning-on-quadrotor-simulation-100-randomized-dynamic-environments-5-50-moving-obstacles.md>): Quadrotor Motion Planning; Quadrotor Simulation 100 randomized dynamic environments 5–50 moving obstacles; Mean Computation Time (ms): 2.322.

- [Path Planning on Sparse Env Map 1](<https://www.sota2.com/research/sota/path-planning-on-sparse-env-map-1.md>): Path planning; Sparse Env Map 1; Time (ms): 897.02.

- [Path Planning on Cluttered Env (Map 2)](<https://www.sota2.com/research/sota/path-planning-on-cluttered-env-map-2.md>): Path planning; Cluttered Env (Map 2); Clearance (cm): 9.93.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2011.06748>)

[PDF](<https://arxiv.org/pdf/2011.06748.pdf>)
