A comparison of distance metrics for the multi-objective pathfinding problem
From MaRDI portal
Cites work
- A comparison of genetic representations for multi-objective shortest path problems on multigraphs
- An improved approximation algorithm for the discrete Fréchet distance
- Approximability of the discrete Fréchet distance
- Combining Manhattan and Crowding Distances in Decision Space for Multimodal Multi-objective Optimization Problems
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Dimensionality reduction in multiobjective shortest path search
- Evolutionary Multi-Criterion Optimization
- Fréchet distance with speed limits
- Fréchet-Distance on Road Networks
- scientific article; zbMATH DE number 2088034 (Why is no real title available?)
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
- New similarity measures between polylines with applications to morphing and polygon sweeping
- On a multicriteria shortest path problem
- Sur quelques points du calcul fonctionnel.
- The Effects of Crowding Distance and Mutation in Multimodal and Multi-objective Optimization Problems
Cited in
(1)
This page was built for publication: A comparison of distance metrics for the multi-objective pathfinding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535739)
