MétaCan
Menu
Back to cohort

Safe Urban Delivery by a Mobile Robot via CLF-CBF-QP Control Under Dynamic Obstacles

2025· preprint· W4415937960 on OpenAlexaff
Sushil Pokhrel

Bibliographic record

Venuenot available
Typepreprint
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsObstacle avoidanceController (irrigation)KinematicsMobile robotTask (project management)Control (management)ObstacleFunction (biology)RobotJerk

Abstract

fetched live from OpenAlex

To address dynamic obstacle avoidance in urban environments, this project presents a safety-critical control framework for autonomous delivery robots using a unicycle kinematic model. A Control Lyapunov Function (CLF) and Control Barrier Function (CBF) based Quadratic Programming (QP) controller ensures safe navigation and task completion. CLFs guarantee goal convergence despite environmental variations and moving obstacles, such as pedestrians [1, 2, 3]. CBFs enforce safety constraints in real-time, aligning with recent advancements in robotic control under dynamic conditions [4, 5]. Simulations in a Python/NumPy environment show a 97% safe task completion rate, delivery times within 10% of the optimal path baseline, and zero CBF violations, consistent with QP-based pathfinding literature [2, 3]. The framework prioritizes safety, enhancing public trust in autonomous robots, as supported by human-robot interaction studies [6, 7]. Ethical implications and public acceptance are discussed, emphasizing safe human-robot coexistence. All code, simulation data, and visual resources are publicly available to promote reproducibility and collaboration [8, 9].

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication, Open science, Research integrity, Insufficient payload (model declined to judge)
Consensus categoriesMeta-epidemiology (narrow), Research integrity
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.497
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0070.005
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0000.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.009
GPT teacher head0.250
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; both teacher heads agree on what is shown here.

Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207