Pith. sign in

REVIEW 1 cited by

S-Nav: Semantic-Geometric Planning for Mobile Robots

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.01613 v1 pith:GLHY5ZKQ submitted 2023-07-04 cs.RO

classification cs.RO
keywords planningpathmobilerobotss-navenvironmentgeometrics-graphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Path planning is a basic capability of autonomous mobile robots. Former approaches in path planning exploit only the given geometric information from the environment without leveraging the inherent semantics within the environment. The recently presented S-Graphs constructs 3D situational graphs incorporating geometric, semantic, and relational aspects between the elements to improve the overall scene understanding and the localization of the robot. But these works do not exploit the underlying semantic graphs for improving the path planning for mobile robots. To that aim, in this paper, we present S-Nav a novel semantic-geometric path planner for mobile robots. It leverages S-Graphs to enable fast and robust hierarchical high-level planning in complex indoor environments. The hierarchical architecture of S-Nav adds a novel semantic search on top of a traditional geometric planner as well as precise map reconstruction from S-Graphs to improve planning speed, robustness, and path quality. We demonstrate improved results of S-Nav in a synthetic environment.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SPADE: Towards Scalable Path Planning Architecture on Actionable Multi-Domain 3D Scene Graphs

    cs.RO 2025-05 conditional novelty 4.0 of 10

    SPADE plans paths over 3D scene graphs by combining a high-level global route, local geometric replanning, and domain-aware edge subsampling to handle dynamic scenes.

Pith tools