Potential-based bounded-cost search and anytime non-parametric A*

DOI10.1016/J.ARTINT.2014.05.002MaRDI QIDQ2014923zbMATH OpenOpenAlexWikidataFDO

Authors Roni Stern, Ariel Felner, Rami Puzis, Rajat Shah, Jur P. van den Berg, Ken Goldberg

Publication date 16 June 2014

Published in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

heuristic searchroboticsanytime algorithms

Mathematics Subject Classification ID

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

Recommendations

• Anytime heuristic search
• Anytime pack search
• Anytime search in dynamic graphs
• Time-bounded best-first search for reversible and non-reversible search graphs
• Generalized best-first search strategies and the optimality of A*

Cites work

• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• A note on two problems in connexion with graphs
• A parameter-free classification method for large scale learning
• Anytime heuristic search
• Depth-first iterative-deepening: An optimal admissible tree search
• Duality in permutation state spaces and the dual search algorithm
• Emergence of Scaling in Random Networks
• Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
• Heuristic search viewed as path finding in a graph
• Incremental deployment of network monitors based on Group Betweenness Centrality
• Introduction to algorithms
• Linear-space best-first search
• Maximizing over multiple pattern databases speeds up heuristic search
• Performance of linear-space search algorithms
• Predicting the size of IDA\(^*\)'s search tree
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Solution counting algorithms for constraint-centered search heuristics
• Studies in Semi-Admissible Heuristics
• The centrality of groups and classes
• The fast downward planning system
• Time complexity of iterative-deepening-\(A^{*}\)

Cited in

(5)

• Probably bounded suboptimal heuristic search
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• Truncated incremental search
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
• Anytime search in dynamic graphs

This page was built for publication: Potential-based bounded-cost search and anytime non-parametric A*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014923)