Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Introduction to algorithms
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Planning control rules for reactive agents
Artificial Intelligence
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Fast planning through greedy action graphs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
State-space planning by integer optimization
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Model checking
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Symbolic Model Checking
Model checking Java programs using structural heuristics
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Enhanced Iterative-Deepening Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Detection and Exploitation of Symmetry in Planning Problems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A* with Partial Expansion for Large Branching Factor Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
µcke - Efficient µ-Calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Numeric State Variables in Constraint-Based Planning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams
CL '00 Proceedings of the First International Conference on Computational Logic
Planning with a language for extended goals
Eighteenth national conference on Artificial intelligence
Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
SetA*: an efficient BDD-based heuristic search algorithm
Eighteenth national conference on Artificial intelligence
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
Journal of Artificial Intelligence Research
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Planning with resources and concurrency a forward chaining approach
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Heuristic search + symbolic model checking = efficient conformant planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Optimal scheduling using branch and bound with SPIN 4.0
SPIN'03 Proceedings of the 10th international conference on Model checking software
SPIN'03 Proceedings of the 10th international conference on Model checking software
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Solving concurrent Markov decision processes
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Temporal planning in domains with linear processes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
An artificial intelligence planning tool for the container stacking problem
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
SPIN'03 Proceedings of the 10th international conference on Model checking software
Improving concurrency in temporal plans
Artificial Intelligence Review
Heuristic search for the analysis of graph transition systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A universal planning system for hybrid domains
Applied Intelligence
COLIN: planning with continuous linear numeric change
Journal of Artificial Intelligence Research
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules. As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance. The extensions include critical path analysis of sequentially generated plans to generate corresponding optimal parallel plans. The linear time algorithm to compute the parallel plan bypasses known NP hardness results for partial ordering by scheduling plans with respect to the set of actions and the imposed precedence relations. The efficiency of this algorithm also allows us to improve the exploration guidance: for each encountered planning state the corresponding approximate sequential plan is scheduled. One major strength of MIPS is its static analysis phase that grounds and simplifies parameterized predicates, functions and operators, that infers knowledge to minimize the state description length, and that detects domain object symmetries. The latter aspect is analyzed in detail. MIPS has been developed to serve as a complete and optimal state space planner, with admissible estimates, exploration engines and branching cuts. In the competition version, however, certain performance compromises had to be made, including floating point arithmetic, weighted heuristic search exploration according to an inadmissible estimate and parameterized optimization.