{"cited_by_count":916853,"description":"This cluster of papers focuses on sampling-based algorithms, optimal motion planning, and path planning for robot navigation. It covers topics such as collision avoidance, real-time planning, kinodynamic planning, probabilistic roadmaps, multi-agent systems, and autonomous vehicles.","display_name":"Robotic Path Planning Algorithms","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T10586","wikipedia":"https://en.wikipedia.org/wiki/Motion_planning"},"field_id":"17","id":"T10586","keywords":[{"display_name":"obstacle avoidance","id":"obstacle-avoidance","score":0.3171,"url":"https://openalex.org/keywords/obstacle-avoidance"},{"display_name":"path planning","id":"path-planning","score":0.4278,"url":"https://openalex.org/keywords/path-planning"},{"display_name":"motion planning","id":"motion-planning","score":0.3266,"url":"https://openalex.org/keywords/motion-planning"},{"display_name":"A* algorithm","id":"a-algorithm","score":0.3871,"url":"https://openalex.org/keywords/a-algorithm"},{"display_name":"dynamic obstacles","id":"dynamic-obstacles","score":0.574,"url":"https://openalex.org/keywords/dynamic-obstacles"},{"display_name":"robot path planning","id":"robot-path-planning","score":0.5366,"url":"https://openalex.org/keywords/robot-path-planning"},{"display_name":"artificial potential field","id":"artificial-potential-field","score":0.5816,"url":"https://openalex.org/keywords/artificial-potential-field"},{"display_name":"robot motion planning","id":"robot-motion-planning","score":0.45,"url":"https://openalex.org/keywords/robot-motion-planning"},{"display_name":"collision-free paths","id":"collision-free-paths","score":0.761,"url":"https://openalex.org/keywords/collision-free-paths"},{"display_name":"UAV path planning","id":"uav-path-planning","score":0.4695,"url":"https://openalex.org/keywords/uav-path-planning"},{"display_name":"mobile robot path planning","id":"mobile-robot-path-planning","score":0.7806,"url":"https://openalex.org/keywords/mobile-robot-path-planning"},{"display_name":"rapidly-exploring random tree","id":"rapidly-exploring-random-tree","score":0.7762,"url":"https://openalex.org/keywords/rapidly-exploring-random-tree"},{"display_name":"unknown environments","id":"unknown-environments","score":0.2923,"url":"https://openalex.org/keywords/unknown-environments"},{"display_name":"RRT*","id":"rrt","score":0.8722,"url":"https://openalex.org/keywords/rrt"},{"display_name":"dynamic obstacle avoidance","id":"dynamic-obstacle-avoidance","score":0.6206,"url":"https://openalex.org/keywords/dynamic-obstacle-avoidance"},{"display_name":"sampling-based motion planning","id":"sampling-based-motion-planning","score":0.7956,"url":"https://openalex.org/keywords/sampling-based-motion-planning"},{"display_name":"global path planning","id":"global-path-planning","score":0.7742,"url":"https://openalex.org/keywords/global-path-planning"},{"display_name":"multi-agent path finding","id":"multi-agent-pathfinding","score":0.8567,"url":"https://openalex.org/keywords/multi-agent-pathfinding"},{"display_name":"cluttered environments","id":"cluttered-environments","score":0.2607,"url":"https://openalex.org/keywords/cluttered-environments"},{"display_name":"3D path planning","id":"3d-path-planning","score":0.6589,"url":"https://openalex.org/keywords/3d-path-planning"},{"display_name":"probabilistic roadmaps","id":"probabilistic-roadmaps","score":0.8308,"url":"https://openalex.org/keywords/probabilistic-roadmaps"},{"display_name":"path smoothing","id":"path-smoothing","score":0.7912,"url":"https://openalex.org/keywords/path-smoothing"},{"display_name":"real-time path planning","id":"real-time-path-planning","score":0.7357,"url":"https://openalex.org/keywords/real-time-path-planning"},{"display_name":"dynamic window approach","id":"dynamic-window-approach","score":0.7574,"url":"https://openalex.org/keywords/dynamic-window-approach"},{"display_name":"local path planning","id":"local-path-planning","score":0.763,"url":"https://openalex.org/keywords/local-path-planning"}],"legacy_keywords":["Sampling-Based Algorithms","Optimal Motion Planning","Path Planning","Collision Avoidance","Robot Navigation","Real-Time Planning","Kinodynamic Planning","Probabilistic Roadmaps","Multi-Agent Systems","Autonomous Vehicles"],"openalex_id":"https://openalex.org/T10586","source_created_date":"2024-01-23T15:27:07","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1707","url":"/topics/T10586","works_api_url":"https://api.openalex.org/works?filter=topics.id:T10586","works_count":75895,"label":"Robotic Path Planning Algorithms","provider":"openalex","revision":"417ff2703742d2b6","taxonomy_revision":"f050b5d4780b1289","title":"Robotic Path Planning Algorithms","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36174243004334295","address_version":"morton4x16-v1","coordinates":[3,17,1707,10586],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}