Truncated incremental search

DOI10.1016/J.ARTINT.2016.01.009zbMath1351.68251OpenAlexW2299136288MaRDI QIDQ253972

Sandip Aine, Maxim Likhachev

Publication date: 8 March 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.01.009

zbMATH Keywords

planningheuristic searchanytime planninganytime searchincremental searchreplanning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing

Cites Work

• Unnamed Item
• Unnamed Item
• Lifelong planning \(\text{A}^*\)
• Potential-based bounded-cost search and anytime non-parametric A*
• Anytime search in dynamic graphs
• Heuristic search viewed as path finding in a graph
• Real-time heuristic search
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• Solving constraint optimization problems from CLP-style specifications using heuristic search techniques
• Using interpolation to improve path planning: The Field D* algorithm
• Three approaches to heuristic search in networks
• Studies in Semi-Admissible Heuristics
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Planning as heuristic search

This page was built for publication: Truncated incremental search