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 191–200 of 261 papers

TitleStatusHype
MeshA*: Efficient Path Planing With Motion Primitives—0
Microgrid Planner: A Distributed Energy Resource Sizing Method—0
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results—0
Movable-Element STARS-Assisted Near-Field Wideband Communications—0
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering—0
Multi-objective Evolution of Heuristic Using Large Language Model—0
Multi-Resolution A*—0
Multi-Robot Path Planning Combining Heuristics and Multi-Agent Reinforcement Learning—0
NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling—0
Neural Machine Translation with Gumbel-Greedy Decoding—0
Show:102550
← PrevPage 20 of 27Next →

No leaderboard results yet.