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

DOI10.1016/J.ARTINT.2014.05.002zbMATH Open1405.68330OpenAlexW2126113409WikidataQ57365675 ScholiaQ57365675MaRDI QIDQ2014923FDOQ2014923

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

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*

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)

Cites Work

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

Cited In (5)

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

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)