Probabilistic Roadmaps Based Motion Planning of a 4 Degree of Freedom Robot

Abstract

In this paper, we used a probabilistic roadmaps(PRM) method to plan a motion path for a 4 degrees of freedom(DOF) robot in static workspace. This methods includes two phases: a learning phase and a query phase. In learning phase, a roadmap is constructed and stored as a graph , in which stores all of the random collision-free configurations in free configuration space denoted by and keeps all of the edges corresponding to feasible paths between these configurations. In query phase, the algorithm tries to connect any given initial and goal configuration to the nodes in the graph. And then the Dijkstra's algorithm searches for a shortest path to concatenate these two nodes. The experiment result demonstrates that this method applying to this 4 degrees of freedom robot works well.