DeepAI AI Chat
Log In Sign Up

Gradient-Based Mixed Planning with Discrete and Continuous Actions

by   Kebing Jin, et al.

Dealing with planning problems with both discrete logical relations and continuous numeric changes in real-world dynamic environments is challenging. Existing numeric planning systems for the problem often discretize numeric variables or impose convex quadratic constraints on numeric variables, which harms the performance when solving the problem. In this paper, we propose a novel algorithm framework to solve the numeric planning problems mixed with discrete and continuous actions based on gradient descent. We cast the numeric planning with discrete and continuous actions as an optimization problem by integrating a heuristic function based on discrete effects. Specifically, we propose a gradient-based framework to simultaneously optimize continuous parameters and actions of candidate plans. The framework is combined with a heuristic module to estimate the best plan candidate to transit initial state to the goal based on relaxation. We repeatedly update numeric parameters and compute candidate plan until it converges to a valid plan to the planning problem. In the empirical study, we exhibit that our algorithm framework is both effective and efficient, especially when solving non-convex planning problems.


page 23

page 25

page 32

page 33


Integrated Task and Motion Planning

The problem of planning for a robot that operates in environments contai...

Landmark-Based Plan Recognition

Recognition of goals and plans using incomplete evidence from action exe...

Incremental Learning of Discrete Planning Domains from Continuous Perceptions

We propose a framework for learning discrete deterministic planning doma...

GrASP: Gradient-Based Affordance Selection for Planning

Planning with a learned model is arguably a key component of intelligenc...

Optimal Mixed Discrete-Continuous Planning for Linear Hybrid Systems

Planning in hybrid systems with both discrete and continuous control var...

Planning under Continuous Time and Resource Uncertainty: A Challenge for AI

We outline a class of problems, typical of Mars rover operations, that a...

Enhanced gradient-based MCMC in discrete spaces

The recent introduction of gradient-based MCMC for discrete spaces holds...