Position Paper: Using Early Goal Test in A*

von Felner, Ariel
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Heuristic search, memory-based heuristics and their applications : papers from the AAAI workshop ; [held July 17, 2006, in Boston, Massachusetts, USA ; at AAAI-06/IAAI-06]

Veröffentlicht 2006

On the Differences and Similarities of fMM and GBFHS

von Shperberg, Shahaf
Veröffentlicht in International Symposium on Combinatorial Search (13. : 2020 : Online) Proceedings of the Thirteenth International Symposium on Combinatorial Search (SoCS 2020) (2020)

SUBOPTIMALLY SOLVING THE WATCHMAN ROUTE PROBLEM ON A GRID WITH HEURISTIC SEARCH

von Yaffe, Tamir
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Probabilistic Robust Multi-Agent Path Finding

von Atzmon, Dor
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Solving the Longest Simple Path Problem with Heuristic Search

von Cohen, Yossi
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

THE CLOSED LIST IS AN OBSTACLE TOO

von Felner, Ariel
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Unbounded Sub-Optimal Conflict-Based Search in Complex Domains

von Walker, Thayne T.
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Solving the Watchman Route Problem on a Grid with Heuristic Search

von Seiref, Shawn
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

Solving the Watchman Route Problem on a Grid with Heuristic Search

von Seiref, Shawn
Veröffentlicht in International Symposium on Combinatorial Search (13. : 2020 : Online) Proceedings of the Thirteenth International Symposium on Combinatorial Search (SoCS 2020) (2020)

Predicting the Effectiveness of Bidirectional Heuristic Search

von Sturtevant, Nathan R.
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

ITERATIVE-DEEPENING BIDIRECTIONAL HEURISTIC SEARCH WITH RESTRICTED MEMORY

von Shperberg, Shahaf S.
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

ITERATIVE-DEEPENING BIDIRECTIONAL HEURISTIC SEARCH WITH RESTRICTED MEMORY

von Shperberg, Shahaf S.
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)

Using FastMap to Solve Graph Problems in a Euclidean Space

von Li, Jiaoyang
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

von Shaham, Eshed
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results

von Li, Jiaoyang
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

STUDYING ONLINE MULTI-AGENT PATH FINDING

von Morag, Jonathan
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

CONFLICT-FREE MULTI-AGENT MEETING

von Atzmon, Dor
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Probabilistic Robust Multi-Agent Path Finding

von Atzmon, Dor
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)