Sampling-based motion planning via control barrier functions

20Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.

Abstract

Robot motion planning is central to real-world autonomous applications, such as self-driving cars, persistence surveillance, and robotic arm manipulation. One challenge in motion planning is generating control signals for nonlinear systems that result in obstacle free paths through dynamic environments. In this paper, we propose Control Barrier Function guided Rapidly-exploring Random Trees (CBF-RRT), a sampling-based motion planning algorithm for continuous-time nonlinear systems in dynamic environments. The algorithm focuses on two objectives: efficiently generating feasible controls that steer the system toward a goal region, and handling environments with dynamical obstacles in continuous time. We formulate the control synthesis problem as a Quadratic Program (QP) that enforces Control Barrier Function (CBF) constraints to achieve obstacle avoidance. Additionally, CBF-RRT does not require nearest neighbor or explicit collision checks during sampling.

Author supplied keywords

Cite

CITATION STYLE

APA

Yang, G., Vang, B., Serlin, Z., Belta, C., & Tron, R. (2019). Sampling-based motion planning via control barrier functions. In ACM International Conference Proceeding Series. Association for Computing Machinery. https://doi.org/10.1145/3365265.3365282

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free