This paper presents a strategy for planning robot motions in dynamic, uncertain environments (DUEs). Successful and efficient robot operation in such environments requires reasoning about the future evolution and uncertainties of the states of the moving agents and obstacles. A novel procedure to account for future information gathering (and the quality of that information) in the planning process is presented. To approximately solve the stochastic dynamic programming problem that is associated with DUE planning, we present a partially closed-loop receding horizon control algorithm whose solution integrates prediction, estimation, and planning while also accounting for chance constraints that arise from the uncertain locations of the robot and obstacles. Simulation results in simple static and dynamic scenarios illustrate the benefit of the algorithm over classical approaches. The approach is also applied to more complicated scenarios, including agents with complex, multimodal behaviors, basic robot-agent interaction, and agent information gathering.

Obstacle avoidance, and by extension collision checking, is a basic requirement for robot autonomy. Most classical approaches to collision-checking ignore the uncertainties associated with the robot and obstacle's geometry and position. It is natural to use a probabilistic description of the uncertainties. However, constraint satisfaction cannot be guaranteed, in this case, and collision constraints must instead be converted to chance constraints. Standard results for linear probabilistic constraint evaluation have been applied to probabilistic collision evaluation; however, this approach ignores the uncertainty associated with the sensed obstacle. An alternative formulation of probabilistic collision checking that accounts for robot and obstacle uncertainty is presented which allows for dependent object distributions (e.g., interactive robot-obstacle models). In order to efficiently enforce the resulting collision chance constraints, an approximation is proposed and the validity of this approximation is evaluated. The results presented here have been applied to robot-motion planning in dynamic, uncertain environments.

This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires reasoning about the future system evolution and the uncertainty associated with obstacles and moving agents in the environment. This paper presents a novel procedure to account for future information gathering (and the quality of that information) in the planning process. After first presenting a formal Dynamic Programming (DP) formulation, we present a Partially Closed-loop Receding Horizon Control algorithm whose approximation to the DP solution integrates prediction, estimation, and planning while also accounting for chance constraints that arise from the uncertain location of the robot and other moving agents. Simulation results in simple static and dynamic scenarios illustrate the benefit of the algorithm over classical approaches.