Motion Planning with Variable Grid Resolution for Graph-Search-Based Planning

This document describes motion planning with variable grid resolution for graph-search-based planning. An example system includes a processor that obtains an initial pose, a goal pose, and an obstacle map for an environment. The processor uses a motion-planning algorithm to determine a path or trajectory using two or more grid resolutions for a graph-based search. The path includes a series of waypoints, including two-dimensional positional coordinates (and time coordinates if a trajectory), to navigate from the initial pose towards the goal pose. Operation of the host vehicle is then controlled to maneuver along the path using an assisted-driving or autonomous-driving system. In this way, motion planning is performed for the entire path but uses a coarser grid resolution for the portion nearer the goal pose. This allows motion planning for autonomous parking, especially in environments that include static and dynamic objects, to be handled in a more computationally-efficient manner.