Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Related Work
2024-4-5 16:29:52 Author: hackernoon.com(查看原文) 阅读量:1 收藏

Read on Terminal Reader

Open TLDRtldt arrow

Too Long; Didn't Read

This work revisits the necessary and sufficient conditions of strictly optimally efficient heuristics for forward search algorithms.

featured image - Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Related Work

EScholar: Electronic Academic Papers for Scholars HackerNoon profile picture

EScholar: Electronic Academic Papers for Scholars

EScholar: Electronic Academic Papers for Scholars

@escholar

We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community

STORY’S CREDIBILITY

Academic Research Paper

Academic Research Paper

Part of HackerNoon's growing list of open-source research papers, promoting free access to academic material.

L O A D I N G
. . . comments & more!


About Author

EScholar: Electronic Academic Papers for Scholars HackerNoon profile picture

EScholar: Electronic Academic Papers for Scholars@escholar

We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community

TOPICS

THIS ARTICLE WAS FEATURED IN...

RELATED STORIES


文章来源: https://hackernoon.com/optimize-planning-heuristics-to-rank-not-to-estimate-cost-to-goal-related-work?source=rss
如有侵权请联系:admin#unsafe.sh