Geometric Distributional Control: Learning Progress with Partial Structural Knowledge
- URL: http://arxiv.org/abs/2609.06331v1
- Date: Sun, 06 Sep 2026 01:39:05 GMT
- Title: Geometric Distributional Control: Learning Progress with Partial Structural Knowledge
- Abstract summary: Real-time control often sits between two limiting regimes. Predictive optimization and model-based control are powerful when dynamics, parameters, objectives, and online planning models are specified.<n> reinforcement learning can relax this requirement, but must infer long-horizon value signals from sequential data and interaction.<n>This middle regime is common in systems including autonomous driving, warehouse robotics, traffic control, and delivery drones.<n> Geometric Distributional Control (GDC) is designed for this partial-knowledge setting. It factorizes control into feasibility and progress.
- Score: 6.099441855983951
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Real-time control often sits between two limiting regimes. Predictive optimization and model-based control are powerful when dynamics, parameters, objectives, and online planning models are specified; reinforcement learning can relax this requirement, but must infer long-horizon value signals from sequential data and interaction, making training slow, high-variance, and hard to scale in large action spaces. This middle regime is common in systems including autonomous driving, warehouse robotics, traffic control, and delivery drones: partial geometry, physics, rules, or constraints are known, yet the local direction of task progress remains uncertain. Geometric Distributional Control (GDC) is designed for this partial-knowledge setting. It factorizes control into feasibility and progress: known geometry, rules, constraints, and response maps define an executable scaffold, while progress-weighted feasible data learns the missing directional signal on that scaffold. The learned score acts as a Bellman-like local value-gradient, selecting actions that make progress without requiring global Bellman recursion, a fully specified planner, or a black-box policy that absorbs both feasibility and preference. This knowledge can be lightweight and partial, such as simple dynamics, safety filters, local maps, constraint projectors, or lower-level response maps; it need not encode full dynamics or a long-horizon objective. Offline, GDC fits a progress-tilted distribution from short known-feasible snippets with weak signed progress certificates. Online, its score is projected through the scaffold and applied in receding-horizon feedback. We prove that this score descends a data-induced soft progress value and validate GDC on structured multilevel optimization and SUMO route-progress driving, where it improves over known-only solvers and learning baselines while preserving scaffold-enforced feasibility.
Related papers
- LePlanner: An Iterative Amortized Controller For World Models [0.0]
We propose LePlanner, an amortized iterative controller that learns to construct and refine latent action sequences through a frozen world-model predictor.<n>LePlanner is trained with an arrival-and-hold objective that encourages the controller to reach the goal at the earliest feasible horizon and remain there.<n>It achieves success rates of 98% on PushT, 100% on Reacher, 100% on TwoRooms, and 92% on the OGBench Cube task.
arXiv Detail & Related papers (2026-09-12T10:01:21Z) - RAVEN: Reinforcement-Adaptive Visibility-Graph Planning for Robust Humanoid Navigation with Collision-Free MPC [11.923992019929495]
We propose RAVEN, a hierarchical reinforcement learning framework for robust humanoid navigation.<n>RAVEN employs RL to adapt the geometric construction of a visibility-graph planner by modifying obstacle inflation and related graph parameters.<n>Results demonstrate reduced overshoot near obstacles, improved robustness in narrow passages, and more reliable navigation under delay and noise.
arXiv Detail & Related papers (2026-07-17T07:23:54Z) - Position: Weight Space Should Be a First-Class Generative AI Modality [67.10702320971893]
This paper argues that model checkpoints should be treated as a first-class data modality.<n>It argues that generative modeling in weight space should be standardized as a core machine learning primitive.<n>Our goal is to shift the community's default mindset from optimizing models per task to sampling models from learned weight distributions.
arXiv Detail & Related papers (2026-05-18T16:38:26Z) - Hierarchical Motion Planning and Control under Unknown Nonlinear Dynamics via Predicted Reachability [2.857551605623957]
Autonomous motion planning under unknown nonlinear dynamics requires learning system properties while navigating toward a target.<n>We develop a hierarchical planning-control framework that enables online motion synthesis with limited prior system knowledge.
arXiv Detail & Related papers (2026-03-31T23:36:11Z) - Adapting Reinforcement Learning for Path Planning in Constrained Parking Scenarios [6.734318562862061]
We introduce a Deep Reinforcement Learning framework for real-time path planning in parking scenarios.<n>Unlike classical planners, our solution does not require ideal and structured perception.<n>At test time, the policy generates actions through a single forward pass at each step, which is lightweight enough for real-time deployment.
arXiv Detail & Related papers (2026-01-30T04:35:49Z) - Self-Supervised Path Planning in Unstructured Environments via Global-Guided Differentiable Hard Constraint Projection [5.665217514922631]
We propose a self-supervised framework for deploying deep learning agents for autonomous navigation in unstructured environments.<n>To mitigate data scarcity, we construct a Global-Guided Artificial Potential Field (G-APF), which provides dense supervision signals without manual labeling.<n> benchmarks on a test set of 20,000 scenarios demonstrate an 88.75% success rate, substantiating the enhanced operational safety.
arXiv Detail & Related papers (2026-01-27T08:37:21Z) - Hybrid DQN-TD3 Reinforcement Learning for Autonomous Navigation in Dynamic Environments [1.241204035960416]
This paper presents a hierarchical path-planning and control framework that combines a high-level Deep Q-Network (DQN) for discrete sub-goal selection with a low-level Twin Delayed Deep Deterministic Policy Gradient (TD3) controller for continuous actuation.<n>We design a practical reward shaping scheme (direction, distance, obstacle avoidance, action smoothness, collision penalty, time penalty, and progress) together with a LiDAR-based safety gate that prevents unsafe motions.
arXiv Detail & Related papers (2025-10-30T16:12:01Z) - Scaling Up Occupancy-centric Driving Scene Generation: Dataset and Method [54.461213497603154]
Occupancy-centric methods have recently achieved state-of-the-art results by offering consistent conditioning across frames and modalities.<n>Nuplan-Occ is the largest occupancy dataset to date, constructed from the widely used Nuplan benchmark.<n>We develop a unified framework that jointly synthesizes high-quality occupancy, multi-view videos, and LiDAR point clouds.
arXiv Detail & Related papers (2025-10-27T03:52:45Z) - Test-Time Graph Search for Goal-Conditioned Reinforcement Learning [56.13800388912632]
offline goal-conditioned reinforcement learning (GCRL) trains policies that reach user-specified goals at test time.<n>We introduce Test-Time Graph Search (TTGS), a lightweight planning approach to solve the GCRL task.<n>TTGS accepts any state-space distance or cost signal, builds a weighted graph over dataset states, and performs fast search to assemble a sequence of subgoals that a frozen policy executes.
arXiv Detail & Related papers (2025-10-08T17:20:53Z) - TrajBooster: Boosting Humanoid Whole-Body Manipulation via Trajectory-Centric Learning [79.59753528758361]
We present TrajBooster, a cross-embodiment framework that leverages abundant wheeled-humanoid data to boost bipedal VLA.<n>Our key idea is to use end-effector trajectories as a morphology-agnostic interface.<n>Results show that TrajBooster allows existing wheeled-humanoid data to efficiently strengthen bipedal humanoid VLA performance.
arXiv Detail & Related papers (2025-09-15T12:25:39Z) - Autonomous Vehicle Controllers From End-to-End Differentiable Simulation [57.278726604424556]
We propose a differentiable simulator and design an analytic policy gradients (APG) approach to training AV controllers.<n>Our proposed framework brings the differentiable simulator into an end-to-end training loop, where gradients of environment dynamics serve as a useful prior to help the agent learn a more grounded policy.<n>We find significant improvements in performance and robustness to noise in the dynamics, as well as overall more intuitive human-like handling.
arXiv Detail & Related papers (2024-09-12T11:50:06Z) - Action-Quantized Offline Reinforcement Learning for Robotic Skill
Learning [68.16998247593209]
offline reinforcement learning (RL) paradigm provides recipe to convert static behavior datasets into policies that can perform better than the policy that collected the data.
In this paper, we propose an adaptive scheme for action quantization.
We show that several state-of-the-art offline RL methods such as IQL, CQL, and BRAC improve in performance on benchmarks when combined with our proposed discretization scheme.
arXiv Detail & Related papers (2023-10-18T06:07:10Z) - Modular Deep Reinforcement Learning for Continuous Motion Planning with
Temporal Logic [59.94347858883343]
This paper investigates the motion planning of autonomous dynamical systems modeled by Markov decision processes (MDP)
The novelty is to design an embedded product MDP (EP-MDP) between the LDGBA and the MDP.
The proposed LDGBA-based reward shaping and discounting schemes for the model-free reinforcement learning (RL) only depend on the EP-MDP states.
arXiv Detail & Related papers (2021-02-24T01:11:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.