scientific article

zbMath1182.68061arXiv1110.2737MaRDI QIDQ3624053

No author found.

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/1110.2737

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

anytime algorithmheuristic search algorithmmemory-efficient search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (15)

Anytime heuristic search for partial satisfaction planning ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Anytime search in dynamic graphs ⋮ Heuristic search of optimal machine teaching curricula ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ A classification of configuration spaces of planar robot arms for a continuous inverse kinematics problem ⋮ \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ Fast optimal and bounded suboptimal Euclidean pathfinding ⋮ Anytime pack search ⋮ Probably bounded suboptimal heuristic search ⋮ Anytime algorithms for the longest common palindromic subsequence problem ⋮ Truncated incremental search

This page was built for publication: