4.7 Article

Gradient-based mixed planning with symbolic and numeric action parameters

Journal

ARTIFICIAL INTELLIGENCE
Volume 313, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.artint.2022.103789

Keywords

AI planning; Mixed planning

Funding

  1. National Natural Science Foundation of China [62076263, 61906216]
  2. Guangdong Natural Science Funds for Distinguished Young Scholar [2017A030306028]
  3. Guangdong special branch plans young talent with scientific and technological innovation [2017TQ04X866]
  4. Guangdong Basic and Applied Basic Research Foundation [2020A1515010642]
  5. Guangdong Province Key Laboratory of Big Data Analysis and Processing
  6. Key Laboratory of Machine Intelligence and Advanced Computing (Sun Yat-Sen University) of Ministry of Education of China
  7. ONR [N00014-16-1-2892, N00014-18-1-2442, N00014-18-1-2840, N00014-9-1-2119]
  8. AFOSR [FA9550-18-1-0067]
  9. DARPA SAIL-ON grant [W911NF19-2-0006]
  10. JP Morgan AI Faculty Research grant

Ask authors/readers for more resources

In this paper, a novel algorithm framework based on gradient descent is proposed to solve numeric planning problems mixed with logical relations and numeric changes. The framework effectively solves the planning problem by simultaneously optimizing numeric parameters and computing candidate plans. It achieves high efficiency and accuracy, especially in cases with obstacles and non-linear numeric effects.
Dealing with planning problems with both logical relations and numeric changes in real -world dynamic environments is challenging. Existing numeric planning systems for the problem often discretize numeric variables or impose convex constraints on numeric variables, which harms the performance when solving problems. In this paper, we propose a novel algorithm framework to solve numeric planning problems mixed with logical relations and numeric changes based on gradient descent. We cast the numeric planning with logical relations and numeric changes as an optimization problem. Specifically, we extend syntax to allow parameters of action models to be either objects or real-valued numbers, which enhances the ability to model real-world numeric effects. Based on the extended modeling language, we propose a gradient-based framework to simultaneously optimize numeric parameters and compute appropriate actions to form candidate plans. The gradient-based framework is composed of an algorithmic heuristic module based on propositional operations to select actions and generate constraints for gradient descent, an algorithmic transition module to update states to next ones, and a loss module to compute loss. We repeatedly minimize loss by updating numeric parameters and compute candidate plans until it converges into a valid plan for the planning problem. In the empirical study, we exhibit that our algorithm framework is both effective and efficient in solving planning problems mixed with logical relations and numeric changes, especially when the problems contain obstacles and non-linear numeric effects.(c) 2022 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available