scipplan 0.2.0a2__tar.gz → 0.2.2a0__tar.gz

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/LICENSE

@@ -1,4 +1,4 @@
-Copyright (c) 2024 Ari Gestetner
+Copyright (c) 2025 Buser Say
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

scipplan-0.2.2a0/PKG-INFO

@@ -0,0 +1,103 @@
+Metadata-Version: 2.1
+Name: scipplan
+Version: 0.2.2a0
+Summary: Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation in Python.
+Author: Ari Gestetner, Buser Say
+Author-email: ari.gestetner@monash.edu, buser.say@monash.edu
+License: MIT License
+Keywords: scip,automated planner
+Classifier: Development Status :: 3 - Alpha
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Natural Language :: English
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# SCIPPlan
+
+SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions (which can be specified as ODEs or directly as solution equations) that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
+
+## Example Domain: Navigation
+
+<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
+
+
+Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
+
+Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
+
+## Dependencies
+
+i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
+
+ii) Symbolic Mathematics: SymPy [6].
+
+## Installing and Running SCIPPlan
+In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
+
+After installing SCIP you will be able to install SCIPPlan using
+```bash
+pip install scipplan
+```
+Now you will be able to run some of the example domains which include 
+- Navigation (3 instances)
+
+To run one of these examples all you need to do is run
+```bash
+scipplan -D navigation -I 1
+```
+which will run the 1st instance of the navigation domain using the ODEs as the transition function with the help of SymPy [6]. Similarly, the command
+```bash
+scipplan -D navigation -I 1 --provide-sols
+```
+will run the the 1st instance of the navigation domain using the solution equations as the transition function. For more information regarding the available tags and what they mean run `scipplan --help`.
+
+Alternatively you can import scipplan classes to run it using python.
+```py
+from scipplan.scipplan import SCIPPlan
+from scipplan.config import Config
+from scipplan.helpers import write_to_csv
+```
+this will import the only two classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
+```py
+# Set params
+config = Config(domain="navigation", instance=1)
+# Retrieve cli args
+config = Config.get_config()
+```
+after which you are able to solve problem by either using the solve or optimize methods
+```py
+# The optimize method just optimises the problem for the given horizon
+plan = SCIPPlan(config)
+plan.optimize()
+# Class method which takes input the config, solves the problem 
+# with auto incrementing the horizon until a solution is found then 
+# returns the plan as well as the time taken to solve the problem
+plan, solve_time = SCIPPlan.solve(config)  
+```
+In order to save the generated constraints for the horizon solved as well as the results, use the following code
+```py
+write_to_csv("new_constraints", plan.new_constraints, config)
+write_to_csv("results", plan.results_table, config)
+```
+
+## Citation
+
+If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
+
+## References
+[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
+
+[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
+
+[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
+
+[4] [SCIP](https://www.scipopt.org/)
+
+[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)
+
+[6] [SymPy](https://www.sympy.org/en/index.html)

scipplan-0.2.2a0/README.md

@@ -0,0 +1,84 @@
+# SCIPPlan
+
+SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions (which can be specified as ODEs or directly as solution equations) that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
+
+## Example Domain: Navigation
+
+<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
+
+
+Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
+
+Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
+
+## Dependencies
+
+i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
+
+ii) Symbolic Mathematics: SymPy [6].
+
+## Installing and Running SCIPPlan
+In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
+
+After installing SCIP you will be able to install SCIPPlan using
+```bash
+pip install scipplan
+```
+Now you will be able to run some of the example domains which include 
+- Navigation (3 instances)
+
+To run one of these examples all you need to do is run
+```bash
+scipplan -D navigation -I 1
+```
+which will run the 1st instance of the navigation domain using the ODEs as the transition function with the help of SymPy [6]. Similarly, the command
+```bash
+scipplan -D navigation -I 1 --provide-sols
+```
+will run the the 1st instance of the navigation domain using the solution equations as the transition function. For more information regarding the available tags and what they mean run `scipplan --help`.
+
+Alternatively you can import scipplan classes to run it using python.
+```py
+from scipplan.scipplan import SCIPPlan
+from scipplan.config import Config
+from scipplan.helpers import write_to_csv
+```
+this will import the only two classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
+```py
+# Set params
+config = Config(domain="navigation", instance=1)
+# Retrieve cli args
+config = Config.get_config()
+```
+after which you are able to solve problem by either using the solve or optimize methods
+```py
+# The optimize method just optimises the problem for the given horizon
+plan = SCIPPlan(config)
+plan.optimize()
+# Class method which takes input the config, solves the problem 
+# with auto incrementing the horizon until a solution is found then 
+# returns the plan as well as the time taken to solve the problem
+plan, solve_time = SCIPPlan.solve(config)  
+```
+In order to save the generated constraints for the horizon solved as well as the results, use the following code
+```py
+write_to_csv("new_constraints", plan.new_constraints, config)
+write_to_csv("results", plan.results_table, config)
+```
+
+## Citation
+
+If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
+
+## References
+[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
+
+[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
+
+[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
+
+[4] [SCIP](https://www.scipopt.org/)
+
+[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)
+
+[6] [SymPy](https://www.sympy.org/en/index.html)

scipplan-0.2.2a0/scipplan/__init__.py

@@ -0,0 +1,5 @@
+__version__ = "0.2.2alpha0"
+print(f"SCIPPlan Version: {__version__}")
+__release__ = "v0.2.2a0"
+__author__ = "Ari Gestetner, Buser Say"
+__email__ = "ari.gestetner@monash.edu, buser.say@monash.edu"

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/scipplan/parse_model.py

@@ -10,13 +10,68 @@ from math import exp, log, sqrt, sin, cos, isclose
 
 from pyscipopt.scip import Model, SumExpr
 
-def switch_comparator(comparator):
-    if isinstance(comparator, ast.Eq): return ast.NotEq()
-    if isinstance(comparator, ast.NotEq): return ast.Eq()
-    if isinstance(comparator, ast.Lt): return ast.Gt()
-    if isinstance(comparator, ast.LtE): return ast.GtE()
-    if isinstance(comparator, ast.Gt): return ast.Lt()
-    if isinstance(comparator, ast.GtE): return ast.LtE()
+
+def linearise(expr: ast.Compare, aux_var: Variable) -> tuple[ast.Compare, ast.Compare]:
+    """linearise
+    This function linearises an inequality using an auxilary variable
+    
+    The linearisation process is as follows.
+    If the expression is of the form of E1 <= E2, then we linearise by using the following expressions.
+    z=0 ==> E1 <= E2 and z=1 ==> E1 > E2 (equivalent to E1 >= E2 + feastol). This is then equivalent to,
+    E2 + feastol - M + z*M <= E1 <= E2 + zM.
+    
+    Similarly, for E1 < E2 we have z=0 ==> E1 < E2 which is equivalent to E1 <= E2 - feastol + z*M 
+    and z=1 ==> E1 >= E2.
+    Thus for E1 < E2 we have,
+    E2 + z*M - M <= E1 <= E2 + z*M - feastol.
+    
+    If, however, the inequality is of the form of E1 >= E2 then we evaluate the expression, E2 <= E1.
+    Similarly, if the expression is E1 > E2 then we evaluate the expression E2 < E1.
+    
+    :param expr: An inequality expression which is linearised.
+    :type expr: ast.Compare
+    :param aux_var: An auxiliary variable used when linearising the inequality to determine if the expression is true or false.
+    :type aux_var: Variable
+    :raises ValueError: If expr is not a valid inequality (i.e. doesn't use <, <=, > and >=)
+    :return: both the linearised inequalities
+    :rtype: tuple[ast.Compare, ast.Compare]
+    """
+    if not isinstance(expr.ops[0], (ast.Lt, ast.LtE, ast.Gt, ast.GtE)):
+        raise ValueError("Only <, <=, > or >= are allowed")
+    if isinstance(expr.ops[0], ast.GtE):
+        expr.left, expr.comparators[0] = expr.comparators[0], expr.left
+        expr.ops[0] = ast.LtE()
+    if isinstance(expr.ops[0], ast.Gt):
+        expr.left, expr.comparators[0] = expr.comparators[0], expr.left
+        expr.ops[0] = ast.Lt()
+    
+    if isinstance(expr.ops[0], ast.LtE):
+        lhs = ast.BinOp(
+            left=expr.comparators[0], 
+            op=ast.Add(), 
+            right=ast.parse(f"feastol - bigM + {aux_var.name} * bigM").body[0].value
+        )
+        rhs = ast.BinOp(
+            left=expr.comparators[0], 
+            op=ast.Add(), 
+            right=ast.parse(f"{aux_var.name} * bigM").body[0].value
+        )
+    if isinstance(expr.ops[0], ast.Lt):
+        lhs = ast.BinOp(
+            left=expr.comparators[0], 
+            op=ast.Add(), 
+            right=ast.parse(f"{aux_var.name} * bigM - bigM").body[0].value
+        )
+        rhs = ast.BinOp(
+            left=expr.comparators[0], 
+            op=ast.Add(), 
+            right=ast.parse(f"{aux_var.name} * bigM - feastol").body[0].value
+        )
+    expr1 = ast.Compare(lhs, [ast.LtE()], [expr.left])
+    expr2 = ast.Compare(expr.left, [ast.LtE()], [rhs])
+    return expr1, expr2
+    
+
 
 @dataclass
 class Expressions:
@@ -37,8 +92,8 @@ class Expressions:
 
 class ParserType(Enum):
     """ParserType
-    "enum type CALCULATOR: Used to calculate using feastol
-    "enum type PARSER: Used to parse an expression and create the correct minlp constraints
+    enum type CALCULATOR: Used to calculate using feastol
+    enum type PARSER: Used to parse an expression and create the correct minlp constraints
     """
     CALCULATOR = "calculator"
     PARSER = "parser"
@@ -149,25 +204,15 @@ class ParseModel:
                             else:
                                 aux_var: Variable = self.expressions.aux_vars[idx]
                     
-                            aux_vars.append(aux_var)
+                            if self.params.add_aux_vars is True:
+                                aux_vars.append(aux_var)
                             self.variables[aux_var.name] = aux_var.model_var
                             
-                            expr.left = ast.BinOp(
-                                left=expr.left, 
-                                op=(ast.Add() if isinstance(expr.ops[0], (ast.Gt, ast.GtE)) else ast.Sub()), 
-                                right=ast.parse(f"bigM * {aux_var.name}").body[0].value
-                            )
-                            self.expressions.add_expressions(self.evaluate(expr))
-                            
-                            expr.ops[0] = switch_comparator(expr.ops[0])
+                            expr1, expr2 = linearise(expr, aux_var)
                             
-                            expr.comparators[0] = ast.BinOp(
-                                left=expr.comparators[0], 
-                                op=(ast.Add() if isinstance(expr.ops[0], (ast.Gt, ast.GtE)) else ast.Sub()), 
-                                right=ast.parse(f"feastol - bigM").body[0].value
-                            )
-                            
-                            self.expressions.add_expressions(self.evaluate(expr))
+                            self.expressions.add_expressions(self.evaluate(expr1))
+                            self.expressions.add_expressions(self.evaluate(expr2))
+
                         else:
                             raise Exception("or expressions may only be made up of inequalities")
                     lhs = SumExpr()
@@ -236,4 +281,4 @@ if __name__ == "__main__":
 #     print(calc(
 # """
 # a + b + c >= 5 or a - b - c == 10
-# """))
+# """))

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/scipplan/plan_model.py

@@ -116,12 +116,17 @@ class PlanModel:
             
             self.var_names.add(name)
             
-            for t in range(self.config.horizon):
-                variables[(name, t)] = Variable.create_var(self.model, name, vtype, t, self.constants)
-                var_type = variables[(name, t)].var_type
-            if var_type is VarType.STATE:
-                variables[(name, self.config.horizon)] = Variable.create_var(self.model, name, vtype, self.config.horizon, self.constants)
-                    
+            if vtype.startswith("global"):
+                var = Variable.create_var(self.model, name, vtype, "global", self.constants)
+                for t in range(self.config.horizon + 1):
+                    variables[(name, t)] = var
+            else:
+                for t in range(self.config.horizon):
+                    variables[(name, t)] = Variable.create_var(self.model, name, vtype, t, self.constants)
+                    var_type = variables[(name, t)].var_type
+                if var_type is VarType.STATE:
+                    variables[(name, self.config.horizon)] = Variable.create_var(self.model, name, vtype, self.config.horizon, self.constants)
+
         return variables
                 
          
@@ -160,8 +165,6 @@ class PlanModel:
         for cons_idx, (translation, constraints) in enumerate(translations.items()):
             for idx, constraint in enumerate(constraints):
                 if (self.config.provide_sols is False) and (translation == "temporal_constraints"):
-                    # for func_name, func in self.ode_functions.items():
-                    #     constraint = constraint.replace(func_name, func)
                     pattern = r"|".join(f"({func_name})" for func_name, func in self.ode_functions.items())
                     constraint = re.sub(pattern, lambda x: self.ode_functions[x.group(0)], constraint)
                     constraints[idx] = constraint
@@ -297,7 +300,7 @@ class PlanModel:
 
         dt = Symbol(dt_var)
         # Used to represent constant variables
-        temp_var = Symbol("TEMP_VAR")
+        temp_var = Symbol("ODES_TEMP_VAR")
 
         variables = {}
         states = []

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/scipplan/scipplan.py

@@ -68,7 +68,8 @@ class SCIPPlan:
                 "zero_crossing_coefficient": zero_cross.coef,
                 "new_dt_val": zero_cross.new_dt_val,
                 "horizon": zero_cross.horizon,
-                "iteration": zero_cross.iteration
+                "iteration": zero_cross.iteration,
+                "constraint_idx": zero_cross.constraint_idx
             })
             
             if self.config.show_output is True:
@@ -80,19 +81,19 @@ class SCIPPlan:
             
             self.scip_model.freeTransform()
             
-            for idx, constraint in enumerate(self.plan.translations["temporal_constraints"]):
-                t = zero_cross.horizon
-                # aux_vars = self.plan.aux_vars["temporal_constraints"][idx][t]
-                aux_vars = const_gen_aux_vars[idx][t]
-                # Only add aux vars if there are no aux vars added for the secific constraint
-                params = self.plan.get_parser_params(horizon=t, add_aux_vars=aux_vars is None)
-                params.variables[self.config.dt_var] *= zero_cross.coef
-                exprs = PM(params).evaluate(constraint, aux_vars=aux_vars)
-                if const_gen_aux_vars[idx][t] is None:
-                    const_gen_aux_vars[idx][t] = exprs.aux_vars
-                    
-                for eqtn_idx, eqtn in enumerate(exprs):
-                    self.plan.model.addCons(eqtn, f"{constraint}_{idx}_{eqtn_idx}")
+            t = zero_cross.horizon
+            idx = zero_cross.constraint_idx
+            constraint = self.plan.translations["temporal_constraints"][idx]
+            aux_vars = self.plan.aux_vars["temporal_constraints"][idx][t]
+            # Only add aux vars if there are no aux vars added for the specific constraint
+            params = self.plan.get_parser_params(horizon=t, add_aux_vars=aux_vars is None)
+            params.variables[self.config.dt_var] *= zero_cross.coef
+            exprs = PM(params).evaluate(constraint, aux_vars=aux_vars)
+            if const_gen_aux_vars[idx][t] is None:
+                const_gen_aux_vars[idx][t] = exprs.aux_vars
+             
+            for eqtn_idx, eqtn in enumerate(exprs):
+                self.plan.model.addCons(eqtn, f"{constraint}_{idx}_{eqtn_idx}")
             
             iteration += 1
 
@@ -104,7 +105,7 @@ class SCIPPlan:
         for h in range(self.config.horizon):
             dt = self.scip_model.getVal(self.plan.variables[(self.config.dt_var, h)].model_var)
             
-            for constraint in self.plan.translations["temporal_constraints"]:
+            for idx, constraint in enumerate(self.plan.translations["temporal_constraints"]):
                 is_violated = False
                 
                 for time in iterate(0, dt, self.config.epsilon):
@@ -129,6 +130,7 @@ class SCIPPlan:
                         start=cross_interval[0],
                         end=cross_interval[1],
                         dt_interval=dt,
+                        constraint_idx = idx,
                     )
         
         return ZeroCrossing(is_violated=False)
@@ -213,4 +215,4 @@ def main():
     print(f"Total time: {solve_time:.3f}")
 
 if __name__ == "__main__":
-    main()
+    main()

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/scipplan/zero_crossing.py

@@ -11,6 +11,7 @@ class ZeroCrossing:
     dt_interval: float = None
     coef: float = field(init=False, default=None)
     new_dt_val: float = field(init=False, default=None)
+    constraint_idx: int = None
     
     def __post_init__(self):
         if self.is_violated is True:
@@ -25,4 +26,4 @@ class ZeroCrossing:
                     """))
             avg_interval = (self.start + self.end) / 2.0
             self.coef = avg_interval / self.dt_interval
-            self.new_dt_val = self.coef * self.dt_interval
+            self.new_dt_val = self.coef * self.dt_interval

scipplan-0.2.2a0/scipplan.egg-info/PKG-INFO

@@ -0,0 +1,103 @@
+Metadata-Version: 2.1
+Name: scipplan
+Version: 0.2.2a0
+Summary: Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation in Python.
+Author: Ari Gestetner, Buser Say
+Author-email: ari.gestetner@monash.edu, buser.say@monash.edu
+License: MIT License
+Keywords: scip,automated planner
+Classifier: Development Status :: 3 - Alpha
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Natural Language :: English
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+# SCIPPlan
+
+SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions (which can be specified as ODEs or directly as solution equations) that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
+
+## Example Domain: Navigation
+
+<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
+
+
+Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
+
+Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
+
+## Dependencies
+
+i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
+
+ii) Symbolic Mathematics: SymPy [6].
+
+## Installing and Running SCIPPlan
+In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
+
+After installing SCIP you will be able to install SCIPPlan using
+```bash
+pip install scipplan
+```
+Now you will be able to run some of the example domains which include 
+- Navigation (3 instances)
+
+To run one of these examples all you need to do is run
+```bash
+scipplan -D navigation -I 1
+```
+which will run the 1st instance of the navigation domain using the ODEs as the transition function with the help of SymPy [6]. Similarly, the command
+```bash
+scipplan -D navigation -I 1 --provide-sols
+```
+will run the the 1st instance of the navigation domain using the solution equations as the transition function. For more information regarding the available tags and what they mean run `scipplan --help`.
+
+Alternatively you can import scipplan classes to run it using python.
+```py
+from scipplan.scipplan import SCIPPlan
+from scipplan.config import Config
+from scipplan.helpers import write_to_csv
+```
+this will import the only two classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
+```py
+# Set params
+config = Config(domain="navigation", instance=1)
+# Retrieve cli args
+config = Config.get_config()
+```
+after which you are able to solve problem by either using the solve or optimize methods
+```py
+# The optimize method just optimises the problem for the given horizon
+plan = SCIPPlan(config)
+plan.optimize()
+# Class method which takes input the config, solves the problem 
+# with auto incrementing the horizon until a solution is found then 
+# returns the plan as well as the time taken to solve the problem
+plan, solve_time = SCIPPlan.solve(config)  
+```
+In order to save the generated constraints for the horizon solved as well as the results, use the following code
+```py
+write_to_csv("new_constraints", plan.new_constraints, config)
+write_to_csv("results", plan.results_table, config)
+```
+
+## Citation
+
+If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
+
+## References
+[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
+
+[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
+
+[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
+
+[4] [SCIP](https://www.scipopt.org/)
+
+[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)
+
+[6] [SymPy](https://www.sympy.org/en/index.html)

scipplan-0.2.2a0/scipplan.egg-info/top_level.txt

@@ -0,0 +1,5 @@
+build
+dist
+output
+scipplan
+visualisation

{scipplan-0.2.0a2 → scipplan-0.2.2a0}/setup.py

@@ -1,6 +1,6 @@
 import scipplan
 
-from setuptools import setup, find_packages
+from setuptools import setup, find_namespace_packages
 
 def readme():
     with open("README.md") as f:
@@ -15,7 +15,7 @@ setup(
     license="MIT License",
     author=scipplan.__author__,
     author_email=scipplan.__email__,
-    packages=find_packages(),  # Automatically find all packages
+    packages=find_namespace_packages(),  # Automatically find all packages
     include_package_data=True,
     package_data={
         # "": ["translation/*.txt"], 

scipplan-0.2.0a2/PKG-INFO

@@ -1,215 +0,0 @@
-Metadata-Version: 2.1
-Name: scipplan
-Version: 0.2.0a2
-Summary: Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation in Python.
-Author: Ari Gestetner, Buser Say
-Author-email: ari.gestetner@monash.edu, buser.say@monash.edu
-License: MIT License
-Keywords: scip,automated planner
-Classifier: Development Status :: 3 - Alpha
-Classifier: Environment :: Console
-Classifier: Intended Audience :: Science/Research
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Natural Language :: English
-Classifier: Operating System :: OS Independent
-Classifier: Programming Language :: Python :: 3
-Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
-Description-Content-Type: text/markdown
-License-File: LICENSE
-
-# SCIPPlan
-
-SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
-
-## Example Domain: Navigation
-
-<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
-
-
-Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
-
-Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
-
-## Dependencies
-
-i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
-
-## Installing and Running SCIPPlan
-In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
-
-After installing SCIP you will be able to install SCIPPlan using
-```bash
-pip install scipplan
-```
-Now you will be able to run some of the example domains which include 
-- Navigation (3 instances)
-
-To run one of these examples all you need to do is run
-```bash
-scipplan -D navigation -I 1
-```
-which will run the 1st instance of the navigation domain. For more information regarding the available tags and what they mean run `scipplan --help`.
-
-Alternatively you can import scipplan classes to run it using python.
-```py
-from scipplan.scipplan import SCIPPlan
-from scipplan.config import Config
-from scipplan.helpers import write_to_csv
-```
-this will import the only 2 classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
-```py
-# Set params
-config = Config(domain="navigation", instance=1)
-# Retrieve cli args
-config = Config.get_config()
-```
-after which you are able to solve problem by either using the solve or optimize methods
-```py
-# The optimize method just optimises the problem for the given horizon
-plan = SCIPPlan(config)
-plan.optimize()
-# Class method which takes input the config, solves the problem 
-# with auto incrementing the horizon until a solution is found then 
-# returns the plan as well as the time taken to solve the problem
-plan, solve_time = SCIPPlan.solve(config)  
-```
-In order to save the generated constraints for the horizon solved as well as the results, use the following code
-```py
-write_to_csv("new_constraints", plan.new_constraints, config)
-write_to_csv("results", plan.results_table, config)
-```
-
-
-
-## Custom Domains
-If you would like to create your own domain you will need to create a directory named "translation" in the directory which scipplan is run from with txt files of the format "{translation type}\_{domain name}\_{instance number}.txt" (e.g. "pvariables_navigation_1.txt"). Note that the files in the translation directory will override any example files if they share domain name and instance number (e.g. navigation 1 would override the example).
-
-For each domain instance the following translation files are required
-- constants
-- pvariables
-- initials
-- goals
-- instantaneous_constraints
-- temporal_constraints
-- transitions
-- reward
-
-As a part of SCIPPlan, all the constraint files allow for the use of "and" and "or" expressions, polynomials and `exp`, `log`, `sqrt`, `sin` and `cos` functions (Note: `sin` and `cos` are only available in PySCIPOpt>=4.3.0 so if your version is below that you will not be able to use the trig functions unless you update).
-
-### Constants
-The constants file allows for constant values to be defined as a variable to be used in other files in the model. To use add constants as follows
-```txt
-HalfVal = 0.5
-Epsilon = config_epsilon
-bigM = config_bigM
-```  
-
-Some config values can be accessed in the constants file to be used in other files and are available as 
-- `config_epsilon`
-- `config_gap`
-- `config_bigM`  
-Note that these variables are only accessible in the constants file and you will need to define a new constants variable to store the value 
-
-### Pvariables
-When creating the pvariables file, the variables should be listed in the following format
-```txt
-action_continuous: Accelerate_x
-action_continuous: Accelerate_y
-action_continuous: Dt
-action_boolean: Mode
-state_continuous: Location_x
-state_continuous: Location_y
-state_continuous: Speed_x
-state_continuous: Speed_y
-```
-where the variable and value type of the variable is set in the format "{variable type}_{value type}" and the variable itself has to be in a Python compatible format (e.g. variables can't use - sign like `some-var` but can use _ like `some_var` as well as the dash sign ' cannot be used). The use of next state variables which is often written using the dash symbol will be explained further in the Transitions section.  
-Additionally a variable for Dt has to be defined and has to be the same as the dt_var in the config object so if you would like to use a different variable name for Dt (e.g. dt) please also ensure you add it to the config via the `--dt-var` tag or the `dt_var` parameter.  
-The available variable types are
-- state
-- action
-- auxiliary
-
-The available value types are 
-- continuos
-- integer 
-- boolean 
-
-Please note that constants don't need to have their variable names defined in pvariables as they are defined in constants.
-
-### Initials
-The initials file defines the initial state values for time t=0, for example
-```txt
-Location_x == 0.0
-Location_y == 0.0
-Speed_x == 0.0
-Speed_y == 0.0
-```
-notice te use of teh constant value defined earlier in the constants file.
-### Goals
-The goals file should encode the final state values such that t=H+1, for example
-```txt
-Location_x == 8.0
-Location_y == 8.0
-```
-### Instantaneous Constraints
-This is where the instantaneous constraints go.
-An example is as follows
-```txt
-Location_x <= 10.0
-Location_y <= 10.0
-Location_x >= 0.0
-Location_y >= 0.0
-Accelerate_x <= 0.5
-Accelerate_y <= 0.5
-Accelerate_x >= -0.5
-Accelerate_y >= -0.5
-(Location_x <= 4.0) or (Location_x >= 6.0) or (Location_y <= 4.0) or (Location_y >= 6.0)
-```
-### Temporal Constraints
-The temporal constraints are the constraints which SCIPPlan will ensure that the solution never violates by iterating through every epsilon value of Dt and checking for zero crossings. An example of a temporal constraint is as follows
-```txt
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-
-((Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0))
-```
-
-The use of mode switches are used in these constraints (`Dt + Epsilon*Mode`). Please note that the or expression is enclosed in round brackets which allows the constraints to be parsed as a singular expression
-### Transitions
-Transitions are to be added here with the following syntax.  
-For example $S_{t+1} = \frac 12 A_t\cdot t^2 + V_t\cdot t + S_t$.  
-Alternatively this can be written as $S' = \frac 12 A\cdot t^2 + V\cdot t + S$.
-Since Python doesn't allow variables to use the ' symbol it should be replaced with `_dash`, for example
-```txt
-Location_x_dash - 1.0*Location_x - 1.0*Speed_x*(Dt + Epsilon*Mode) - 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Location_y_dash - 1.0*Location_y - 1.0*Speed_y*(Dt + Epsilon*Mode) - 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Speed_x_dash - 1.0*Speed_x - 1.0*Accelerate_x*(Dt + Epsilon*Mode) == 0.0
-Speed_y_dash - 1.0*Speed_y - 1.0*Accelerate_y*(Dt + Epsilon*Mode) == 0.0
-```
-
-### Reward
-As for the reward function, SCIPPlan maximises the reward thus if using a cost function it should be negated as per the example
-```txt
--1.0*(Dt + Mode * Epsilon)
-```
-Only one reward function is able to be optimised for in SCIPPlan
-
-## Citation
-
-If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
-
-## References
-[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
-
-[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
-
-[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
-
-[4] [SCIP](https://www.scipopt.org/)
-
-[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)

scipplan-0.2.0a2/README.md

@@ -1,196 +0,0 @@
-# SCIPPlan
-
-SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
-
-## Example Domain: Navigation
-
-<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
-
-
-Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
-
-Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
-
-## Dependencies
-
-i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
-
-## Installing and Running SCIPPlan
-In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
-
-After installing SCIP you will be able to install SCIPPlan using
-```bash
-pip install scipplan
-```
-Now you will be able to run some of the example domains which include 
-- Navigation (3 instances)
-
-To run one of these examples all you need to do is run
-```bash
-scipplan -D navigation -I 1
-```
-which will run the 1st instance of the navigation domain. For more information regarding the available tags and what they mean run `scipplan --help`.
-
-Alternatively you can import scipplan classes to run it using python.
-```py
-from scipplan.scipplan import SCIPPlan
-from scipplan.config import Config
-from scipplan.helpers import write_to_csv
-```
-this will import the only 2 classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
-```py
-# Set params
-config = Config(domain="navigation", instance=1)
-# Retrieve cli args
-config = Config.get_config()
-```
-after which you are able to solve problem by either using the solve or optimize methods
-```py
-# The optimize method just optimises the problem for the given horizon
-plan = SCIPPlan(config)
-plan.optimize()
-# Class method which takes input the config, solves the problem 
-# with auto incrementing the horizon until a solution is found then 
-# returns the plan as well as the time taken to solve the problem
-plan, solve_time = SCIPPlan.solve(config)  
-```
-In order to save the generated constraints for the horizon solved as well as the results, use the following code
-```py
-write_to_csv("new_constraints", plan.new_constraints, config)
-write_to_csv("results", plan.results_table, config)
-```
-
-
-
-## Custom Domains
-If you would like to create your own domain you will need to create a directory named "translation" in the directory which scipplan is run from with txt files of the format "{translation type}\_{domain name}\_{instance number}.txt" (e.g. "pvariables_navigation_1.txt"). Note that the files in the translation directory will override any example files if they share domain name and instance number (e.g. navigation 1 would override the example).
-
-For each domain instance the following translation files are required
-- constants
-- pvariables
-- initials
-- goals
-- instantaneous_constraints
-- temporal_constraints
-- transitions
-- reward
-
-As a part of SCIPPlan, all the constraint files allow for the use of "and" and "or" expressions, polynomials and `exp`, `log`, `sqrt`, `sin` and `cos` functions (Note: `sin` and `cos` are only available in PySCIPOpt>=4.3.0 so if your version is below that you will not be able to use the trig functions unless you update).
-
-### Constants
-The constants file allows for constant values to be defined as a variable to be used in other files in the model. To use add constants as follows
-```txt
-HalfVal = 0.5
-Epsilon = config_epsilon
-bigM = config_bigM
-```  
-
-Some config values can be accessed in the constants file to be used in other files and are available as 
-- `config_epsilon`
-- `config_gap`
-- `config_bigM`  
-Note that these variables are only accessible in the constants file and you will need to define a new constants variable to store the value 
-
-### Pvariables
-When creating the pvariables file, the variables should be listed in the following format
-```txt
-action_continuous: Accelerate_x
-action_continuous: Accelerate_y
-action_continuous: Dt
-action_boolean: Mode
-state_continuous: Location_x
-state_continuous: Location_y
-state_continuous: Speed_x
-state_continuous: Speed_y
-```
-where the variable and value type of the variable is set in the format "{variable type}_{value type}" and the variable itself has to be in a Python compatible format (e.g. variables can't use - sign like `some-var` but can use _ like `some_var` as well as the dash sign ' cannot be used). The use of next state variables which is often written using the dash symbol will be explained further in the Transitions section.  
-Additionally a variable for Dt has to be defined and has to be the same as the dt_var in the config object so if you would like to use a different variable name for Dt (e.g. dt) please also ensure you add it to the config via the `--dt-var` tag or the `dt_var` parameter.  
-The available variable types are
-- state
-- action
-- auxiliary
-
-The available value types are 
-- continuos
-- integer 
-- boolean 
-
-Please note that constants don't need to have their variable names defined in pvariables as they are defined in constants.
-
-### Initials
-The initials file defines the initial state values for time t=0, for example
-```txt
-Location_x == 0.0
-Location_y == 0.0
-Speed_x == 0.0
-Speed_y == 0.0
-```
-notice te use of teh constant value defined earlier in the constants file.
-### Goals
-The goals file should encode the final state values such that t=H+1, for example
-```txt
-Location_x == 8.0
-Location_y == 8.0
-```
-### Instantaneous Constraints
-This is where the instantaneous constraints go.
-An example is as follows
-```txt
-Location_x <= 10.0
-Location_y <= 10.0
-Location_x >= 0.0
-Location_y >= 0.0
-Accelerate_x <= 0.5
-Accelerate_y <= 0.5
-Accelerate_x >= -0.5
-Accelerate_y >= -0.5
-(Location_x <= 4.0) or (Location_x >= 6.0) or (Location_y <= 4.0) or (Location_y >= 6.0)
-```
-### Temporal Constraints
-The temporal constraints are the constraints which SCIPPlan will ensure that the solution never violates by iterating through every epsilon value of Dt and checking for zero crossings. An example of a temporal constraint is as follows
-```txt
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-
-((Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0))
-```
-
-The use of mode switches are used in these constraints (`Dt + Epsilon*Mode`). Please note that the or expression is enclosed in round brackets which allows the constraints to be parsed as a singular expression
-### Transitions
-Transitions are to be added here with the following syntax.  
-For example $S_{t+1} = \frac 12 A_t\cdot t^2 + V_t\cdot t + S_t$.  
-Alternatively this can be written as $S' = \frac 12 A\cdot t^2 + V\cdot t + S$.
-Since Python doesn't allow variables to use the ' symbol it should be replaced with `_dash`, for example
-```txt
-Location_x_dash - 1.0*Location_x - 1.0*Speed_x*(Dt + Epsilon*Mode) - 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Location_y_dash - 1.0*Location_y - 1.0*Speed_y*(Dt + Epsilon*Mode) - 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Speed_x_dash - 1.0*Speed_x - 1.0*Accelerate_x*(Dt + Epsilon*Mode) == 0.0
-Speed_y_dash - 1.0*Speed_y - 1.0*Accelerate_y*(Dt + Epsilon*Mode) == 0.0
-```
-
-### Reward
-As for the reward function, SCIPPlan maximises the reward thus if using a cost function it should be negated as per the example
-```txt
--1.0*(Dt + Mode * Epsilon)
-```
-Only one reward function is able to be optimised for in SCIPPlan
-
-## Citation
-
-If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
-
-## References
-[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
-
-[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
-
-[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
-
-[4] [SCIP](https://www.scipopt.org/)
-
-[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)

scipplan-0.2.0a2/scipplan/__init__.py

@@ -1,5 +0,0 @@
-__version__ = "0.2.0alpha2"
-print(f"SCIPPlan Version: {__version__}")
-__release__ = "v0.2.0a2"
-__author__ = "Ari Gestetner, Buser Say"
-__email__ = "ari.gestetner@monash.edu, buser.say@monash.edu"

scipplan-0.2.0a2/scipplan.egg-info/PKG-INFO

@@ -1,215 +0,0 @@
-Metadata-Version: 2.1
-Name: scipplan
-Version: 0.2.0a2
-Summary: Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation in Python.
-Author: Ari Gestetner, Buser Say
-Author-email: ari.gestetner@monash.edu, buser.say@monash.edu
-License: MIT License
-Keywords: scip,automated planner
-Classifier: Development Status :: 3 - Alpha
-Classifier: Environment :: Console
-Classifier: Intended Audience :: Science/Research
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Natural Language :: English
-Classifier: Operating System :: OS Independent
-Classifier: Programming Language :: Python :: 3
-Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
-Description-Content-Type: text/markdown
-License-File: LICENSE
-
-# SCIPPlan
-
-SCIPPlan [1,2,3] is a SCIP-based [4] hybrid planner for domains with i) mixed (i.e., real and/or discrete valued) state and action spaces, ii) nonlinear state transitions that are functions of time, and iii) general reward functions. SCIPPlan iteratively i) finds violated constraints (i.e., zero-crossings) by simulating the state transitions, and ii) adds the violated (symbolic) constraints back to its underlying optimisation model, until a valid plan is found.
-
-## Example Domain: Navigation
-
-<img src=./visualisation/scipplan_navigation_1.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_2.gif width="32%" height="32%"> <img src=./visualisation/scipplan_navigation_3.gif width="32%" height="32%">
-
-
-Figure 1: Visualisation of different plans generated by SCIPPlan [1,2,3] for example navigation domains where the red square represents the agent, the blue shapes represent the obstacles, the gold star represents the goal location and the delta represents time. The agent can control its acceleration and the duration of its control input to modify its speed and location in order to navigate in a two-dimensional maze. The purpose of the domain is to find a path for the agent with minimum makespan such that the agent reaches its the goal without colliding with the obstacles. 
-
-Note that SCIPPlan does not linearise or discretise the domain to find a valid plan.
-
-## Dependencies
-
-i) Solver: SCIP (the current implementation uses the python interface to the SCIP solver, i.e., PySCIPOpt [5]). This version of SCIPPlan has only been tested on PySCIOpt>=4.0.0 using earlier an version of pyscipopt may result in unintended behaviour. 
-
-## Installing and Running SCIPPlan
-In order to Install SCIPPlan you need to ensure you have a working version of the SCIP optimisation suite on your system which can be installed from [the SCIP website](https://www.scipopt.org). For more information about SCIP and PySCIPOpt refer to this [installation guide](https://github.com/scipopt/PySCIPOpt/blob/master/INSTALL.md).
-
-After installing SCIP you will be able to install SCIPPlan using
-```bash
-pip install scipplan
-```
-Now you will be able to run some of the example domains which include 
-- Navigation (3 instances)
-
-To run one of these examples all you need to do is run
-```bash
-scipplan -D navigation -I 1
-```
-which will run the 1st instance of the navigation domain. For more information regarding the available tags and what they mean run `scipplan --help`.
-
-Alternatively you can import scipplan classes to run it using python.
-```py
-from scipplan.scipplan import SCIPPlan
-from scipplan.config import Config
-from scipplan.helpers import write_to_csv
-```
-this will import the only 2 classes and function needed to run SCIPPlan. Then to set the configuration either create an instance of the Config class by setting the params or by retrieving the cli input
-```py
-# Set params
-config = Config(domain="navigation", instance=1)
-# Retrieve cli args
-config = Config.get_config()
-```
-after which you are able to solve problem by either using the solve or optimize methods
-```py
-# The optimize method just optimises the problem for the given horizon
-plan = SCIPPlan(config)
-plan.optimize()
-# Class method which takes input the config, solves the problem 
-# with auto incrementing the horizon until a solution is found then 
-# returns the plan as well as the time taken to solve the problem
-plan, solve_time = SCIPPlan.solve(config)  
-```
-In order to save the generated constraints for the horizon solved as well as the results, use the following code
-```py
-write_to_csv("new_constraints", plan.new_constraints, config)
-write_to_csv("results", plan.results_table, config)
-```
-
-
-
-## Custom Domains
-If you would like to create your own domain you will need to create a directory named "translation" in the directory which scipplan is run from with txt files of the format "{translation type}\_{domain name}\_{instance number}.txt" (e.g. "pvariables_navigation_1.txt"). Note that the files in the translation directory will override any example files if they share domain name and instance number (e.g. navigation 1 would override the example).
-
-For each domain instance the following translation files are required
-- constants
-- pvariables
-- initials
-- goals
-- instantaneous_constraints
-- temporal_constraints
-- transitions
-- reward
-
-As a part of SCIPPlan, all the constraint files allow for the use of "and" and "or" expressions, polynomials and `exp`, `log`, `sqrt`, `sin` and `cos` functions (Note: `sin` and `cos` are only available in PySCIPOpt>=4.3.0 so if your version is below that you will not be able to use the trig functions unless you update).
-
-### Constants
-The constants file allows for constant values to be defined as a variable to be used in other files in the model. To use add constants as follows
-```txt
-HalfVal = 0.5
-Epsilon = config_epsilon
-bigM = config_bigM
-```  
-
-Some config values can be accessed in the constants file to be used in other files and are available as 
-- `config_epsilon`
-- `config_gap`
-- `config_bigM`  
-Note that these variables are only accessible in the constants file and you will need to define a new constants variable to store the value 
-
-### Pvariables
-When creating the pvariables file, the variables should be listed in the following format
-```txt
-action_continuous: Accelerate_x
-action_continuous: Accelerate_y
-action_continuous: Dt
-action_boolean: Mode
-state_continuous: Location_x
-state_continuous: Location_y
-state_continuous: Speed_x
-state_continuous: Speed_y
-```
-where the variable and value type of the variable is set in the format "{variable type}_{value type}" and the variable itself has to be in a Python compatible format (e.g. variables can't use - sign like `some-var` but can use _ like `some_var` as well as the dash sign ' cannot be used). The use of next state variables which is often written using the dash symbol will be explained further in the Transitions section.  
-Additionally a variable for Dt has to be defined and has to be the same as the dt_var in the config object so if you would like to use a different variable name for Dt (e.g. dt) please also ensure you add it to the config via the `--dt-var` tag or the `dt_var` parameter.  
-The available variable types are
-- state
-- action
-- auxiliary
-
-The available value types are 
-- continuos
-- integer 
-- boolean 
-
-Please note that constants don't need to have their variable names defined in pvariables as they are defined in constants.
-
-### Initials
-The initials file defines the initial state values for time t=0, for example
-```txt
-Location_x == 0.0
-Location_y == 0.0
-Speed_x == 0.0
-Speed_y == 0.0
-```
-notice te use of teh constant value defined earlier in the constants file.
-### Goals
-The goals file should encode the final state values such that t=H+1, for example
-```txt
-Location_x == 8.0
-Location_y == 8.0
-```
-### Instantaneous Constraints
-This is where the instantaneous constraints go.
-An example is as follows
-```txt
-Location_x <= 10.0
-Location_y <= 10.0
-Location_x >= 0.0
-Location_y >= 0.0
-Accelerate_x <= 0.5
-Accelerate_y <= 0.5
-Accelerate_x >= -0.5
-Accelerate_y >= -0.5
-(Location_x <= 4.0) or (Location_x >= 6.0) or (Location_y <= 4.0) or (Location_y >= 6.0)
-```
-### Temporal Constraints
-The temporal constraints are the constraints which SCIPPlan will ensure that the solution never violates by iterating through every epsilon value of Dt and checking for zero crossings. An example of a temporal constraint is as follows
-```txt
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 10.0
-Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 0.0
-
-((Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_x + Speed_x*(Dt + Epsilon*Mode) + 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) <= 4.0) or 
-(Location_y + Speed_y*(Dt + Epsilon*Mode) + 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) >= 6.0))
-```
-
-The use of mode switches are used in these constraints (`Dt + Epsilon*Mode`). Please note that the or expression is enclosed in round brackets which allows the constraints to be parsed as a singular expression
-### Transitions
-Transitions are to be added here with the following syntax.  
-For example $S_{t+1} = \frac 12 A_t\cdot t^2 + V_t\cdot t + S_t$.  
-Alternatively this can be written as $S' = \frac 12 A\cdot t^2 + V\cdot t + S$.
-Since Python doesn't allow variables to use the ' symbol it should be replaced with `_dash`, for example
-```txt
-Location_x_dash - 1.0*Location_x - 1.0*Speed_x*(Dt + Epsilon*Mode) - 0.5*Accelerate_x*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Location_y_dash - 1.0*Location_y - 1.0*Speed_y*(Dt + Epsilon*Mode) - 0.5*Accelerate_y*(Dt + Epsilon*Mode)*(Dt + Epsilon*Mode) == 0.0
-Speed_x_dash - 1.0*Speed_x - 1.0*Accelerate_x*(Dt + Epsilon*Mode) == 0.0
-Speed_y_dash - 1.0*Speed_y - 1.0*Accelerate_y*(Dt + Epsilon*Mode) == 0.0
-```
-
-### Reward
-As for the reward function, SCIPPlan maximises the reward thus if using a cost function it should be negated as per the example
-```txt
--1.0*(Dt + Mode * Epsilon)
-```
-Only one reward function is able to be optimised for in SCIPPlan
-
-## Citation
-
-If you are using SCIPPlan, please cite the papers [1,2,3] and the underlying SCIP solver [4].
-
-## References
-[1] Buser Say and Scott Sanner. [Metric Nonlinear Hybrid Planning with Constraint Generation](http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop06/docs/proceedings.pdf#page=23). In PlanSOpt, pages 19-25, 2018.
-
-[2] Buser Say and Scott Sanner. [Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation](https://link.springer.com/chapter/10.1007/978-3-030-19212-9_33). In CPAIOR, pages 502-518, 2019.
-
-[3] Buser Say. [Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization](https://ojs.aaai.org/index.php/ICAPS/article/view/27216). In ICAPS, pages 375-383, 2023.
-
-[4] [SCIP](https://www.scipopt.org/)
-
-[5] [PySCIPOpt](https://github.com/SCIP-Interfaces/PySCIPOpt)

scipplan-0.2.0a2/scipplan.egg-info/top_level.txt

@@ -1 +0,0 @@
-scipplan