Incremental heuristic search in AI

Authors:
Sven Koenig;Maxim Likhachev;Yaxin Liu;David Furcy
Affiliations:
-;-;-;-
Venue:
AI Magazine
Year:
2004

Citing 43
Cited 17

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
A dynamization of the all pairs least cost path problem

Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Finding paths and deleting edges in directed acyclic graphs

Information Processing Letters
Real-time heuristic search

Artificial Intelligence
Explaining and repairing plans that fail

Artificial Intelligence
On the dynamic shortest path problem

Journal of Information Processing
Incremental algorithms for minimal length paths

Journal of Algorithms
A validation-structure-based theory of plan modification and reuse

Artificial Intelligence
Technical Note: \cal Q-Learning

Machine Learning
Efficient memory-bounded search methods

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear-space best-first search

Artificial Intelligence
Dynamic algorithms for shortest paths in planar graphs

Theoretical Computer Science
Efficient learning and planning within the Dyna framework

Adaptive Behavior
Solution reuse in dynamic constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Prioritized Sweeping: Reinforcement Learning with Less Data and Less Time

Machine Learning
Learning to act using real-time dynamic programming

Artificial Intelligence - Special volume on computational research on interaction and agency, part 1
Plan reuse versus plan generation: a theoretical and empirical analysis

Artificial Intelligence - Special volume on planning and scheduling
The Parti-game Algorithm for Variable Resolution Reinforcement Learning in Multidimensional State-spaces

Machine Learning
On the computational complexity of dynamic graph problems

Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem

Journal of Algorithms
Map learning and high-speed navigation in RHINO

Artificial intelligence and mobile robots
Lifelong learning algorithms

Learning to learn
Fully dynamic output bounded single source shortest path problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An On-Line Edge-Deletion Problem

Journal of the ACM (JACM)
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
Robust efficient, globally-optimized reinforcement learning with the parti-game algorithm

Proceedings of the 1998 conference on Advances in neural information processing systems II
Semi-dynamic breadth-first search in digraphs

Theoretical Computer Science
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Planning and Learning by Analogical Reasoning

Planning and Learning by Analogical Reasoning
Reinforcement Learning

Reinforcement Learning
Hybrid evolutionary motion planning using follow boundary repair for mobile robots

Journal of Systems Architecture: the EUROMICRO Journal - Special issue on evolutionary computing
Agent-centered search

AI Magazine
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
D*lite

Eighteenth national conference on Artificial intelligence
Speeding up the calculation of heuristics for heuristic search-based planning

Eighteenth national conference on Artificial intelligence
Dynamic Programming

Dynamic Programming
Performance bounds for planning in unknown terrain

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Lifelong planning A*

Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Reinforcement learning: a survey

Journal of Artificial Intelligence Research
A domain-independent algorithm for plan adaptation

Journal of Artificial Intelligence Research
The focussed D* algorithm for real-time replanning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A robust and fast action selection mechanism for planning

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Collaborative diffusion: programming antiobjects

Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
Excuse me, I need better AI!: employing collaborative diffusion to make game AI child's play

Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames
RTTES: Real-time search in dynamic environments

Applied Intelligence
Comparing real-time and incremental heuristic search for real-time situated agents

Autonomous Agents and Multi-Agent Systems
Dynamic fringe-saving A*

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The fringe-saving A* search algorithm: a feasibility study

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient incremental search for moving target search

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Variable sized grid cells for rapid replanning in dynamic environments

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Multi-agent real-time pursuit

Autonomous Agents and Multi-Agent Systems
Generalized Fringe-Retrieving A*: faster moving target search on state lattices

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A constraint-based solver for the military unit path finding problem

SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
A survey and classification of A* based best-first heuristic search algorithms

SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Heuristic and metaheuristic optimization techniques with application to power systems

MMACTEE'10 Proceedings of the 12th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Tree Adaptive A*

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Adaptive Exact Inference in Graphical Models

The Journal of Machine Learning Research
BDDRPA*: an efficient BDD-Based incremental heuristic search algorithm for replanning

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
A* orthogonal matching pursuit: Best-first search for compressed sensing signal recovery

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Incremental search reuses information from previous searches to find solutions to a series of similar search problems potentially faster than is possible by solving each search problem from scratch. This is important because many AI systems have to adapt their plans continuously to changes in (their knowledge of) the world. In this article, we give an overview of incremental search, focusing on LIFELONG PLANNING A*, and outline some of its possible applications in AI.