SOTAVerified

Heuristic Search

Heuristic Search is a problem-solving method that uses practical rules or "guides" (heuristics) to find solutions more quickly than exhaustive search, by focusing on the most promising paths first.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 111–120 of 261 papers

TitleStatusHype
Grid-based angle-constrained path planning—0
Hardware Distortion Modeling for Panel Selection in Large Intelligent Surfaces—0
Computing Programs for Generalized Planning as Heuristic Search—0
Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction—0
Heuristic Search as Evidential Reasoning—0
Heuristic Search for Multi-Objective Probabilistic Planning—0
Heuristic Search for Path Finding with Refuelling—0
Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+—0
Dense Crowd Flow-Informed Path Planning—0
A Multi-Heuristic Search-based Motion Planning for Automated Parking—0
Show:102550
← PrevPage 12 of 27Next →

No leaderboard results yet.