RB 1016 Path Planning is an ontology term in the NarrativeGoldmine robotics hierarchy representing the superclass of algorithms that compute collision-free trajectories from a start configuration to a goal configuration in a robot’s configuration space. It encompasses graph-search methods (A*, Dijkstra), sampling-based planners (RRT, PRM), and reactive local-planning strategies (DWA, potential fields), all of which underpin autonomous navigation in structured and unstructured environments.
Semantic Classification
Content
Overview
R B 1016 pathplanning represents an abstract concept in the robotics ontology hierarchy.