Yossi Cohen, Roni Stern, Ariel Felner |
PosterID:
19
PDF
Slides
Poster
BibTeX
|
| Prior approaches for finding the longest simple path (LSP) in a graph used constraints solvers and genetic algorithms. In this work, we solve the LSP problem with heuristic search. We first introduce several methods for pruning dominated path prefixes. Then, we propose several admissible heuristic functions for this problem. Experimental results demonstrate the large impact of the proposed heuristics and pruning rules. | |
| Canb | 10/28/2020, 00:00 – 01:00 |
| 10/29/2020, 17:00 – 18:00 |
| Paris | 10/27/2020, 14:00 – 15:00 |
| 10/29/2020, 07:00 – 08:00 |
| NYC | 10/27/2020, 09:00 – 10:00 |
| 10/29/2020, 02:00 – 03:00 |
| LA | 10/27/2020, 06:00 – 07:00 |
| 10/28/2020, 23:00 – 00:00 |
Revisiting Bounded-Suboptimal Safe Interval Path Planning
Konstantin Yakovlev, Anton Andreychuk, Roni Stern
Solving the Watchman Route Problem on a Grid with Heuristic Search
Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner
Solving the Longest Simple Path Problem with Heuristic Search
Yossi Cohen, Roni Stern, Ariel Felner
Convex Hull Monte-Carlo Tree-Search
Michael Painter, Bruno Lacerda, Nick Hawes