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

arXiv cs.RO / 4/2/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper presents a hierarchical motion planning-and-control framework for autonomous agents operating under unknown nonlinear dynamics with limited prior system knowledge.
  • It approximates the unknown dynamics using a piecewise-affine (PWA) model learned online by identifying local affine dynamics once the agent enters corresponding polytope regions.
  • To keep computation tractable, it uses a non-uniform adaptive state-space partition that refines only in task-relevant areas, then builds an abstract directed weighted graph over the partitions.
  • The approach uses (relaxed) reachability theory with predictive reachability conditions to certify which graph edges exist and to assign provable time-to-reach weights for certified edges and information-theoretic weights for uncertain ones to balance exploration and exploitation.
  • Simulations are reported to demonstrate effective exploration-exploitation trade-offs while maintaining formal reachability guarantees, including for underactuated systems where classical conditions are hard to satisfy.

Abstract

Autonomous motion planning under unknown nonlinear dynamics requires learning system properties while navigating toward a target. In this work, we develop a hierarchical planning-control framework that enables online motion synthesis with limited prior system knowledge. The state space is partitioned into polytopes and approximates the unknown nonlinear system using a piecewise-affine (PWA) model. The local affine models are identified once the agent enters the corresponding polytopes. To reduce computational complexity, we introduce a non-uniform adaptive state space partition strategy that refines the partition only in task-relevant regions. The resulting PWA system is abstracted into a directed weighted graph, whose edge existence is incrementally verified using reach control theory and predictive reachability conditions. Certified edges are weighted using provable time-to-reach bounds, while uncertain edges are assigned information-theoretic weights to guide exploration. The graph is updated online as new data becomes available, and high-level planning is performed by graph search, while low-level affine feedback controllers are synthesized to execute the plan. Furthermore, the conditions of classical reach control theory are often difficult to satisfy in underactuated settings. We therefore introduce relaxed reachability conditions to extend the framework to such systems. Simulations demonstrate effective exploration-exploitation trade-offs with formal reachability guarantees.