Mobile robots navigation based on graph search techniques

MaRDI QIDQ2804583zbMATH OpenFDO

Authors Radu Robotin, Petru Dobra, Gheorghe Lazea

Publication date 4 May 2016

zbMATH Keywords

heuristic searchpath planninggraph searchmobile robot

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• Piecemeal graph exploration by a mobile robot.
• Graphbots: mobility in discrete spaces
• scientific article; zbMATH DE number 872791
• Navigation of mobile robots in the presence of obstacles
• Mobile robot navigation in context of spatial data processing
• Traversal of an unknown directed graph by a finite robot

Cited in

(5)

• The PETLON algorithm to plan efficiently for task-level-optimal navigation
• Dynamic path planning for a mobile automaton with limited information on the environment
• An optimal path algorithm for autonomous searching robots
• Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots
• State space sampling of feasible motions for high performance mobile robot navigation in highly constrained environments

This page was built for publication: Mobile robots navigation based on graph search techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804583)