Arrow Research search

Author name cluster

Andre Cire

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

AAAI Conference 2018 Conference Paper

Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning

  • Chiara Piacentini
  • Margarita Castro
  • Andre Cire
  • J. Christopher Beck

Linear programming has been successfully used to compute admissible heuristics for cost-optimal classical planning. Although one of the strengths of linear programming is the ability to express and reason about numeric variables and constraints, their use in numeric planning is limited. In this work, we extend linear programming-based heuristics for classical planning to support numeric state variables. In particular, we propose a model for the interval relaxation, coupled with landmarks and state equation constraints. We consider both linear programming models and their harder-tosolve, yet more informative, integer programming versions. Our experimental analysis shows that considering an NP- Hard heuristic often pays off and that A∗ search using our integer programming heuristics establishes a new state of the art in cost-optimal numeric planning.

PDF Details

AAAI Conference 2014 Conference Paper

Parallel Restarted Search

  • Andre Cire
  • Serdar Kadioglu
  • Meinolf Sellmann

We consider the problem of parallelizing restarted backtrack search. With few notable exceptions, most commercial and academic constraint programming solvers do not learn no-goods during search. Depending on the branching heuristics used, this means that there are little to no side-effects between restarts, making them an excellent target for parallelization. We develop a simple technique for parallelizing restarted search deterministically and demonstrate experimentally that we can achieve near-linear speed-ups in practice.

PDF Details