Computational aspects for the Koditschek-Rimon navigation function

We revisit here the Koditschek-Rimon navigation function idea for the static sphere world case. While the theoretical scafolding is well-known, details about the numerical computations of the associated bounds are lacking in the literature. We present a full implementation of these bounds and propose future directions for reducing their conservatism.

Authors

Institutions

Publication Details

Journal
IFAC-PapersOnLine
Published
2025-01-01
DOI
https://doi.org/10.1016/j.ifacol.2025.09.539
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

Computational aspects for the Koditschek-Rimon navigation function

Florin Stoican, Theodor-Gabriel Nicu, Daniel Ioan, Ionela Prodan
IFAC-PapersOnLine
Robotic Path Planning Algorithms
article

Computational aspects for the Koditschek-Rimon navigation function

Florin Stoican, Theodor-Gabriel Nicu, Daniel Ioan, Ionela Prodan
article en

Abstract

We revisit here the Koditschek-Rimon navigation function idea for the static sphere world case. While the theoretical scafolding is well-known, details about the numerical computations of the associated bounds are lacking in the literature. We present a full implementation of these bounds and propose future directions for reducing their conservatism.

IFAC-PapersOnLineVol. 59(11)
Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Openalex Percentile: Top 73%
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.