Robotics

Hierarchical Motion Planning and Control under Unknown Nonlinear Dynamics via Predicted Reachability

A new hierarchical AI planning method allows robots to safely explore and control systems with completely unknown dynamics.

Deep Dive

Researchers Zhiquan Zhang and Melkior Ornik have introduced a novel hierarchical framework that enables autonomous systems to plan and execute motions in environments with completely unknown and nonlinear dynamics. The core innovation lies in partitioning the state space into polytopes and approximating the complex, unknown system with simpler, local piecewise-affine (PWA) models. These models are identified only as the agent enters each region, allowing for online learning. To manage computational load, the team developed a non-uniform adaptive state space partition that refines the model only in areas critical to the task, avoiding unnecessary complexity elsewhere.

This learned PWA system is then abstracted into a directed weighted graph, where edges represent possible transitions between regions. The existence of these edges is rigorously verified using reach control theory and predictive reachability conditions. Certified edges are assigned weights based on provable time-to-reach bounds, while uncertain edges receive information-theoretic weights to strategically guide exploration. High-level planning is performed via graph search on this continuously updated map, while low-level affine feedback controllers execute the chosen path. A key extension is the introduction of relaxed reachability conditions, which allows the framework to be applied to challenging underactuated systems where classical control theory often fails. Simulation results demonstrate that the method successfully balances the need to explore the unknown environment with the goal of efficiently reaching a target, all while maintaining formal safety and reachability guarantees.

Key Points
  • The framework uses an adaptive, non-uniform partition of the state space to build local piecewise-affine models of unknown dynamics, reducing computational complexity by focusing on task-relevant regions.
  • It constructs and updates a directed graph online, where edges are verified using predictive reachability, blending provable time-to-reach bounds for known paths with information-theoretic weights for exploration.
  • It introduces relaxed reachability conditions to extend formal guarantees to underactuated systems, a class where traditional methods often struggle, enabling safer autonomous operation in complex, unknown environments.

Why It Matters

This brings formal safety and performance guarantees to robots and autonomous systems operating in completely unknown, nonlinear environments, a critical step for real-world deployment.