#### DMCA

## On the implementation of mips

### Cached

### Download Links

Venue: | In Proceedings of Workshop on DecisionTheoretic Planning, Artificial Intelligence Planning and Scheduling (AIPS |

Citations: | 30 - 4 self |

### Citations

1498 | A formal basis for the heuristic determination of minimum cost paths. - Hart, Nilsson, et al. - 1968 |

1157 | Fast planning through planning graph analysis.
- Blum, Furst
- 1997
(Show Context)
Citation Context ...roblem suite. We intend to build a hybrid planner on heuristic search and BDD-exploration. The challenging question is how to combine the approach with other successful planning techniques Graphplan (=-=Blum & Furst 1995-=-), Tim (Fox & Long 1998), Integer Programming (Kautz & Walser 1999), and Satplan (Kautz & Selman 1996) to build a system that can solve really hard problems. Acknowledgments We thank J. Hoffmann and B... |

574 | Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search.
- Kautz, Selman
- 1996
(Show Context)
Citation Context ... Even though the code is not self-explanatory and only scratched in the text it might give a feeling of the implementation. Planning as Satisfiability Planning as satisfiability (as given in Satplan (=-=Kautz & Selman 1996-=-)) formalizes the truth of fact f afterst time steps with a variable x f;t in propositional logic. The initial state is valid in time step t = 0 and leads to the following conjunction: start = V f2s x... |

199 | Planning as heuristic search: New results.
- Bonet, Geffner
- 1999
(Show Context)
Citation Context ...aph and extracts a simplified solution by returning the number of instantiated operators that at least have to fire. Therefore, the heuristic estimate in FF is an elaboration to the heuristic in HSP (=-=Bonet & Geffner 1999-=-), since the latter one considers the first phase only. With enforced hill climbing it further employs another search strategy and drastically reduces the explored portion of search space at least for... |

86 | Searching with pattern databases.
- Culberson, Schaeffer
- 1996
(Show Context)
Citation Context ...he relational product algorithm determines all successor states according to the set of states with minimal merit and the given heuristic estimate in one evaluation step. Heuristic pattern databases (=-=Culberson & Schaeffer 1996-=-) serve as heuristics and are combined to an overall heuristic by taking the maximum or the sum of subposition solutions. Subpositions are facts and the estimated distance of each single fact p to the... |

65 | State-space planning by integer optimization
- Kautz, Walser
- 1999
(Show Context)
Citation Context ...earch and BDD-exploration. The challenging question is how to combine the approach with other successful planning techniques Graphplan (Blum & Furst 1995), Tim (Fox & Long 1998), Integer Programming (=-=Kautz & Walser 1999-=-), and Satplan (Kautz & Selman 1996) to build a system that can solve really hard problems. Acknowledgments We thank J. Hoffmann and B. Nebel for introducing us to the fast-forward planning approach. ... |

57 | Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
- Edelkamp, Helmert
- 1999
(Show Context)
Citation Context ...n representation of the states and operators has been resolved by precompiling the domain to minimize the state description length. The process of finding a state description consists of four phases (=-=Edelkamp & Helmert 1999-=-). In the first phase we symbolically analyze the domain specification to determine constant and one-way predicates, i.e. predicates that remain unchanged by all operators or toggle in only one direct... |

54 | A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm - Hoffmann |

45 | OBDDs in heuristic search
- Edelkamp, Reel
- 1998
(Show Context)
Citation Context ...ystem (Jensen & Veloso 1999) and is planned to enrich MIPS in the near future. Symbolic Heuristic Search (Version 1.2-1.4) In the symbolic version of A* (Hart, Nilsson, & Raphael 1968), called BDDA* (=-=Edelkamp & Reffel 1998-=-), the relational product algorithm determines all successor states according to the set of states with minimal merit and the given heuristic estimate in one evaluation step. Heuristic pattern databas... |

37 |
The automatic inference of state invariants
- Fox, Long
- 1998
(Show Context)
Citation Context ...o build a hybrid planner on heuristic search and BDD-exploration. The challenging question is how to combine the approach with other successful planning techniques Graphplan (Blum & Furst 1995), Tim (=-=Fox & Long 1998-=-), Integer Programming (Kautz & Walser 1999), and Satplan (Kautz & Selman 1996) to build a system that can solve really hard problems. Acknowledgments We thank J. Hoffmann and B. Nebel for introducing... |

22 | OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents
- Jensen, Veloso
- 1999
(Show Context)
Citation Context ...itions T 1 ; : : : ; Tn allowing the modified calculation: 9x 0 From(x 0 )sT (x 0 ; x) = 9x 0 n Tns: : :s9x 0 1 T 1sF rom(x 0 ) This approach has effectively been applied to the UMOP planning system (=-=Jensen & Veloso 1999-=-) and is planned to enrich MIPS in the near future. Symbolic Heuristic Search (Version 1.2-1.4) In the symbolic version of A* (Hart, Nilsson, & Raphael 1968), called BDDA* (Edelkamp & Reffel 1998), th... |

21 | Verification of synchronous sequential machines using symbolic execution - Coudert, Berthet, et al. - 1989 |

14 | Deterministic state space planning with BDDs - Edelkamp, Reffel - 1999 |

7 | Heuristic search planning with BDDs
- Edelkamp
- 2000
(Show Context)
Citation Context ...ds to a noticeable improvement in solvability by the cost of longer solutions. Further experiments indicate that on average the FF-Heuristic leads to shorter solutions and to smaller execution times (=-=Edelkamp 2000-=-). int Backward(State& from) -- matches = 0; markedFacts = zeroFacts; processedFacts = from.getVector(); while (operSentinal ? 0) -- Operator* oper = operQueue[--operSentinal]; for (int j=0; j! oper-?... |

1 | Symbolic model checking with paritioned transition relations - Burch, Clarke, et al. - 1991 |

1 |
Efficient BDD algoithms for FSM synthesis and verification
- Ranjan, Aziz, et al.
- 1991
(Show Context)
Citation Context ...e efficient computation is obtained by partitioning the transition relation and performing the existential quantification of next state variables early in the calculation (Burch, Clarke, & Long 1991; =-=Ranjan et al. 1991-=-). To do this the transition relation T is split into a conjunction of partitions T 1 ; : : : ; Tn allowing the modified calculation: 9x 0 From(x 0 )sT (x 0 ; x) = 9x 0 n Tns: : :s9x 0 1 T 1sF rom(x 0... |