• AltAlt

  • Referenced in 7 articles [sw20691]
  • combination of Graphplan and heuristic state space search technology. The first version of AltAlt competed ... heuristic search planner. Basically, AltAlt uses Graphplan’s planning graph data structure to derive ... heuristic computation, as well as the state search. Specifically, we have use partial constructed planning ... computing the heuristics, and subsets of actions in the planning graph to limit the branching...
  • POMDPS

  • Referenced in 37 articles [sw03055]
  • Online planning algorithms for POMDPS. Partially Observable Markov Decision Processes (POMDPs) provide a rich framework ... Online algorithms generally consist of a lookahead search to find the best action to execute ... indicate that state-of-the-art online heuristic search methods can handle large POMDP domains...
  • MOAPPS

  • Referenced in 11 articles [sw13459]
  • production planning using the multiple-objective tabu search. In recent years, there has been ... complex planning and design problems using the modern heuristics optimization techniques (i.e. tabu search, genetic ... modelling approach used, aggregate production planning (APP) problems can be quite complex and large scale ... need to investigate the suitability of modern heuristics for their solution. In this paper...
  • AltAltp

  • Referenced in 2 articles [sw20689]
  • AltAltp: Online parallelization of plans with heuristic state search. Despite their near dominance, heuristic state ... parallel plans in classical planning. The reason is that directly searching for parallel solutions ... heuristic state search planner AltAlt, called AltAltp which generates parallel plans by using greedy online ... plans. The greedy approach is significantly informed by the use of novel distance heuristics that...
  • LPG

  • Referenced in 12 articles [sw20690]
  • current partial plan, and are dynamically evaluated during search using discrete Lagrange multipliers ... evaluation function uses some heuristics to estimate the ”search cost” and the ”execution cost ... during search, and that takes into account the mutex relations of the planning graph...
  • FluCaP

  • Referenced in 11 articles [sw07748]
  • abstraction. Secondly, guided by an admissible heuristic, the search is restricted to those states that ... probabilistic track of the 2004 International Planning Competition (IPC’2004) and demonstrated an advantage over...
  • COLIN

  • Referenced in 5 articles [sw27480]
  • planning with continuous linear numeric change. We describe COLIN, a forward-chaining heuristic search planner ... tightly coupled temporal and numeric reasoning during planning. COLIN combines FF-style forward chaining search ... extension of the temporal relaxed planning graph heuristic of CRIKEY3, to support reasoning directly with...
  • D* Extra Lite

  • Referenced in 2 articles [sw20992]
  • search-tree cutting and frontier-gap repairing. Searching for the shortest-path in an unknown ... popular incremental heuristic search algorithm (i.e., it utilizes knowledge from previous searches). Its efficiency lies ... expands only those parts of the search-space that are relevant to registered changes ... with reinitialization of the affected search-space achieved by search-tree branch cutting. The provided...
  • PISA

  • Referenced in 1 article [sw20692]
  • based on the compilation to conformant probabilistic planning is much intuitive, its performance appears ... second approach based on stochastic heuristic search works well for much larger problems. It aims ... estimating heuristic distance, which is then used to guide the search. Our planning system, PISA...
  • NMRDPP

  • Referenced in 4 articles [sw10437]
  • experimentation of methods for decision-theoretic planning with non-Markovian rewards. The current version ... detail. These include dynamic programming, heuristic search, and structured methods. Using NMRDPP, we compare ... inspired by the treatment of domain-specific search control knowledge in the TLPlan planner, which ... special case. In the First International Probabilistic Planning Competition, NMRDPP was able to compete...
  • D*Lite

  • Referenced in 6 articles [sw20991]
  • Stentz’ Focussed Dynamic A* is a heuristic search method that repeatedly determines a shortest path ... orders of magnitudes faster than planning from scratch since it modifies previous search results locally...
  • TorchLight

  • Referenced in 4 articles [sw13534]
  • Analyzing search topology without running any search: on the connection between causal graphs ... optimal planning. In earlier work, it was observed that the optimal relaxation heuristic...
  • MASS

  • Referenced in 3 articles [sw02593]
  • algorithm in facilities layout planning. We have proposed a semi-heuristic optimization algorithm for designing ... Hungarian assignment algorithm. Being a semi-heuristic search our algorithm is likely to be more...
  • ReDO

  • Referenced in 0 articles [sw25850]
  • cross-layer approach. It requires a careful planning for different fault-tolerance mechanisms at different ... layer reliability is therefore a multi-objective search problem in which reliability must be traded ... reliability of the full system. A new heuristic based on the extremal optimization theory...
  • BARON

  • Referenced in 330 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CCSP

  • Referenced in 14 articles [sw00111]
  • CCSP: A formal system for distributed program debugging...
  • CGAL

  • Referenced in 372 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • c-sat

  • Referenced in 8 articles [sw00168]
  • Parallelizing modern SAT solvers for clusters such as...
  • GAP

  • Referenced in 3003 articles [sw00320]
  • GAP is a system for computational discrete algebra...