MétaCan
Menu
Back to cohort

A Route Planning Approach with RAG-based LLM and FAISS for Robotic Guide

2025· article· W7131136634 on OpenAlexfundno aff
Alessandro Pio, Fabio Persia, Giovanni Pilato, Daniela D’Auria, Mouzhi Ge

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
FundersCanadian University Press
KeywordsGeospatial analysisGraphRoute planningAutomated planning and schedulingNatural languageMotion planningPath (computing)Point (geometry)

Abstract

fetched live from OpenAlex

This paper presents a system for the automated generation of Cypher queries from natural language to optimize route planning for robotic guidance within a Neo4j database and OpenStreetMap-based graph representation. The proposed system uses a hybrid methodology that integrates RetrievalAugmented Generation (RAG) with local Large Language Models (LLMs) to improve query interpretation and path calculation. Additionally, the integration of Facebook AI Similarity Search (FAISS) for vector search, combined with specialized prompt engineering, facilitates the management of complex queries, such as automated point selection and route construction. The proposed system also incorporates few-shot learning to improve LLM performance in processing routing tasks by recognizing specific amenities and optimizing paths. Natural language queries allow non-expert users to intuitively interact with a robotic guide, requesting destinations, amenities, or optimal paths without technical input. The system has been evaluated as effective in automated systems designed to suggest urban navigation and perform geospatial network analysis, making this approach an innovative solution for dynamic spatial data management in complex environments.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
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.110
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.025
GPT teacher head0.288
Teacher spread0.263 · 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; a candidate call from one teacher head, not a consensus.

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