A Framework for Real-time Path Planning in Changing Environments

Abstract

We present a new method for generating collision-free paths for robots operating in changing environments. Our approach is closely related to recent probabilistic roadmap approaches. These planners use preprocessing and query stages, and are aimed at planning many times in the same environment. In contrast, our preprocessing stage creates a representation of the configuration space that can be easily modified in real time to account for changes in the environment, thus facilitating real-time planning. As with previous approaches, we begin by constructing a graph that represents a roadmap in the configuration space, but we do not construct this graph for a specific workspace. Instead, we construct the graph for an obstacle-free workspace, and encode the mapping from workspace cells to nodes and arcs in the graph. When the environment changes, this mapping is used to make the appropriate modifications to the graph, and plans can be generated by searching the modified graph. In this paper, we first discuss the construction of the roadmap, including how random samples of the configuration space are generated using an importance sampling approach and how these samples are connected to form the roadmap. We then discuss the mapping from the workspace to the configuration space roadmap, explaining how the mapping is generated and how it can be encoded efficiently using compression schemes that exploit redundancy in the mapping. We then introduce quantitative robustness measures and show how these can be used to enhance the robustness of the roadmap to changes in the environment. Finally, we evaluate an implementation of our approach for serial-link manipulators with up to 20 joints.

FFRob: An Efficient Heuristic for Task and Motion Planning

“…It is similar in spirit to the roadmaps of Leven and Hutchinson [18] in that it is designed to support solving multiple motionplanning queries in closely related environments. The crg has three components:…”

Realtime Informed Path Sampling for Motion Planning Search

“…The other side of this tradeoff is that in highly cluttered environments, the planner may suffer decreased performance. Leven and Hutchinson (2002) introduce a variety of approaches to improve the likelihood that a lazy PRM will yield a collision-free path. The authors also contribute a pair of ideas to the biased sampling discussion.…”

Combinatorial Motion Planning

“…A related precursor to the PRM was proposed in [63,64]. The PRM has been widely used in practice, and many variants have been proposed [1,4,11,12,22,27,32,42,83,95,104,111,112,136,139,140,152,154,163,167,168,172]. An experimental comparison of many of these variants appears in [60].…”