Computer Science
8 years ago

New Method Eliminates Spurious Paths, Boosting Efficiency in Search and Planning

Proceedings of the International Symposium on Combinatorial Search
The Spurious Path Problem in Abstraction
Gaojian Fan, Robert C. Holte

Paper Summary

Related papers

Theme background image
Computer Science
8 years ago

New algorithm revolutionizes planning efficiency with flexible graphplan heuristic!

AI Planning
Constraint Optimization
Semantic Web
Theme background image
Computer Science
8 years ago

New semaphore technology revolutionizes resource management and process scheduling.

Program Verification
Reconfigurable Computing
Formal Methods
Theme background image
Computer Science
8 years ago

Improved task synchronization in VxWorks boosts efficiency and reliability.

Expert Systems
Grid Computing

Abstraction in search and planning can lead to fake paths called spurious paths. These paths don't actually exist in real situations. There are two types of spurious paths: some don't depend on the situation, while others do. By using a method that detects certain situations, we can get rid of both types of spurious paths. This method can completely remove spurious paths in certain cases. Getting rid of these fake paths can make a heuristic much better, even in situations where there are no fake states.