Planning for conjunctive goals
Artificial Intelligence
Pattern knowledge and search: the SUPREM architecture
Artificial Intelligence
Artificial Intelligence
Learning by analogical reasoning in general problem-solving
Learning by analogical reasoning in general problem-solving
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
PRODIGY 4.0: The Manual and Tutorial
PRODIGY 4.0: The Manual and Tutorial
Human Problem Solving
Teleo-reactive programs for agent control
Journal of Artificial Intelligence Research
Reinforcement learning: a survey
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Learning to act using real-time dynamic programming
Artificial Intelligence
Robotics and Autonomous Systems
Situated agents can have goals
Robotics and Autonomous Systems
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Linear time near-optimal planning in the blocks world
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Improving the learning efficiencies of realtime search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
CPlan: a constraint programming approach to planning
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
Total order planning is more efficient than we thought
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
Value-update rules for real-time search
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
Terrain coverage with ant robots: a simulation study
Proceedings of the fifth international conference on Autonomous agents
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
Functional strips: a more flexible language for planning and problem solving
Logic-based artificial intelligence
Efficient and inefficient ant coverage methods
Annals of Mathematics and Artificial Intelligence
Planning and Control in Artificial Intelligence: A Unifying Perspective
Applied Intelligence
Modelling Intelligent Behaviour: The Markov Decision Process Approach
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
A Heuristic for Planning Based on Action Evaluation
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Speeding up the calculation of heuristics for heuristic search-based planning
Eighteenth national conference on Artificial intelligence
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
Multiobjective heuristic state-space planning
Artificial Intelligence
Integer optimization models of AI planning problems
The Knowledge Engineering Review
Robots, softbots, immobots: The 1997 AAAI Workshop on Theories of Action, Planning and Control
The Knowledge Engineering Review
Artificial Intelligence
Incremental heuristic search in AI
AI Magazine
A Comparison of Fast Search Methods for Real-Time Situated Agents
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Heuristics for Planning with Action Costs
Current Topics in Artificial Intelligence
Comparing real-time and incremental heuristic search for real-time situated agents
Autonomous Agents and Multi-Agent Systems
Anytime heuristic search for partial satisfaction planning
Artificial Intelligence
Unified Definition of Heuristics for Classical Planning
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Branching and pruning: an optimal temporal POCL planner based on constraint programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
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
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
AltAltp: online parallelization of plans with heuristic state search
Journal of Artificial Intelligence Research
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
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
Using memory to transform search on the planning graph
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
mGPT: a probabilistic planner based on heuristic search
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Dynamic control in real-time heuristic search
Journal of Artificial Intelligence Research
The GRT planning system: backward heuristic construction in forward state-space planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
When is temporal planning really temporal?
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Planning with goal utility dependencies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Inference and Learning in Planning (Extended Abstract)
DS '09 Proceedings of the 12th International Conference on Discovery Science
An LP-based heuristic for optimal planning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Solutions to real-world instances of PSPACE-complete stacking
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Case-based subgoaling in real-time heuristic search for video game pathfinding
Journal of Artificial Intelligence Research
Planning with incomplete information
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Scaling up heuristic planning with relational decision trees
Journal of Artificial Intelligence Research
Everything you always wanted to know about planning (but were afraid to ask)
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Feasibility study of utility-directed behaviour for computer game agents
Proceedings of the 8th International Conference on Advances in Computer Entertainment Technology
Reinforcement learning as heuristic for action-rule preferences
ProMAS'10 Proceedings of the 8th international conference on Programming Multi-Agent Systems
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
Planning as satisfiability: Heuristics
Artificial Intelligence
Artificial Intelligence: From programs to solvers
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
The ability to plan and react in dynamic environments is central to intelligent behavior yet few algorithms have managed to combine fast planning with a robust execution. In this paper we develop one such algorithm by looking at planning as real time search. For that we develop a variation of Korf's Learning Real Time A* algorithm together with a suitable heuristic function. The resulting algorithm interleaves lookahead with execution and never builds a plan. It is an action selection mechanism that decides at each time point what to do next. Yet it solves hard planning problems faster than any domain independent planning algorithm known to us, including the powerful SAT planner recently introduced by Kautz and Selman. It also works in the presence of perturbations and noise, and can be given a fixed time window to operate. We illustrate each of these features by running the algorithm on a number of benchmark problems.