- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On approximating shortest paths in weighted triangular tessellations
Artificial Intelligence 318 (C):103898 (2023)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
K⁎: A heuristic search algorithm for finding the k shortest paths.Husain Aljazzar & Stefan Leue - 2011 - Artificial Intelligence 175 (18):2129-2154.
On the complexity of finding paths in a two-dimensional domain I: Shortest paths: Shortest paths.A. W. Chou - 2004 - Mathematical Logic Quarterly 50 (6):551.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
Approximating operators and semantics for abstract dialectical frameworks.Hannes Strass - 2013 - Artificial Intelligence 205 (C):39-70.
Approximating optimal social choice under metric preferences.Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl & Piotr Skowron - 2018 - Artificial Intelligence 264 (C):27-51.
The complexity of approximating MAPs for belief networks with bounded probabilities.Ashraf M. Abdelbar, Stephen T. Hedetniemi & Sandra M. Hedetniemi - 2000 - Artificial Intelligence 124 (2):283-288.
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
Depth-based short-sighted stochastic shortest path problems.Felipe W. Trevizan & Manuela M. Veloso - 2014 - Artificial Intelligence 216 (C):179-205.
An anytime algorithm for constrained stochastic shortest path problems with deterministic policies.Sungkweon Hong & Brian C. Williams - 2023 - Artificial Intelligence 316 (C):103846.
Analytics
Added to PP
2023-03-06
Downloads
4 (#1,013,551)
6 months
1 (#1,912,481)
2023-03-06
Downloads
4 (#1,013,551)
6 months
1 (#1,912,481)
Historical graph of downloads
References found in this work
Pairwise symmetry reasoning for multi-agent path finding search.Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Graeme Gange & Sven Koenig - 2021 - Artificial Intelligence 301 (C):103574.
Subdimensional expansion for multirobot path planning.Glenn Wagner & Howie Choset - 2015 - Artificial Intelligence 219 (C):1-24.
Fast optimal and bounded suboptimal Euclidean pathfinding.Bojie Shen, Muhammad Aamir Cheema, Daniel D. Harabor & Peter J. Stuckey - 2022 - Artificial Intelligence 302 (C):103624.
Path-length analysis for grid-based path planning.James P. Bailey, Alex Nash, Craig A. Tovey & Sven Koenig - 2021 - Artificial Intelligence 301 (C):103560.
An algorithmic approach to some problems in terrain navigation.Joseph S. B. Mitchell - 1988 - Artificial Intelligence 37 (1-3):171-201.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-zhzfn uwo