BOOK-CHAPTER

Generalizing the Relaxed Planning Heuristic to Non-linear Tasks

Stefan Edelkamp

Year: 2004 Lecture notes in computer science Pages: 198-212   Publisher: Springer Science+Business Media
Keywords:
Computer science Heuristic Tree traversal Domain (mathematical analysis) State space Mathematical optimization Algorithm Theoretical computer science Artificial intelligence Mathematics

Metrics

9
Cited By
0.88
FWCI (Field Weighted Citation Impact)
30
Refs
0.76
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

AI-based Problem Solving and Planning
Physical Sciences →  Computer Science →  Artificial Intelligence
Logic, Reasoning, and Knowledge
Physical Sciences →  Computer Science →  Artificial Intelligence
Constraint Satisfaction and Optimization
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

A Temporal Relaxed Planning Graph Heuristic for Planning with Envelopes

Andrew ColesAndrew Coles

Journal:   Proceedings of the International Conference on Automated Planning and Scheduling Year: 2017 Vol: 27 Pages: 47-55
JOURNAL ARTICLE

Heuristic Evaluation Based on Lifted Relaxed Planning Graphs

Bram RidderMaria Fox

Journal:   Proceedings of the International Conference on Automated Planning and Scheduling Year: 2014 Vol: 24 Pages: 244-252
JOURNAL ARTICLE

A TIL-Relaxed Heuristic for Planning with Time Windows

Tony AllardCharles GrettonPatrik Haslum

Journal:   Proceedings of the International Conference on Automated Planning and Scheduling Year: 2018 Vol: 28 Pages: 2-10
© 2026 ScienceGate Book Chapters — All rights reserved.