Differentially constrained mobile robot motion planning in state lattices

Authors:
Mihail Pivtoraiko;Ross A. Knepper;Alonzo Kelly
Affiliations:
Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213;Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213;Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213
Venue:
Journal of Field Robotics - Special Issue on Space Robotics, Part I
Year:
2009

Citing 0
Cited 8

Safe distributed motion coordination for second-order systems with different planning cycles

International Journal of Robotics Research
Learning intelligent controllers for path-following skills on snake-like robots

ICIRA'11 Proceedings of the 4th international conference on Intelligent Robotics and Applications - Volume Part II
Path planning with variable-fidelity terrain assessment

Robotics and Autonomous Systems
GPU based generation of state transition models using simulations for unmanned surface vehicle trajectory planning

Robotics and Autonomous Systems
On-Road motion planning for autonomous vehicles

ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part III
Integrated motion planning and control for graceful balancing mobile robots

International Journal of Robotics Research
A hierarchical approach for primitive-based motion planning and control of autonomous vehicles

Robotics and Autonomous Systems
Target following with motion prediction for unmanned surface vehicle operating in cluttered environments

Autonomous Robots

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to the problem of differentially constrained mobile robot motion planning in arbitrary cost fields. The approach is based on deterministic search in a specially discretized state space. We compute a set of elementary motions that connects each discrete state value to a set of its reachable neighbors via feasible motions. Thus, this set of motions induces a connected search graph. The motions are carefully designed to terminate at discrete states, whose dimensions include relevant state variables (e.g., position, heading, curvature, and velocity). The discrete states, and thus the motions, repeat at regular intervals, forming a lattice. We ensure that all paths in the graph encode feasible motions via the imposition of continuity constraints on state variables at graph vertices and compliance of the graph edges with a differential equation comprising the vehicle model. The resulting state lattice permits fast full configuration space cost evaluation and collision detection. Experimental results with research prototype rovers demonstrate that the planner allows us to exploit the entire envelope of vehicle maneuverability in rough terrain, while featuring real-time performance. © 2009 Wiley Periodicals, Inc.