2019
DOI: 10.1609/icaps.v29i1.3469
|View full text |Cite
|
Sign up to set email alerts
|

Mixed Discrete Continuous Non-Linear Planning through Piecewise Linear Approximation

Abstract: Reasoning with continuously changing numeric quantities is vital to applying planners in many real-world scenarios. Several planners capable of doing this have been developed recently. Scalability remains a challenge for such planners, especially those that reason with non-linear continuous change. In this paper, we present a novel approach to reasoning with non-linear domains. Bounding the problem using linear over and under-estimators, allows us to use scalable planners that handle linear change to find plan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 13 publications
(19 reference statements)
0
5
0
Order By: Relevance
“…This is in contrast to other related decision making systems that are built on top of additional restrictive assumptions (e.g., the assumption that the state transition function T is piecewise linear (Shin and Davis 2005), polynomial (Cashmore et al 2016) etc.). Our results suggest similar constraint generation approaches can be utilized for effective planning under other planning formalisms that support continuous-time planning Long 2003, 2006;Benton, Coles, and Coles 2012;Scala et al 2016;Micheli and Scala 2019;Denenberg and Coles 2021;Percassi, Scala, and Vallati 2021). Moreover, our theoretical results provide us with some practical insights.…”
Section: Discussion and Related Workmentioning
confidence: 63%
“…This is in contrast to other related decision making systems that are built on top of additional restrictive assumptions (e.g., the assumption that the state transition function T is piecewise linear (Shin and Davis 2005), polynomial (Cashmore et al 2016) etc.). Our results suggest similar constraint generation approaches can be utilized for effective planning under other planning formalisms that support continuous-time planning Long 2003, 2006;Benton, Coles, and Coles 2012;Scala et al 2016;Micheli and Scala 2019;Denenberg and Coles 2021;Percassi, Scala, and Vallati 2021). Moreover, our theoretical results provide us with some practical insights.…”
Section: Discussion and Related Workmentioning
confidence: 63%
“…DiNo and ENHSP solve all 50 instances relatively quickly and SMTPlan is only able to solve 13 of 50 instances. Figure 4.2 shows Denenberg's [10] results on the linear generator domain with OPTIC ++. When compared to the PDDL 2.1 solver OPTIC++, our planner is not able to solve as many instances as quickly.…”
Section: Discussionmentioning
confidence: 99%
“…ENHSP was run with a discretization of 1. We do not have access to OPTIC ++ and use the results from Denenberg's paper [10]. The goal state in all planning instances is to get the generator to run successfully, i.e.…”
Section: Domain Descriptionmentioning
confidence: 99%
“…For the updated problem, the bounds are sorted, and processes generated for each adjacent pair of bounds, each with its own r ub,lb value. This collection of processes uses a "stacked" model to generate a combined linear effect (Denenberg and Coles 2018;2019).…”
Section: Refining the Linearizationmentioning
confidence: 99%